Struct std::collections::dlist::MutItemsExperimental [-]  [+] [src]

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

An iterator over mutable references to the items of a DList.

Trait Implementations

impl<'a, A> Iterator<&'a mut A> for MutItems<'a, A>

fn next(&mut self) -> Option<&'a mut A>

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

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

fn chain<U: Iterator<&'a mut A>>(self, U) -> Chain<MutItems<'a, A>, U>

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

fn map<B>(self, |&'a mut A| -> B) -> Map<'r, &'a mut A, B, MutItems<'a, A>>

fn filter(self, |&&'a mut A| -> bool) -> Filter<'r, &'a mut A, MutItems<'a, A>>

fn filter_map<B>(self, |&'a mut A| -> Option<B>) -> FilterMap<'r, &'a mut A, B, MutItems<'a, A>>

fn enumerate(self) -> Enumerate<MutItems<'a, A>>

fn peekable(self) -> Peekable<&'a mut A, MutItems<'a, A>>

fn skip_while(self, |&&'a mut A| -> bool) -> SkipWhile<'r, &'a mut A, MutItems<'a, A>>

fn take_while(self, |&&'a mut A| -> bool) -> TakeWhile<'r, &'a mut A, MutItems<'a, A>>

fn skip(self, uint) -> Skip<MutItems<'a, A>>

fn take(self, uint) -> Take<MutItems<'a, A>>

fn scan<St, B>(self, St, |&mut St, &'a mut A| -> Option<B>) -> Scan<'r, &'a mut A, B, MutItems<'a, A>, St>

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

fn fuse(self) -> Fuse<MutItems<'a, A>>

fn inspect(self, |&&'a mut A|) -> Inspect<'r, &'a mut A, MutItems<'a, A>>

fn by_ref(&'r mut self) -> ByRef<'r, MutItems<'a, A>>

fn collect<B: FromIterator<&'a mut A>>(&mut self) -> B

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

fn last(&mut self) -> Option<&'a mut A>

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

fn count(&mut self) -> uint

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

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

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

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

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

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

impl<'a, A> DoubleEndedIterator<&'a mut A> for MutItems<'a, A>

fn next_back(&mut self) -> Option<&'a mut A>

fn rev(self) -> Rev<MutItems<'a, A>>

impl<'a, A> ExactSize<&'a mut A> for MutItems<'a, A>

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

fn len(&self) -> uint

impl<'a, A> ListInsertion<A> for MutItems<'a, A>

fn insert_next(&mut self, elt: A)

fn peek_next(&'a mut self) -> Option<&'a mut A>