Struct generational_cache::cache::lru_cache::LRUCache

pub struct LRUCache<V, K, T, M> { /* private fields */ }

A generational-arena powered LRUCache implementation.

Implementations

impl<V, K, T, M> LRUCache<V, K, T, M>where V: Vector<LRUCacheBlockArenaEntry<K, T>>, M: Map<K, Link>,

pub fn least_recent(&self) -> Option<(&K, &T)>

pub fn most_recent(&self) -> Option<(&K, &T)>

impl<V, K, T, M> LRUCache<V, K, T, M>where V: Vector<LRUCacheBlockArenaEntry<K, T>>, M: Map<K, Link>,

pub fn with_backing_vector_and_map(vector: V, map: M) -> Self

impl<V, K, T, M> LRUCache<V, K, T, M>where V: Vector<LRUCacheBlockArenaEntry<K, T>>, M: Map<K, Link> + Default,

pub fn with_backing_vector(vector: V) -> Self

Trait Implementations

impl<V, K, T, M> Cache<K, T> for LRUCache<V, K, T, M>where V: Vector<LRUCacheBlockArenaEntry<K, T>>, M: Map<K, Link>, K: Copy,

type Error = LRUCacheError<<V as Vector<Entry<Node<Block<K, T>>>>>::Error, <M as Map<K, Link>>::Error>

fn insert(&mut self, key: K, value: T) -> Result<Eviction<K, T>, Self::Error>

fn remove(&mut self, key: &K) -> Result<T, Self::Error>

fn query(&mut self, key: &K) -> Result<&T, Self::Error>

fn capacity(&self) -> usize

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn clear(&mut self) -> Result<(), Self::Error>

fn is_maxed(&self) -> bool

impl<V, K, T, M> Default for LRUCache<V, K, T, M>where V: Vector<LRUCacheBlockArenaEntry<K, T>> + Default, M: Map<K, Link> + Default,

fn default() -> Self

Returns the “default value” for a type.