Trait Map 

pub trait Map<K: Ord + Eq + Hash, V>:
    Default
    + Len
    + Extend<(K, V)>
    + FromIterator<(K, V)>
    + IntoIterator<Item = (K, V)> {
    // Required methods
    fn insert(&mut self, key: K, val: V) -> Result<(), InsertError<V>>;
    fn remove<Q>(&mut self, key: &Q) -> Option<V>
       where K: Borrow<Q>,
             Q: Hash + Eq + Ord;
    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> ;
    fn iter_mut(&mut self) -> IterMut<'_, K, V> ;

    // Provided method
    fn has<Q: Hash + Eq + Ord>(&self, key: &Q) -> bool
       where K: Borrow<Q> { ... }
}

An collection of key-value pairs

Provided implementations

• HashMap<K, V>
• tinyvec::ArrayVec<(K, V)>
• Vec<(K, V)>

Requirements

• Default for creating the map
• Extend for adding new entries to the map
• Len for bound checks, empty checks, and accessing the length
• FromIterator for collecting into the map
• IntoIterator for iterating and destroying the map

Required Methods

fn insert(&mut self, key: K, val: V) -> Result<(), InsertError<V>>

See [HashMap.insert]

fn remove<Q>(&mut self, key: &Q) -> Option<V>

where K: Borrow<Q>, Q: Hash + Eq + Ord,

See [HashMap.remove]

fn get<'a, Q: Hash + Eq + Ord>(&'a self, key: &Q) -> Option<&'a V>

where K: Borrow<Q> + 'a,

See [HashMap.get]

fn get_mut<'a, Q: Hash + Eq + Ord>(&'a mut self, key: &Q) -> Option<&'a mut V>

where K: Borrow<Q> + 'a,

See [HashMap.get_mut]

fn iter(&self) -> Iter<'_, K, V>

See [HashMap.iter]

fn iter_mut(&mut self) -> IterMut<'_, K, V>

See [HashMap.iter_mut]

Provided Methods

fn has<Q: Hash + Eq + Ord>(&self, key: &Q) -> bool

where K: Borrow<Q>,

See [HashMap.contains_key]

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.

Implementations on Foreign Types

impl<A: Array<Item = (K, V)>, K: Eq + Hash + Ord, V> Map<K, V> for ArrayVec<A>

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>

fn iter_mut(&mut self) -> IterMut<'_, K, V>

impl<K, V> Map<K, V> for Vec<(K, V)>

where K: Ord + Hash,

Available on crate feature alloc only.

fn insert(&mut self, key: K, val: V) -> Result<(), InsertError<V>>

fn remove<Q>(&mut self, key: &Q) -> Option<V>

where K: Borrow<Q>, Q: Hash + Eq + Ord,

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>

fn iter_mut(&mut self) -> IterMut<'_, K, V>

impl<K: Eq + Hash + Ord, V> Map<K, V> for BTreeMap<K, V>

Available on crate feature alloc only.

fn insert(&mut self, key: K, val: V) -> Result<(), InsertError<V>>

fn remove<Q: 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>

fn iter_mut(&mut self) -> IterMut<'_, K, V>

impl<K: Eq + Hash + Ord, V> Map<K, V> for HashMap<K, V>

Available on crate feature std only.

fn iter(&self) -> Iter<'_, K, V>

fn iter_mut(&mut self) -> IterMut<'_, K, V>

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 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>,

Implementors