Struct L1Cache 

pub struct L1Cache { /* private fields */ }

Exact-match cache: a capacity-bounded LRU with per-entry TTL. A single mutex suffices because the critical section is a hash lookup plus a clone.

Implementations

impl L1Cache

pub fn new(capacity: usize, ttl: Duration) -> Arc<Self>

pub fn lookup(&self, req: &ChatRequest, tenant: &str) -> Option<ChatResponse>

Look up an exact-match entry.

Every call is counted exactly once, as a hit or a miss, so hits + misses == lookups always holds. Callers must not count misses themselves.

pub fn insert(&self, req: &ChatRequest, tenant: &str, resp: &ChatResponse)

pub fn stats(&self) -> CacheStats