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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn position<A, B, T: Iterator<A>, U: Iterator<B>>(&mut self, |(A, B)| -> bool) -> Option<uint>

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

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

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

fn rev<A, B, T: ExactSize<A>, U: ExactSize<B>>(self) -> Rev<Zip<T, U>>

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

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

fn clone<T: Clone, U: Clone>(&self) -> Zip<T, U>

fn clone_from<T: Clone, U: Clone>(&mut self, &Zip<T, U>)