Struct std::collections::dlist::MutItems[src]
pub struct MutItems<'a, T> {
// some fields omitted
}Double-ended mutable DList iterator
pub struct MutItems<'a, T> {
// some fields omitted
}Double-ended mutable DList iterator
impl<'a, A> Iterator<&'a mut A> for MutItems<'a, A>fn next<'a, A>(&mut self) -> Option<&'a mut A>fn size_hint<'a, A>(&self) -> (uint, Option<uint>)fn size_hint<'a, A>(&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|: 'r -> B) -> Map<'r, &'a mut A, B, MutItems<'a, A>>fn filter<'a, A>(self, |&&'a mut A|: 'r -> bool) -> Filter<'r, &'a mut A, MutItems<'a, A>>fn filter_map<B>(self, |&'a mut A|: 'r -> Option<B>) -> FilterMap<'r, &'a mut A, B, MutItems<'a, A>>fn enumerate<'a, A>(self) -> Enumerate<MutItems<'a, A>>fn peekable<'a, A>(self) -> Peekable<&'a mut A, MutItems<'a, A>>fn skip_while<'a, A>(self, |&&'a mut A|: 'r -> bool) -> SkipWhile<'r, &'a mut A, MutItems<'a, A>>fn take_while<'a, A>(self, |&&'a mut A|: 'r -> bool) -> TakeWhile<'r, &'a mut A, MutItems<'a, A>>fn skip<'a, A>(self, uint) -> Skip<MutItems<'a, A>>fn take<'a, A>(self, uint) -> Take<MutItems<'a, A>>fn scan<St, B>(self, St, |&mut St, &'a mut A|: 'r -> Option<B>) -> Scan<'r, &'a mut A, B, MutItems<'a, A>, St>fn flat_map<B, U: Iterator<B>>(self, |&'a mut A|: 'r -> U) -> FlatMap<'r, &'a mut A, MutItems<'a, A>, U>fn fuse<'a, A>(self) -> Fuse<MutItems<'a, A>>fn inspect<'a, A>(self, |&&'a mut A|: 'r) -> Inspect<'r, &'a mut A, MutItems<'a, A>>fn by_ref<'a, A>(&'r mut self) -> ByRef<'r, MutItems<'a, A>>fn advance<'a, A>(&mut self, |&'a mut A| -> bool) -> boolfn collect<B: FromIterator<&'a mut A>>(&mut self) -> Bfn nth<'a, A>(&mut self, uint) -> Option<&'a mut A>fn last<'a, A>(&mut self) -> Option<&'a mut A>fn fold<B>(&mut self, B, |B, &'a mut A| -> B) -> Bfn count<'a, A>(&mut self) -> uintfn all<'a, A>(&mut self, |&'a mut A| -> bool) -> boolfn any<'a, A>(&mut self, |&'a mut A| -> bool) -> boolfn find<'a, A>(&mut self, |&&'a mut A| -> bool) -> Option<&'a mut A>fn position<'a, A>(&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>impl<'a, A> ExactSize<&'a mut A> for MutItems<'a, A>impl<'a, A> ListInsertion<A> for MutItems<'a, A>fn insert_next<'a, A>(&mut self, elt: A)fn peek_next<'a, A>(&'a mut self) -> Option<&'a mut A>
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct (or str), enum,
trait, typedef (or
tdef).