Struct ordermap::VacantEntry

pub struct VacantEntry<'a, K: 'a, V: 'a, S: 'a = RandomState> {
    pub(crate) map: &'a mut OrderMap<K, V, S>,
    pub(crate) key: K,
    pub(crate) hash: HashValue,
    pub(crate) probe: usize,
}

Fields

map: &'a mut OrderMap<K, V, S>

key: K

hash: HashValue

probe: usize

Implementations

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

pub fn key(&self) -> &K

pub fn into_key(self) -> K

pub fn index(&self) -> usize

Return the index where the key-value pair will be inserted.

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

pub(crate) fn insert_impl<Sz>(self, value: V) -> &'a mut V

where Sz: Size,