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

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

A mutable iterator over a BTreeMap's entries.

Trait Implementations

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn count(&mut self) -> uint

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

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

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

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

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

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

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

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

fn rev(self) -> Rev<MutEntries<'a, K, V>>

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

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

fn len(&self) -> uint