VacantEntry in std::collections::btree_map - Rust (original) (raw)
Struct VacantEntry
1.0.0 · Source
pub struct VacantEntry<'a, K, V, A = Global>
where
A: Allocator + Clone,
{ /* private fields */ }Expand description
A view into a vacant entry in a BTreeMap. It is part of the Entry enum.
1.10.0 · Source
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 · Source
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();
}1.0.0 · Source
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);1.92.0 · Source
Sets the value of the entry with the VacantEntry’s key, and returns an OccupiedEntry.
§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") {
let entry = o.insert_entry(37);
assert_eq!(entry.get(), &37);
}
assert_eq!(map["poneyland"], 37);