Struct BoundedLruCache 

pub struct BoundedLruCache<K, V> { /* private fields */ }

Small bounded LRU cache used by renderer hot-path caches.

Hits update recency in place, so the common path is a single hash lookup. Eviction scans the bounded table and happens only when inserting into a full cache.

Implementations

impl<K, V> BoundedLruCache<K, V>

where K: Clone + Eq + Hash,

pub fn new(cap: NonZeroUsize) -> Self

pub fn with_capacity_at_least_one(cap: usize) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn cap(&self) -> NonZeroUsize

pub fn contains(&self, key: &K) -> bool

pub fn get(&mut self, key: &K) -> Option<&V>

pub fn peek(&self, key: &K) -> Option<&V>

pub fn get_mut(&mut self, key: &K) -> Option<&mut V>

pub fn push(&mut self, key: K, value: V) -> Option<(K, V)>

pub fn put(&mut self, key: K, value: V) -> Option<V>

pub fn pop_lru(&mut self) -> Option<(K, V)>

pub fn pop(&mut self, key: &K) -> Option<V>

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)>