Struct freqache::LFUCache

pub struct LFUCache<K> { /* fields omitted */ }

A weighted, thread-safe least-frequently-used cache

Implementations

impl<K: Clone + Eq + Hash> LFUCache<K>

pub fn new() -> Self

Construct a new LFUCache.

pub fn contains_key<Q: ?Sized>(&self, key: &Q) -> bool where
    K: Borrow<Q>,
    Q: Hash + Eq, 

Return true if the cache contains the given key.

pub fn insert(&self, key: K) -> bool

Add a new key to the cache and return true is it was already present, otherwise false.

If already present, the key’s priority is increased by one.

pub fn is_empty(&self) -> bool

Return true if the cache is empty.

pub fn len(&self) -> usize

Return the number of entries in this cache.

pub fn remove(&self, key: &K) -> bool

Remove an entry from the cache and return true if it was present or false if not.

pub fn iter(&self) -> Iter<'_, K>

Iterate over the keys in the cache, beginning with the least-frequently used.

Calling insert or remove while iterating will result in a deadlock.