Struct std::collections::tree_map::MoveEntriesExperimental [-]  [+] [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(&mut self) -> Option<(K, V)>

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

fn size_hint(&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)| -> B) -> Map<'r, (K, V), B, MoveEntries<K, V>>

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

fn count(&mut self) -> uint

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

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

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

fn position(&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)>