Enum hashlink::linked_hash_map::RawEntryMut
source · pub enum RawEntryMut<'a, K, V, S> {
Occupied(RawOccupiedEntryMut<'a, K, V>),
Vacant(RawVacantEntryMut<'a, K, V, S>),
}
Variants§
Occupied(RawOccupiedEntryMut<'a, K, V>)
Vacant(RawVacantEntryMut<'a, K, V, S>)
Implementations§
source§impl<'a, K, V, S> RawEntryMut<'a, K, V, S>
impl<'a, K, V, S> RawEntryMut<'a, K, V, S>
sourcepub 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.
sourcepub fn or_insert_with<F>(self, default: F) -> (&'a mut K, &'a mut V)
pub fn or_insert_with<F>(self, default: F) -> (&'a mut K, &'a mut V)
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.
pub fn and_modify<F>(self, f: F) -> Self
Trait Implementations§
Auto Trait Implementations§
impl<'a, K, V, S> Freeze for RawEntryMut<'a, K, V, S>
impl<'a, K, V, S> RefUnwindSafe for RawEntryMut<'a, K, V, S>
impl<'a, K, V, S> Send for RawEntryMut<'a, K, V, S>
impl<'a, K, V, S> Sync for RawEntryMut<'a, K, V, S>
impl<'a, K, V, S> Unpin for RawEntryMut<'a, K, V, S>
impl<'a, K, V, S> !UnwindSafe for RawEntryMut<'a, K, V, S>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more