Struct ChainMap

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

Implementations

impl<K, V, S> ChainMap<K, V, S>

where K: Hash + Eq, S: BuildHasher,

pub fn new(map: HashMap<K, V, S>) -> 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 insert_at( &mut self, idx: usize, key: K, value: V, ) -> Result<Option<V>, Error>

pub fn get<Q>(&self, key: &Q) -> Option<&V>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

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>(&mut self, key: &Q) -> Option<&mut V>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

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>(&self, idx: usize, key: &Q) -> Option<&V>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn get_before_mut<Q>(&mut self, idx: usize, key: &Q) -> Option<&mut V>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

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

pub fn last_has<Q>(&self, key: &Q) -> bool

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn has_at<Q>(&self, idx: usize, key: &Q) -> bool

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

pub fn child_len(&self) -> usize

pub fn get_last_index<Q>(&self, key: &Q) -> Option<usize>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

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

pub fn new_child(&mut self)

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

pub fn split_off(&mut self, idx: usize) -> Self

pub fn append(&mut self, other: &mut Self)

Trait Implementations

impl<K: Clone, V: Clone, S: Clone> Clone for ChainMap<K, V, S>

fn clone(&self) -> ChainMap<K, V, S>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K, V, S> Debug for ChainMap<K, V, S>

where K: Eq + Hash + Debug, V: Debug, S: BuildHasher,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K, V> Default for ChainMap<K, V>

where K: Hash + Eq,

fn default() -> Self

Returns the “default value” for a type.

impl<K, Q, V, S> Index<&Q> for ChainMap<K, V, S>

where K: Eq + Hash + Borrow<Q>, Q: Eq + Hash + ?Sized, S: BuildHasher,

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.

type Output = V

The returned type after indexing.

impl<K, V, S> PartialEq for ChainMap<K, V, S>

where K: Eq + Hash, V: PartialEq, S: BuildHasher,

fn eq(&self, other: &ChainMap<K, V, S>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V, S> Eq for ChainMap<K, V, S>

where K: Eq + Hash, V: Eq, S: BuildHasher,