Struct MemoCache 

pub struct MemoCache<V: Clone> { /* private fields */ }

A memoization cache for inference results keyed by MemoKey.

Eviction

When insert is called and the cache has reached config.max_entries, one entry is evicted according to config.eviction:

• Lru — the entry with the oldest last_accessed timestamp.
• Fifo — the entry at the front of the insertion-order deque.
• Ttl — any expired entry first; if none, the front of the insertion deque (i.e., FIFO fall-back).

TTL on access

If config.ttl is Some(d), entries are checked on every get call. An entry whose inserted_at is older than d will be removed and MemoLookupResult::Expired returned instead of Hit.

Implementations

impl<V: Clone + Debug> MemoCache<V>

pub fn new(config: MemoConfig) -> Self

Create a new cache with the given configuration.

pub fn with_default() -> Self

Create a cache with MemoConfig::default().

pub fn with_max_entries(max: usize) -> Self

Create a cache with LRU eviction and a custom capacity.

pub fn get(&mut self, key: &MemoKey) -> MemoLookupResult<V>

Look up key in the cache.

Returns:

• Hit(v) — the key was present, fresh, and v is a clone of the value.
• Miss — the key was not found.
• Expired— the key was found but had exceeded its TTL; it has been removed from the cache.

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

Insert value under key.

If the cache is already at capacity, one entry is evicted first according to config.eviction.

pub fn invalidate(&mut self, key: &MemoKey) -> bool

Remove the entry for key, returning true if it was present.

pub fn clear(&mut self)

Remove all entries and reset the entry count in stats.

pub fn stats(&self) -> &MemoStats

Snapshot of the current statistics.

pub fn len(&self) -> usize

Number of entries currently stored.

pub fn is_empty(&self) -> bool

Whether the cache is empty.