fn rposition<'a, A, B, T: ExactSize<A>>(&mut self, |B| -> bool) -> Option<uint>

fn len<'a, A, B, T: ExactSize<A>>(&self) -> uint

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn position<'a, A, B, T: Iterator<A>>(&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, B, T: DoubleEndedIterator<A>>(&mut self) -> Option<B>

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

fn indexable<'a, A, B, T: RandomAccessIterator<A>>(&self) -> uint

fn idx<'a, A, B, T: RandomAccessIterator<A>>(&mut self, index: uint) -> Option<B>