Struct VacantEntryRef
pub struct VacantEntryRef<'a, 'b, K, Q, V, S, A = Global>where
A: Allocator,
Q: ?Sized,{ /* private fields */ }
Expand description
A view into a vacant entry in a HashMap
.
It is part of the EntryRef
enum.
§Examples
use hashbrown::hash_map::{EntryRef, HashMap, VacantEntryRef};
let mut map = HashMap::<String, i32>::new();
let entry_v: VacantEntryRef<_, _, _, _> = match map.entry_ref("a") {
EntryRef::Vacant(view) => view,
EntryRef::Occupied(_) => unreachable!(),
};
entry_v.insert(10);
assert!(map["a"] == 10 && map.len() == 1);
// Nonexistent key (insert and update)
match map.entry_ref("b") {
EntryRef::Occupied(_) => unreachable!(),
EntryRef::Vacant(view) => {
let value = view.insert(2);
assert_eq!(*value, 2);
*value = 20;
}
}
assert!(map["b"] == 20 && map.len() == 2);
Implementations§
§impl<'a, 'b, K, Q, V, S, A> VacantEntryRef<'a, 'b, K, Q, V, S, A>where
A: Allocator,
Q: ?Sized,
impl<'a, 'b, K, Q, V, S, A> VacantEntryRef<'a, 'b, K, Q, V, S, A>where
A: Allocator,
Q: ?Sized,
pub fn key(&self) -> &'b Q
pub fn key(&self) -> &'b Q
Gets a reference to the key that would be used when inserting a value
through the VacantEntryRef
.
§Examples
use hashbrown::HashMap;
let mut map: HashMap<String, u32> = HashMap::new();
let key: &str = "poneyland";
assert_eq!(map.entry_ref(key).key(), "poneyland");
pub 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 VacantEntryRef
’s key,
and returns a mutable reference to it.
§Examples
use hashbrown::HashMap;
use hashbrown::hash_map::EntryRef;
let mut map: HashMap<String, u32> = HashMap::new();
let key: &str = "poneyland";
if let EntryRef::Vacant(o) = map.entry_ref(key) {
o.insert(37);
}
assert_eq!(map["poneyland"], 37);
pub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V, S, A>
pub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V, S, A>
Sets the value of the entry with the VacantEntryRef
’s key,
and returns an OccupiedEntry
.
§Examples
use hashbrown::HashMap;
use hashbrown::hash_map::EntryRef;
let mut map: HashMap<&str, u32> = HashMap::new();
if let EntryRef::Vacant(v) = map.entry_ref("poneyland") {
let o = v.insert_entry(37);
assert_eq!(o.get(), &37);
}
Trait Implementations§
Auto Trait Implementations§
impl<'a, 'b, K, Q, V, S, A> Freeze for VacantEntryRef<'a, 'b, K, Q, V, S, A>where
Q: ?Sized,
impl<'a, 'b, K, Q, V, S, A> RefUnwindSafe for VacantEntryRef<'a, 'b, K, Q, V, S, A>where
Q: RefUnwindSafe + ?Sized,
S: RefUnwindSafe,
A: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, 'b, K, Q, V, S, A> Send for VacantEntryRef<'a, 'b, K, Q, V, S, A>
impl<'a, 'b, K, Q, V, S, A> Sync for VacantEntryRef<'a, 'b, K, Q, V, S, A>
impl<'a, 'b, K, Q, V, S, A> Unpin for VacantEntryRef<'a, 'b, K, Q, V, S, A>where
Q: ?Sized,
impl<'a, 'b, K, Q, V, S, A = Global> !UnwindSafe for VacantEntryRef<'a, 'b, K, Q, V, S, A>
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