Struct tracing::stdlib::collections::hash_map::VacantEntry

pub struct VacantEntry<'a, K, V>
where
    K: 'a,
    V: 'a,
{
    base: RustcVacantEntry<'a, K, V>,
}

A view into a vacant entry in a HashMap. It is part of the Entry enum.

Fields

base: RustcVacantEntry<'a, K, V>

Implementations

impl<'a, K, V> VacantEntry<'a, K, V>

where K: 'a, V: 'a,

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::HashMap;

let mut map: HashMap<&str, u32> = HashMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland");

pub fn into_key(self) -> K

Take ownership of the key.

Examples

use std::collections::HashMap;
use std::collections::hash_map::Entry;

let mut map: HashMap<&str, u32> = HashMap::new();

if let Entry::Vacant(v) = map.entry("poneyland") {
    v.into_key();
}

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::HashMap;
use std::collections::hash_map::Entry;

let mut map: HashMap<&str, u32> = HashMap::new();

if let Entry::Vacant(o) = map.entry("poneyland") {
    o.insert(37);
}
assert_eq!(map["poneyland"], 37);

pub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V>

🔬This is a nightly-only experimental API. (entry_insert #65225)

Sets the value of the entry with the VacantEntry’s key, and returns an OccupiedEntry.

Examples

#![feature(entry_insert)]
use std::collections::HashMap;
use std::collections::hash_map::Entry;

let mut map: HashMap<&str, u32> = HashMap::new();

if let Entry::Vacant(o) = map.entry("poneyland") {
    o.insert_entry(37);
}
assert_eq!(map["poneyland"], 37);

Trait Implementations

impl<K, V> Debug for VacantEntry<'_, K, V>

where K: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.