Struct std::iter::ZipExperimental [-]  [+] [src]

pub struct Zip<T, U> {
    // some fields omitted
}

An iterator which iterates two other iterators simultaneously

Trait Implementations

impl<A, B, T: ExactSize<A>, U: ExactSize<B>> ExactSize<(A, B)> for Zip<T, U>

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

fn len(&self) -> uint

impl<A, B, T: Iterator<A>, U: Iterator<B>> Iterator<(A, B)> for Zip<T, U>

fn next(&mut self) -> Option<(A, B)>

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

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

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

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

fn enumerate(self) -> Enumerate<Zip<T, U>>

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

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

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

fn skip(self, uint) -> Skip<Zip<T, U>>

fn take(self, uint) -> Take<Zip<T, U>>

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

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

fn fuse(self) -> Fuse<Zip<T, U>>

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

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

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

fn nth(&mut self, uint) -> Option<(A, B)>

fn last(&mut self) -> Option<(A, B)>

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

fn count(&mut self) -> uint

fn all(&mut self, |(A, B)| -> bool) -> bool

fn any(&mut self, |(A, B)| -> bool) -> bool

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

fn position(&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)>

impl<A, B, T: ExactSize<A>, U: ExactSize<B>> DoubleEndedIterator<(A, B)> for Zip<T, U>

fn next_back(&mut self) -> Option<(A, B)>

fn rev(self) -> Rev<Zip<T, U>>

impl<A, B, T: RandomAccessIterator<A>, U: RandomAccessIterator<B>> RandomAccessIterator<(A, B)> for Zip<T, U>

fn indexable(&self) -> uint

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

Derived Implementations

impl<T: Clone, U: Clone> Clone for Zip<T, U>

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

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