pub fn iter_mut<'r>(&'r mut self) -> MutEntries<'r, V> {
        MutEntries {
            front: 0,
            back: self.v.len(),
            iter: self.v.iter_mut()
        }
    }
/// Returns an iterator visiting all key-value pairs in ascending order by the keys,
/// with mutable references to the values.
/// The iterator's element type is `(uint, &'r mut V)`.
///
/// # Example
///
/// ```
/// use std::collections::SmallIntMap;
///
/// let mut map = SmallIntMap::new();
/// map.insert(1, "a");
/// map.insert(2, "b");
/// map.insert(3, "c");
///
/// for (key, value) in map.iter_mut() {
///     *value = "x";
/// }
///
/// for (key, value) in map.iter() {
///     assert_eq!(value, &"x");
/// }
/// ```
Returns an iterator visiting all key-value pairs in ascending order by the keys,
with mutable references to the values.
The iterator's element type is `(uint, &'r mut V)`.
Returns an iterator visiting all key - value pairs in ascending order by the keys with mutable references to the values . The iterator ' s element type is ` ( uint & ' r mut V ) ` .
pub fn iter_mut<'r>(&'r mut self) -> MutEntries<'r, V> {
        MutEntries {
            front: 0,
            back: self.v.len(),
            iter: self.v.iter_mut()
        }
    }
pub fn iter_mut < ' r > ( & ' r mut self ) -> MutEntries < ' r , V > { MutEntries { front : 0 , back : self . v . len ( ) , iter : self . v . iter_mut ( ) } }
Returns an iterator visiting all key-value pairs in ascending order by the keys,
with mutable references to the values.
Returns an iterator visiting all key - value pairs in ascending order by the keys with mutable references to the values .
&'r mut self
&'r mut self
example
```
use std::collections::SmallIntMap.



for (key, value) in map.iter_mut() {
value = "x";
}


` ` ` use std :: collections :: SmallIntMap . for ( key value ) in map . iter_mut () { value = " x " ; }