Struct LFUCache

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

A hash set whose keys are ordered by frequency of access

Implementations

impl<K: Eq + Hash, V> LFUCache<K, V>

pub fn new() -> Self

Construct a new LFUCache.

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

Return true if the cache contains the given key.

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

Increase the given key’s priority and return true if present, otherwise false.

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

Add a new value to the cache, and return the old value at key, if any.

pub fn is_empty(&self) -> bool

Return true if the cache is empty.

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

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

pub fn len(&self) -> usize

Return the number of entries in this cache.

pub fn pop(&mut self) -> Option<V>

Remove and return the last element in the cache, if any.

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

Remove the given key from the cache and return it, if it was present.