Struct ClawCache 

pub struct ClawCache<K, V> { /* private fields */ }

A minimal LRU cache with a fixed maximum capacity.

When the cache is full and a new entry is inserted, the least-recently-used entry is evicted. All operations are O(1) amortised.

Type Parameters

• K — cache key type; must implement Eq + Hash + Clone.
• V — cached value type.

Implementations

impl<K, V> ClawCache<K, V>

where K: Eq + Hash + Clone,

pub fn new(capacity: usize) -> ClawResult<Self>

Create a new cache with the given maximum capacity (number of entries).

Errors

Returns ClawError::Cache if capacity is zero.

pub fn insert(&mut self, key: K, value: V)

Insert value under key. If the cache is full, the LRU entry is evicted first.

pub fn get(&mut self, key: &K) -> Option<&V>

Return a reference to the cached value for key, or None if not present. Accessing an entry marks it as most-recently used.

pub fn remove(&mut self, key: &K) -> Option<V>

Remove and return the value for key, if present.

pub fn invalidate(&mut self, key: &K)

Invalidate (remove) the value for key, if present.

pub fn clear(&mut self)

Remove all entries from the cache.

pub fn len(&self) -> usize

Return the number of entries currently in the cache.

pub fn is_empty(&self) -> bool

Return true if the cache contains no entries.

Trait Implementations

impl<K: Debug, V: Debug> Debug for ClawCache<K, V>

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

Formats the value using the given formatter.