Struct RawVacantEntryMut 

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

Handle to an absent entry, returned by RawEntryMut::Vacant.

Implementations

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

where K: KevyHash + Eq,

pub fn insert(self, key: K, value: V) -> &'a mut V

Insert (key, value) and return a mutable borrow of the freshly inserted value. The borrow is tied to the original map borrow.

Note: this performs a second probe after a possible grow, because the slot located by the first probe (the one that produced Vacant) can be invalidated by maybe_grow. The added probe is acceptable for the live_entry pattern (the read fast path is the one we were chasing; the absent-key insert path is the cold side, and live_entry itself never takes it).