Struct asset_lru::CostBasedLru

pub struct CostBasedLru<K: ?Sized + Hash + Eq, V> { /* fields omitted */ }

An LRU cache which bases eviction on the total cost (e.g. size) of the contained objects.

See crate-level documentation for details.

Implementations

impl<K: ?Sized + Hash + Eq, V> CostBasedLru<K, V>

pub fn new(max_cost: u64) -> CostBasedLru<K, V>

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

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

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

Add an entry to the cache. Return the old entry if this key was already present.

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>

Iterator visiting entries in most-recently-used order.

pub fn clear(&mut self)