Struct std::collections::tree_set::RevSetItemsExperimental [-]  [+] [src]

pub struct RevSetItems<'a, T: 'a> {
    // some fields omitted
}

A lazy backward iterator over a set.

Trait Implementations

impl<'a, T> Iterator<&'a T> for RevSetItems<'a, T>

fn next(&mut self) -> Option<&'a T>

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

fn chain<U: Iterator<&'a T>>(self, U) -> Chain<RevSetItems<'a, T>, U>

fn zip<B, U: Iterator<B>>(self, U) -> Zip<RevSetItems<'a, T>, U>

fn map<B>(self, |&'a T| -> B) -> Map<'r, &'a T, B, RevSetItems<'a, T>>

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

fn filter_map<B>(self, |&'a T| -> Option<B>) -> FilterMap<'r, &'a T, B, RevSetItems<'a, T>>

fn enumerate(self) -> Enumerate<RevSetItems<'a, T>>

fn peekable(self) -> Peekable<&'a T, RevSetItems<'a, T>>

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

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

fn skip(self, uint) -> Skip<RevSetItems<'a, T>>

fn take(self, uint) -> Take<RevSetItems<'a, T>>

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

fn flat_map<B, U: Iterator<B>>(self, |&'a T| -> U) -> FlatMap<'r, &'a T, RevSetItems<'a, T>, U>

fn fuse(self) -> Fuse<RevSetItems<'a, T>>

fn inspect(self, |&&'a T|) -> Inspect<'r, &'a T, RevSetItems<'a, T>>

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

fn collect<B: FromIterator<&'a T>>(&mut self) -> B

fn nth(&mut self, uint) -> Option<&'a T>

fn last(&mut self) -> Option<&'a T>

fn fold<B>(&mut self, B, |B, &'a T| -> B) -> B

fn count(&mut self) -> uint

fn all(&mut self, |&'a T| -> bool) -> bool

fn any(&mut self, |&'a T| -> bool) -> bool

fn find(&mut self, |&&'a T| -> bool) -> Option<&'a T>

fn position(&mut self, |&'a T| -> bool) -> Option<uint>

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

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