Struct LruMap 

pub struct LruMap<K: PartialEq + Clone, V: Clone> { /* private fields */ }

A map with LRU (least-recently-used) eviction policy.

When the capacity is exceeded, the least-recently-used entry is removed. Useful for memoization caches inside the type checker.

Implementations

impl<K: PartialEq + Clone, V: Clone> LruMap<K, V>

pub fn new(capacity: usize) -> Self

Create an LRU map with the given capacity (must be > 0).

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

Get a value by key, promoting it to the front (most recently used).

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

Insert a key-value pair, evicting the LRU entry if at capacity.

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

Peek at a value without updating LRU order.

pub fn len(&self) -> usize

Number of entries.

pub fn is_empty(&self) -> bool

Check if empty.

pub fn clear(&mut self)

Evict all entries.

pub fn capacity(&self) -> usize

Current capacity.

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

Iterate entries in MRU order.

Trait Implementations

impl<K: Clone + PartialEq + Clone, V: Clone + Clone> Clone for LruMap<K, V>

fn clone(&self) -> LruMap<K, V>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Debug + PartialEq + Clone, V: Debug + Clone> Debug for LruMap<K, V>

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

Formats the value using the given formatter.