# Struct vec_map::IterMut [−] [src]

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

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

## Trait Implementations

### `impl<'a, V> Iterator for IterMut<'a, V>`

#### `type Item = (usize, &'a mut V)`

#### `fn next(&mut self) -> Option<(usize, &'a mut V)>`

#### `fn size_hint(&self) -> (usize, Option<usize>)`

#### 1.0.0 `fn count(self) -> usize`

#### 1.0.0 `fn last(self) -> Option<Self::Item>`

#### 1.0.0 `fn nth(&mut self, n: usize) -> Option<Self::Item>`

#### 1.0.0 `fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>`

#### 1.0.0 `fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator`

#### 1.0.0 `fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B`

#### 1.0.0 `fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool`

#### 1.0.0 `fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>`

#### 1.0.0 `fn enumerate(self) -> Enumerate<Self>`

#### 1.0.0 `fn peekable(self) -> Peekable<Self>`

#### 1.0.0 `fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool`

#### 1.0.0 `fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool`

#### 1.0.0 `fn skip(self, n: usize) -> Skip<Self>`

#### 1.0.0 `fn take(self, n: usize) -> Take<Self>`

#### 1.0.0 `fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>`

#### 1.0.0 `fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoIterator`

#### 1.0.0 `fn fuse(self) -> Fuse<Self>`

#### 1.0.0 `fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()`

#### 1.0.0 `fn by_ref(&mut self) -> &mut Self`

#### 1.0.0 `fn collect<B>(self) -> B where B: FromIterator<Self::Item>`

#### 1.0.0 `fn partition<B, F>(self, f: F) -> (B, B) where B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool`

#### 1.0.0 `fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B`

#### 1.0.0 `fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool`

#### 1.0.0 `fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool`

#### 1.0.0 `fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool`

#### 1.0.0 `fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool`

#### 1.0.0 `fn rposition<P>(&mut self, predicate: P) -> Option<usize> where Self: ExactSizeIterator + DoubleEndedIterator, P: FnMut(Self::Item) -> bool`

#### 1.0.0 `fn max(self) -> Option<Self::Item> where Self::Item: Ord`

#### 1.0.0 `fn min(self) -> Option<Self::Item> where Self::Item: Ord`

#### `fn max_by<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord`

#### 1.6.0 `fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where F: FnMut(&Self::Item) -> B, B: Ord`

#### `fn min_by<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B`

#### 1.6.0 `fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B`

#### 1.0.0 `fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator`

#### 1.0.0 `fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Iterator<Item=(A, B)>`

#### 1.0.0 `fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>`

#### 1.0.0 `fn cycle(self) -> Cycle<Self> where Self: Clone`

#### `fn sum<S>(self) -> S where S: Add<Self::Item, Output=S> + Zero`

#### `fn product<P>(self) -> P where P: Mul<Self::Item, Output=P> + One`

#### 1.5.0 `fn cmp<I>(self, other: I) -> Ordering where I: IntoIterator<Item=Self::Item>, Self::Item: Ord`

#### 1.5.0 `fn partial_cmp<I>(self, other: I) -> Option<Ordering> where I: IntoIterator, Self::Item: PartialOrd<I::Item>`

#### 1.5.0 `fn eq<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>`

#### 1.5.0 `fn ne<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialEq<I::Item>`

#### 1.5.0 `fn lt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>`

#### 1.5.0 `fn le<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>`

#### 1.5.0 `fn gt<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>`

#### 1.5.0 `fn ge<I>(self, other: I) -> bool where I: IntoIterator, Self::Item: PartialOrd<I::Item>`

### `impl<'a, V> DoubleEndedIterator for IterMut<'a, V>`

#### `fn next_back(&mut self) -> Option<(usize, &'a mut V)>`

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result

## Search Tricks

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`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)