fn next<'a, T>(&mut self) -> Option<(uint, &'a T)>

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

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

fn chain<U: Iterator<(uint, &'a T)>>(self, U) -> Chain<Entries<'a, T>, U>

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

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

fn filter<'a, T>(self, |&(uint, &'a T)|: 'r -> bool) -> Filter<'r, (uint, &'a T), Entries<'a, T>>

fn filter_map<B>(self, |(uint, &'a T)|: 'r -> Option<B>) -> FilterMap<'r, (uint, &'a T), B, Entries<'a, T>>

fn enumerate<'a, T>(self) -> Enumerate<Entries<'a, T>>

fn peekable<'a, T>(self) -> Peekable<(uint, &'a T), Entries<'a, T>>

fn skip_while<'a, T>(self, |&(uint, &'a T)|: 'r -> bool) -> SkipWhile<'r, (uint, &'a T), Entries<'a, T>>

fn take_while<'a, T>(self, |&(uint, &'a T)|: 'r -> bool) -> TakeWhile<'r, (uint, &'a T), Entries<'a, T>>

fn skip<'a, T>(self, uint) -> Skip<Entries<'a, T>>

fn take<'a, T>(self, uint) -> Take<Entries<'a, T>>

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

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

fn fuse<'a, T>(self) -> Fuse<Entries<'a, T>>

fn inspect<'a, T>(self, |&(uint, &'a T)|: 'r) -> Inspect<'r, (uint, &'a T), Entries<'a, T>>

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

fn advance<'a, T>(&mut self, |(uint, &'a T)| -> bool) -> bool

fn collect<B: FromIterator<(uint, &'a T)>>(&mut self) -> B

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

fn last<'a, T>(&mut self) -> Option<(uint, &'a T)>

fn fold<B>(&mut self, B, |B, (uint, &'a T)| -> B) -> B

fn count<'a, T>(&mut self) -> uint

fn all<'a, T>(&mut self, |(uint, &'a T)| -> bool) -> bool

fn any<'a, T>(&mut self, |(uint, &'a T)| -> bool) -> bool

fn find<'a, T>(&mut self, |&(uint, &'a T)| -> bool) -> Option<(uint, &'a T)>

fn position<'a, T>(&mut self, |(uint, &'a T)| -> bool) -> Option<uint>

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

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

fn next_back<'a, T>(&mut self) -> Option<(uint, &'a T)>

fn rev<'a, T>(self) -> Rev<Entries<'a, T>>