Struct RandomPolicy 

pub struct RandomPolicy<K> { /* private fields */ }

An eviction policy that evicts entries randomly when the cache is full.

Implementations

impl<K> RandomPolicy<K>

pub fn new() -> Self

Trait Implementations

impl<K, V> CachePolicy<K, V> for RandomPolicy<K>

where K: Eq + Hash + Clone + Send + Sync, V: Send + Sync,

fn on_access(&self, _key: &K, _cost: u64)

A random policy does not care about access patterns. This is a no-op.

fn on_admit(&self, key: &K, cost: u64) -> AdmissionDecision<K>

A random policy always admits new items. We just need to start tracking it.

fn on_remove(&self, key: &K)

When an item is removed from the cache, we must stop tracking it.

fn evict(&self, cost_to_free: u64) -> (Vec<K>, u64)

The core eviction logic.

fn clear(&self)

Clears all tracked items.

impl<K: Debug> Debug for RandomPolicy<K>

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

Formats the value using the given formatter.