pub trait Map<K: Ord + Eq + Hash, V>: Default + GetSize + Reserve + Extend<(K, V)> + FromIterator<(K, V)> + IntoIterator<Item = (K, V)> {
    fn insert(&mut self, key: K, val: V) -> Result<(), InsertError<V>>;
    fn remove<Q: Hash + Eq + Ord>(&mut self, key: &Q) -> Option<V>
    where
        K: Borrow<Q>
; fn get<'a, Q: Hash + Eq + Ord>(&'a self, key: &Q) -> Option<&'a V>
    where
        K: Borrow<Q> + 'a
; fn get_mut<'a, Q: Hash + Eq + Ord>(
        &'a mut self,
        key: &Q
    ) -> Option<&'a mut V>
    where
        K: Borrow<Q> + 'a
; fn iter(&self) -> Iter<'_, K, V>Notable traits for Iter<'a, K, V>impl<'a, K: Eq + Hash, V> Iterator for Iter<'a, K, V> type Item = (&'a K, &'a V);; fn iter_mut(&mut self) -> IterMut<'_, K, V>Notable traits for IterMut<'a, K, V>impl<'a, K: Eq + Hash, V> Iterator for IterMut<'a, K, V> type Item = (&'a K, &'a mut V);; fn has<Q: Hash + Eq + Ord>(&self, key: &Q) -> bool
    where
        K: Borrow<Q>
, { ... } }
Expand description

An collection of key-value pairs

Provided implementations

Requirements

Required Methods

See [HashMap.insert]

See [HashMap.remove]

See [HashMap.get]

See [HashMap.get_mut]

See [HashMap.iter]

See [HashMap.iter_mut]

Provided Methods

See [HashMap.contains_key]

Implementations on Foreign Types

Implementors