Struct IdempotencyCache 

pub struct IdempotencyCache { /* private fields */ }

Request deduplication cache keyed on client-supplied idempotency keys.

When a client sends the same idempotency key twice, the second request receives the cached response without re-executing the operation. Entries expire after ttl and are lazily evicted.

Implementations

impl IdempotencyCache

pub fn new(max_entries: usize, ttl: Duration) -> Self

Create a new cache with the given capacity and TTL.

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

Look up a previously cached response by idempotency key.

Returns (status_code, body) if a fresh entry exists; None otherwise.

pub fn insert(&self, key: &str, status: u16, body: Vec<u8>)

Store a response under the given idempotency key.

If the cache is full, expired entries are evicted first. If still full after eviction, the insert is silently dropped to prevent unbounded memory growth.

pub fn evict_expired(&self)

Remove all expired entries from the cache.

pub fn len(&self) -> usize

Return the number of entries currently in the cache (including stale ones).

pub fn is_empty(&self) -> bool

Returns true if the cache contains no entries.