pub struct Zip<T, U> { priv a: T, priv b: U, }
An iterator which iterates two other iterators simultaneously
impl<A, B, T: ExactSize<A>, U: ExactSize<B>> ExactSize<(A, B)> for Zip<T, U>
impl<T: Clone, U: Clone> Clone for Zip<T, U>
fn clone(&self) -> Zip<T, U>
Returns a copy of the value. The contents of owned pointers are copied to maintain uniqueness, while the contents of managed pointers are not copied.
impl<A, B, T: Iterator<A>, U: Iterator<B>> Iterator<(A, B)> for Zip<T, U>
fn next(&mut self) -> Option<(A, B)>
Advance the iterator and return the next value. Return None
when the end is reached.
fn size_hint(&self) -> (uint, Option<uint>)
Return a lower bound and upper bound on the remaining length of the iterator.
The common use case for the estimate is pre-allocating space to store the results.
impl<A, B, T: ExactSize<A>, U: ExactSize<B>> DoubleEndedIterator<(A, B)> for Zip<T, U>
fn next_back(&mut self) -> Option<(A, B)>
Yield an element from the end of the range, returning None
if the range is empty.
impl<A, B, T: RandomAccessIterator<A>, U: RandomAccessIterator<B>> RandomAccessIterator<(A, B)> for Zip<T, U>
fn indexable(&self) -> uint
Return the number of indexable elements. At most std::uint::max_value
elements are indexable, even if the iterator represents a longer range.
fn idx(&self, index: uint) -> Option<(A, B)>
Return an element at an index
Prefix searches with a type followed by a colon (e.g.
fn:
) to restrict the search to a given type.
Accepted types are: fn
, mod
,
struct
(or str
), enum
,
trait
, typedef
(or
tdef
).