pub fn iter_mut(&mut self) -> IterMut<K, V> {
        IterMut {
            num_left: self.num_elems,
            slots: self.slots.iter_mut().enumerate(),
            _k: PhantomData,
        }
    }
/// An iterator visiting all key-value pairs in arbitrary order, with
/// mutable references to the values. The iterator element type is
/// `(K, &'a mut V)`.
///
/// This function must iterate over all slots, empty or not. In the face of
/// many deleted elements it can be inefficient.
///
/// # Examples
///
/// ```
/// # use slotmap::*;
/// let mut sm = SlotMap::new();
/// let mut sec = SecondaryMap::new();
/// let k0 = sm.insert(1); sec.insert(k0, 10);
/// let k1 = sm.insert(2); sec.insert(k1, 20);
/// let k2 = sm.insert(3); sec.insert(k2, 30);
///
/// for (k, v) in sec.iter_mut() {
///     if k != k1 {
///         *v *= -1;
///     }
/// }
///
/// assert_eq!(sec[k0], -10);
/// assert_eq!(sec[k1], 20);
/// assert_eq!(sec[k2], -30);
/// ```
An iterator visiting all key-value pairs in arbitrary order, with
mutable references to the values. The iterator element type is
`(K, &'a mut V)`.

This function must iterate over all slots, empty or not. In the face of
many deleted elements it can be inefficient.
An iterator visiting all key - value pairs in arbitrary order with mutable references to the values . The iterator element type is ` ( K & ' a mut V ) ` . This function must iterate over all slots empty or not . In the face of many deleted elements it can be inefficient .
pub fn iter_mut(&mut self) -> IterMut<K, V> {
        IterMut {
            num_left: self.num_elems,
            slots: self.slots.iter_mut().enumerate(),
            _k: PhantomData,
        }
    }
pub fn iter_mut ( & mut self ) -> IterMut < K , V > { IterMut { num_left : self . num_elems , slots : self . slots . iter_mut ( ) . enumerate ( ) , _k : PhantomData , } }
An iterator visiting all key-value pairs in arbitrary order, with
mutable references to the values.
An iterator visiting all key - value pairs in arbitrary order with mutable references to the values .
&mut self
examples
None
use slotmap::*;
let mut sm = SlotMap::new();
let mut sec = SecondaryMap::new();
let k0 = sm.insert(1); sec.insert(k0, 10);
let k1 = sm.insert(2); sec.insert(k1, 20);
let k2 = sm.insert(3); sec.insert(k2, 30).




let mut sm = SlotMap :: new () ; let mut sec = SecondaryMap :: new () ; let k0 = sm . insert ( 1 ) ; sec . insert ( k0 10 ) ; let k1 = sm . insert ( 2 ) ; sec . insert ( k1 20 ) ; let k2 = sm . insert ( 3 ) ; sec . insert ( k2 30 ) .