All tests if every element of the iterator matches a predicate.

Any tests if any element of the iterator matches a predicate.

Append create a new Seq which yield each element from origin Seq and additional elements.

Chain takes two iterators and creates a new iterator over both in sequence.

CollectFunc call func on each element to collect it.

Contains returns true if element is found in the [Seq].

Contains returns true if element is satisfies the given predicate in the [Seq].

Count consumes the iterator, counting the number of elements equal to the given one and returning it.

CountFunc consumes the iterator, counting the number of elements match the predicate function and returning it.

Dedup removes consecutive repeated elements in the [Seq].

DedupFunc removes all but the first of consecutive elements in the Seq satisfying a given equality relation.

Enumerate create a new seq which yield (index, item) pair.

Filter creates an iterator which uses a closure to determine if an element should be yielded.

FilterMap creates an iterator that both filters and maps.

FilterZero creates an iterator which remove zero variable from Seq.

Find searches for an element of an iterator that satisfies a predicate.

FindMap applies function to the elements of iterator and returns the first non-none result.

First try to find first element in [Seq], if no elements in [Seq], return zero var and false.

FlatMap call f on each element in Seq which create a new type Seq by each element.

Fold each element into an accumulator by applying an operation, returning the final result.

ForEach call f on each element in [Seq].

Index searches index of element which satisfying the given predicate.

Inspect call f on each element in [Seq].

Intersperse creates a new iterator which places a copy of `separator` between adjacent items of the original iterator.

IsSorted checks if the elements of this iterator are sorted.

IsSortedFunc checks if the elements of this iterator are sorted using the given comparator function.

Last try to find last element in [Seq], if no elements in [Seq], return zero var and false.

Map call f on each element in [Seq], and map each element to another type.

MapWhile call f on each element on [Seq], and map each element to another type.

Max returns the maximum element of an iterator.

MaxByKey returns the element that gives the maximum value from the specified function.

MaxFunc returns the element that gives the maximum value with respect to the specified comparison function.

Min returns the minimum element of an iterator.

MinByKey returns the element that gives the minimum value from the specified function.

MinFunc returns the element that gives the minimum value with respect to the specified comparison function.

Reduce reduces the elements to a single one, by repeatedly applying a reducing operation.

Scan returns a [Seq] containing successive accumulation values generated by applying [f] on each element and current accumulator value that starts with [init] value.

Size consumes the iterator, counting the number of iterations and returning it.

Skip creates an iterator that skips the first `n` elements.

SkipWhile creates an iterator that [`skip`]s elements based on a predicate.

StepBy creates an iterator starting at the same point, but stepping by the given amount at each iteration.

Take creates an iterator that yields the first `n` elements, or fewer if the underlying iterator ends sooner.

TakeWhile creates an iterator that yields elements based on a predicate.

TryFold applies a function as long as it returns successfully, producing a single, final value.

TryForEach call f on each element in [Seq], stopping at the first error and returning that error.

Seq is an iterator over sequences of individual values.