pub struct Fuse<T> {
// some fields omitted
}An iterator that yields None forever after the underlying iterator
yields None once.
Methods
impl<T> Fuse<T>
Resets the fuse such that the next call to .next() or .next_back() will
call the underlying iterator again even if it previously returned None.
Trait Implementations
fn next(&mut self) -> Option<A>
fn chain<U: Iterator<A>>(self, other: U) -> Chain<Self, U>
fn zip<B, U: Iterator<B>>(self, other: U) -> Zip<Self, U>
fn map<'r, B>(self, f: |A|: 'r -> B) -> Map<'r, A, B, Self>
fn filter<'r>(self, predicate: |&A|: 'r -> bool) -> Filter<'r, A, Self>
fn filter_map<'r, B>(self, f: |A|: 'r -> Option<B>) -> FilterMap<'r, A, B, Self>
fn skip_while<'r>(self, predicate: |&A|: 'r -> bool) -> SkipWhile<'r, A, Self>
fn take_while<'r>(self, predicate: |&A|: 'r -> bool) -> TakeWhile<'r, A, Self>
fn scan<'r, St, B>(self, initial_state: St, f: |&mut St, A|: 'r -> Option<B>) -> Scan<'r, A, B, Self, St>
fn flat_map<'r, B, U: Iterator<B>>(self, f: |A|: 'r -> U) -> FlatMap<'r, A, Self, U>
fn fuse(self) -> Fuse<Self>
fn inspect<'r>(self, f: |&A|: 'r) -> Inspect<'r, A, Self>
fn by_ref<'r>(&'r mut self) -> ByRef<'r, Self>
fn last(&mut self) -> Option<A>
fn fold<B>(&mut self, init: B, f: |B, A| -> B) -> B
fn all(&mut self, f: |A| -> bool) -> bool
fn any(&mut self, f: |A| -> bool) -> bool
fn find(&mut self, predicate: |&A| -> bool) -> Option<A>
fn max_by<B: Ord>(&mut self, f: |&A| -> B) -> Option<A>
fn min_by<B: Ord>(&mut self, f: |&A| -> B) -> Option<A>
Derived Implementations
Keyboard shortcuts
- ?
- Show this help dialog
- S
- Focus the search field
- ⇤
- Move up in search results
- ⇥
- Move down in search results
- ⏎
- Go to active search result
Search tricks
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct (or str), enum,
trait, typedef (or
tdef).