Enum ritelinked::linked_hash_map::RawEntryMut [−][src]
pub enum RawEntryMut<'a, K, V, S> {
Occupied(RawOccupiedEntryMut<'a, K, V>),
Vacant(RawVacantEntryMut<'a, K, V, S>),
}
Variants
Tuple Fields of Occupied
0: RawOccupiedEntryMut<'a, K, V>
Tuple Fields of Vacant
0: RawVacantEntryMut<'a, K, V, S>
Implementations
pub fn or_insert(self, default_key: K, default_val: V) -> (&'a mut K, &'a mut V) where
K: Hash,
S: BuildHasher,
pub fn or_insert(self, default_key: K, default_val: V) -> (&'a mut K, &'a mut V) where
K: Hash,
S: BuildHasher,
Similarly to Entry::or_insert
, if this entry is occupied, it will move the existing entry
to the back of the internal linked list.
pub fn or_insert_with<F>(self, default: F) -> (&'a mut K, &'a mut V) where
F: FnOnce() -> (K, V),
K: Hash,
S: BuildHasher,
pub fn or_insert_with<F>(self, default: F) -> (&'a mut K, &'a mut V) where
F: FnOnce() -> (K, V),
K: Hash,
S: BuildHasher,
Similarly to Entry::or_insert_with
, if this entry is occupied, it will move the existing
entry to the back of the internal linked list.