Struct itertools::structs::MultiProduct
source · [−]Expand description
An iterator adaptor that iterates over the cartesian product of
multiple iterators of type I
.
An iterator element type is Vec<I>
.
See .multi_cartesian_product()
for more information.
Trait Implementations
sourceimpl<I: Clone> Clone for MultiProduct<I>where
I: Iterator + Clone,
I::Item: Clone,
impl<I: Clone> Clone for MultiProduct<I>where
I: Iterator + Clone,
I::Item: Clone,
sourcefn clone(&self) -> MultiProduct<I>ⓘNotable traits for MultiProduct<I>impl<I> Iterator for MultiProduct<I>where
I: Iterator + Clone,
I::Item: Clone, type Item = Vec<I::Item>;
fn clone(&self) -> MultiProduct<I>ⓘNotable traits for MultiProduct<I>impl<I> Iterator for MultiProduct<I>where
I: Iterator + Clone,
I::Item: Clone, type Item = Vec<I::Item>;
I: Iterator + Clone,
I::Item: Clone, type Item = Vec<I::Item>;
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresourceimpl<I> Iterator for MultiProduct<I>where
I: Iterator + Clone,
I::Item: Clone,
impl<I> Iterator for MultiProduct<I>where
I: Iterator + Clone,
I::Item: Clone,
sourcefn next(&mut self) -> Option<Self::Item>
fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
sourcefn count(self) -> usize
fn count(self) -> usize
Consumes the iterator, counting the number of iterations and returning it. Read more
sourcefn size_hint(&self) -> (usize, Option<usize>)
fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
sourcefn last(self) -> Option<Self::Item>
fn last(self) -> Option<Self::Item>
Consumes the iterator, returning the last element. Read more
sourcefn next_chunk<const N: usize>(
&mut self
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
fn next_chunk<const N: usize>(
&mut self
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
🔬This is a nightly-only experimental API. (
iter_next_chunk
)Advances the iterator and returns an array containing the next
N
values. Read moresourcefn advance_by(&mut self, n: usize) -> Result<(), usize>
fn advance_by(&mut self, n: usize) -> Result<(), usize>
🔬This is a nightly-only experimental API. (
iter_advance_by
)Advances the iterator by
n
elements. Read more1.0.0 · sourcefn nth(&mut self, n: usize) -> Option<Self::Item>
fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the
n
th element of the iterator. Read more1.28.0 · sourcefn step_by(self, step: usize) -> StepBy<Self>
fn step_by(self, step: usize) -> StepBy<Self>
Creates an iterator starting at the same point, but stepping by
the given amount at each iteration. Read more
1.0.0 · sourcefn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where
U: IntoIterator<Item = Self::Item>,
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where
U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 · sourcefn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where
U: IntoIterator,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where
U: IntoIterator,
‘Zips up’ two iterators into a single iterator of pairs. Read more
sourcefn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where
G: FnMut() -> Self::Item,
fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where
G: FnMut() -> Self::Item,
🔬This is a nightly-only experimental API. (
iter_intersperse
)Creates a new iterator which places an item generated by
separator
between adjacent items of the original iterator. Read more1.0.0 · sourcefn map<B, F>(self, f: F) -> Map<Self, F>where
F: FnMut(Self::Item) -> B,
fn map<B, F>(self, f: F) -> Map<Self, F>where
F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each
element. Read more
1.21.0 · sourcefn for_each<F>(self, f: F)where
F: FnMut(Self::Item),
fn for_each<F>(self, f: F)where
F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
1.0.0 · sourcefn filter<P>(self, predicate: P) -> Filter<Self, P>where
P: FnMut(&Self::Item) -> bool,
fn filter<P>(self, predicate: P) -> Filter<Self, P>where
P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element
should be yielded. Read more
1.0.0 · sourcefn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where
F: FnMut(Self::Item) -> Option<B>,
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>where
F: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both filters and maps. Read more
1.0.0 · sourcefn enumerate(self) -> Enumerate<Self>
fn enumerate(self) -> Enumerate<Self>
Creates an iterator which gives the current iteration count as well as
the next value. Read more
1.0.0 · sourcefn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where
P: FnMut(&Self::Item) -> bool,
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>where
P: FnMut(&Self::Item) -> bool,
1.0.0 · sourcefn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where
P: FnMut(&Self::Item) -> bool,
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>where
P: FnMut(&Self::Item) -> bool,
Creates an iterator that yields elements based on a predicate. Read more
1.57.0 · sourcefn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where
P: FnMut(Self::Item) -> Option<B>,
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>where
P: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both yields elements based on a predicate and maps. Read more
1.0.0 · sourcefn skip(self, n: usize) -> Skip<Self>
fn skip(self, n: usize) -> Skip<Self>
Creates an iterator that skips the first
n
elements. Read more1.0.0 · sourcefn take(self, n: usize) -> Take<Self>
fn take(self, n: usize) -> Take<Self>
Creates an iterator that yields the first
n
elements, or fewer
if the underlying iterator ends sooner. Read more1.0.0 · sourcefn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where
F: FnMut(&mut St, Self::Item) -> Option<B>,
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0 · sourcefn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where
U: IntoIterator,
F: FnMut(Self::Item) -> U,
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>where
U: IntoIterator,
F: FnMut(Self::Item) -> U,
Creates an iterator that works like map, but flattens nested structure. Read more
1.0.0 · sourcefn inspect<F>(self, f: F) -> Inspect<Self, F>where
F: FnMut(&Self::Item),
fn inspect<F>(self, f: F) -> Inspect<Self, F>where
F: FnMut(&Self::Item),
Does something with each element of an iterator, passing the value on. Read more
1.0.0 · sourcefn by_ref(&mut self) -> &mut Self
fn by_ref(&mut self) -> &mut Self
Borrows an iterator, rather than consuming it. Read more
1.0.0 · sourcefn collect<B>(self) -> Bwhere
B: FromIterator<Self::Item>,
fn collect<B>(self) -> Bwhere
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
sourcefn collect_into<E>(self, collection: &mut E) -> &mut Ewhere
E: Extend<Self::Item>,
fn collect_into<E>(self, collection: &mut E) -> &mut Ewhere
E: Extend<Self::Item>,
🔬This is a nightly-only experimental API. (
iter_collect_into
)Collects all the items from an iterator into a collection. Read more
1.0.0 · sourcefn partition<B, F>(self, f: F) -> (B, B)where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
fn partition<B, F>(self, f: F) -> (B, B)where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
sourcefn is_partitioned<P>(self, predicate: P) -> boolwhere
P: FnMut(Self::Item) -> bool,
fn is_partitioned<P>(self, predicate: P) -> boolwhere
P: FnMut(Self::Item) -> bool,
🔬This is a nightly-only experimental API. (
iter_is_partitioned
)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
. Read more1.27.0 · sourcefn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> Rwhere
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,
An iterator method that applies a function as long as it returns
successfully, producing a single, final value. Read more
1.27.0 · sourcefn try_for_each<F, R>(&mut self, f: F) -> Rwhere
F: FnMut(Self::Item) -> R,
R: Try<Output = ()>,
fn try_for_each<F, R>(&mut self, f: F) -> Rwhere
F: FnMut(Self::Item) -> R,
R: Try<Output = ()>,
An iterator method that applies a fallible function to each item in the
iterator, stopping at the first error and returning that error. Read more
1.0.0 · sourcefn fold<B, F>(self, init: B, f: F) -> Bwhere
F: FnMut(B, Self::Item) -> B,
fn fold<B, F>(self, init: B, f: F) -> Bwhere
F: FnMut(B, Self::Item) -> B,
Folds every element into an accumulator by applying an operation,
returning the final result. Read more
1.51.0 · sourcefn reduce<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
fn reduce<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
Reduces the elements to a single one, by repeatedly applying a reducing
operation. Read more
sourcefn try_reduce<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere
F: FnMut(Self::Item, Self::Item) -> R,
R: Try<Output = Self::Item>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
fn try_reduce<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryTypewhere
F: FnMut(Self::Item, Self::Item) -> R,
R: Try<Output = Self::Item>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
🔬This is a nightly-only experimental API. (
iterator_try_reduce
)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. Read more
1.0.0 · sourcefn all<F>(&mut self, f: F) -> boolwhere
F: FnMut(Self::Item) -> bool,
fn all<F>(&mut self, f: F) -> boolwhere
F: FnMut(Self::Item) -> bool,
Tests if every element of the iterator matches a predicate. Read more
1.0.0 · sourcefn any<F>(&mut self, f: F) -> boolwhere
F: FnMut(Self::Item) -> bool,
fn any<F>(&mut self, f: F) -> boolwhere
F: FnMut(Self::Item) -> bool,
Tests if any element of the iterator matches a predicate. Read more
1.0.0 · sourcefn find<P>(&mut self, predicate: P) -> Option<Self::Item>where
P: FnMut(&Self::Item) -> bool,
fn find<P>(&mut self, predicate: P) -> Option<Self::Item>where
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator that satisfies a predicate. Read more
1.30.0 · sourcefn find_map<B, F>(&mut self, f: F) -> Option<B>where
F: FnMut(Self::Item) -> Option<B>,
fn find_map<B, F>(&mut self, f: F) -> Option<B>where
F: FnMut(Self::Item) -> Option<B>,
Applies function to the elements of iterator and returns
the first non-none result. Read more
sourcefn try_find<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere
F: FnMut(&Self::Item) -> R,
R: Try<Output = bool>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
fn try_find<F, R>(
&mut self,
f: F
) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryTypewhere
F: FnMut(&Self::Item) -> R,
R: Try<Output = bool>,
<R as Try>::Residual: Residual<Option<Self::Item>>,
🔬This is a nightly-only experimental API. (
try_find
)Applies function to the elements of iterator and returns
the first true result or the first error. Read more
1.0.0 · sourcefn position<P>(&mut self, predicate: P) -> Option<usize>where
P: FnMut(Self::Item) -> bool,
fn position<P>(&mut self, predicate: P) -> Option<usize>where
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator, returning its index. Read more
1.6.0 · sourcefn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where
B: Ord,
F: FnMut(&Self::Item) -> B,
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>where
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the maximum value from the
specified function. Read more
1.15.0 · sourcefn max_by<F>(self, compare: F) -> Option<Self::Item>where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn max_by<F>(self, compare: F) -> Option<Self::Item>where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the maximum value with respect to the
specified comparison function. Read more
1.6.0 · sourcefn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where
B: Ord,
F: FnMut(&Self::Item) -> B,
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>where
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the minimum value from the
specified function. Read more
1.15.0 · sourcefn min_by<F>(self, compare: F) -> Option<Self::Item>where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn min_by<F>(self, compare: F) -> Option<Self::Item>where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the
specified comparison function. Read more
1.0.0 · sourcefn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
1.36.0 · sourcefn copied<'a, T>(self) -> Copied<Self>where
T: 'a + Copy,
Self: Iterator<Item = &'a T>,
fn copied<'a, T>(self) -> Copied<Self>where
T: 'a + Copy,
Self: Iterator<Item = &'a T>,
Creates an iterator which copies all of its elements. Read more
1.0.0 · sourcefn cloned<'a, T>(self) -> Cloned<Self>where
T: 'a + Clone,
Self: Iterator<Item = &'a T>,
fn cloned<'a, T>(self) -> Cloned<Self>where
T: 'a + Clone,
Self: Iterator<Item = &'a T>,
1.0.0 · sourcefn cycle(self) -> Cycle<Self>where
Self: Clone,
fn cycle(self) -> Cycle<Self>where
Self: Clone,
Repeats an iterator endlessly. Read more
sourcefn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>
fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>
🔬This is a nightly-only experimental API. (
iter_array_chunks
)Returns an iterator over
N
elements of the iterator at a time. Read more1.11.0 · sourcefn sum<S>(self) -> Swhere
S: Sum<Self::Item>,
fn sum<S>(self) -> Swhere
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
1.11.0 · sourcefn product<P>(self) -> Pwhere
P: Product<Self::Item>,
fn product<P>(self) -> Pwhere
P: Product<Self::Item>,
Iterates over the entire iterator, multiplying all the elements Read more
sourcefn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
fn cmp_by<I, F>(self, other: I, cmp: F) -> Orderingwhere
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
🔬This is a nightly-only experimental API. (
iter_order_by
)Lexicographically compares the elements of this
Iterator
with those
of another with respect to the specified comparison function. Read more1.5.0 · sourcefn partial_cmp<I>(self, other: I) -> Option<Ordering>where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn partial_cmp<I>(self, other: I) -> Option<Ordering>where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
sourcefn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>where
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
🔬This is a nightly-only experimental API. (
iter_order_by
)Lexicographically compares the elements of this
Iterator
with those
of another with respect to the specified comparison function. Read more1.5.0 · sourcefn eq<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn eq<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
sourcefn eq_by<I, F>(self, other: I, eq: F) -> boolwhere
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
fn eq_by<I, F>(self, other: I, eq: F) -> boolwhere
I: IntoIterator,
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
🔬This is a nightly-only experimental API. (
iter_order_by
)1.5.0 · sourcefn ne<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn ne<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0 · sourcefn lt<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn lt<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this
Iterator
are lexicographically
less than those of another. Read more1.5.0 · sourcefn le<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn le<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this
Iterator
are lexicographically
less or equal to those of another. Read more1.5.0 · sourcefn gt<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn gt<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this
Iterator
are lexicographically
greater than those of another. Read more1.5.0 · sourcefn ge<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn ge<I>(self, other: I) -> boolwhere
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this
Iterator
are lexicographically
greater than or equal to those of another. Read moresourcefn is_sorted_by<F>(self, compare: F) -> boolwhere
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
fn is_sorted_by<F>(self, compare: F) -> boolwhere
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
🔬This is a nightly-only experimental API. (
is_sorted
)Checks if the elements of this iterator are sorted using the given comparator function. Read more
sourcefn is_sorted_by_key<F, K>(self, f: F) -> boolwhere
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
fn is_sorted_by_key<F, K>(self, f: F) -> boolwhere
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
🔬This is a nightly-only experimental API. (
is_sorted
)Checks if the elements of this iterator are sorted using the given key extraction
function. Read more
Auto Trait Implementations
impl<I> RefUnwindSafe for MultiProduct<I>where
I: RefUnwindSafe,
<I as Iterator>::Item: RefUnwindSafe,
impl<I> Send for MultiProduct<I>where
I: Send,
<I as Iterator>::Item: Send,
impl<I> Sync for MultiProduct<I>where
I: Sync,
<I as Iterator>::Item: Sync,
impl<I> Unpin for MultiProduct<I>where
I: Unpin,
<I as Iterator>::Item: Unpin,
impl<I> UnwindSafe for MultiProduct<I>where
I: UnwindSafe,
<I as Iterator>::Item: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<I> IntoIterator for Iwhere
I: Iterator,
impl<I> IntoIterator for Iwhere
I: Iterator,
sourceimpl<T> Itertools for Twhere
T: Iterator + ?Sized,
impl<T> Itertools for Twhere
T: Iterator + ?Sized,
sourcefn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter>ⓘNotable traits for Interleave<I, J>impl<I, J> Iterator for Interleave<I, J>where
I: Iterator,
J: Iterator<Item = I::Item>, type Item = I::Item;
where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
fn interleave<J>(self, other: J) -> Interleave<Self, J::IntoIter>ⓘNotable traits for Interleave<I, J>impl<I, J> Iterator for Interleave<I, J>where
I: Iterator,
J: Iterator<Item = I::Item>, type Item = I::Item;
where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
I: Iterator,
J: Iterator<Item = I::Item>, type Item = I::Item;
Alternate elements from two iterators until both have run out. Read more
sourcefn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, J::IntoIter>ⓘNotable traits for InterleaveShortest<I, J>impl<I, J> Iterator for InterleaveShortest<I, J>where
I: Iterator,
J: Iterator<Item = I::Item>, type Item = I::Item;
where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
fn interleave_shortest<J>(
self,
other: J
) -> InterleaveShortest<Self, J::IntoIter>ⓘNotable traits for InterleaveShortest<I, J>impl<I, J> Iterator for InterleaveShortest<I, J>where
I: Iterator,
J: Iterator<Item = I::Item>, type Item = I::Item;
where
J: IntoIterator<Item = Self::Item>,
Self: Sized,
I: Iterator,
J: Iterator<Item = I::Item>, type Item = I::Item;
Alternate elements from two iterators until at least one of them has run
out. Read more
sourcefn intersperse(self, element: Self::Item) -> Intersperse<Self>where
Self: Sized,
Self::Item: Clone,
fn intersperse(self, element: Self::Item) -> Intersperse<Self>where
Self: Sized,
Self::Item: Clone,
An iterator adaptor to insert a particular value
between each element of the adapted iterator. Read more
sourcefn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>ⓘNotable traits for IntersperseWith<I, ElemF>impl<I, ElemF> Iterator for IntersperseWith<I, ElemF>where
I: Iterator,
ElemF: IntersperseElement<I::Item>, type Item = I::Item;
where
Self: Sized,
F: FnMut() -> Self::Item,
fn intersperse_with<F>(self, element: F) -> IntersperseWith<Self, F>ⓘNotable traits for IntersperseWith<I, ElemF>impl<I, ElemF> Iterator for IntersperseWith<I, ElemF>where
I: Iterator,
ElemF: IntersperseElement<I::Item>, type Item = I::Item;
where
Self: Sized,
F: FnMut() -> Self::Item,
I: Iterator,
ElemF: IntersperseElement<I::Item>, type Item = I::Item;
An iterator adaptor to insert a particular value created by a function
between each element of the adapted iterator. Read more
sourcefn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter>ⓘNotable traits for ZipLongest<T, U>impl<T, U> Iterator for ZipLongest<T, U>where
T: Iterator,
U: Iterator, type Item = EitherOrBoth<T::Item, U::Item>;
where
J: IntoIterator,
Self: Sized,
fn zip_longest<J>(self, other: J) -> ZipLongest<Self, J::IntoIter>ⓘNotable traits for ZipLongest<T, U>impl<T, U> Iterator for ZipLongest<T, U>where
T: Iterator,
U: Iterator, type Item = EitherOrBoth<T::Item, U::Item>;
where
J: IntoIterator,
Self: Sized,
T: Iterator,
U: Iterator, type Item = EitherOrBoth<T::Item, U::Item>;
Create an iterator which iterates over both this and the specified
iterator simultaneously, yielding pairs of two optional elements. Read more
sourcefn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter>ⓘNotable traits for ZipEq<I, J>impl<I, J> Iterator for ZipEq<I, J>where
I: Iterator,
J: Iterator, type Item = (I::Item, J::Item);
where
J: IntoIterator,
Self: Sized,
fn zip_eq<J>(self, other: J) -> ZipEq<Self, J::IntoIter>ⓘNotable traits for ZipEq<I, J>impl<I, J> Iterator for ZipEq<I, J>where
I: Iterator,
J: Iterator, type Item = (I::Item, J::Item);
where
J: IntoIterator,
Self: Sized,
I: Iterator,
J: Iterator, type Item = (I::Item, J::Item);
Create an iterator which iterates over both this and the specified
iterator simultaneously, yielding pairs of elements. Read more
sourcefn batching<B, F>(self, f: F) -> Batching<Self, F>ⓘNotable traits for Batching<I, F>impl<B, F, I> Iterator for Batching<I, F>where
I: Iterator,
F: FnMut(&mut I) -> Option<B>, type Item = B;
where
F: FnMut(&mut Self) -> Option<B>,
Self: Sized,
fn batching<B, F>(self, f: F) -> Batching<Self, F>ⓘNotable traits for Batching<I, F>impl<B, F, I> Iterator for Batching<I, F>where
I: Iterator,
F: FnMut(&mut I) -> Option<B>, type Item = B;
where
F: FnMut(&mut Self) -> Option<B>,
Self: Sized,
I: Iterator,
F: FnMut(&mut I) -> Option<B>, type Item = B;
A “meta iterator adaptor”. Its closure receives a reference to the
iterator and may pick off as many elements as it likes, to produce the
next iterator element. Read more
sourcefn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq,
fn group_by<K, F>(self, key: F) -> GroupBy<K, Self, F>where
Self: Sized,
F: FnMut(&Self::Item) -> K,
K: PartialEq,
Return an iterable that can group iterator elements.
Consecutive elements that map to the same key (“runs”), are assigned
to the same group. Read more
sourcefn chunks(self, size: usize) -> IntoChunks<Self>where
Self: Sized,
fn chunks(self, size: usize) -> IntoChunks<Self>where
Self: Sized,
Return an iterable that can chunk the iterator. Read more
sourcefn tuple_windows<T>(self) -> TupleWindows<Self, T>ⓘNotable traits for TupleWindows<I, T>impl<I, T> Iterator for TupleWindows<I, T>where
I: Iterator<Item = T::Item>,
T: HomogeneousTuple + Clone,
T::Item: Clone, type Item = T;
where
Self: Sized + Iterator<Item = T::Item>,
T: HomogeneousTuple,
T::Item: Clone,
fn tuple_windows<T>(self) -> TupleWindows<Self, T>ⓘNotable traits for TupleWindows<I, T>impl<I, T> Iterator for TupleWindows<I, T>where
I: Iterator<Item = T::Item>,
T: HomogeneousTuple + Clone,
T::Item: Clone, type Item = T;
where
Self: Sized + Iterator<Item = T::Item>,
T: HomogeneousTuple,
T::Item: Clone,
I: Iterator<Item = T::Item>,
T: HomogeneousTuple + Clone,
T::Item: Clone, type Item = T;
Return an iterator over all contiguous windows producing tuples of
a specific size (up to 12). Read more
sourcefn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>ⓘNotable traits for CircularTupleWindows<I, T>impl<I, T> Iterator for CircularTupleWindows<I, T>where
I: Iterator<Item = T::Item> + Clone,
T: TupleCollect + Clone,
T::Item: Clone, type Item = T;
where
Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
T::Item: Clone,
fn circular_tuple_windows<T>(self) -> CircularTupleWindows<Self, T>ⓘNotable traits for CircularTupleWindows<I, T>impl<I, T> Iterator for CircularTupleWindows<I, T>where
I: Iterator<Item = T::Item> + Clone,
T: TupleCollect + Clone,
T::Item: Clone, type Item = T;
where
Self: Sized + Clone + Iterator<Item = T::Item> + ExactSizeIterator,
T: TupleCollect + Clone,
T::Item: Clone,
I: Iterator<Item = T::Item> + Clone,
T: TupleCollect + Clone,
T::Item: Clone, type Item = T;
Return an iterator over all windows, wrapping back to the first
elements when the window would otherwise exceed the length of the
iterator, producing tuples of a specific size (up to 12). Read more
sourcefn tuples<T>(self) -> Tuples<Self, T>ⓘNotable traits for Tuples<I, T>impl<I, T> Iterator for Tuples<I, T>where
I: Iterator<Item = T::Item>,
T: HomogeneousTuple, type Item = T;
where
Self: Sized + Iterator<Item = T::Item>,
T: HomogeneousTuple,
fn tuples<T>(self) -> Tuples<Self, T>ⓘNotable traits for Tuples<I, T>impl<I, T> Iterator for Tuples<I, T>where
I: Iterator<Item = T::Item>,
T: HomogeneousTuple, type Item = T;
where
Self: Sized + Iterator<Item = T::Item>,
T: HomogeneousTuple,
I: Iterator<Item = T::Item>,
T: HomogeneousTuple, type Item = T;
Return an iterator that groups the items in tuples of a specific size
(up to 12). Read more
sourcefn tee(self) -> (Tee<Self>, Tee<Self>)where
Self: Sized,
Self::Item: Clone,
fn tee(self) -> (Tee<Self>, Tee<Self>)where
Self: Sized,
Self::Item: Clone,
Split into an iterator pair that both yield all elements from
the original iterator. Read more
sourcefn step(self, n: usize) -> Step<Self>ⓘNotable traits for Step<I>impl<I> Iterator for Step<I>where
I: Iterator, type Item = I::Item;
where
Self: Sized,
fn step(self, n: usize) -> Step<Self>ⓘNotable traits for Step<I>impl<I> Iterator for Step<I>where
I: Iterator, type Item = I::Item;
where
Self: Sized,
I: Iterator, type Item = I::Item;
👎Deprecated since 0.8.0:
Use std .step_by() instead
Return an iterator adaptor that steps
n
elements in the base iterator
for each iteration. Read moresourcefn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
fn map_results<F, T, U, E>(self, f: F) -> MapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
👎Deprecated since 0.10.0:
Use .map_ok() instead
See
.map_ok()
.sourcefn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
fn map_ok<F, T, U, E>(self, f: F) -> MapOk<Self, F>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> U,
Return an iterator adaptor that applies the provided closure
to every
Result::Ok
value. Result::Err
values are
unchanged. Read moresourcefn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>ⓘNotable traits for FilterOk<I, F>impl<I, F, T, E> Iterator for FilterOk<I, F>where
I: Iterator<Item = Result<T, E>>,
F: FnMut(&T) -> bool, type Item = Result<T, E>;
where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
fn filter_ok<F, T, E>(self, f: F) -> FilterOk<Self, F>ⓘNotable traits for FilterOk<I, F>impl<I, F, T, E> Iterator for FilterOk<I, F>where
I: Iterator<Item = Result<T, E>>,
F: FnMut(&T) -> bool, type Item = Result<T, E>;
where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(&T) -> bool,
I: Iterator<Item = Result<T, E>>,
F: FnMut(&T) -> bool, type Item = Result<T, E>;
Return an iterator adaptor that filters every
Result::Ok
value with the provided closure. Result::Err
values are
unchanged. Read moresourcefn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>ⓘNotable traits for FilterMapOk<I, F>impl<I, F, T, U, E> Iterator for FilterMapOk<I, F>where
I: Iterator<Item = Result<T, E>>,
F: FnMut(T) -> Option<U>, type Item = Result<U, E>;
where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
fn filter_map_ok<F, T, U, E>(self, f: F) -> FilterMapOk<Self, F>ⓘNotable traits for FilterMapOk<I, F>impl<I, F, T, U, E> Iterator for FilterMapOk<I, F>where
I: Iterator<Item = Result<T, E>>,
F: FnMut(T) -> Option<U>, type Item = Result<U, E>;
where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnMut(T) -> Option<U>,
I: Iterator<Item = Result<T, E>>,
F: FnMut(T) -> Option<U>, type Item = Result<U, E>;
Return an iterator adaptor that filters and transforms every
Result::Ok
value with the provided closure. Result::Err
values are unchanged. Read moresourcefn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>ⓘNotable traits for FlattenOk<I, T, E>impl<I, T, E> Iterator for FlattenOk<I, T, E>where
I: Iterator<Item = Result<T, E>>,
T: IntoIterator, type Item = Result<T::Item, E>;
where
Self: Iterator<Item = Result<T, E>> + Sized,
T: IntoIterator,
fn flatten_ok<T, E>(self) -> FlattenOk<Self, T, E>ⓘNotable traits for FlattenOk<I, T, E>impl<I, T, E> Iterator for FlattenOk<I, T, E>where
I: Iterator<Item = Result<T, E>>,
T: IntoIterator, type Item = Result<T::Item, E>;
where
Self: Iterator<Item = Result<T, E>> + Sized,
T: IntoIterator,
I: Iterator<Item = Result<T, E>>,
T: IntoIterator, type Item = Result<T::Item, E>;
Return an iterator adaptor that flattens every
Result::Ok
value into
a series of Result::Ok
values. Result::Err
values are unchanged. Read moresourcefn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnOnce(ProcessResults<'_, Self, E>) -> R,
fn process_results<F, T, E, R>(self, processor: F) -> Result<R, E>where
Self: Iterator<Item = Result<T, E>> + Sized,
F: FnOnce(ProcessResults<'_, Self, E>) -> R,
“Lift” a function of the values of the current iterator so as to process
an iterator of
Result
values instead. Read moresourcefn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>where
Self: Sized,
Self::Item: PartialOrd,
J: IntoIterator<Item = Self::Item>,
fn merge<J>(self, other: J) -> Merge<Self, J::IntoIter>where
Self: Sized,
Self::Item: PartialOrd,
J: IntoIterator<Item = Self::Item>,
Return an iterator adaptor that merges the two base iterators in
ascending order. If both base iterators are sorted (ascending), the
result is sorted. Read more
sourcefn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F>ⓘNotable traits for MergeBy<I, J, F>impl<I, J, F> Iterator for MergeBy<I, J, F>where
I: Iterator,
J: Iterator<Item = I::Item>,
F: MergePredicate<I::Item>, type Item = I::Item;
where
Self: Sized,
J: IntoIterator<Item = Self::Item>,
F: FnMut(&Self::Item, &Self::Item) -> bool,
fn merge_by<J, F>(self, other: J, is_first: F) -> MergeBy<Self, J::IntoIter, F>ⓘNotable traits for MergeBy<I, J, F>impl<I, J, F> Iterator for MergeBy<I, J, F>where
I: Iterator,
J: Iterator<Item = I::Item>,
F: MergePredicate<I::Item>, type Item = I::Item;
where
Self: Sized,
J: IntoIterator<Item = Self::Item>,
F: FnMut(&Self::Item, &Self::Item) -> bool,
I: Iterator,
J: Iterator<Item = I::Item>,
F: MergePredicate<I::Item>, type Item = I::Item;
sourcefn merge_join_by<J, F, T>(
self,
other: J,
cmp_fn: F
) -> MergeJoinBy<Self, J::IntoIter, F>ⓘNotable traits for MergeJoinBy<I, J, F>impl<I, J, F, T> Iterator for MergeJoinBy<I, J, F>where
I: Iterator,
J: Iterator,
F: FnMut(&I::Item, &J::Item) -> T,
T: OrderingOrBool<I::Item, J::Item>, type Item = T::MergeResult;
where
J: IntoIterator,
F: FnMut(&Self::Item, &J::Item) -> T,
T: OrderingOrBool<Self::Item, J::Item>,
Self: Sized,
fn merge_join_by<J, F, T>(
self,
other: J,
cmp_fn: F
) -> MergeJoinBy<Self, J::IntoIter, F>ⓘNotable traits for MergeJoinBy<I, J, F>impl<I, J, F, T> Iterator for MergeJoinBy<I, J, F>where
I: Iterator,
J: Iterator,
F: FnMut(&I::Item, &J::Item) -> T,
T: OrderingOrBool<I::Item, J::Item>, type Item = T::MergeResult;
where
J: IntoIterator,
F: FnMut(&Self::Item, &J::Item) -> T,
T: OrderingOrBool<Self::Item, J::Item>,
Self: Sized,
I: Iterator,
J: Iterator,
F: FnMut(&I::Item, &J::Item) -> T,
T: OrderingOrBool<I::Item, J::Item>, type Item = T::MergeResult;
Create an iterator that merges items from both this and the specified
iterator in ascending order. Read more
sourcefn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>where
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::Item: PartialOrd,
fn kmerge(self) -> KMerge<<Self::Item as IntoIterator>::IntoIter>where
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::Item: PartialOrd,
Return an iterator adaptor that flattens an iterator of iterators by
merging them in ascending order. Read more
sourcefn kmerge_by<F>(
self,
first: F
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>ⓘNotable traits for KMergeBy<I, F>impl<I, F> Iterator for KMergeBy<I, F>where
I: Iterator,
F: KMergePredicate<I::Item>, type Item = I::Item;
where
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
fn kmerge_by<F>(
self,
first: F
) -> KMergeBy<<Self::Item as IntoIterator>::IntoIter, F>ⓘNotable traits for KMergeBy<I, F>impl<I, F> Iterator for KMergeBy<I, F>where
I: Iterator,
F: KMergePredicate<I::Item>, type Item = I::Item;
where
Self: Sized,
Self::Item: IntoIterator,
F: FnMut(&<Self::Item as IntoIterator>::Item, &<Self::Item as IntoIterator>::Item) -> bool,
I: Iterator,
F: KMergePredicate<I::Item>, type Item = I::Item;
Return an iterator adaptor that flattens an iterator of iterators by
merging them according to the given closure. Read more
sourcefn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter>ⓘNotable traits for Product<I, J>impl<I, J> Iterator for Product<I, J>where
I: Iterator,
J: Clone + Iterator,
I::Item: Clone, type Item = (I::Item, J::Item);
where
Self: Sized,
Self::Item: Clone,
J: IntoIterator,
J::IntoIter: Clone,
fn cartesian_product<J>(self, other: J) -> Product<Self, J::IntoIter>ⓘNotable traits for Product<I, J>impl<I, J> Iterator for Product<I, J>where
I: Iterator,
J: Clone + Iterator,
I::Item: Clone, type Item = (I::Item, J::Item);
where
Self: Sized,
Self::Item: Clone,
J: IntoIterator,
J::IntoIter: Clone,
I: Iterator,
J: Clone + Iterator,
I::Item: Clone, type Item = (I::Item, J::Item);
Return an iterator adaptor that iterates over the cartesian product of
the element sets of two iterators
self
and J
. Read moresourcefn multi_cartesian_product(
self
) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>ⓘNotable traits for MultiProduct<I>impl<I> Iterator for MultiProduct<I>where
I: Iterator + Clone,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::IntoIter: Clone,
<Self::Item as IntoIterator>::Item: Clone,
fn multi_cartesian_product(
self
) -> MultiProduct<<Self::Item as IntoIterator>::IntoIter>ⓘNotable traits for MultiProduct<I>impl<I> Iterator for MultiProduct<I>where
I: Iterator + Clone,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: IntoIterator,
<Self::Item as IntoIterator>::IntoIter: Clone,
<Self::Item as IntoIterator>::Item: Clone,
I: Iterator + Clone,
I::Item: Clone, type Item = Vec<I::Item>;
Return an iterator adaptor that iterates over the cartesian product of
all subiterators returned by meta-iterator
self
. Read moresourcefn coalesce<F>(self, f: F) -> Coalesce<Self, F>where
Self: Sized,
F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
fn coalesce<F>(self, f: F) -> Coalesce<Self, F>where
Self: Sized,
F: FnMut(Self::Item, Self::Item) -> Result<Self::Item, (Self::Item, Self::Item)>,
Return an iterator adaptor that uses the passed-in closure to
optionally merge together consecutive elements. Read more
sourcefn dedup(self) -> Dedup<Self>where
Self: Sized,
Self::Item: PartialEq,
fn dedup(self) -> Dedup<Self>where
Self: Sized,
Self::Item: PartialEq,
Remove duplicates from sections of consecutive identical elements.
If the iterator is sorted, all elements will be unique. Read more
sourcefn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>where
Self: Sized,
Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
fn dedup_by<Cmp>(self, cmp: Cmp) -> DedupBy<Self, Cmp>where
Self: Sized,
Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements,
determining equality using a comparison function.
If the iterator is sorted, all elements will be unique. Read more
sourcefn dedup_with_count(self) -> DedupWithCount<Self>where
Self: Sized,
fn dedup_with_count(self) -> DedupWithCount<Self>where
Self: Sized,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
how many repeated elements were present.
If the iterator is sorted, all elements will be unique. Read more
sourcefn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>where
Self: Sized,
Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
fn dedup_by_with_count<Cmp>(self, cmp: Cmp) -> DedupByWithCount<Self, Cmp>where
Self: Sized,
Cmp: FnMut(&Self::Item, &Self::Item) -> bool,
Remove duplicates from sections of consecutive identical elements, while keeping a count of
how many repeated elements were present.
This will determine equality using a comparison function.
If the iterator is sorted, all elements will be unique. Read more
sourcefn duplicates(self) -> Duplicates<Self>where
Self: Sized,
Self::Item: Eq + Hash,
fn duplicates(self) -> Duplicates<Self>where
Self: Sized,
Self::Item: Eq + Hash,
Return an iterator adaptor that produces elements that appear more than once during the
iteration. Duplicates are detected using hash and equality. Read more
sourcefn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>where
Self: Sized,
V: Eq + Hash,
F: FnMut(&Self::Item) -> V,
fn duplicates_by<V, F>(self, f: F) -> DuplicatesBy<Self, V, F>where
Self: Sized,
V: Eq + Hash,
F: FnMut(&Self::Item) -> V,
Return an iterator adaptor that produces elements that appear more than once during the
iteration. Duplicates are detected using hash and equality. Read more
sourcefn unique(self) -> Unique<Self>ⓘNotable traits for Unique<I>impl<I> Iterator for Unique<I>where
I: Iterator,
I::Item: Eq + Hash + Clone, type Item = I::Item;
where
Self: Sized,
Self::Item: Clone + Eq + Hash,
fn unique(self) -> Unique<Self>ⓘNotable traits for Unique<I>impl<I> Iterator for Unique<I>where
I: Iterator,
I::Item: Eq + Hash + Clone, type Item = I::Item;
where
Self: Sized,
Self::Item: Clone + Eq + Hash,
I: Iterator,
I::Item: Eq + Hash + Clone, type Item = I::Item;
Return an iterator adaptor that filters out elements that have
already been produced once during the iteration. Duplicates
are detected using hash and equality. Read more
sourcefn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>ⓘNotable traits for UniqueBy<I, V, F>impl<I, V, F> Iterator for UniqueBy<I, V, F>where
I: Iterator,
V: Eq + Hash,
F: FnMut(&I::Item) -> V, type Item = I::Item;
where
Self: Sized,
V: Eq + Hash,
F: FnMut(&Self::Item) -> V,
fn unique_by<V, F>(self, f: F) -> UniqueBy<Self, V, F>ⓘNotable traits for UniqueBy<I, V, F>impl<I, V, F> Iterator for UniqueBy<I, V, F>where
I: Iterator,
V: Eq + Hash,
F: FnMut(&I::Item) -> V, type Item = I::Item;
where
Self: Sized,
V: Eq + Hash,
F: FnMut(&Self::Item) -> V,
I: Iterator,
V: Eq + Hash,
F: FnMut(&I::Item) -> V, type Item = I::Item;
Return an iterator adaptor that filters out elements that have
already been produced once during the iteration. Read more
sourcefn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>ⓘNotable traits for PeekingTakeWhile<'a, I, F>impl<'a, I, F> Iterator for PeekingTakeWhile<'a, I, F>where
I: PeekingNext,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
where
Self: Sized + PeekingNext,
F: FnMut(&Self::Item) -> bool,
fn peeking_take_while<F>(&mut self, accept: F) -> PeekingTakeWhile<'_, Self, F>ⓘNotable traits for PeekingTakeWhile<'a, I, F>impl<'a, I, F> Iterator for PeekingTakeWhile<'a, I, F>where
I: PeekingNext,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
where
Self: Sized + PeekingNext,
F: FnMut(&Self::Item) -> bool,
I: PeekingNext,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
Return an iterator adaptor that borrows from this iterator and
takes items while the closure
accept
returns true
. Read moresourcefn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>ⓘNotable traits for TakeWhileRef<'a, I, F>impl<'a, I, F> Iterator for TakeWhileRef<'a, I, F>where
I: Iterator + Clone,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
where
Self: Clone,
F: FnMut(&Self::Item) -> bool,
fn take_while_ref<F>(&mut self, accept: F) -> TakeWhileRef<'_, Self, F>ⓘNotable traits for TakeWhileRef<'a, I, F>impl<'a, I, F> Iterator for TakeWhileRef<'a, I, F>where
I: Iterator + Clone,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
where
Self: Clone,
F: FnMut(&Self::Item) -> bool,
I: Iterator + Clone,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
Return an iterator adaptor that borrows from a
Clone
-able iterator
to only pick off elements while the predicate accept
returns true
. Read moresourcefn take_while_inclusive<F>(
&mut self,
accept: F
) -> TakeWhileInclusive<'_, Self, F>ⓘNotable traits for TakeWhileInclusive<'a, I, F>impl<'a, I, F> Iterator for TakeWhileInclusive<'a, I, F>where
I: Iterator,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
where
Self: Sized,
F: FnMut(&Self::Item) -> bool,
fn take_while_inclusive<F>(
&mut self,
accept: F
) -> TakeWhileInclusive<'_, Self, F>ⓘNotable traits for TakeWhileInclusive<'a, I, F>impl<'a, I, F> Iterator for TakeWhileInclusive<'a, I, F>where
I: Iterator,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
where
Self: Sized,
F: FnMut(&Self::Item) -> bool,
I: Iterator,
F: FnMut(&I::Item) -> bool, type Item = I::Item;
Returns an iterator adaptor that consumes elements while the given
predicate is
true
, including the element for which the predicate
first returned false
. Read moresourcefn while_some<A>(self) -> WhileSome<Self>ⓘNotable traits for WhileSome<I>impl<I, A> Iterator for WhileSome<I>where
I: Iterator<Item = Option<A>>, type Item = A;
where
Self: Sized + Iterator<Item = Option<A>>,
fn while_some<A>(self) -> WhileSome<Self>ⓘNotable traits for WhileSome<I>impl<I, A> Iterator for WhileSome<I>where
I: Iterator<Item = Option<A>>, type Item = A;
where
Self: Sized + Iterator<Item = Option<A>>,
I: Iterator<Item = Option<A>>, type Item = A;
Return an iterator adaptor that filters
Option<A>
iterator elements
and produces A
. Stops on the first None
encountered. Read moresourcefn tuple_combinations<T>(self) -> TupleCombinations<Self, T>ⓘNotable traits for TupleCombinations<I, T>impl<I, T> Iterator for TupleCombinations<I, T>where
I: Iterator,
T: HasCombination<I>, type Item = T;
where
Self: Sized + Clone,
Self::Item: Clone,
T: HasCombination<Self>,
fn tuple_combinations<T>(self) -> TupleCombinations<Self, T>ⓘNotable traits for TupleCombinations<I, T>impl<I, T> Iterator for TupleCombinations<I, T>where
I: Iterator,
T: HasCombination<I>, type Item = T;
where
Self: Sized + Clone,
Self::Item: Clone,
T: HasCombination<Self>,
I: Iterator,
T: HasCombination<I>, type Item = T;
Return an iterator adaptor that iterates over the combinations of the
elements from an iterator. Read more
sourcefn combinations(self, k: usize) -> Combinations<Self>ⓘNotable traits for Combinations<I>impl<I> Iterator for Combinations<I>where
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: Clone,
fn combinations(self, k: usize) -> Combinations<Self>ⓘNotable traits for Combinations<I>impl<I> Iterator for Combinations<I>where
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: Clone,
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
Return an iterator adaptor that iterates over the
k
-length combinations of
the elements from an iterator. Read moresourcefn combinations_with_replacement(
self,
k: usize
) -> CombinationsWithReplacement<Self>ⓘNotable traits for CombinationsWithReplacement<I>impl<I> Iterator for CombinationsWithReplacement<I>where
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: Clone,
fn combinations_with_replacement(
self,
k: usize
) -> CombinationsWithReplacement<Self>ⓘNotable traits for CombinationsWithReplacement<I>impl<I> Iterator for CombinationsWithReplacement<I>where
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: Clone,
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
Return an iterator that iterates over the
k
-length combinations of
the elements from an iterator, with replacement. Read moresourcefn permutations(self, k: usize) -> Permutations<Self>ⓘNotable traits for Permutations<I>impl<I> Iterator for Permutations<I>where
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: Clone,
fn permutations(self, k: usize) -> Permutations<Self>ⓘNotable traits for Permutations<I>impl<I> Iterator for Permutations<I>where
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: Clone,
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
Return an iterator adaptor that iterates over all k-permutations of the
elements from an iterator. Read more
sourcefn powerset(self) -> Powerset<Self>ⓘNotable traits for Powerset<I>impl<I> Iterator for Powerset<I>where
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: Clone,
fn powerset(self) -> Powerset<Self>ⓘNotable traits for Powerset<I>impl<I> Iterator for Powerset<I>where
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
where
Self: Sized,
Self::Item: Clone,
I: Iterator,
I::Item: Clone, type Item = Vec<I::Item>;
Return an iterator that iterates through the powerset of the elements from an
iterator. Read more
sourcefn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>ⓘNotable traits for PadUsing<I, F>impl<I, F> Iterator for PadUsing<I, F>where
I: Iterator,
F: FnMut(usize) -> I::Item, type Item = I::Item;
where
Self: Sized,
F: FnMut(usize) -> Self::Item,
fn pad_using<F>(self, min: usize, f: F) -> PadUsing<Self, F>ⓘNotable traits for PadUsing<I, F>impl<I, F> Iterator for PadUsing<I, F>where
I: Iterator,
F: FnMut(usize) -> I::Item, type Item = I::Item;
where
Self: Sized,
F: FnMut(usize) -> Self::Item,
I: Iterator,
F: FnMut(usize) -> I::Item, type Item = I::Item;
Return an iterator adaptor that pads the sequence to a minimum length of
min
by filling missing elements using a closure f
. Read moresourcefn with_position(self) -> WithPosition<Self>ⓘNotable traits for WithPosition<I>impl<I: Iterator> Iterator for WithPosition<I> type Item = (Position, I::Item);
where
Self: Sized,
fn with_position(self) -> WithPosition<Self>ⓘNotable traits for WithPosition<I>impl<I: Iterator> Iterator for WithPosition<I> type Item = (Position, I::Item);
where
Self: Sized,
Return an iterator adaptor that combines each element with a
Position
to
ease special-case handling of the first or last elements. Read moresourcefn positions<P>(self, predicate: P) -> Positions<Self, P>ⓘNotable traits for Positions<I, F>impl<I, F> Iterator for Positions<I, F>where
I: Iterator,
F: FnMut(I::Item) -> bool, type Item = usize;
where
Self: Sized,
P: FnMut(Self::Item) -> bool,
fn positions<P>(self, predicate: P) -> Positions<Self, P>ⓘNotable traits for Positions<I, F>impl<I, F> Iterator for Positions<I, F>where
I: Iterator,
F: FnMut(I::Item) -> bool, type Item = usize;
where
Self: Sized,
P: FnMut(Self::Item) -> bool,
I: Iterator,
F: FnMut(I::Item) -> bool, type Item = usize;
Return an iterator adaptor that yields the indices of all elements
satisfying a predicate, counted from the start of the iterator. Read more
sourcefn update<F>(self, updater: F) -> Update<Self, F>ⓘNotable traits for Update<I, F>impl<I, F> Iterator for Update<I, F>where
I: Iterator,
F: FnMut(&mut I::Item), type Item = I::Item;
where
Self: Sized,
F: FnMut(&mut Self::Item),
fn update<F>(self, updater: F) -> Update<Self, F>ⓘNotable traits for Update<I, F>impl<I, F> Iterator for Update<I, F>where
I: Iterator,
F: FnMut(&mut I::Item), type Item = I::Item;
where
Self: Sized,
F: FnMut(&mut Self::Item),
I: Iterator,
F: FnMut(&mut I::Item), type Item = I::Item;
Return an iterator adaptor that applies a mutating function
to each element before yielding it. Read more
sourcefn next_tuple<T>(&mut self) -> Option<T>where
Self: Sized + Iterator<Item = T::Item>,
T: HomogeneousTuple,
fn next_tuple<T>(&mut self) -> Option<T>where
Self: Sized + Iterator<Item = T::Item>,
T: HomogeneousTuple,
Advances the iterator and returns the next items grouped in a tuple of
a specific size (up to 12). Read more
sourcefn collect_tuple<T>(self) -> Option<T>where
Self: Sized + Iterator<Item = T::Item>,
T: HomogeneousTuple,
fn collect_tuple<T>(self) -> Option<T>where
Self: Sized + Iterator<Item = T::Item>,
T: HomogeneousTuple,
Collects all items from the iterator into a tuple of a specific size
(up to 12). Read more
sourcefn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where
P: FnMut(&Self::Item) -> bool,
fn find_position<P>(&mut self, pred: P) -> Option<(usize, Self::Item)>where
P: FnMut(&Self::Item) -> bool,
Find the position and value of the first element satisfying a predicate. Read more
sourcefn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn find_or_last<P>(self, predicate: P) -> Option<Self::Item>where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the last element, if any. Read more
sourcefn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn find_or_first<P>(self, predicate: P) -> Option<Self::Item>where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
Find the value of the first element satisfying a predicate or return the first element, if any. Read more
sourcefn contains<Q>(&mut self, query: &Q) -> boolwhere
Self: Sized,
Self::Item: Borrow<Q>,
Q: PartialEq,
fn contains<Q>(&mut self, query: &Q) -> boolwhere
Self: Sized,
Self::Item: Borrow<Q>,
Q: PartialEq,
Returns
true
if the given item is present in this iterator. Read moresourcefn all_equal(&mut self) -> boolwhere
Self: Sized,
Self::Item: PartialEq,
fn all_equal(&mut self) -> boolwhere
Self: Sized,
Self::Item: PartialEq,
Check whether all elements compare equal. Read more
sourcefn all_equal_value(
&mut self
) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where
Self: Sized,
Self::Item: PartialEq,
fn all_equal_value(
&mut self
) -> Result<Self::Item, Option<(Self::Item, Self::Item)>>where
Self: Sized,
Self::Item: PartialEq,
If there are elements and they are all equal, return a single copy of that element.
If there are no elements, return an Error containing None.
If there are elements and they are not all equal, return a tuple containing the first
two non-equal elements found. Read more
sourcefn all_unique(&mut self) -> boolwhere
Self: Sized,
Self::Item: Eq + Hash,
fn all_unique(&mut self) -> boolwhere
Self: Sized,
Self::Item: Eq + Hash,
Check whether all elements are unique (non equal). Read more
sourcefn dropping(self, n: usize) -> Selfwhere
Self: Sized,
fn dropping(self, n: usize) -> Selfwhere
Self: Sized,
Consume the first
n
elements from the iterator eagerly,
and return the same iterator again. Read moresourcefn dropping_back(self, n: usize) -> Selfwhere
Self: Sized,
Self: DoubleEndedIterator,
fn dropping_back(self, n: usize) -> Selfwhere
Self: Sized,
Self: DoubleEndedIterator,
Consume the last
n
elements from the iterator eagerly,
and return the same iterator again. Read moresourcefn foreach<F>(self, f: F)where
F: FnMut(Self::Item),
Self: Sized,
fn foreach<F>(self, f: F)where
F: FnMut(Self::Item),
Self: Sized,
👎Deprecated since 0.8.0:
Use .for_each() instead
Run the closure
f
eagerly on each element of the iterator. Read moresourcefn concat(self) -> Self::Itemwhere
Self: Sized,
Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,
fn concat(self) -> Self::Itemwhere
Self: Sized,
Self::Item: Extend<<<Self as Iterator>::Item as IntoIterator>::Item> + IntoIterator + Default,
sourcefn collect_vec(self) -> Vec<Self::Item>where
Self: Sized,
fn collect_vec(self) -> Vec<Self::Item>where
Self: Sized,
sourcefn try_collect<T, U, E>(self) -> Result<U, E>where
Self: Sized + Iterator<Item = Result<T, E>>,
Result<U, E>: FromIterator<Result<T, E>>,
fn try_collect<T, U, E>(self) -> Result<U, E>where
Self: Sized + Iterator<Item = Result<T, E>>,
Result<U, E>: FromIterator<Result<T, E>>,
sourcefn set_from<'a, A: 'a, J>(&mut self, from: J) -> usizewhere
Self: Iterator<Item = &'a mut A>,
J: IntoIterator<Item = A>,
fn set_from<'a, A: 'a, J>(&mut self, from: J) -> usizewhere
Self: Iterator<Item = &'a mut A>,
J: IntoIterator<Item = A>,
Assign to each reference in
self
from the from
iterator,
stopping at the shortest of the two iterators. Read moresourcefn join(&mut self, sep: &str) -> Stringwhere
Self::Item: Display,
fn join(&mut self, sep: &str) -> Stringwhere
Self::Item: Display,
Combine all iterator elements into one String, separated by
sep
. Read moresourcefn format(self, sep: &str) -> Format<'_, Self>where
Self: Sized,
fn format(self, sep: &str) -> Format<'_, Self>where
Self: Sized,
Format all iterator elements, separated by
sep
. Read moresourcefn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where
Self: Sized,
F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,
fn format_with<F>(self, sep: &str, format: F) -> FormatWith<'_, Self, F>where
Self: Sized,
F: FnMut(Self::Item, &mut dyn FnMut(&dyn Display) -> Result) -> Result,
Format all iterator elements, separated by
sep
. Read moresourcefn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
Self: Iterator<Item = Result<A, E>>,
F: FnMut(B, A) -> B,
fn fold_results<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
Self: Iterator<Item = Result<A, E>>,
F: FnMut(B, A) -> B,
👎Deprecated since 0.10.0:
Use .fold_ok() instead
See
.fold_ok()
.sourcefn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
Self: Iterator<Item = Result<A, E>>,
F: FnMut(B, A) -> B,
fn fold_ok<A, E, B, F>(&mut self, start: B, f: F) -> Result<B, E>where
Self: Iterator<Item = Result<A, E>>,
F: FnMut(B, A) -> B,
Fold
Result
values from an iterator. Read moresourcefn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where
Self: Iterator<Item = Option<A>>,
F: FnMut(B, A) -> B,
fn fold_options<A, B, F>(&mut self, start: B, f: F) -> Option<B>where
Self: Iterator<Item = Option<A>>,
F: FnMut(B, A) -> B,
Fold
Option
values from an iterator. Read moresourcefn fold1<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
Self: Sized,
fn fold1<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
Self: Sized,
👎Deprecated since 0.10.2:
Use Iterator::reduce
instead
Accumulator of the elements in the iterator. Read more
sourcefn tree_fold1<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
Self: Sized,
fn tree_fold1<F>(self, f: F) -> Option<Self::Item>where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
Self: Sized,
Accumulate the elements in the iterator in a tree-like manner. Read more
sourcefn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where
Self: Sized,
F: FnMut(B, Self::Item) -> FoldWhile<B>,
fn fold_while<B, F>(&mut self, init: B, f: F) -> FoldWhile<B>where
Self: Sized,
F: FnMut(B, Self::Item) -> FoldWhile<B>,
An iterator method that applies a function, producing a single, final value. Read more
sourcefn sum1<S>(self) -> Option<S>where
Self: Sized,
S: Sum<Self::Item>,
fn sum1<S>(self) -> Option<S>where
Self: Sized,
S: Sum<Self::Item>,
Iterate over the entire iterator and add all the elements. Read more
sourcefn product1<P>(self) -> Option<P>where
Self: Sized,
P: Product<Self::Item>,
fn product1<P>(self) -> Option<P>where
Self: Sized,
P: Product<Self::Item>,
Iterate over the entire iterator and multiply all the elements. Read more
sourcefn sorted_unstable(self) -> IntoIter<Self::Item>where
Self: Sized,
Self::Item: Ord,
fn sorted_unstable(self) -> IntoIter<Self::Item>where
Self: Sized,
Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read more
sourcefn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn sorted_unstable_by<F>(self, cmp: F) -> IntoIter<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read more
sourcefn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
fn sorted_unstable_by_key<K, F>(self, f: F) -> IntoIter<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read more
sourcefn sorted(self) -> IntoIter<Self::Item>where
Self: Sized,
Self::Item: Ord,
fn sorted(self) -> IntoIter<Self::Item>where
Self: Sized,
Self::Item: Ord,
Sort all iterator elements into a new iterator in ascending order. Read more
sourcefn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn sorted_by<F>(self, cmp: F) -> IntoIter<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Sort all iterator elements into a new iterator in ascending order. Read more
sourcefn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
fn sorted_by_key<K, F>(self, f: F) -> IntoIter<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. Read more
sourcefn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
fn sorted_by_cached_key<K, F>(self, f: F) -> IntoIter<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
Sort all iterator elements into a new iterator in ascending order. The key function is
called exactly once per key. Read more
sourcefn k_smallest(self, k: usize) -> IntoIter<Self::Item>where
Self: Sized,
Self::Item: Ord,
fn k_smallest(self, k: usize) -> IntoIter<Self::Item>where
Self: Sized,
Self::Item: Ord,
Sort the k smallest elements into a new iterator, in ascending order. Read more
sourcefn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where
Self: Sized,
F: FnMut(Self::Item) -> Either<L, R>,
A: Default + Extend<L>,
B: Default + Extend<R>,
fn partition_map<A, B, F, L, R>(self, predicate: F) -> (A, B)where
Self: Sized,
F: FnMut(Self::Item) -> Either<L, R>,
A: Default + Extend<L>,
B: Default + Extend<R>,
Collect all iterator elements into one of two
partitions. Unlike
Iterator::partition
, each partition may
have a distinct type. Read moresourcefn partition_result<A, B, T, E>(self) -> (A, B)where
Self: Iterator<Item = Result<T, E>> + Sized,
A: Default + Extend<T>,
B: Default + Extend<E>,
fn partition_result<A, B, T, E>(self) -> (A, B)where
Self: Iterator<Item = Result<T, E>> + Sized,
A: Default + Extend<T>,
B: Default + Extend<E>,
Partition a sequence of
Result
s into one list of all the Ok
elements
and another list of all the Err
elements. Read moresourcefn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>where
Self: Iterator<Item = (K, V)> + Sized,
K: Hash + Eq,
fn into_group_map<K, V>(self) -> HashMap<K, Vec<V>>where
Self: Iterator<Item = (K, V)> + Sized,
K: Hash + Eq,
Return a
HashMap
of keys mapped to Vec
s of values. Keys and values
are taken from (Key, Value)
tuple pairs yielded by the input iterator. Read moresourcefn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>where
Self: Iterator<Item = V> + Sized,
K: Hash + Eq,
F: Fn(&V) -> K,
fn into_group_map_by<K, V, F>(self, f: F) -> HashMap<K, Vec<V>>where
Self: Iterator<Item = V> + Sized,
K: Hash + Eq,
F: Fn(&V) -> K,
Return an
Iterator
on a HashMap
. Keys mapped to Vec
s of values. The key is specified
in the closure. Read moresourcefn into_grouping_map<K, V>(self) -> GroupingMap<Self>where
Self: Iterator<Item = (K, V)> + Sized,
K: Hash + Eq,
fn into_grouping_map<K, V>(self) -> GroupingMap<Self>where
Self: Iterator<Item = (K, V)> + Sized,
K: Hash + Eq,
Constructs a
GroupingMap
to be used later with one of the efficient
group-and-fold operations it allows to perform. Read moresourcefn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>where
Self: Iterator<Item = V> + Sized,
K: Hash + Eq,
F: FnMut(&V) -> K,
fn into_grouping_map_by<K, V, F>(self, key_mapper: F) -> GroupingMapBy<Self, F>where
Self: Iterator<Item = V> + Sized,
K: Hash + Eq,
F: FnMut(&V) -> K,
Constructs a
GroupingMap
to be used later with one of the efficient
group-and-fold operations it allows to perform. Read moresourcefn min_set(self) -> Vec<Self::Item>where
Self: Sized,
Self::Item: Ord,
fn min_set(self) -> Vec<Self::Item>where
Self: Sized,
Self::Item: Ord,
Return all minimum elements of an iterator. Read more
sourcefn min_set_by<F>(self, compare: F) -> Vec<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn min_set_by<F>(self, compare: F) -> Vec<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all minimum elements of an iterator, as determined by
the specified function. Read more
sourcefn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
fn min_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
Return all minimum elements of an iterator, as determined by
the specified function. Read more
sourcefn max_set(self) -> Vec<Self::Item>where
Self: Sized,
Self::Item: Ord,
fn max_set(self) -> Vec<Self::Item>where
Self: Sized,
Self::Item: Ord,
Return all maximum elements of an iterator. Read more
sourcefn max_set_by<F>(self, compare: F) -> Vec<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn max_set_by<F>(self, compare: F) -> Vec<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return all maximum elements of an iterator, as determined by
the specified function. Read more
sourcefn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
fn max_set_by_key<K, F>(self, key: F) -> Vec<Self::Item>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
Return all maximum elements of an iterator, as determined by
the specified function. Read more
sourcefn minmax(self) -> MinMaxResult<Self::Item>where
Self: Sized,
Self::Item: PartialOrd,
fn minmax(self) -> MinMaxResult<Self::Item>where
Self: Sized,
Self::Item: PartialOrd,
Return the minimum and maximum elements in the iterator. Read more
sourcefn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where
Self: Sized,
K: PartialOrd,
F: FnMut(&Self::Item) -> K,
fn minmax_by_key<K, F>(self, key: F) -> MinMaxResult<Self::Item>where
Self: Sized,
K: PartialOrd,
F: FnMut(&Self::Item) -> K,
Return the minimum and maximum element of an iterator, as determined by
the specified function. Read more
sourcefn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn minmax_by<F>(self, compare: F) -> MinMaxResult<Self::Item>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the minimum and maximum element of an iterator, as determined by
the specified comparison function. Read more
sourcefn position_max(self) -> Option<usize>where
Self: Sized,
Self::Item: Ord,
fn position_max(self) -> Option<usize>where
Self: Sized,
Self::Item: Ord,
Return the position of the maximum element in the iterator. Read more
sourcefn position_max_by_key<K, F>(self, key: F) -> Option<usize>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
fn position_max_by_key<K, F>(self, key: F) -> Option<usize>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
Return the position of the maximum element in the iterator, as
determined by the specified function. Read more
sourcefn position_max_by<F>(self, compare: F) -> Option<usize>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn position_max_by<F>(self, compare: F) -> Option<usize>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the maximum element in the iterator, as
determined by the specified comparison function. Read more
sourcefn position_min(self) -> Option<usize>where
Self: Sized,
Self::Item: Ord,
fn position_min(self) -> Option<usize>where
Self: Sized,
Self::Item: Ord,
Return the position of the minimum element in the iterator. Read more
sourcefn position_min_by_key<K, F>(self, key: F) -> Option<usize>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
fn position_min_by_key<K, F>(self, key: F) -> Option<usize>where
Self: Sized,
K: Ord,
F: FnMut(&Self::Item) -> K,
Return the position of the minimum element in the iterator, as
determined by the specified function. Read more
sourcefn position_min_by<F>(self, compare: F) -> Option<usize>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn position_min_by<F>(self, compare: F) -> Option<usize>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the position of the minimum element in the iterator, as
determined by the specified comparison function. Read more
sourcefn position_minmax(self) -> MinMaxResult<usize>where
Self: Sized,
Self::Item: PartialOrd,
fn position_minmax(self) -> MinMaxResult<usize>where
Self: Sized,
Self::Item: PartialOrd,
Return the positions of the minimum and maximum elements in
the iterator. Read more
sourcefn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where
Self: Sized,
K: PartialOrd,
F: FnMut(&Self::Item) -> K,
fn position_minmax_by_key<K, F>(self, key: F) -> MinMaxResult<usize>where
Self: Sized,
K: PartialOrd,
F: FnMut(&Self::Item) -> K,
Return the postions of the minimum and maximum elements of an
iterator, as determined by the specified function. Read more
sourcefn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn position_minmax_by<F>(self, compare: F) -> MinMaxResult<usize>where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Return the postions of the minimum and maximum elements of an
iterator, as determined by the specified comparison function. Read more
sourcefn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
Self: Sized,
fn exactly_one(self) -> Result<Self::Item, ExactlyOneError<Self>>where
Self: Sized,
If the iterator yields exactly one element, that element will be returned, otherwise
an error will be returned containing an iterator that has the same output as the input
iterator. Read more
sourcefn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
Self: Sized,
fn at_most_one(self) -> Result<Option<Self::Item>, ExactlyOneError<Self>>where
Self: Sized,
If the iterator yields no elements, Ok(None) will be returned. If the iterator yields
exactly one element, that element will be returned, otherwise an error will be returned
containing an iterator that has the same output as the input iterator. Read more
sourcefn multipeek(self) -> MultiPeek<Self>ⓘNotable traits for MultiPeek<I>impl<I> Iterator for MultiPeek<I>where
I: Iterator, type Item = I::Item;
where
Self: Sized,
fn multipeek(self) -> MultiPeek<Self>ⓘNotable traits for MultiPeek<I>impl<I> Iterator for MultiPeek<I>where
I: Iterator, type Item = I::Item;
where
Self: Sized,
I: Iterator, type Item = I::Item;
An iterator adaptor that allows the user to peek at multiple
.next()
values without advancing the base iterator. Read moresourcefn counts(self) -> HashMap<Self::Item, usize>where
Self: Sized,
Self::Item: Eq + Hash,
fn counts(self) -> HashMap<Self::Item, usize>where
Self: Sized,
Self::Item: Eq + Hash,
Collect the items in this iterator and return a
HashMap
which
contains each item that appears in the iterator and the number
of times it appears. Read moresourcefn counts_by<K, F>(self, f: F) -> HashMap<K, usize>where
Self: Sized,
K: Eq + Hash,
F: FnMut(Self::Item) -> K,
fn counts_by<K, F>(self, f: F) -> HashMap<K, usize>where
Self: Sized,
K: Eq + Hash,
F: FnMut(Self::Item) -> K,
Collect the items in this iterator and return a
HashMap
which
contains each item that appears in the iterator and the number
of times it appears,
determining identity using a keying function. Read moresourcefn multiunzip<FromI>(self) -> FromIwhere
Self: Sized + MultiUnzip<FromI>,
fn multiunzip<FromI>(self) -> FromIwhere
Self: Sized + MultiUnzip<FromI>,
Converts an iterator of tuples into a tuple of containers. Read more