Struct hash_chain::ChainMap

pub struct ChainMap<K, V, S = RandomState> { /* fields omitted */ }

Methods

impl<K: Hash + Eq, V> ChainMap<K, V>

pub fn new(map: HashMap<K, V>) -> Self

pub fn insert(&mut self, key: K, value: V) -> Option<V>

Inserts a key-value pair into the map. If the map did not have this key present, None is returned.

pub fn get<Q: ?Sized>(&self, key: &Q) -> Option<&V> where
    K: Borrow<Q>,
    Q: Hash + Eq, 

Returns the key-value pair corresponding to the supplied key.

The supplied key may be any borrowed form of the map's key type, but Hash and Eq on the borrowed form must match those for the key type.

pub fn get_mut<Q: ?Sized>(&mut self, key: &Q) -> Option<&mut V> where
    K: Borrow<Q>,
    Q: Hash + Eq, 

Returns a mutable reference to the value corresponding to the key.

The supplied key may be any borrowed form of the map's key type, but Hash and Eq on the borrowed form must match those for the key type.

pub fn get_before<Q: ?Sized>(&self, idx: usize, key: &Q) -> Option<&V> where
    K: Borrow<Q>,
    Q: Hash + Eq, 

pub fn get_before_mut<Q: ?Sized>(
    &mut self,
    idx: usize,
    key: &Q
) -> Option<&mut V> where
    K: Borrow<Q>,
    Q: Hash + Eq, 

pub fn new_child(&mut self)

pub fn new_child_with(&mut self, map: HashMap<K, V>)

pub fn remove_child(&mut self) -> Option<HashMap<K, V>>

pub fn last_has<Q: ?Sized>(&self, key: &Q) -> bool where
    K: Borrow<Q>,
    Q: Hash + Eq, 

pub fn has_at<Q: ?Sized>(&self, idx: usize, key: &Q) -> bool where
    K: Borrow<Q>,
    Q: Hash + Eq, 

pub fn child_len(&self) -> usize

Trait Implementations

impl<K: Hash + Eq, V> Default for ChainMap<K, V>

fn default() -> Self

Returns the "default value" for a type.

impl<'_, K, Q: ?Sized, V> Index<&'_ Q> for ChainMap<K, V> where
    K: Eq + Hash + Borrow<Q>,
    Q: Eq + Hash, 

type Output = V

The returned type after indexing.

fn index(&self, key: &Q) -> &V

Returns a reference to the value corresponding to the supplied key.

Panics

Panics if the key is not present in the HashMap.