Struct DedupCache 

pub struct DedupCache { /* private fields */ }

Request deduplication cache.

Stores responses keyed by RequestKey. When the cache is full, the oldest entry (by insertion order, tracked via a monotonic sequence counter) is evicted to make room for the new one.

Thread safety

DedupCache is not Sync by design; wrap it in a Mutex or RwLock when sharing across threads.

Implementations

impl DedupCache

pub fn new(capacity: usize, default_ttl: Duration) -> Self

Create a new cache with the given capacity and default_ttl.

pub fn with_capacity(n: usize) -> Self

Shorthand constructor with a 60-second default TTL.

pub fn get(&mut self, key: &RequestKey) -> Option<&str>

Look up a cached response.

Returns None if the key is not present or if the cached entry has expired. On a valid hit the hit_count of the entry is incremented and the response string slice is returned.

pub fn insert(&mut self, key: RequestKey, response: String)

Insert a response with the DedupCache::default_ttl.

If the cache is at capacity, the entry with the smallest insertion sequence number (i.e. the oldest entry) is evicted first.

pub fn insert_with_ttl( &mut self, key: RequestKey, response: String, ttl: Duration, )

Insert a response with a custom ttl.

Evicts the oldest entry when the cache is at capacity before inserting.

pub fn evict_expired(&mut self) -> usize

Remove all expired entries.

Returns the number of entries removed.

pub fn len(&self) -> usize

Number of entries currently in the cache.

pub fn is_empty(&self) -> bool

Returns true if the cache contains no entries.

pub fn stats(&self) -> &DedupStats

Reference to the current statistics snapshot.

pub fn clear(&mut self)

Remove all entries and reset statistics.