Advances the iterator by n elements.
The iterator will have been advanced by n elements when Ok(()) is returned, or a Err(k)
where k is remaining number of steps that could not be advanced because the iterator ran out.
Returns an iterator over N elements of the iterator at a time.
The chunks do not overlap. If N does not divide the length of the iterator, then the last up to N-1 elements will
be omitted and can be retrieved from the .intoRemainder() function of the iterator.
An iterator which is a "clone" of the original iterator. Iterating through the original or the clone will not affect the other.
Do not modify the original collection the original Iterable is based on while iterating. See Clone for more information.
Lexicographically compares the elements of this Iterator with those of another with respect to the specified comparison function.
Less = -1
Equal = 0
Greater = 1
Creates a new iterator which places an item generated by separator between adjacent items of the original iterator.
The closure will be called each time to generate the separator.
Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false.
Checks if the elements of this iterator are sorted by f.
That is, for each element f(a,b) and its following element f(b,c), f(a,b) <= f(b,c) must hold. If the iterator yields exactly zero or one element, true is returned.
negative if a < b
zero if a == b
positive if a > b
Checks if the elements of this iterator are sorted by a key.
That is, for each element f(a) and its following element f(b), f(a) <= f(b) must hold. If the iterator yields exactly zero or one element, true is returned.
negative if a < b
zero if a == b
positive if a > b
Creates an iterator that both yields elements based on a predicate and maps.
It will call this closure on each element of the iterator, and yield elements while it returns Some(_).
Calls the given function f for each contiguous window of size over self and returns an iterator over the outputs of f
e.g. 1, 2, 3, 4 with size 2 will yield windows of 1, 2, 2, 3, 3, 4
Returns the next n elements of the iterator as an Arr,
If there are not enough elements to fill the array then Err is returned containing an iterator over the remaining elements.
Returns the nth element of the iterator.
Like most indexing operations, the count starts from zero, so nth(0) returns the first value, nth(1) the second, and so on.
nth() will return None if n is greater than or equal to the length of the iterator.
Consumes an iterator, creating two collections from it.
partition() returns a pair, all of the elements for which it returned true, and all of the elements for which it returned false.
Reorders the elements of this iterator in-place according to the given predicate,
such that all those that return true precede all those that return false.
Returns the number of true elements found.
The relative order of partitioned items is not maintained.
Searches for an element in an iterator from the right, returning its index.
Recommended to use with a list, as it is more efficient, otherwise use position.
An iterator which, like fold, holds internal state, but unlike fold, produces a new iterator.
On iteration, the closure will be applied to each element of the iterator and the return value from the closure.
The closure can return Some(value) to yield value, or None to end the iteration.
