Struct wasmer_compiler::lib::std::collections::hash_map::VacantEntry
1.0.0 · source · pub struct VacantEntry<'a, K, V>where
K: 'a,
V: 'a,{
base: RustcVacantEntry<'a, K, V>,
}
Expand description
A view into a vacant entry in a HashMap
.
It is part of the Entry
enum.
Fields§
§base: RustcVacantEntry<'a, K, V>
Implementations§
source§impl<'a, K, V> VacantEntry<'a, K, V>where
K: 'a,
V: 'a,
impl<'a, K, V> VacantEntry<'a, K, V>where
K: 'a,
V: 'a,
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::HashMap;
let mut map: HashMap<&str, u32> = HashMap::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::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();
}
1.0.0 · 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::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);
sourcepub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V>
🔬This is a nightly-only experimental API. (entry_insert
)
pub fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V>
entry_insert
)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§
Auto Trait Implementations§
impl<'a, K, V> Freeze for VacantEntry<'a, K, V>where
K: Freeze,
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>
impl<'a, K, V> Sync for VacantEntry<'a, K, V>
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§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
§impl<T> Pointee for T
impl<T> Pointee for T
source§impl<T> Upcastable for T
impl<T> Upcastable for T
source§fn upcast_any_ref(&self) -> &(dyn Any + 'static)
fn upcast_any_ref(&self) -> &(dyn Any + 'static)
upcast ref
source§fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn upcast_any_mut(&mut self) -> &mut (dyn Any + 'static)
upcast mut ref