Struct TtlCache 

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

A simple thread-safe TTL cache.

Entries are lazily evicted: expired entries are removed on the next get or cleanup call, not by a background timer.

Implementations

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

pub fn new(default_ttl: Duration, max_entries: usize) -> Self

Create a new TTL cache.

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

Insert a value with the default TTL.

pub fn insert_with_ttl(&self, key: K, value: V, ttl: Duration)

Insert a value with a custom TTL.

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

Get a value if it exists and hasn’t expired.

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

Remove a value.

pub fn cleanup(&self)

Remove all expired entries.

pub fn len(&self) -> usize

Number of entries (including potentially expired ones).

pub fn is_empty(&self) -> bool

Whether the cache is empty.