Struct Cache 

pub struct Cache<K, V, W = ItemCountWeighter, H = FastBuildHasher> { /* private fields */ }

A simple concurrent cache.

Implementations

impl<K, V, W, H> Cache<K, V, W, H>

where K: Eq + Hash + Clone, V: Clone, W: Weighter<K, V> + Clone, H: BuildHasher + Clone,

pub fn is_empty(&self) -> bool

Returns true if the cache is empty.

pub fn len(&self) -> usize

Returns the number of items currently in the cache.

pub fn weight(&self) -> u64

Returns the total weight of all items in the cache.

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

Inserts an item into the cache with the given key and value.

If an item with the same key already exists, it will be overwritten and the old value will be dropped. If the cache is full, one or more items will be evicted to make room for the new item, based on the configured item weighter and the weight of the new item.

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

Gets an item from the cache by its key.

If the item is found, it is cloned and Some(value) is returned. Otherwise, None is returned.

pub fn remove(&self, key: &K)

Removes an item from the cache by its key.

Trait Implementations

impl<K: Clone, V: Clone, W: Clone, H: Clone> Clone for Cache<K, V, W, H>

fn clone(&self) -> Cache<K, V, W, H>

Returns a duplicate of the value.

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

Performs copy-assignment from source.