Struct ShardedCache 

pub struct ShardedCache { /* private fields */ }

A concurrent cache backed by N power-of-two LRU shards.

Keys are routed to shards via hash(key) & (n_shards - 1). Each shard is independently protected by a Mutex<LruCache<Vec<u8>, Vec<u8>>>.

Panics

new panics if n_shards is not a power of two, or if n_shards is 0.

Implementations

impl ShardedCache

pub fn new(n_shards: usize, shard_cap: usize) -> Self

Create a new sharded cache.

• n_shards: number of shards — must be a power of two.
• shard_cap: capacity per shard (entry count).

Panics

Panics if n_shards == 0 or !n_shards.is_power_of_two().

pub fn n_shards(&self) -> usize

Return the number of shards.

pub fn shard_cap(&self) -> usize

Capacity per shard.

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

Look up key, returning a cloned copy of the value if present.

Returns None if the key is absent or expired.

pub fn put(&self, key: Vec<u8>, value: Vec<u8>)

Insert or update key -> value.

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

Remove key, returning its value if present.

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

Return true if key is present and not expired.

pub fn len(&self) -> usize

Return the total number of live entries across all shards.

pub fn is_empty(&self) -> bool

Return true if no entries are in any shard.

pub fn clear(&self)

Clear all shards.