std​::collections​::treemap

Structs

DifferenceItemsEntriesIntersectionItemsMoveEntriesMutEntriesRevEntriesRevMutEntriesRevSetItemsSetItemsSymDifferenceItemsTreeMapTreeSetUnionItems

Struct std::collections::treemap::DifferenceItems[src]

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

Lazy iterator producing elements in the set difference (in-order)

Trait Implementations

impl<'a, T: Ord> Iterator<&'a T> for DifferenceItems<'a, T>

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

fn size_hint<'a, T: Ord>(&self) -> (uint, Option<uint>)

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

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

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

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

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

fn enumerate<'a, T: Ord>(self) -> Enumerate<DifferenceItems<'a, T>>

fn peekable<'a, T: Ord>(self) -> Peekable<&'a T, DifferenceItems<'a, T>>

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

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

fn skip<'a, T: Ord>(self, uint) -> Skip<DifferenceItems<'a, T>>

fn take<'a, T: Ord>(self, uint) -> Take<DifferenceItems<'a, T>>

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

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

fn fuse<'a, T: Ord>(self) -> Fuse<DifferenceItems<'a, T>>

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

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

fn advance<'a, T: Ord>(&mut self, |&'a T| -> bool) -> bool

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

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

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

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

fn count<'a, T: Ord>(&mut self) -> uint

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

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

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

fn position<'a, T: Ord>(&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>