Struct std::iter::FlatMapExperimental [-]  [+] [src]

pub struct FlatMap<'a, A, T, U> {
    // some fields omitted
}

An iterator that maps each element to an iterator, and yields the elements of the produced iterators

Trait Implementations

impl<'a, A, T: Iterator<A>, B, U: Iterator<B>> Iterator<B> for FlatMap<'a, A, T, U>

fn next(&mut self) -> Option<B>

fn size_hint(&self) -> (uint, Option<uint>)

fn size_hint(&self) -> (uint, Option<uint>)

fn chain<U: Iterator<B>>(self, U) -> Chain<FlatMap<'a, A, T, U>, U>

fn zip<B, U: Iterator<B>>(self, U) -> Zip<FlatMap<'a, A, T, U>, U>

fn map<B>(self, |B| -> B) -> Map<'r, B, B, FlatMap<'a, A, T, U>>

fn filter(self, |&B| -> bool) -> Filter<'r, B, FlatMap<'a, A, T, U>>

fn filter_map<B>(self, |B| -> Option<B>) -> FilterMap<'r, B, B, FlatMap<'a, A, T, U>>

fn enumerate(self) -> Enumerate<FlatMap<'a, A, T, U>>

fn peekable(self) -> Peekable<B, FlatMap<'a, A, T, U>>

fn skip_while(self, |&B| -> bool) -> SkipWhile<'r, B, FlatMap<'a, A, T, U>>

fn take_while(self, |&B| -> bool) -> TakeWhile<'r, B, FlatMap<'a, A, T, U>>

fn skip(self, uint) -> Skip<FlatMap<'a, A, T, U>>

fn take(self, uint) -> Take<FlatMap<'a, A, T, U>>

fn scan<St, B>(self, St, |&mut St, B| -> Option<B>) -> Scan<'r, B, B, FlatMap<'a, A, T, U>, St>

fn flat_map<B, U: Iterator<B>>(self, |B| -> U) -> FlatMap<'r, B, FlatMap<'a, A, T, U>, U>

fn fuse(self) -> Fuse<FlatMap<'a, A, T, U>>

fn inspect(self, |&B|) -> Inspect<'r, B, FlatMap<'a, A, T, U>>

fn by_ref(&'r mut self) -> ByRef<'r, FlatMap<'a, A, T, U>>

fn collect<B: FromIterator<B>>(&mut self) -> B

fn nth(&mut self, uint) -> Option<B>

fn last(&mut self) -> Option<B>

fn fold<B>(&mut self, B, |B, B| -> B) -> B

fn count(&mut self) -> uint

fn all(&mut self, |B| -> bool) -> bool

fn any(&mut self, |B| -> bool) -> bool

fn find(&mut self, |&B| -> bool) -> Option<B>

fn position(&mut self, |B| -> bool) -> Option<uint>

fn max_by<B: Ord>(&mut self, |&B| -> B) -> Option<B>

fn min_by<B: Ord>(&mut self, |&B| -> B) -> Option<B>

impl<'a, A, T: DoubleEndedIterator<A>, B, U: DoubleEndedIterator<B>> DoubleEndedIterator<B> for FlatMap<'a, A, T, U>

fn next_back(&mut self) -> Option<B>

fn rev(self) -> Rev<FlatMap<'a, A, T, U>>