Struct linked_hash_map::VacantEntry
[−]
[src]
pub struct VacantEntry<'a, K: 'a, V: 'a, S: 'a = RandomState> { /* fields omitted */ }
A view into a single empty location in a LinkedHashMap
.
Methods
impl<'a, K: 'a + Hash + Eq, V: 'a, S: BuildHasher> VacantEntry<'a, K, V, S>
[src]
impl<'a, K: 'a + Hash + Eq, V: 'a, S: BuildHasher> VacantEntry<'a, K, V, S>
pub fn key(&self) -> &K
[src]
pub fn key(&self) -> &K
Gets a reference to the entry key
Examples
use linked_hash_map::LinkedHashMap; let mut map = LinkedHashMap::<String, u32>::new(); assert_eq!("foo", map.entry("foo".to_string()).key());
pub fn insert(self, value: V) -> &'a mut V
[src]
pub fn insert(self, value: V) -> &'a mut V
Sets the value of the entry with the VacantEntry's key, and returns a mutable reference to it
Trait Implementations
Auto Trait Implementations
impl<'a, K, V, S> Send for VacantEntry<'a, K, V, S> where
K: Send,
S: Send,
V: Send,
impl<'a, K, V, S> Send for VacantEntry<'a, K, V, S> where
K: Send,
S: Send,
V: Send,
impl<'a, K, V, S> Sync for VacantEntry<'a, K, V, S> where
K: Sync,
S: Sync,
V: Sync,
impl<'a, K, V, S> Sync for VacantEntry<'a, K, V, S> where
K: Sync,
S: Sync,
V: Sync,