Struct ParsedSourceLru 

pub struct ParsedSourceLru<T> { /* private fields */ }

Bounded LRU cache mapping SourceHash to Arc<T>. Eviction is LRU by last-touched order. Hits are O(1); eviction scans the bounded live set only when an insert needs space.

Implementations

impl<T> ParsedSourceLru<T>

pub fn with_capacity(capacity: usize) -> Self

Build an empty cache that holds at most capacity entries. capacity == 0 disables caching entirely (every lookup is a miss and nothing is stored).

pub fn get(&self, key: SourceHash) -> Option<Arc<T>>

Look up key. Returns the cached Arc<T> on hit (and bumps recency); returns None on miss.

pub fn insert(&self, key: SourceHash, value: T) -> Arc<T>

Insert value for key, evicting the oldest entry if the cache is at capacity. Returns the inserted Arc<T>.

pub fn get_or_parse<F>(&self, source: &[u8], extra: &[u8], parse: F) -> Arc<T>

where F: FnOnce(&[u8]) -> T,

Look up key; on miss, run parse(source) to produce the value and insert it. Returns the cached or freshly inserted Arc<T>.

pub fn len(&self) -> usize

Total number of entries currently held.

pub fn is_empty(&self) -> bool

true iff the cache holds zero entries.