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

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

A forward iterator over the key-value pairs of a map, with the values being mutable.

Trait Implementations

impl<'a, T> Iterator<(uint, &'a mut T)> for MutEntries<'a, T>

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

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

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

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

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

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

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

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

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

fn peekable(self) -> Peekable<(uint, &'a mut T), MutEntries<'a, T>>

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

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

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

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

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

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

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

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

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

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

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

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

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

fn count(&mut self) -> uint

fn all(&mut self, |(uint, &'a mut T)| -> bool) -> bool

fn any(&mut self, |(uint, &'a mut T)| -> bool) -> bool

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

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

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

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