pub struct VacantEntry<'a, K, V, A = Global>where
A: Allocator,{ /* 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>where
A: Allocator,
impl<'a, K, V, A> VacantEntry<'a, K, V, A>where
A: Allocator,
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
use rune::alloc::BTreeMap;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland");
Sourcepub fn into_key(self) -> K
pub fn into_key(self) -> K
Take ownership of the key.
§Examples
use rune::alloc::BTreeMap;
use rune::alloc::btree_map::Entry;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
if let Entry::Vacant(v) = map.entry("poneyland") {
v.into_key();
}
Sourcepub fn try_insert(self, value: V) -> Result<&'a mut V, AllocError>
pub fn try_insert(self, value: V) -> Result<&'a mut V, AllocError>
Sets the value of the entry with the VacantEntry
’s key,
and returns a mutable reference to it.
§Examples
use rune::alloc::BTreeMap;
use rune::alloc::btree_map::Entry;
let mut map: BTreeMap<&str, u32> = BTreeMap::new();
if let Entry::Vacant(o) = map.entry("poneyland") {
o.try_insert(37)?;
}
assert_eq!(map["poneyland"], 37);
Trait Implementations§
Auto Trait Implementations§
impl<'a, K, V, A> Freeze for VacantEntry<'a, K, V, A>where
K: Freeze,
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>where
K: Unpin,
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