Struct hashlink::linked_hash_map::OccupiedEntry

pub struct OccupiedEntry<'a, K, V, S> { /* private fields */ }

Implementations

impl<'a, K, V, S> OccupiedEntry<'a, K, V, S>

pub fn key(&self) -> &K

pub fn remove_entry(self) -> (K, V)

pub fn get(&self) -> &V

pub fn get_mut(&mut self) -> &mut V

pub fn into_mut(self) -> &'a mut V

pub fn to_back(&mut self)

pub fn to_front(&mut self)

pub fn insert(&mut self, value: V) -> V

Replaces this entry’s value with the provided value.

Similarly to LinkedHashMap::insert, this moves the existing entry to the back of the internal linked list.

pub fn remove(self) -> V

pub fn insert_entry(self, value: V) -> (K, V)

Similar to OccupiedEntry::replace_entry, but does move the entry to the back of the internal linked list.

pub fn cursor_mut(self) -> CursorMut<'a, K, V, S>

where K: Eq + Hash, S: BuildHasher,

Returns a CursorMut over the current entry.

pub fn replace_entry(self, value: V) -> (K, V)

Replaces the entry’s key with the key provided to LinkedHashMap::entry, and replaces the entry’s value with the given value parameter.

Does not move the entry to the back of the internal linked list.

pub fn replace_key(self) -> K

Replaces this entry’s key with the key provided to LinkedHashMap::entry.

Does not move the entry to the back of the internal linked list.

Trait Implementations

impl<K: Debug, V: Debug, S> Debug for OccupiedEntry<'_, K, V, S>

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

Formats the value using the given formatter.