Struct std::collections::tree_map::MutEntriesExperimental [-]  [+] [src]

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

Lazy forward iterator over a map that allows for the mutation of the values.

Trait Implementations

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

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

/// Advances 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(&self) -> (uint, Option<uint>)

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