Struct std::iter::Enumerate[src]

pub struct Enumerate<T> {
    // some fields omitted
}

An iterator which yields the current count and the element during iteration

Trait Implementations

impl<A, T: ExactSize<A>> ExactSize<(uint, A)> for Enumerate<T>

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

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

impl<A, T: Iterator<A>> Iterator<(uint, A)> for Enumerate<T>

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

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

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

fn chain<U: Iterator<(uint, A)>>(self, U) -> Chain<Enumerate<T>, U>

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

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

fn filter<A, T: Iterator<A>>(self, |&(uint, A)|: 'r -> bool) -> Filter<'r, (uint, A), Enumerate<T>>

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

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

fn peekable<A, T: Iterator<A>>(self) -> Peekable<(uint, A), Enumerate<T>>

fn skip_while<A, T: Iterator<A>>(self, |&(uint, A)|: 'r -> bool) -> SkipWhile<'r, (uint, A), Enumerate<T>>

fn take_while<A, T: Iterator<A>>(self, |&(uint, A)|: 'r -> bool) -> TakeWhile<'r, (uint, A), Enumerate<T>>

fn skip<A, T: Iterator<A>>(self, uint) -> Skip<Enumerate<T>>

fn take<A, T: Iterator<A>>(self, uint) -> Take<Enumerate<T>>

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

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

fn fuse<A, T: Iterator<A>>(self) -> Fuse<Enumerate<T>>

fn inspect<A, T: Iterator<A>>(self, |&(uint, A)|: 'r) -> Inspect<'r, (uint, A), Enumerate<T>>

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

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

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

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

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

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

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

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

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

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

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

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

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

impl<A, T: ExactSize<A>> DoubleEndedIterator<(uint, A)> for Enumerate<T>

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

fn rev<A, T: ExactSize<A>>(self) -> Rev<Enumerate<T>>

impl<A, T: RandomAccessIterator<A>> RandomAccessIterator<(uint, A)> for Enumerate<T>

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

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

Derived Implementations

impl<T: Clone> Clone for Enumerate<T>

fn clone<T: Clone>(&self) -> Enumerate<T>

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