Struct VacantEntry 

pub struct VacantEntry<'map, Key, Value, State = RandomState> { /* private fields */ }

A view into a vacant entry in the multimap.

Implementations

impl<'map, Key, Value, State> VacantEntry<'map, Key, Value, State>

where Key: Eq + Hash, State: BuildHasher,

pub fn insert(self, value: Value) -> &'map mut Value

Examples

use ordered_multimap::ListOrderedMultimap;
use ordered_multimap::list_ordered_multimap::Entry;

let mut map = ListOrderedMultimap::new();

let mut entry = match map.entry("key") {
    Entry::Vacant(entry) => entry,
    _ => panic!("expected vacant entry")
};

assert_eq!(entry.insert("value"), &"value");

pub fn insert_entry(self, value: Value) -> OccupiedEntry<'map, Key, Value>

Examples

use ordered_multimap::ListOrderedMultimap;
use ordered_multimap::list_ordered_multimap::Entry;

let mut map = ListOrderedMultimap::new();

let mut entry = match map.entry("key") {
    Entry::Vacant(entry) => entry,
    _ => panic!("expected vacant entry")
};

let mut entry = entry.insert_entry("value");
assert_eq!(entry.get(), &"value");

pub fn into_key(self) -> Key

Examples

use ordered_multimap::ListOrderedMultimap;
use ordered_multimap::list_ordered_multimap::Entry;

let mut map: ListOrderedMultimap<&str, &str> = ListOrderedMultimap::new();

let mut entry = match map.entry("key") {
    Entry::Vacant(entry) => entry,
    _ => panic!("expected vacant entry")
};

assert_eq!(entry.into_key(), "key");

pub fn key(&self) -> &Key

Examples

use ordered_multimap::ListOrderedMultimap;
use ordered_multimap::list_ordered_multimap::Entry;

let mut map: ListOrderedMultimap<&str, &str> = ListOrderedMultimap::new();

let mut entry = match map.entry("key") {
    Entry::Vacant(entry) => entry,
    _ => panic!("expected vacant entry")
};

assert_eq!(entry.key(), &"key");

Trait Implementations

impl<Key, Value, State> Debug for VacantEntry<'_, Key, Value, State>

where Key: Debug,

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

Formats the value using the given formatter.