Struct TtlPolicy 

pub struct TtlPolicy<K, V> { /* private fields */ }

A simple time-to-live policy that removes only expired keys when the ttl is exceeded

Implementations

impl<K, V> TtlPolicy<K, V>

pub fn new(ttl: Duration) -> Self

Trait Implementations

impl<K, V> Policy<K, V> for TtlPolicy<K, V>

where K: Copy + Eq + Hash, V: Clone + Sync,

type Inner = TtlPolicyInner<K>

The inner type of this policy, likely behind a lock

fn lock_inner(&self) -> MutexGuard<'_, Self::Inner>

Panics

fn get<S: BuildHasher>( &self, key: &K, cache: &LightCache<K, V, S, Self>, ) -> Option<V>

fn insert<S: BuildHasher>( &self, key: K, value: V, cache: &LightCache<K, V, S, Self>, ) -> Option<V>

fn remove<S: BuildHasher>( &self, key: &K, cache: &LightCache<K, V, S, Self>, ) -> Option<V>

fn lock_and_prune<S: BuildHasher>( &self, cache: &LightCache<K, V, S, Self>, ) -> MutexGuard<'_, Self::Inner>

impl<K, V> Prune<K, V, TtlPolicy<K, V>> for TtlPolicyInner<K>

where K: Copy + Eq + Hash, V: Clone + Sync,

fn prune<S: BuildHasher>( &mut self, cache: &LightCache<K, V, S, TtlPolicy<K, V>>, )

Prune is typically be called before any operation on the cache