Enum Entry 

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

A view into a single entry in a map, which may either be vacant or occupied.

This enum is constructed from the entry method on LinkedHashMap.

Examples

use tether_map::Entry;
use tether_map::LinkedHashMap;

let mut map = LinkedHashMap::new();

match map.entry("key") {
    Entry::Vacant(entry) => {
        entry.insert_tail("value");
    }
    Entry::Occupied(entry) => {
        println!("Key already exists: {}", entry.get());
    }
}

Variants

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

An occupied entry.

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

A vacant entry.

Implementations

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

where K: Hash + Eq,

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

Ensures a value is in the entry by inserting the provided default if vacant, and returns a mutable reference to the value in the entry.

When inserting, the new entry is linked at the tail (end) of the list, matching the behavior of insert/insert_tail for new keys.

pub fn and_modify<F>(self, f: F) -> Self

where F: FnOnce(&mut V),

If the entry is occupied, applies the provided function to the value in place. Returns the entry for further chaining.