Struct L1Cache 

pub struct L1Cache { /* private fields */ }

In-process LRU cache with per-entry TTL, backed by moka.

Used as the L1 layer in the dual-layer cache architecture. Clone is cheap and shares the underlying store (moka is internally referenced).

Implementations

impl L1Cache

pub fn new(capacity: usize) -> Self

Create a new L1 cache with the given maximum entry capacity.

pub fn get(&self, key: &str) -> Option<Vec<u8>>

Retrieve cached bytes by key, or None if absent or expired.

pub fn get_with_swr(&self, key: &str, threshold_ratio: f64) -> L1SwrRead

Retrieve cached bytes with stale-while-revalidate classification.

An entry is fresh until it has lived threshold_ratio of its own TTL (±10% jitter, drawn once when the entry is inserted so a hot read never touches the entropy source), stale from then until hard expiry, and a miss after that. The freshness window derives from the TTL the entry was inserted with: a direct write carries the caller’s full TTL, an L2 backfill carries the capped backfill TTL — see CacheKit’s L1 documentation.

Semantics mirror cachekit-py’s swr_threshold_ratio (elapsed lifetime > ratio × TTL ⇒ stale). Hard expiry is enforced by moka: an expired entry is never returned, so SWR can never serve past it.

This is a pure read — it does not track refresh state. Callers own refresh scheduling and deduplication (the #[cachekit] macro uses CacheKit::single_flight).

pub fn set(&self, key: &str, value: &[u8], ttl: Duration)

Insert or overwrite an entry with the given TTL.

pub fn delete(&self, key: &str)

Remove an entry by key.

pub fn run_pending_tasks(&self)

Drive moka’s internal eviction machinery. Useful in tests to force pending invalidations and expiry checks to complete synchronously.

Trait Implementations

impl Clone for L1Cache

fn clone(&self) -> L1Cache

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.