pub struct LFUCache<K, V, P> { /* fields omitted */ }
Expand description
A weighted, thread-safe, futures-aware least-frequently-used cache
Construct a new LFUCache
.
Return true
if the cache contains the given key.
Borrow the value of the cache entry with the given key.
Add a new entry to the cache.
Return the unoccupied capacity of this cache.
Return the capacity of this cache.
Return true
if the cache is empty.
Return true
if the cache is full.
Return the number of entries in this cache.
Return the currently occupied capacity of this cache.
Remove an entry from the cache, and clone and return its value if present.
Traverse the cache values beginning with the least-frequent.
Traverse the cache entries beginning with the least-frequent, and evict entries from the
cache according to this its Policy
.
impl<T> Any for T where
T: 'static + ?Sized,
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
impl<T, U> Into<U> for T where
U: From<T>,
The type returned in the event of a conversion error.
The type returned in the event of a conversion error.