Algorithm¶

1

import "std/data/algorithm";

Functions¶

filter¶

1

public f<Vector<T>> filter<T>(const Vector<T>& items, f<bool>(const T&) predicate)

Build a new vector containing only the elements of items for which predicate returns true.

Parameters

Returns: Vector<T> — A new vector holding the kept elements, in iteration order

map¶

1

public f<Vector<R>> map<T, R>(const Vector<T>& items, f<R>(const T&) transform)

Build a new vector by applying transform to every element of items.

Parameters

Returns: Vector<R> — A new vector holding the transformed elements, in iteration order

reduce¶

1

public f<R> reduce<T, R>(const Vector<T>& items, const R& initialValue, f<R>(const R&, const T&) combine)

Combine all elements of items into a single value, left to right, starting from initialValue.

Parameters

Returns: R — The final accumulated value

forEach¶

1

public p forEach<T>(const Vector<T>& items, p(const T&) action)

Invoke action once for every element of items, in iteration order.

Parameters

find¶

1

public f<Optional<T>> find<T>(const Vector<T>& items, f<bool>(const T&) predicate)

Find the first element of items for which predicate returns true.

Parameters

Returns: Optional<T> — The first matching element, or an empty Optional if none match

any¶

1

public f<bool> any<T>(const Vector<T>& items, f<bool>(const T&) predicate)

Check whether at least one element of items satisfies predicate.

Parameters

Returns: bool — True if any element matches, false if items is empty or none match

all¶

1

public f<bool> all<T>(const Vector<T>& items, f<bool>(const T&) predicate)

Check whether every element of items satisfies predicate.

Parameters

Returns: bool — True if all elements match (vacuously true if items is empty), false otherwise

none¶

1

public f<bool> none<T>(const Vector<T>& items, f<bool>(const T&) predicate)

Check whether no element of items satisfies predicate.

Parameters

Returns: bool — True if no element matches (vacuously true if items is empty), false otherwise

count¶

1

public f<long> count<T>(const Vector<T>& items, f<bool>(const T&) predicate)

Count how many elements of items satisfy predicate.

Parameters

Returns: long — The number of matching elements

contains¶

1

public f<bool> contains<T>(const Vector<T>& items, const T& value)

Check whether items contains an element equal to value.

Parameters

Returns: bool — True if an equal element is present, false otherwise

min¶

1

public f<Optional<T>> min<T>(const Vector<T>& items, f<bool>(const T&, const T&) isLess)

Find the smallest element of items, according to isLess.

Parameters

Returns: Optional<T> — The smallest element, or an empty Optional if items is empty

max¶

1

public f<Optional<T>> max<T>(const Vector<T>& items, f<bool>(const T&, const T&) isLess)

Find the largest element of items, according to isLess.

Parameters

Returns: Optional<T> — The largest element, or an empty Optional if items is empty

partition¶

1

public f<Pair<Vector<T>, Vector<T>>> partition<T>(const Vector<T>& items, f<bool>(const T&) predicate)

Split items into two vectors according to predicate.

Parameters

Returns: Pair<Vector<T>, Vector<T>> — A pair of (matching elements, non-matching elements), each in iteration order