std​::collections​::treemap

Structs

DifferenceItemsEntriesIntersectionItemsMoveEntriesMutEntriesRevEntriesRevMutEntriesRevSetItemsSetItemsSymDifferenceItemsTreeMapTreeSetUnionItems

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

pub struct MoveEntries<K, V> {
    // some fields omitted
}

Lazy forward iterator over a map that consumes the map while iterating

Trait Implementations

impl<K, V> Iterator<(K, V)> for MoveEntries<K, V>

fn next<K, V>(&mut self) -> Option<(K, V)>

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

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

fn chain<U: Iterator<(K, V)>>(self, U) -> Chain<MoveEntries<K, V>, U>

fn zip<B, U: Iterator<B>>(self, U) -> Zip<MoveEntries<K, V>, U>

fn map<B>(self, |(K, V)|: 'r -> B) -> Map<'r, (K, V), B, MoveEntries<K, V>>

fn filter<K, V>(self, |&(K, V)|: 'r -> bool) -> Filter<'r, (K, V), MoveEntries<K, V>>

fn filter_map<B>(self, |(K, V)|: 'r -> Option<B>) -> FilterMap<'r, (K, V), B, MoveEntries<K, V>>

fn enumerate<K, V>(self) -> Enumerate<MoveEntries<K, V>>

fn peekable<K, V>(self) -> Peekable<(K, V), MoveEntries<K, V>>

fn skip_while<K, V>(self, |&(K, V)|: 'r -> bool) -> SkipWhile<'r, (K, V), MoveEntries<K, V>>

fn take_while<K, V>(self, |&(K, V)|: 'r -> bool) -> TakeWhile<'r, (K, V), MoveEntries<K, V>>

fn skip<K, V>(self, uint) -> Skip<MoveEntries<K, V>>

fn take<K, V>(self, uint) -> Take<MoveEntries<K, V>>

fn scan<St, B>(self, St, |&mut St, (K, V)|: 'r -> Option<B>) -> Scan<'r, (K, V), B, MoveEntries<K, V>, St>

fn flat_map<B, U: Iterator<B>>(self, |(K, V)|: 'r -> U) -> FlatMap<'r, (K, V), MoveEntries<K, V>, U>

fn fuse<K, V>(self) -> Fuse<MoveEntries<K, V>>

fn inspect<K, V>(self, |&(K, V)|: 'r) -> Inspect<'r, (K, V), MoveEntries<K, V>>

fn by_ref<K, V>(&'r mut self) -> ByRef<'r, MoveEntries<K, V>>

fn advance<K, V>(&mut self, |(K, V)| -> bool) -> bool

fn collect<B: FromIterator<(K, V)>>(&mut self) -> B

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

fn last<K, V>(&mut self) -> Option<(K, V)>

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

fn count<K, V>(&mut self) -> uint

fn all<K, V>(&mut self, |(K, V)| -> bool) -> bool

fn any<K, V>(&mut self, |(K, V)| -> bool) -> bool

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

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

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

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