std​::collections​::treemap

Structs

DifferenceItemsEntriesIntersectionItemsMoveEntriesMutEntriesRevEntriesRevMutEntriesRevSetItemsSetItemsSymDifferenceItemsTreeMapTreeSetUnionItems

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

pub struct Entries<'a, K, V> {
    // some fields omitted
}

Lazy forward iterator over a map

Trait Implementations

impl<'a, K, V> Iterator<(&'a K, &'a V)> for Entries<'a, K, V>

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

Advance the iterator to the next node (in order) and return a tuple with a reference to the key and value. If there are no more nodes, return None.

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

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

fn chain<U: Iterator<(&'a K, &'a V)>>(self, U) -> Chain<Entries<'a, K, V>, U>

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

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

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

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

fn enumerate<'a, K, V>(self) -> Enumerate<Entries<'a, K, V>>

fn peekable<'a, K, V>(self) -> Peekable<(&'a K, &'a V), Entries<'a, K, V>>

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

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

fn skip<'a, K, V>(self, uint) -> Skip<Entries<'a, K, V>>

fn take<'a, K, V>(self, uint) -> Take<Entries<'a, K, V>>

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

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

fn fuse<'a, K, V>(self) -> Fuse<Entries<'a, K, V>>

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

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

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

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

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

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

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

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

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

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

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

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

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

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