Struct sentry_core::protocol::map::VacantEntry
1.0.0 · source · [−]pub struct VacantEntry<'a, K, V> where
K: 'a,
V: 'a, { /* private fields */ }
Expand description
A view into a vacant entry in a BTreeMap
.
It is part of the Entry
enum.
Implementations
sourceimpl<'a, K, V> VacantEntry<'a, K, V> where
K: Ord,
impl<'a, K, V> VacantEntry<'a, K, V> where
K: Ord,
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
use std::collections::BTreeMap;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland");
1.12.0 · sourcepub fn into_key(self) -> K
pub fn into_key(self) -> K
Take ownership of the key.
Examples
use std::collections::BTreeMap;
use std::collections::btree_map::Entry;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
if let Entry::Vacant(v) = map.entry("poneyland") {
v.into_key();
}
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::BTreeMap;
use std::collections::btree_map::Entry;
let mut map: BTreeMap<&str, u32> = BTreeMap::new();
if let Entry::Vacant(o) = map.entry("poneyland") {
o.insert(37);
}
assert_eq!(map["poneyland"], 37);
Trait 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> where
K: Send,
V: Send,
impl<'a, K, V> Sync for VacantEntry<'a, K, V> where
K: Sync,
V: Sync,
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
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more