Enum ordermap::Entry

pub enum Entry<'a, K: 'a, V: 'a, S: 'a = RandomState> {
    Occupied(OccupiedEntry<'a, K, V, S>),
    Vacant(VacantEntry<'a, K, V, S>),
}

Entry for an existing key-value pair or a vacant location to insert one.

FIXME: Remove dependence on the S parameter (to match HashMap).

Variants

Occupied(OccupiedEntry<'a, K, V, S>)

Existing slot with equivalent key.

Vacant(VacantEntry<'a, K, V, S>)

Vacant slot (no equivalent key in the map).

Implementations

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

pub fn or_insert(self, default: V) -> &'a mut V

Computes in O(1) time (amortized average).

pub fn or_insert_with<F>(self, call: F) -> &'a mut V

where F: FnOnce() -> V,

Computes in O(1) time (amortized average).

pub fn key(&self) -> &K

pub fn index(&self) -> usize

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