pub struct VacantEntry<'a, K, V, A = Global>{ /* private fields */ }
Expand description
A view into a vacant entry in a BTreeMap
.
It is part of the Entry
enum.
Implementations§
Source§impl<'a, K, V, A> VacantEntry<'a, K, V, A>
impl<'a, K, V, A> VacantEntry<'a, K, V, A>
1.10.0 · Sourcepub fn key(&self) -> &K
pub fn key(&self) -> &K
Gets a reference to the key that would be used when inserting a value through the VacantEntry.
§Examples
1.0.0 · 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
Sourcepub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V, A>
🔬This is a nightly-only experimental API. (btree_entry_insert
#65225)
pub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V, A>
btree_entry_insert
#65225)Sets the value of the entry with the VacantEntry
’s key,
and returns an OccupiedEntry
.
§Examples
#![feature(btree_entry_insert)]
use std::collections::BTreeMap;
use std::collections::btree_map::Entry;
let mut map: BTreeMap<&str, u32> = BTreeMap::new();
if let Entry::Vacant(o) = map.entry("poneyland") {
let entry = o.insert_entry(37);
assert_eq!(entry.get(), &37);
}
assert_eq!(map["poneyland"], 37);
Trait Implementations§
Auto Trait Implementations§
impl<'a, K, V, A> Freeze for VacantEntry<'a, K, V, A>
impl<'a, K, V, A> RefUnwindSafe for VacantEntry<'a, K, V, A>
impl<'a, K, V, A> Send for VacantEntry<'a, K, V, A>
impl<'a, K, V, A> Sync for VacantEntry<'a, K, V, A>
impl<'a, K, V, A> Unpin for VacantEntry<'a, K, V, A>
impl<'a, K, V, A = Global> !UnwindSafe for VacantEntry<'a, K, V, 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