pub enum Entry<'a, K: 'a, V: 'a, A: Allocator = Global> {
Vacant(VacantEntry<'a, K, V, A>),
Occupied(OccupiedEntry<'a, K, V, A>),
}
Expand description
Variants§
Vacant(VacantEntry<'a, K, V, A>)
A vacant entry.
Occupied(OccupiedEntry<'a, K, V, A>)
An occupied entry.
Implementations§
Source§impl<'a, K: Ord, V, A: Allocator> Entry<'a, K, V, A>
impl<'a, K: Ord, V, A: Allocator> Entry<'a, K, V, A>
Sourcepub fn or_try_insert(self, default: V) -> Result<&'a mut V, AllocError>
pub fn or_try_insert(self, default: V) -> Result<&'a mut V, AllocError>
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 rune::alloc::BTreeMap;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
map.entry("poneyland").or_try_insert(12)?;
assert_eq!(map["poneyland"], 12);
Sourcepub fn or_try_insert_with<F: FnOnce() -> V>(
self,
default: F,
) -> Result<&'a mut V, AllocError>
pub fn or_try_insert_with<F: FnOnce() -> V>( self, default: F, ) -> Result<&'a mut V, AllocError>
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 rune::alloc::BTreeMap;
let mut map: BTreeMap<&str, String> = BTreeMap::new();
let s = "hoho".to_string();
map.entry("poneyland").or_try_insert_with(|| s)?;
assert_eq!(map["poneyland"], "hoho".to_string());
Sourcepub fn or_try_insert_with_key<F: FnOnce(&K) -> V>(
self,
default: F,
) -> Result<&'a mut V, AllocError>
pub fn or_try_insert_with_key<F: FnOnce(&K) -> V>( self, default: F, ) -> Result<&'a mut V, AllocError>
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 rune::alloc::BTreeMap;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
map.entry("poneyland").or_try_insert_with_key(|key| key.chars().count())?;
assert_eq!(map["poneyland"], 9);
Sourcepub fn key(&self) -> &K
pub fn key(&self) -> &K
Returns a reference to this entry’s key.
§Examples
use rune::alloc::BTreeMap;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland");
Sourcepub fn and_modify<F>(self, f: F) -> Self
pub fn and_modify<F>(self, f: F) -> Self
Provides in-place mutable access to an occupied entry before any potential inserts into the map.
§Examples
use rune::alloc::BTreeMap;
let mut map: BTreeMap<&str, usize> = BTreeMap::new();
map.entry("poneyland")
.and_modify(|e| { *e += 1 })
.or_try_insert(42)?;
assert_eq!(map["poneyland"], 42);
map.entry("poneyland")
.and_modify(|e| { *e += 1 })
.or_try_insert(42)?;
assert_eq!(map["poneyland"], 43);
Source§impl<'a, K: Ord, V: Default, A: Allocator> Entry<'a, K, V, A>
impl<'a, K: Ord, V: Default, A: Allocator> Entry<'a, K, V, A>
Sourcepub fn or_try_default(self) -> Result<&'a mut V, AllocError>
pub fn or_try_default(self) -> Result<&'a mut V, AllocError>
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 rune::alloc::BTreeMap;
let mut map: BTreeMap<&str, Option<usize>> = BTreeMap::new();
map.entry("poneyland").or_try_default()?;
assert_eq!(map["poneyland"], None);