pub struct FlatMap<'self, A, T, U> { priv iter: T, priv f: &'self fn(A) -> U, priv frontiter: Option<U>, priv backiter: Option<U>, }
An iterator that maps each element to an iterator, and yields the elements of the produced iterators
impl<'self, A, T: Iterator<A>, B, U: Iterator<B>> Iterator<B> for FlatMap<'self, A, T, U>
fn next(&mut self) -> Option<B>
Advance the iterator and return the next value. Return None
when the end is reached.
fn size_hint(&self) -> (uint, Option<uint>)
Return a lower bound and upper bound on the remaining length of the iterator.
The common use case for the estimate is pre-allocating space to store the results.
impl<'self, A, T: DoubleEndedIterator<A>, B, U: DoubleEndedIterator<B>> DoubleEndedIterator<B> for FlatMap<'self, A, T, U>
fn next_back(&mut self) -> Option<B>
Yield an element from the end of the range, returning None
if the range is empty.
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
).