Struct std::collections::hash_map::VacantEntry
1.0.0 · source · pub struct VacantEntry<'a, K: 'a, V: 'a> { /* private fields */ }
Expand description
A view into a vacant entry in a HashMap
.
It is part of the Entry
enum.
Implementations§
source§impl<'a, K: 'a, V: 'a> VacantEntry<'a, K, V>
impl<'a, K: 'a, V: 'a> VacantEntry<'a, K, V>
sourcepub fn insert(self, value: V) -> &'a mut V
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.
§Examples
use std::collections::HashMap;
use std::collections::hash_map::Entry;
let mut map: HashMap<&str, u32> = HashMap::new();
if let Entry::Vacant(o) = map.entry("poneyland") {
o.insert(37);
}
assert_eq!(map["poneyland"], 37);
Runsourcepub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V>
🔬This is a nightly-only experimental API. (entry_insert
#65225)
pub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V>
entry_insert
#65225)Sets the value of the entry with the VacantEntry
’s key,
and returns an OccupiedEntry
.
§Examples
#![feature(entry_insert)]
use std::collections::HashMap;
use std::collections::hash_map::Entry;
let mut map: HashMap<&str, u32> = HashMap::new();
if let Entry::Vacant(o) = map.entry("poneyland") {
o.insert_entry(37);
}
assert_eq!(map["poneyland"], 37);
RunTrait Implementations§
Auto Trait Implementations§
impl<'a, K, V> RefUnwindSafe for VacantEntry<'a, K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, K, V> Send for VacantEntry<'a, K, V>
impl<'a, K, V> Sync for VacantEntry<'a, K, V>
impl<'a, K, V> Unpin for VacantEntry<'a, K, V>where
K: Unpin,
impl<'a, K, V> !UnwindSafe for VacantEntry<'a, K, V>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more