Struct indexmap::map::raw_entry_v1::RawVacantEntryMut

pub struct RawVacantEntryMut<'a, K, V, S> {
    map: &'a mut IndexMapCore<K, V>,
    hash_builder: &'a S,
}

A view into a vacant raw entry in an IndexMap. It is part of the RawEntryMut enum.

Fields

map: &'a mut IndexMapCore<K, V>

hash_builder: &'a S

Implementations

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

pub fn index(&self) -> usize

Return the index where a key-value pair may be inserted.

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

where K: Hash, S: BuildHasher,

Inserts the given key and value into the map, and returns mutable references to them.

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

Inserts the given key and value into the map with the provided hash, and returns mutable references to them.

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

where K: Hash, S: BuildHasher,

Inserts the given key and value into the map at the given index, shifting others to the right, and returns mutable references to them.

Panics if index is out of bounds.

Computes in O(n) time (average).

pub fn shift_insert_hashed_nocheck( self, index: usize, hash: u64, key: K, value: V, ) -> (&'a mut K, &'a mut V)

Inserts the given key and value into the map with the provided hash at the given index, and returns mutable references to them.

Panics if index is out of bounds.

Computes in O(n) time (average).

Trait Implementations

impl<K, V, S> Debug for RawVacantEntryMut<'_, K, V, S>

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

Formats the value using the given formatter.