Struct il2_utils::cache::SimpleCache

pub struct SimpleCache<K: Eq + Hash + Copy + Send + Sync, V: Send + Sync> { /* fields omitted */ }

This struct implements a simple value cache that holds up to a certain number of entries at a time.

When it reaches its maximum capacity it will drop the oldest unused entries.

All methods of this struct are thread-safe.

Implementations

impl<K: Eq + Hash + Copy + Send + Sync, V: Send + Sync> SimpleCache<K, V>

pub fn new(max_size: usize) -> Self

Creates a new SimpleCache with a given capacity.

Arguments:

• max_size: Maximum number of items in the cache;

Trait Implementations

impl<K: Eq + Hash + Copy + Send + Sync, V: Send + Sync> ValueCache<K, V> for SimpleCache<K, V>

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

Gets the value from the cache if it exists.

fn insert(&self, key: K, value: &Arc<V>)

Inserts the value into the cache. Reinserting a new value with the same key will replace the existing value.

fn clear(&self)

Removes all entries from the cache.

fn len(&self) -> usize

Returns the number of entries in the cache.

fn is_empty(&self) -> bool

Returns true if the cache is empty or false otherwise.