Struct KernelCache 

pub struct KernelCache { /* private fields */ }

Cache for kernel evaluation results.

Uses symmetric key normalization: k(i,j) = k(j,i), so (i,j) and (j,i) share the same cache entry. Implements LRU eviction when capacity is reached.

Implementations

impl KernelCache

pub fn new(capacity: usize) -> Self

Create a new kernel cache with the given capacity.

The cache will evict the least-recently-used entry when full.

pub fn get(&mut self, i: usize, j: usize) -> Option<f64>

Retrieve a cached value, updating LRU order on hit.

pub fn insert(&mut self, i: usize, j: usize, value: f64)

Insert a value into the cache, evicting the LRU entry if at capacity.

pub fn hit_rate(&self) -> f64

Return the cache hit rate as a fraction in [0.0, 1.0].

pub fn len(&self) -> usize

Number of entries currently in the cache.

pub fn is_empty(&self) -> bool

Whether the cache is empty.

pub fn clear(&mut self)

Clear all entries and reset statistics.

pub fn hits(&self) -> u64

Total number of cache hits.

pub fn misses(&self) -> u64

Total number of cache misses.