Struct LocalCache 

pub struct LocalCache { /* private fields */ }

Local in-memory cache with per-entry TTL support.

Uses Moka’s sync cache with a custom expiry policy to support per-operation TTL values, ensuring behavioral consistency with RedisCache.

Performance

This implementation is optimized for hot-path usage:

• Uses Bytes for keys and values (reference-counted, cheap clones)
• Supports borrowed lookups via the equivalent trait for contains_sync
• Minimizes allocations on repeated operations with the same key

Example

use std::time::Duration;
use mx_cache::{LocalCache, Cache};

let cache = LocalCache::new(10_000, Duration::from_secs(300));

// Each operation can specify its own TTL
cache.set(b"short_lived", b"value1", Duration::from_secs(10)).await.unwrap();
cache.set(b"long_lived", b"value2", Duration::from_secs(3600)).await.unwrap();

Implementations

impl LocalCache

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

Creates a new local cache with the specified capacity and default TTL.

Arguments

• capacity - Maximum number of entries in the cache
• default_ttl - Default TTL used as an upper bound for entries. Individual operations can specify shorter TTLs, but entries will never live longer than this default.

Note

The default_ttl parameter sets a maximum lifetime for entries. Per-operation TTLs (passed to set() and set_nx_px()) take precedence and are fully respected, as long as they don’t exceed this default.

pub fn contains_sync(&self, key: &[u8]) -> bool

Synchronous check for local cache presence - fast path for deduplication.

Returns true if the key exists in the cache and has not expired.

Performance

This is a synchronous operation optimized for hot-path deduplication checks. Uses borrowed key lookup via the equivalent trait to avoid allocating a new Bytes on every call.

pub fn get_sync(&self, key: &[u8]) -> Option<Bytes>

Synchronous get for local cache - fast path for hot data.

Returns the value if the key exists and has not expired.

Performance

This is a synchronous operation that returns a Bytes reference to avoid copying the value data.

Trait Implementations

impl Cache for LocalCache

fn set_nx_px( &self, key: &[u8], value: &[u8], ttl: Duration, ) -> impl Future<Output = Result<bool>> + Send

Sets a value only if the key does not exist (NX = Not eXists).

Arguments

• key - The cache key
• value - The value to store
• ttl - Time-to-live for this entry

Returns

• Ok(true) - The key was newly inserted
• Ok(false) - The key already existed, no change made

fn set( &self, key: &[u8], value: &[u8], ttl: Duration, ) -> impl Future<Output = Result<()>> + Send

Sets a value with the specified TTL.

Arguments

• key - The cache key
• value - The value to store
• ttl - Time-to-live for this entry

fn get( &self, key: &[u8], ) -> impl Future<Output = Result<Option<Vec<u8>>>> + Send

Gets a value from the cache.

Returns

• Ok(Some(value)) - The value exists and has not expired
• Ok(None) - The key does not exist or has expired

fn del(&self, key: &[u8]) -> impl Future<Output = Result<()>> + Send

Deletes a key from the cache.

impl Clone for LocalCache

fn clone(&self) -> LocalCache

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LocalCache

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

Formats the value using the given formatter.