Struct LRUPolicy 

pub struct LRUPolicy { /* private fields */ }

A least-recently-used EvictionPolicy

Tracks access order in an intrusive doubly linked list and, once the cache is full, evicts the entry that has gone longest without a hit.

Examples

use candela::skeleton::{DynamicSkeleton, SkeletonSlot};
use candela::{Layout, Tensor};

// LRUPolicy is DynamicSkeleton's default; a size-1 cache drops the older shape.
let sk: DynamicSkeleton<f32> = DynamicSkeleton::new(1, Box::new(|inputs: &[Layout]| {
    let a = SkeletonSlot::new(inputs[0].clone());
    (&a * 2.0).into_skeleton(&[a]).unwrap()
}));

let a = Tensor::from_scalar(3.0, &[4]);
sk.run(&[&a])?;
sk.run(&[&Tensor::from_scalar(3.0, &[8])])?; // evicts the [4] entry
assert!(!sk.contains_key(&[&a]));

Trait Implementations

impl Debug for LRUPolicy

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

Formats the value using the given formatter.

impl EvictionPolicy for LRUPolicy

fn new(cache_size: usize) -> Self

The constructor of the policy

fn on_get(&mut self, idx: usize)

The get action

fn on_insert(&mut self, idx: usize)

The insert action

fn on_remove(&mut self, idx: usize)

The remove action

fn evict(&mut self) -> Option<usize>

The eviction action