[−][src]Struct cache_2q::VacantEntry
Implementations
impl<'a, K: 'a + Eq + Hash, V: 'a, S: 'a + BuildHasher> VacantEntry<'a, K, V, S>
[src]
pub fn key(&self) -> &K
[src]
Gets a reference to the key that would be used when inserting a value
through the VacantEntry
.
Examples
use cache_2q::{Cache, Entry}; let mut cache: Cache<&str, u32> = Cache::new(8); if let Entry::Vacant(v) = cache.entry("poneyland") { assert_eq!(v.key(), &"poneyland"); } else { panic!("Entry should be vacant"); }
pub fn into_key(self) -> K
[src]
Take ownership of the key.
Examples
use cache_2q::{Cache, Entry}; let mut cache: Cache<String, u32> = Cache::new(8); if let Entry::Vacant(v) = cache.entry("poneyland".into()) { assert_eq!(v.into_key(), "poneyland".to_string()); } else { panic!("Entry should be vacant"); }
pub fn is_remembered(&self) -> bool
[src]
If this vacant entry is remembered
Keys are remembered after they are evicted from the cache. If this entry is remembered,
if inserted, it will be insert to a frequent
list, instead of the usual recent
list
Examples
use cache_2q::{Cache, Entry}; let mut cache: Cache<&str, u32> = Cache::new(1); if let Entry::Vacant(v) = cache.entry("poneyland") { assert!(!v.is_remembered()); } else { panic!("Entry should be vacant"); } cache.insert("poneyland", 0); cache.insert("other", 1); // Force poneyland out of the cache if let Entry::Vacant(v) = cache.entry("poneyland") { assert!(v.is_remembered()); v.insert(0); } else { panic!("Entry should be vacant"); }
impl<'a, K: 'a + Eq + Hash, V: 'a, S: 'a + BuildHasher> VacantEntry<'a, K, V, S>
[src]
pub fn insert(self, value: V) -> &'a mut V
[src]
Sets the value of the entry with the VacantEntry's key, and returns a mutable reference to it.
Examples
use cache_2q::{Cache, Entry}; let mut cache: Cache<&str, u32> = Cache::new(8); if let Entry::Vacant(o) = cache.entry("poneyland") { o.insert(37); } else { panic!("Entry should be vacant"); } assert_eq!(*cache.get("poneyland").unwrap(), 37);
Trait Implementations
impl<'a, K: 'a + Debug + Eq + Hash, V: 'a + Debug, S: 'a + BuildHasher> Debug for VacantEntry<'a, K, V, S>
[src]
Auto Trait Implementations
impl<'a, K, V, S> RefUnwindSafe for VacantEntry<'a, K, V, S> where
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
K: RefUnwindSafe,
S: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, K, V, S> Send for VacantEntry<'a, K, V, S> where
K: Send,
S: Send,
V: Send,
K: Send,
S: Send,
V: Send,
impl<'a, K, V, S> Sync for VacantEntry<'a, K, V, S> where
K: Sync,
S: Sync,
V: Sync,
K: Sync,
S: Sync,
V: Sync,
impl<'a, K, V, S> Unpin for VacantEntry<'a, K, V, S> where
K: Unpin,
K: Unpin,
impl<'a, K, V, S = RandomState> !UnwindSafe for VacantEntry<'a, K, V, S>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,