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

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

An double-ended iterator with the direction inverted

Trait Implementations

impl<A, T: ExactSize<A>> ExactSize<A> for Rev<T>

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

fn len(&self) -> uint

impl<A, T: DoubleEndedIterator<A>> Iterator<A> for Rev<T>

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn count(&mut self) -> uint

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

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

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

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

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

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

impl<A, T: DoubleEndedIterator<A>> DoubleEndedIterator<A> for Rev<T>

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

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

impl<A, T: DoubleEndedIterator<A> + RandomAccessIterator<A>> RandomAccessIterator<A> for Rev<T>

fn indexable(&self) -> uint

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

Derived Implementations

impl<T: Clone> Clone for Rev<T>

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

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