pub struct Fuse<T> {
// some fields omitted
}An iterator that yields None forever after the underlying iterator
yields None once.
impl<T> Fuse<T>fn reset_fuse<T>(&mut self)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.
impl<A, T: Iterator<A>> Iterator<A> for Fuse<T>fn next<A, T: Iterator<A>>(&mut self) -> Option<A>fn size_hint<A, T: Iterator<A>>(&self) -> (uint, Option<uint>)fn size_hint<A, T: Iterator<A>>(&self) -> (uint, Option<uint>)fn chain<U: Iterator<A>>(self, U) -> Chain<Fuse<T>, U>fn zip<B, U: Iterator<B>>(self, U) -> Zip<Fuse<T>, U>fn map<B>(self, |A|: 'r -> B) -> Map<'r, A, B, Fuse<T>>fn filter<A, T: Iterator<A>>(self, |&A|: 'r -> bool) -> Filter<'r, A, Fuse<T>>fn filter_map<B>(self, |A|: 'r -> Option<B>) -> FilterMap<'r, A, B, Fuse<T>>fn enumerate<A, T: Iterator<A>>(self) -> Enumerate<Fuse<T>>fn peekable<A, T: Iterator<A>>(self) -> Peekable<A, Fuse<T>>fn skip_while<A, T: Iterator<A>>(self, |&A|: 'r -> bool) -> SkipWhile<'r, A, Fuse<T>>fn take_while<A, T: Iterator<A>>(self, |&A|: 'r -> bool) -> TakeWhile<'r, A, Fuse<T>>fn skip<A, T: Iterator<A>>(self, uint) -> Skip<Fuse<T>>fn take<A, T: Iterator<A>>(self, uint) -> Take<Fuse<T>>fn scan<St, B>(self, St, |&mut St, A|: 'r -> Option<B>) -> Scan<'r, A, B, Fuse<T>, St>fn flat_map<B, U: Iterator<B>>(self, |A|: 'r -> U) -> FlatMap<'r, A, Fuse<T>, U>fn fuse<A, T: Iterator<A>>(self) -> Fuse<Fuse<T>>fn inspect<A, T: Iterator<A>>(self, |&A|: 'r) -> Inspect<'r, A, Fuse<T>>fn by_ref<A, T: Iterator<A>>(&'r mut self) -> ByRef<'r, Fuse<T>>fn advance<A, T: Iterator<A>>(&mut self, |A| -> bool) -> boolfn collect<B: FromIterator<A>>(&mut self) -> Bfn nth<A, T: Iterator<A>>(&mut self, uint) -> Option<A>fn last<A, T: Iterator<A>>(&mut self) -> Option<A>fn fold<B>(&mut self, B, |B, A| -> B) -> Bfn count<A, T: Iterator<A>>(&mut self) -> uintfn all<A, T: Iterator<A>>(&mut self, |A| -> bool) -> boolfn any<A, T: Iterator<A>>(&mut self, |A| -> bool) -> boolfn find<A, T: Iterator<A>>(&mut self, |&A| -> bool) -> Option<A>fn position<A, T: Iterator<A>>(&mut self, |A| -> bool) -> Option<uint>fn max_by<B: Ord>(&mut self, |&A| -> B) -> Option<A>fn min_by<B: Ord>(&mut self, |&A| -> B) -> Option<A>impl<A, T: DoubleEndedIterator<A>> DoubleEndedIterator<A> for Fuse<T>fn next_back<A, T: DoubleEndedIterator<A>>(&mut self) -> Option<A>fn rev<A, T: DoubleEndedIterator<A>>(self) -> Rev<Fuse<T>>impl<A, T: RandomAccessIterator<A>> RandomAccessIterator<A> for Fuse<T>fn indexable<A, T: RandomAccessIterator<A>>(&self) -> uintfn idx<A, T: RandomAccessIterator<A>>(&mut self, index: uint) -> Option<A>impl<T: Clone> Clone for Fuse<T>
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).