Struct InMemoryCache 

pub struct InMemoryCache<T> { /* private fields */ }

In-memory cache with LRU eviction and TTL expiration

Implementations

impl<T: Clone + Send + Sync + 'static> InMemoryCache<T>

pub fn new(config: DualCacheConfig) -> Self

Create a new in-memory cache with the given configuration

pub fn with_stats(config: DualCacheConfig, stats: Arc<AtomicCacheStats>) -> Self

Create a new in-memory cache with shared statistics

pub fn with_defaults() -> Self

Create with default configuration

pub fn start_cleanup_task(self: &Arc<Self>)

Start the background cleanup task

pub async fn get(&self, key: &CacheKey) -> Option<T>

Get a value from the cache

pub async fn peek(&self, key: &CacheKey) -> Option<T>

Peek a value without recording hit/miss statistics.

Used for under-lock Dual L1 rechecks after an accounting miss so a single client lookup is not double-counted. Still updates eviction access meta on a live hit and still removes expired entries.

pub async fn get_entry(&self, key: &CacheKey) -> Option<CacheEntry<T>>

Get an entry with metadata from the cache

pub async fn peek_entry(&self, key: &CacheKey) -> Option<CacheEntry<T>>

Peek an entry without recording hit/miss statistics (see Self::peek).

pub async fn set(&self, key: CacheKey, value: T)

Set a value in the cache with the default TTL

pub async fn set_with_ttl(&self, key: CacheKey, value: T, ttl: Duration)

Set a value in the cache with a specific TTL

pub async fn set_with_size( &self, key: CacheKey, value: T, ttl: Duration, size_bytes: usize, )

Set a value with size tracking

pub async fn delete(&self, key: &CacheKey) -> bool

Delete a value from the cache

pub async fn delete_if<F>(&self, key: &CacheKey, predicate: F) -> Option<T>

where F: Fn(&T) -> bool,

Atomically delete key only while the live (non-expired) value matches predicate.

Uses DashMap remove_if so a concurrent replacement under the same key is not removed after a stale match decision. Bookkeeping removal checks live state while holding the candidate-index lock, so a replacement inserted after remove_if keeps its eviction metadata and candidate slot.

Returns the removed value when a matching entry was deleted.

pub async fn exists(&self, key: &CacheKey) -> bool

Check if a key exists in the cache

pub fn ttl(&self, key: &CacheKey) -> Option<Duration>

Get the remaining TTL for a key

pub async fn clear(&self)

Clear all entries from the cache

pub fn len(&self) -> usize

Get the number of entries in the cache

pub fn is_empty(&self) -> bool

Check if the cache is empty

pub fn stats(&self) -> Arc<AtomicCacheStats>

Get cache statistics

pub fn keys(&self) -> Vec<CacheKey>

Get all keys in the cache

pub fn shutdown(&self)

Shutdown the cache and cleanup task

Trait Implementations

impl<T> Drop for InMemoryCache<T>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.