Struct Cache 

pub struct Cache<E, K, V, P>
where
    E: CacheEngine<K, V>,
    K: Eq + Hash,
    P: AdmissionPolicy<K>,
{ /* private fields */ }

Implementations

impl<E, K, V, A> Cache<E, K, V, A>

where E: CacheEngine<K, V>, K: Eq + Hash, A: AdmissionPolicy<K>,

pub fn new(engine: E, admission_policy: A) -> Self

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

where Key<K>: Borrow<Q>, Q: Eq + Hash,

Retrieves a value from the cache.

If the key exists, the admission policy is notified of the access.

Returns a [EntryRef] that provides controlled access to the entry.

pub fn insert(&self, key: K, value: V)

Inserts a key-value pair into the cache.

When the cache is full, an eviction candidate is selected by the engine. The admission policy then decides whether the incoming entry should replace the candidate.

Returns a [EntryRef] if an existing entry was replaced.

pub fn remove<Q>(&self, key: &Q) -> bool

where Key<K>: Borrow<Q>, Q: Eq + Hash,

Removes an entry from the cache.

Returns a [EntryRef] if the entry was present.

pub fn metrics(&self) -> MetricsSnapshot