Struct std::iter::EnumerateExperimental [-]  [+] [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(&mut self, |(uint, A)| -> bool) -> Option<uint>

fn len(&self) -> uint

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

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

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

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

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

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

fn enumerate(self) -> Enumerate<Enumerate<T>>

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

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

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

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

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

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

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

fn fuse(self) -> Fuse<Enumerate<T>>

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

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

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

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

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

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

fn count(&mut self) -> uint

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

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

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

fn position(&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(&mut self) -> Option<(uint, A)>

fn rev(self) -> Rev<Enumerate<T>>

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

fn indexable(&self) -> uint

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

Derived Implementations

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

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

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