Enum CachePolicy 

pub enum CachePolicy {
    Lru,
    Lfu,
    Fifo,
    Ttl,
}

Eviction strategy for cache entries.

Variants

Lru

Least-recently-used: evict the entry accessed least recently.

Lfu

Least-frequently-used: evict the entry accessed the fewest times.

Fifo

First-in, first-out: evict the oldest entry by insertion order.

Ttl

Time-to-live: evict entries whose TTL has expired; fall back to LRU on capacity.

Trait Implementations

impl Clone for CachePolicy

fn clone(&self) -> CachePolicy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CachePolicy

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

Formats the value using the given formatter.

impl Hash for CachePolicy

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for CachePolicy

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for CachePolicy

impl Eq for CachePolicy

impl StructuralPartialEq for CachePolicy