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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn fuse<A, T: DoubleEndedIterator<A>>(self) -> Fuse<Rev<T>>

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

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

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

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

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

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

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

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

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

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

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

fn position<A, T: DoubleEndedIterator<A>>(&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>

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

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

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

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

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

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