Enum Entry 

pub enum Entry<'a, K, V> {
    Occupied(OccupiedEntry<'a, K, V>),
    Vacant(VacantEntry<'a, K, V>),
}

Available on crate features node-api and dashmap only.

Variants

Occupied(OccupiedEntry<'a, K, V>)

Vacant(VacantEntry<'a, K, V>)

Implementations

impl<'a, K, V> Entry<'a, K, V>

where K: Eq + Hash,

pub fn and_modify(self, f: impl FnOnce(&mut V)) -> Entry<'a, K, V>

Apply a function to the stored value if it exists.

pub fn key(&self) -> &K

Get the key of the entry.

pub fn into_key(self) -> K

Into the key of the entry.

pub fn or_default(self) -> RefMut<'a, K, V>

where V: Default,

Return a mutable reference to the element if it exists, otherwise insert the default and return a mutable reference to that.

pub fn or_insert(self, value: V) -> RefMut<'a, K, V>

Return a mutable reference to the element if it exists, otherwise a provided value and return a mutable reference to that.

pub fn or_insert_with(self, value: impl FnOnce() -> V) -> RefMut<'a, K, V>

Return a mutable reference to the element if it exists, otherwise insert the result of a provided function and return a mutable reference to that.

pub fn or_try_insert_with<E>( self, value: impl FnOnce() -> Result<V, E>, ) -> Result<RefMut<'a, K, V>, E>

pub fn insert(self, value: V) -> RefMut<'a, K, V>

Sets the value of the entry, and returns a reference to the inserted value.

pub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V>

where K: Clone,

Sets the value of the entry, and returns an OccupiedEntry.

If you are not interested in the occupied entry, consider insert as it doesn’t need to clone the key.

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.