pub enum FastSecureHashMapEntry<'a, K, V, S> {
Occupied(OccupiedEntry<'a, K, V, S>),
Vacant(VacantEntry<'a, K, V, S>),
}
Expand description
Variants
Occupied(OccupiedEntry<'a, K, V, S>)
An occupied entry.
Vacant(VacantEntry<'a, K, V, S>)
A vacant entry.
Implementations
sourceimpl<'a, K, V, S> Entry<'a, K, V, S>
impl<'a, K, V, S> Entry<'a, K, V, S>
Hash map entry.
sourcepub fn insert(self, value: V) -> OccupiedEntry<'a, K, V, S> where
K: Hash,
S: BuildHasher,
pub fn insert(self, value: V) -> OccupiedEntry<'a, K, V, S> where
K: Hash,
S: BuildHasher,
Sets the value of the entry, and returns an OccupiedEntry.
Examples
use hashbrown::HashMap;
let mut map: HashMap<&str, u32> = HashMap::new();
let entry = map.entry("horseyland").insert(37);
assert_eq!(entry.key(), &"horseyland");
sourcepub fn or_insert(self, default: V) -> &'a mut V where
K: Hash,
S: BuildHasher,
pub fn or_insert(self, default: V) -> &'a mut V where
K: Hash,
S: BuildHasher,
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 hashbrown::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);
sourcepub fn or_insert_with<F>(self, default: F) -> &'a mut V where
F: FnOnce() -> V,
K: Hash,
S: BuildHasher,
pub fn or_insert_with<F>(self, default: F) -> &'a mut V where
F: FnOnce() -> V,
K: Hash,
S: BuildHasher,
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 hashbrown::HashMap;
let mut map: HashMap<&str, String> = HashMap::new();
let s = "hoho".to_string();
map.entry("poneyland").or_insert_with(|| s);
assert_eq!(map["poneyland"], "hoho".to_string());
sourcepub fn or_insert_with_key<F>(self, default: F) -> &'a mut V where
F: FnOnce(&K) -> V,
K: Hash,
S: BuildHasher,
pub fn or_insert_with_key<F>(self, default: F) -> &'a mut V where
F: FnOnce(&K) -> V,
K: Hash,
S: BuildHasher,
Ensures a value is in the entry by inserting, if empty, the result of the default function, which takes the key as its argument, and returns a mutable reference to the value in the entry.
Examples
use hashbrown::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);
sourcepub fn key(&self) -> &K
pub fn key(&self) -> &K
Returns a reference to this entry’s key.
Examples
use hashbrown::HashMap;
let mut map: HashMap<&str, u32> = HashMap::new();
assert_eq!(map.entry("poneyland").key(), &"poneyland");
sourcepub fn and_modify<F>(self, f: F) -> Entry<'a, K, V, S> where
F: FnOnce(&mut V),
pub fn and_modify<F>(self, f: F) -> Entry<'a, K, V, S> where
F: FnOnce(&mut V),
Provides in-place mutable access to an occupied entry before any potential inserts into the map.
Examples
use hashbrown::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 and_replace_entry_with<F>(self, f: F) -> Entry<'a, K, V, S> where
F: FnOnce(&K, V) -> Option<V>,
pub fn and_replace_entry_with<F>(self, f: F) -> Entry<'a, K, V, S> where
F: FnOnce(&K, V) -> Option<V>,
Provides shared access to the key and owned access to the value of an occupied entry and allows to replace or remove it based on the value of the returned option.
Examples
use hashbrown::HashMap;
use hashbrown::hash_map::Entry;
let mut map: HashMap<&str, u32> = HashMap::new();
let entry = map
.entry("poneyland")
.and_replace_entry_with(|_k, _v| panic!());
match entry {
Entry::Vacant(e) => {
assert_eq!(e.key(), &"poneyland");
}
Entry::Occupied(_) => panic!(),
}
map.insert("poneyland", 42);
let entry = map
.entry("poneyland")
.and_replace_entry_with(|k, v| {
assert_eq!(k, &"poneyland");
assert_eq!(v, 42);
Some(v + 1)
});
match entry {
Entry::Occupied(e) => {
assert_eq!(e.key(), &"poneyland");
assert_eq!(e.get(), &43);
}
Entry::Vacant(_) => panic!(),
}
assert_eq!(map["poneyland"], 43);
let entry = map
.entry("poneyland")
.and_replace_entry_with(|_k, _v| None);
match entry {
Entry::Vacant(e) => assert_eq!(e.key(), &"poneyland"),
Entry::Occupied(_) => panic!(),
}
assert!(!map.contains_key("poneyland"));
sourceimpl<'a, K, V, S> Entry<'a, K, V, S> where
V: Default,
impl<'a, K, V, S> Entry<'a, K, V, S> where
V: Default,
Hash map entry.
sourcepub fn or_default(self) -> &'a mut V where
K: Hash,
S: BuildHasher,
pub fn or_default(self) -> &'a mut V where
K: Hash,
S: BuildHasher,
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 hashbrown::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, S> RefUnwindSafe for Entry<'a, K, V, S> where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, K, V, S> Send for Entry<'a, K, V, S> where
K: Send,
S: Send,
V: Send,
impl<'a, K, V, S> Sync for Entry<'a, K, V, S> where
K: Sync,
S: Sync,
V: Sync,
impl<'a, K, V, S> Unpin for Entry<'a, K, V, S> where
K: Unpin,
impl<'a, K, V, S> !UnwindSafe for Entry<'a, K, V, S>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more