Enum creusot_contracts::std::collections::hash_map::Entry
1.0.0 · source · pub enum Entry<'a, K, V>where
K: 'a,
V: 'a,{
Occupied(OccupiedEntry<'a, K, V>),
Vacant(VacantEntry<'a, K, V>),
}
Expand description
Variants§
Occupied(OccupiedEntry<'a, K, V>)
An occupied entry.
Vacant(VacantEntry<'a, K, V>)
A vacant entry.
Implementations§
source§impl<'a, K, V> Entry<'a, K, V>
impl<'a, K, V> Entry<'a, K, V>
1.0.0 · sourcepub fn or_insert(self, default: V) -> &'a mut V
pub fn or_insert(self, default: V) -> &'a mut V
Ensures a value is in the entry by inserting the default if empty, and returns a mutable reference to the value in the entry.
§Examples
use std::collections::HashMap;
let mut map: HashMap<&str, u32> = HashMap::new();
map.entry("poneyland").or_insert(3);
assert_eq!(map["poneyland"], 3);
*map.entry("poneyland").or_insert(10) *= 2;
assert_eq!(map["poneyland"], 6);
1.0.0 · sourcepub fn or_insert_with<F>(self, default: F) -> &'a mut Vwhere
F: FnOnce() -> V,
pub fn or_insert_with<F>(self, default: F) -> &'a mut Vwhere
F: FnOnce() -> V,
Ensures a value is in the entry by inserting the result of the default function if empty, and returns a mutable reference to the value in the entry.
§Examples
use std::collections::HashMap;
let mut map = HashMap::new();
let value = "hoho";
map.entry("poneyland").or_insert_with(|| value);
assert_eq!(map["poneyland"], "hoho");
1.50.0 · sourcepub fn or_insert_with_key<F>(self, default: F) -> &'a mut V
pub fn or_insert_with_key<F>(self, default: F) -> &'a mut V
Ensures a value is in the entry by inserting, if empty, the result of the default function.
This method allows for generating key-derived values for insertion by providing the default
function a reference to the key that was moved during the .entry(key)
method call.
The reference to the moved key is provided so that cloning or copying the key is
unnecessary, unlike with .or_insert_with(|| ... )
.
§Examples
use std::collections::HashMap;
let mut map: HashMap<&str, usize> = HashMap::new();
map.entry("poneyland").or_insert_with_key(|key| key.chars().count());
assert_eq!(map["poneyland"], 9);
1.10.0 · sourcepub fn key(&self) -> &K
pub fn key(&self) -> &K
Returns a reference to this entry’s key.
§Examples
use std::collections::HashMap;
let mut map: HashMap<&str, u32> = HashMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland");
1.26.0 · sourcepub fn and_modify<F>(self, f: F) -> Entry<'a, K, V>
pub fn and_modify<F>(self, f: F) -> Entry<'a, K, V>
Provides in-place mutable access to an occupied entry before any potential inserts into the map.
§Examples
use std::collections::HashMap;
let mut map: HashMap<&str, u32> = HashMap::new();
map.entry("poneyland")
.and_modify(|e| { *e += 1 })
.or_insert(42);
assert_eq!(map["poneyland"], 42);
map.entry("poneyland")
.and_modify(|e| { *e += 1 })
.or_insert(42);
assert_eq!(map["poneyland"], 43);
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, and returns an OccupiedEntry
.
§Examples
#![feature(entry_insert)]
use std::collections::HashMap;
let mut map: HashMap<&str, String> = HashMap::new();
let entry = map.entry("poneyland").insert_entry("hoho".to_string());
assert_eq!(entry.key(), &"poneyland");
source§impl<'a, K, V> Entry<'a, K, V>where
V: Default,
impl<'a, K, V> Entry<'a, K, V>where
V: Default,
1.28.0 · sourcepub fn or_default(self) -> &'a mut V
pub fn or_default(self) -> &'a mut V
Ensures a value is in the entry by inserting the default value if empty, and returns a mutable reference to the value in the entry.
§Examples
use std::collections::HashMap;
let mut map: HashMap<&str, Option<u32>> = HashMap::new();
map.entry("poneyland").or_default();
assert_eq!(map["poneyland"], None);
Trait Implementations§
Auto Trait Implementations§
impl<'a, K, V> !Freeze for Entry<'a, K, V>
impl<'a, K, V> !RefUnwindSafe for Entry<'a, K, V>
impl<'a, K, V> !Send for Entry<'a, K, V>
impl<'a, K, V> !Sync for Entry<'a, K, V>
impl<'a, K, V> !Unpin for Entry<'a, K, V>
impl<'a, K, V> !UnwindSafe for Entry<'a, K, V>
Blanket Implementations§
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
source§impl<T> MakeSized for Twhere
T: ?Sized,
impl<T> MakeSized for Twhere
T: ?Sized,
source§fn make_sized(&self) -> Box<T>
fn make_sized(&self) -> Box<T>
logic ⚠
ensures
*result == *self