Struct InMemoryCache 

pub struct InMemoryCache { /* private fields */ }

In-memory LRU cache (OSS local impl, #128).

Capacity-bounded with least-recently-used eviction: get and set refresh recency; once the entry count exceeds the capacity the least-recently-used entry is evicted. The capacity is a constructor parameter (InMemoryCache::with_capacity, DEFAULT_CACHE_CAPACITY by default, clamped to at least 1) — it bounds ENTRY COUNT, not bytes (values are opaque to the store); a byte- or TTL-bounded backend can slot in behind the same trait later.

Implementations

impl InMemoryCache

pub fn new() -> Self

Cache with the default capacity (DEFAULT_CACHE_CAPACITY entries).

pub fn with_capacity(capacity: usize) -> Self

Cache bounded to capacity entries (values below 1 are clamped to 1, so the store is always minimally usable).

Trait Implementations

impl CacheStore for InMemoryCache

fn get<'life0, 'life1, 'async_trait>( &'life0 self, key: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<Option<Vec<u8>>, ExtensionsError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Fetch the value for key, if present.

fn set<'life0, 'async_trait>( &'life0 self, key: String, value: Vec<u8>, ) -> Pin<Box<dyn Future<Output = Result<(), ExtensionsError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Store value under key, overwriting any previous value.

fn delete<'life0, 'life1, 'async_trait>( &'life0 self, key: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<bool, ExtensionsError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Remove key; returns whether a value existed.

fn set_with_ttl<'life0, 'async_trait>( &'life0 self, key: String, value: Vec<u8>, ttl: Duration, ) -> Pin<Box<dyn Future<Output = Result<(), ExtensionsError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Store value under key with a per-entry lifetime hint (DW-037). Backends that cannot honor a per-entry TTL implement the default (store without the hint); every reader re-checks expiry from the value itself, so correctness never depends on this. Defaulted, not abstract: existing implementations stay valid backends without a change (extend, do not break).

fn entry_count(&self) -> Option<u64>

Approximate number of live entries, when the backend can report it cheaply (DW-037 metrics gauge; None = not reportable). An estimate is acceptable — the consumer renders it as a gauge.

impl Debug for InMemoryCache

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for InMemoryCache

fn default() -> Self

Returns the “default value” for a type.