Trait sp_std::iter::FusedIterator 1.26.0[−][src]
pub trait FusedIterator: Iterator { }
Expand description
An iterator that always continues to yield None when exhausted.
Calling next on a fused iterator that has returned None once is guaranteed
to return None again. This trait should be implemented by all iterators
that behave this way because it allows optimizing Iterator::fuse().
Note: In general, you should not use FusedIterator in generic bounds if
you need a fused iterator. Instead, you should just call Iterator::fuse()
on the iterator. If the iterator is already fused, the additional Fuse
wrapper will be a no-op with no performance penalty.
Implementations on Foreign Types
impl<'_, T, S> FusedIterator for SymmetricDifference<'_, T, S> where
T: Eq + Hash,
S: BuildHasher, impl<'_, K, V, F> FusedIterator for DrainFilter<'_, K, V, F> where
F: FnMut(&K, &mut V) -> bool, Implementors
impl<'_, K, V, F> FusedIterator for sp_std::collections::btree_map::DrainFilter<'_, K, V, F> where
F: FnMut(&K, &mut V) -> bool, impl<'_, T> FusedIterator for sp_std::collections::btree_set::Intersection<'_, T> where
T: Ord, impl<'_, T> FusedIterator for sp_std::collections::btree_set::SymmetricDifference<'_, T> where
T: Ord, impl<'_, T, F> FusedIterator for sp_std::collections::btree_set::DrainFilter<'_, T, F> where
F: FnMut(&T) -> bool, 1.27.0[src]
impl<'_, T, P> FusedIterator for sp_std::slice::RSplit<'_, T, P> where
P: FnMut(&T) -> bool, impl<'a, I, T> FusedIterator for Cloned<I> where
T: 'a + Clone,
I: FusedIterator<Item = &'a T>, 1.36.0[src]
impl<'a, I, T> FusedIterator for Copied<I> where
T: 'a + Copy,
I: FusedIterator<Item = &'a T>, impl<'a, P> FusedIterator for RMatchIndices<'a, P> where
P: Pattern<'a>,
<P as Pattern<'a>>::Searcher: ReverseSearcher<'a>, impl<'a, P> FusedIterator for RMatches<'a, P> where
P: Pattern<'a>,
<P as Pattern<'a>>::Searcher: ReverseSearcher<'a>, impl<'a, P> FusedIterator for sp_std::str::RSplit<'a, P> where
P: Pattern<'a>,
<P as Pattern<'a>>::Searcher: ReverseSearcher<'a>, impl<'a, P> FusedIterator for sp_std::str::RSplitN<'a, P> where
P: Pattern<'a>,
<P as Pattern<'a>>::Searcher: ReverseSearcher<'a>, impl<'a, P> FusedIterator for RSplitTerminator<'a, P> where
P: Pattern<'a>,
<P as Pattern<'a>>::Searcher: ReverseSearcher<'a>, impl<A, B> FusedIterator for Chain<A, B> where
A: FusedIterator,
B: FusedIterator<Item = <A as Iterator>::Item>, impl<B, I, F> FusedIterator for FilterMap<I, F> where
F: FnMut(<I as Iterator>::Item) -> Option<B>,
I: FusedIterator, impl<B, I, F> FusedIterator for Map<I, F> where
F: FnMut(<I as Iterator>::Item) -> B,
I: FusedIterator, impl<I, F> FusedIterator for Inspect<I, F> where
F: FnMut(&<I as Iterator>::Item),
I: FusedIterator, impl<I, P> FusedIterator for Filter<I, P> where
I: FusedIterator,
P: FnMut(&<I as Iterator>::Item) -> bool, impl<I, P> FusedIterator for SkipWhile<I, P> where
I: FusedIterator,
P: FnMut(&<I as Iterator>::Item) -> bool, impl<I, P> FusedIterator for TakeWhile<I, P> where
I: FusedIterator,
P: FnMut(&<I as Iterator>::Item) -> bool, 1.29.0[src]
impl<I, U> FusedIterator for Flatten<I> where
I: FusedIterator,
U: Iterator,
<I as Iterator>::Item: IntoIterator,
<<I as Iterator>::Item as IntoIterator>::IntoIter == U,
<<I as Iterator>::Item as IntoIterator>::Item == <U as Iterator>::Item, impl<I, U, F> FusedIterator for FlatMap<I, U, F> where
F: FnMut(<I as Iterator>::Item) -> U,
I: FusedIterator,
U: IntoIterator,