pub enum Entry<'a, K: 'a + Eq + Hash, V: 'a, S: 'a + BuildHasher = RandomState> {
Occupied(OccupiedEntry<'a, K, V, S>),
Vacant(VacantEntry<'a, K, V, S>),
}Expand description
A view into a single entry in a cache, which may either be vacant or occupied.
This enum is constructed from the entry method on Cache.
Variants§
Occupied(OccupiedEntry<'a, K, V, S>)
An occupied entry
Vacant(VacantEntry<'a, K, V, S>)
An vacant entry
Implementations§
Source§impl<'a, K: 'a + Eq + Hash, V: 'a, S: 'a + BuildHasher> Entry<'a, K, V, S>
impl<'a, K: 'a + Eq + Hash, V: 'a, S: 'a + BuildHasher> Entry<'a, K, V, S>
Sourcepub fn key(&self) -> &K
pub fn key(&self) -> &K
Returns a reference to this entry’s key.
§Examples
use cache_2q::Cache;
let mut cache: Cache<&str, u32> = Cache::new(8);
assert_eq!(cache.entry("poneyland").key(), &"poneyland");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 cache_2q::Cache;
let mut cache = Cache::new(8);
{
let value = cache.entry(0xFF00).or_insert(0);
assert_eq!(*value, 0);
}
*cache.entry(0xFF00).or_insert(100) += 1;
assert_eq!(*cache.get(&0xFF00).unwrap(), 1);Sourcepub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut V
pub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut 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 cache_2q::Cache;
let mut cache: Cache<&'static str, String> = Cache::new(8);
cache.entry("key").or_insert_with(|| "value".to_string());
assert_eq!(cache.get(&"key").unwrap(), &"value".to_string());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 cache_2q::Cache;
let mut cache = Cache::new(1);
cache.entry("poneyland")
.and_modify(|e| { *e += 1 })
.or_insert(42);
assert_eq!(*cache.get("poneyland").unwrap(), 42);
cache.entry("poneyland")
.and_modify(|e| { *e += 1 })
.or_insert(42);
assert_eq!(*cache.get("poneyland").unwrap(), 43);Source§impl<'a, K: 'a + Eq + Hash, V: 'a + Default, S: 'a + BuildHasher> Entry<'a, K, V, S>
impl<'a, K: 'a + Eq + Hash, V: 'a + Default, S: 'a + BuildHasher> Entry<'a, K, V, S>
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 cache_2q::Cache;
let mut cache = Cache::new(1);
assert_eq!(*cache.entry(1).or_default(), 0u8);
assert_eq!(cache.get(&1), Some(&mut 0))Trait Implementations§
Auto Trait Implementations§
impl<'a, K, V, S> Freeze for Entry<'a, K, V, S>where
K: Freeze,
impl<'a, K, V, S> RefUnwindSafe for Entry<'a, K, V, S>
impl<'a, K, V, S = RandomState> !Send for Entry<'a, K, V, S>
impl<'a, K, V, S = RandomState> !Sync for Entry<'a, K, V, S>
impl<'a, K, V, S> Unpin for Entry<'a, K, V, S>where
K: Unpin,
impl<'a, K, V, S> UnsafeUnpin for Entry<'a, K, V, S>where
K: UnsafeUnpin,
impl<'a, K, V, S = RandomState> !UnwindSafe for Entry<'a, K, V, S>
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
Mutably borrows from an owned value. Read more