fn next<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&mut self) -> Option<B>

fn size_hint<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&self) -> (uint, Option<uint>)

fn size_hint<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&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|: 'r -> B) -> Map<'r, B, B, FlatMap<'a, A, T, U>>

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

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

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

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

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

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

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

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

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

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

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

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

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

fn advance<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&mut self, |B| -> bool) -> bool

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

fn nth<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&mut self, uint) -> Option<B>

fn last<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&mut self) -> Option<B>

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

fn count<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&mut self) -> uint

fn all<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&mut self, |B| -> bool) -> bool

fn any<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&mut self, |B| -> bool) -> bool

fn find<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&mut self, |&B| -> bool) -> Option<B>

fn position<'a, A, T: Iterator<A>, B, U: Iterator<B>>(&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>

fn next_back<'a, A, T: DoubleEndedIterator<A>, B, U: DoubleEndedIterator<B>>(&mut self) -> Option<B>

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