pub fn iter(&self) -> Iter<K, V> {
        Iter {
            num_left: self.num_elems,
            slots: self.slots.iter().enumerate(),
            _k: PhantomData,
        }
    }
/// An iterator visiting all key-value pairs in arbitrary order. The
/// iterator element type is `(K, &'a 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(0); sec.insert(k0, 10);
/// let k1 = sm.insert(1); sec.insert(k1, 11);
/// let k2 = sm.insert(2); sec.insert(k2, 12);
///
/// for (k, v) in sm.iter() {
///     println!("key: {:?}, val: {}", k, v);
/// }
/// ```
An iterator visiting all key-value pairs in arbitrary order. The
iterator element type is `(K, &'a 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 . The iterator element type is ` ( K & ' a 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(&self) -> Iter<K, V> {
        Iter {
            num_left: self.num_elems,
            slots: self.slots.iter().enumerate(),
            _k: PhantomData,
        }
    }
pub fn iter ( & self ) -> Iter < K , V > { Iter { num_left : self . num_elems , slots : self . slots . iter ( ) . enumerate ( ) , _k : PhantomData , } }
An iterator visiting all key-value pairs in arbitrary order.
An iterator visiting all key - value pairs in arbitrary order .
&self
examples
None
use slotmap::*;
let mut sm = SlotMap::new();
let mut sec = SecondaryMap::new();
let k0 = sm.insert(0); sec.insert(k0, 10);
let k1 = sm.insert(1); sec.insert(k1, 11);
let k2 = sm.insert(2); sec.insert(k2, 12).


let mut sm = SlotMap :: new () ; let mut sec = SecondaryMap :: new () ; let k0 = sm . insert ( 0 ) ; sec . insert ( k0 10 ) ; let k1 = sm . insert ( 1 ) ; sec . insert ( k1 11 ) ; let k2 = sm . insert ( 2 ) ; sec . insert ( k2 12 ) .