Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://doc.rust-lang.org/std/iter/struct.ArrayChunks.html below:

ArrayChunks in std::iter - Rust

pub struct ArrayChunks<I, const N: usize>{  }

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.

This struct is created by the array_chunks method on Iterator. See its documentation for more.

Returns an iterator over the remaining elements of the original iterator that are not going to be returned by this iterator. The returned iterator will yield at most N-1 elements.

let x = [1,2,3,4,5].into_iter().array_chunks::<2>();
let mut rem = x.into_remainder().unwrap();
assert_eq!(rem.next(), Some(5));
assert_eq!(rem.next(), None);

Removes and returns an element from the end of the iterator.

An iterator method that reduces the iterator’s elements to a single, final value, starting from the back.

Advances the iterator from the back by

elements.

Returns the

th element from the end of the iterator.

Searches for an element of an iterator from the back that satisfies a predicate.

Returns the exact remaining length of the iterator.

Returns

if the iterator is empty.

The type of the elements being iterated over.

Advances the iterator and returns the next value.

Returns the bounds on the remaining length of the iterator.

Consumes the iterator, counting the number of iterations and returning it.

An iterator method that applies a function as long as it returns successfully, producing a single, final value.

Folds every element into an accumulator by applying an operation, returning the final result.

Advances the iterator and returns an array containing the next

values.

Consumes the iterator, returning the last element.

Advances the iterator by

elements.

Returns the

th element of the iterator.

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

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

‘Zips up’ two iterators into a single iterator of pairs.

Creates a new iterator which places a copy of

between adjacent items of the original iterator.

Creates a new iterator which places an item generated by

between adjacent items of the original iterator.

Takes a closure and creates an iterator which calls that closure on each element.

Calls a closure on each element of an iterator.

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

Creates an iterator that both filters and maps.

Creates an iterator which gives the current iteration count as well as the next value.

Creates an iterator which can use the

and

methods to look at the next element of the iterator without consuming it. See their documentation for more information.

Creates an iterator that

s elements based on a predicate.

Creates an iterator that yields elements based on a predicate.

Creates an iterator that both yields elements based on a predicate and maps.

Creates an iterator that skips the first

elements.

Creates an iterator that yields the first

elements, or fewer if the underlying iterator ends sooner.

An iterator adapter which, like

, holds internal state, but unlike

, produces a new iterator.

Creates an iterator that works like map, but flattens nested structure.

Creates an iterator that flattens nested structure.

Calls the given function

for each contiguous window of size

over

and returns an iterator over the outputs of

. Like

, the windows during mapping overlap as well.

Does something with each element of an iterator, passing the value on.

Creates a “by reference” adapter for this instance of

.

Transforms an iterator into a collection.

Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered.

Collects all the items from an iterator into a collection.

Consumes an iterator, creating two collections from it.

Reorders the elements of this iterator

according to the given predicate, such that all those that return

precede all those that return

. Returns the number of

elements found.

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return

precede all those that return

.

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error.

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

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately.

Tests if every element of the iterator matches a predicate.

Tests if any element of the iterator matches a predicate.

Searches for an element of an iterator that satisfies a predicate.

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

Applies function to the elements of iterator and returns the first true result or the first error.

Searches for an element in an iterator, returning its index.

Searches for an element in an iterator from the right, returning its index.

Returns the maximum element of an iterator.

Returns the minimum element of an iterator.

Returns the element that gives the maximum value from the specified function.

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

Returns the element that gives the minimum value from the specified function.

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

Reverses an iterator’s direction.

Converts an iterator of pairs into a pair of containers.

Creates an iterator which copies all of its elements.

Returns an iterator over

elements of the iterator at a time.

Iterates over the entire iterator, multiplying all the elements

compares the

elements of this

with those of another. The comparison works like short-circuit evaluation, returning a result without comparing the remaining elements. As soon as an order can be determined, the evaluation stops and a result is returned.

Determines if the elements of this

are equal to those of another with respect to the specified equality function.

Determines if the elements of this

are not equal to those of another.

Checks if the elements of this iterator are sorted.

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

Checks if the elements of this iterator are sorted using the given key extraction function.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4