Struct LruCache 

pub struct LruCache { /* private fields */ }

Simple LRU cache for text deduplication.

Maintains insertion order and evicts the oldest entry when capacity is reached. Note: Updating an existing key does NOT refresh its position (matches Go behavior).

Example

use html_cleaning::dedup::LruCache;

let mut cache = LruCache::new(3);
cache.put("a", 1);
cache.put("b", 2);
assert_eq!(cache.get("a"), Some(1));
assert!(cache.has("b"));

Implementations

impl LruCache

pub fn new(max_size: usize) -> Self

Create new cache with specified capacity.

pub fn get(&self, key: &str) -> Option<i32>

Get value for key.

pub fn has(&self, key: &str) -> bool

Check if key exists.

pub fn put(&mut self, key: &str, value: i32)

Store key-value pair, evicting oldest if at capacity.

pub fn clear(&mut self)

Clear all entries.

pub fn len(&self) -> usize

Get current size.

pub fn is_empty(&self) -> bool

Check if empty.

pub fn remove(&mut self, key: &str)

Remove a specific key from the cache.