Enum EvictionStrategy 

#[non_exhaustive]
pub enum EvictionStrategy {
    Fifo,
    Lru(LruStrategy),
}

Eviction strategy for the cache.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Fifo

First-In-First-Out: evicts the oldest entries first (by insertion time).

Lru(LruStrategy)

Sharded, approximate Least Recently Used eviction. See LruStrategy.

This is not a globally-exact LRU. To reduce serialization overhead on large caches, the entries are split across independent shards (see LruStrategy::shards) and eviction happens per shard: when a shard is full, that shard evicts its own least recently accessed entry. With keys spread across shards, the globally least recently used entry is only evicted approximately, since eviction only ever considers one shard’s entries at a time. Both get() and save() update the access time.

With a single shard (LruStrategy::shards(1)) the whole cache lives in one queue, so eviction is exact, global LRU at the cost of no sharding.

Trait Implementations

impl Clone for EvictionStrategy

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for EvictionStrategy

impl Debug for EvictionStrategy

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

Formats the value using the given formatter.

impl Eq for EvictionStrategy

impl PartialEq for EvictionStrategy

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for EvictionStrategy