Struct TTLSizedCache 

pub struct TTLSizedCache<K, V>
where
    K: Hash + Eq + Clone,
    V: Clone,
{ /* private fields */ }

A sized cache with time-to-live (TTL) functionality

Internally backed by cached::LruTtlCache: entries are evicted once the configured size is exceeded (least-recently-used first), and any entry older than the configured TTL is treated as absent. An expired entry is physically removed from the store the next time it is looked up via Self::get.

Implementations

impl<K, V> TTLSizedCache<K, V>

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

pub fn new(size: usize, ttlseconds: u64) -> Self

Create a new TTL cache with specified size and TTL

size and ttlseconds are clamped to a minimum of 1: the underlying store requires both bounds to be non-zero, so this keeps construction infallible while staying as close as possible to the caller’s request.

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

Insert a key-value pair into the cache

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

Get a value from the cache if it exists and hasn’t expired

pub fn remove(&mut self, key: &K)

Remove a key-value pair from the cache

pub fn clear(&mut self)

Clear the cache

pub fn len(&self) -> usize

Get the number of items in the cache

pub fn is_empty(&self) -> bool

Check if the cache is empty