Struct SyncCache 

pub struct SyncCache<K, V, C: Cache<K, V>> { /* private fields */ }

A thread-safe wrapper around any Cache implementation.

Wraps C (which implements Cache<K, V>) in a Mutex, providing Send + Sync access from multiple threads. All methods acquire the mutex for their duration.

Panics

Every method panics if the inner mutex is poisoned, which happens when another thread panicked while holding the lock.

Implementations

impl<K, V, C: Cache<K, V>> SyncCache<K, V, C>

pub fn new(cache: C) -> Self

Wrap cache in a SyncCache.

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

where V: Clone,

Look up key, cloning and returning the value if present.

This acquires the lock, calls Cache::get (which may update recency), and clones the result so the lock can be released.

pub fn put(&self, key: K, value: V) -> Option<V>

Insert or update key -> value.

Returns the evicted value (if any) per the underlying cache policy.

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

Remove the entry for key, returning its value if present.

pub fn len(&self) -> usize

Return the number of live entries in the cache.

pub fn is_empty(&self) -> bool

Return true if the cache holds no entries.

pub fn clear(&self)

Remove all entries from the cache.