pub struct VacantEntry<'a, K, V> where K: 'a, V: 'a { /* fields omitted */ }
A vacant Entry. It is part of the Entry enum.
impl<'a, K, V> VacantEntry<'a, K, V> where K: Ord
[src]
fn key(&self) -> &KGets a reference to the key that would be used when inserting a value through the VacantEntry.
use std::collections::BTreeMap;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland"); fn into_key(self) -> KTake ownership of the key.
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();
} fn insert(self, value: V) -> &'a mut VSets the value of the entry with the VacantEntry's key, and returns a mutable reference to it.
use std::collections::BTreeMap;
let mut count: BTreeMap<&str, usize> = BTreeMap::new();
// count the number of occurrences of letters in the vec
for x in vec!["a","b","a","c","a","b"] {
*count.entry(x).or_insert(0) += 1;
}
assert_eq!(count["a"], 3); impl<'a, K, V> Debug for VacantEntry<'a, K, V> where K: 'a + Ord + Debug, V: 'a
fn fmt(&self, f: &mut Formatter) -> Result<(), Error>Formats the value using the given formatter.
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/collections/btree_map/struct.VacantEntry.html