pub struct TtlCache<K: Eq + Hash, V: Clone> { /* private fields */ }
Expand description
A TTL cache where items get removed deterministically in the get()
call.
Implementations§
Source§impl<K, V> TtlCache<K, V>
impl<K, V> TtlCache<K, V>
Sourcepub fn contains<Q>(&self, key: &Q) -> bool
pub fn contains<Q>(&self, key: &Q) -> bool
Does the cache contain an non-expired item with the matching key.
Sourcepub fn extend(&mut self, iterator: impl IntoIterator<Item = (K, V)>)
pub fn extend(&mut self, iterator: impl IntoIterator<Item = (K, V)>)
Extend the cache with the given iterator of items.
Trait Implementations§
Auto Trait Implementations§
impl<K, V> Freeze for TtlCache<K, V>
impl<K, V> RefUnwindSafe for TtlCache<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for TtlCache<K, V>
impl<K, V> Sync for TtlCache<K, V>
impl<K, V> Unpin for TtlCache<K, V>
impl<K, V> UnwindSafe for TtlCache<K, V>where
K: UnwindSafe,
V: UnwindSafe,
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