Struct MultiConsumerLruCache

pub struct MultiConsumerLruCache<K, V, L, S>
where
    K: Hash + Eq,
    L: Limiter<K, V>,
{ /* private fields */ }

A multi-consumer LRU cache.

Implementations

impl<K, V, L, S> MultiConsumerLruCache<K, V, L, S>

where K: Hash + Eq + Debug, L: Limiter<K, V>,

pub fn queue(&mut self, key: K, sender: S) -> bool

Adds the sender to the queue for the given key.

Returns true if this is the first queued sender for the key

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

Remove consumers for a given key, this will also remove the key from the cache.

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

Returns a reference to the value for a given key and promotes that element to be the most recently used.

pub fn insert<'a>( &mut self, key: <L as Limiter<K, V>>::KeyToInsert<'a>, value: V, ) -> bool

where <L as Limiter<K, V>>::KeyToInsert<'a>: Hash + PartialEq<K>,

Inserts a new element into the map.

Can fail if the element is rejected by the limiter or if we fail to grow an empty map.

See Schnellru::insert for more info.

pub fn update_cached_metrics(&self)

Update metrics for the inner cache.

impl<K, V, S> MultiConsumerLruCache<K, V, ByLength, S>

where K: Hash + Eq,

pub fn new( max_len: u32, cache_id: &str, ) -> MultiConsumerLruCache<K, V, ByLength, S>

Creates a new empty map with a given max_len and metric label.

Trait Implementations

impl<K, V, L, S> Debug for MultiConsumerLruCache<K, V, L, S>

where K: Hash + Eq, L: Limiter<K, V>,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.