Struct TtlCache 

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

A simple TTL-based cache using a step counter as a clock.

Each entry has a ttl expressed in “steps”. The cache is checked on every get; stale entries are lazily removed.

Implementations

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

pub fn new(default_ttl: u64) -> Self

Create a new TTL cache.

pub fn tick(&mut self)

Advance the clock by one step.

pub fn tick_n(&mut self, n: u64)

Advance the clock by n steps.

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

Insert an entry with the default TTL.

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

Insert an entry with a custom TTL.

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

Get an entry if it hasn’t expired.

pub fn purge_expired(&mut self)

Remove expired entries.

pub fn len(&self) -> usize

Number of entries (including possibly stale).

pub fn is_empty(&self) -> bool

Whether the cache is empty.

pub fn current_step(&self) -> u64

Current step counter.

pub fn clear(&mut self)

Clear all entries.