Struct freqache::LFUCache

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

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

Implementations

impl<K: Clone + Eq + Hash, V: Entry, F: Fn()> LFUCache<K, V, F>

pub fn new(capacity: u64, policy: F) -> Self

Construct a new LFUCache.

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

Return true if the cache contains the given key.

pub async fn get<Q: ?Sized>(&mut self, key: &Q) -> Option<V> where
    K: Borrow<Q>,
    Q: Hash + Eq, 

Clone and return the value of the cache entry with the given key.

pub async fn insert(&mut self, key: K, value: V) -> bool

Add a new entry to the cache.

pub fn is_full(&self) -> bool

Return true if the cache is full.

pub fn len(&self) -> usize

Return the number of entries in this cache.

pub async fn remove<Q>(&mut self, key: &Q) -> bool where
    K: Borrow<Q>,
    Q: Hash + Eq, 

Remove an entry from the cache, and return true if it was present.

pub async fn traverse<C: FnMut(&V) + Send>(&self, f: C)

Traverse the cache values beginning with the least-frequent.

pub async fn evict<E, Fut: Future<Output = Result<bool, E>>, C: Fn(&K, &V) -> Fut + Send>(
    &mut self,
    f: C
) -> Result<(), E>

Traverse the cache values beginning with the least-frequent, and evict the values from the cache when the given callback returns Ok(true), until is_full returns false.