Struct LruCache 

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

Available on crate feature collections only.

A cache with a maximum capacity that evicts the least recently used items.

This implementation uses a Vec for order tracking, giving O(N) access and insertion cost per operation. It is designed for small-capacity caches (up to ~100 entries). For high-throughput or large-capacity use cases, consider the lru crate which provides O(1) operations via a doubly-linked list and HashMap.

Implementations

impl<K: Clone + Hash + Eq, V> LruCache<K, V>

pub fn new(capacity: usize) -> Self

Create a new LRU cache with the given capacity

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

Insert a key-value pair into the cache

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

Get a value from the cache, updating its position

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

Get a value without updating its position

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

Remove a key from the cache

pub fn len(&self) -> usize

Get the current size of the cache

pub fn is_empty(&self) -> bool

Check if the cache is empty

pub fn clear(&mut self)

Clear all items from the cache

Trait Implementations

impl<K: Debug, V: Debug> Debug for LruCache<K, V>

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

Formats the value using the given formatter.