Struct UnboundedLinearCache

pub struct UnboundedLinearCache<K, V>
where
    K: ApproxComparable,
    V: Clone,
{ /* private fields */ }

A cache implementation that checks all entries one-by-one, without eviction

Generic Types

The types K and V are used for the cache keys and values respectively.

K should be ApproxComparable, i.e. the compiler should know how to decide that two K’s are ‘close enough’ given a certain tolerance.

V should be Clone so that the user can do whatever they want with a returned value without messing with the actual cache line.

Constructors

Use the from method to create a new cache. You will be asked to provide a tolerance for the search and (optionally) an initial allocated capacity in memory. tolerance indicates the searching sensitivity (see ApproxComparable), which is a constant w.r.t. to the queried K (for now).

Implementations

impl<K, V> UnboundedLinearCache<K, V>

where K: ApproxComparable, V: Clone,

pub fn new(tolerance: f32) -> Self

pub fn with_initial_capacity(tolerance: f32, capacity: usize) -> Self

Trait Implementations

impl<K, V> ApproximateCache<K, V> for UnboundedLinearCache<K, V>

where K: ApproxComparable, V: Clone,

fn find(&mut self, to_find: &K) -> Option<V>

fn insert(&mut self, key: K, value: V)

fn len(&self) -> usize

fn is_empty(&self) -> bool