Struct TtlCache 

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

A concurrent cache with per-entry TTL eviction.

Entries are automatically considered expired after their TTL elapses. Expired entries are lazily evicted on access.

Implementations

impl<K: Eq + Hash + Clone, V: Clone> TtlCache<K, V>

pub fn new(ttl: Duration) -> Self

Create a new cache with the given TTL for all entries.

pub fn get(&self, key: &K) -> Option<V>

Get a value if it exists and has not expired.

pub fn insert(&self, key: K, value: V)

Insert a value with the configured TTL.

pub fn remove(&self, key: &K) -> Option<V>

Remove an entry.

pub fn take_fresh(&self, key: &K) -> Option<V>

Remove an entry only if it has not expired, returning its value.

Unlike TtlCache::remove (which returns the value even when expired), this is the single-use-consume primitive: an expired entry is dropped and reported as absent — exactly the semantics a CSRF state store or one-time token cache needs.

pub fn cleanup(&self)

Remove all expired entries.

pub fn len(&self) -> usize

Return the number of entries (including expired ones).

pub fn is_empty(&self) -> bool

Return true if the cache is empty.

Trait Implementations

impl<K: Eq + Hash + Clone, V: Clone> Default for TtlCache<K, V>

fn default() -> Self

Returns the “default value” for a type.