Struct LruResultCache 

pub struct LruResultCache { /* private fields */ }

In-memory LRU cache. Hand-rolled to avoid the lru crate dependency — the substrate already has intrusive lists in several places and the implementation is ~80 lines.

Implementations

impl LruResultCache

pub fn new(max_entries: usize, max_bytes: u64) -> Self

Construct an LRU with the given bounds. Either bound being exceeded triggers eviction of the LRU end until both are satisfied.

Trait Implementations

impl Default for LruResultCache

fn default() -> Self

Returns the “default value” for a type.

impl ResultCache for LruResultCache

fn get(&self, key: &CacheKey) -> Option<CachedResult>

Look up an entry. Returns Some only when the entry is present AND unexpired AND its capability_version matches key.capability_version (the latter is enforced by the key itself — entries inserted under a different version simply don’t collide).

fn insert(&self, key: CacheKey, result: CachedResult)

Insert a fresh entry. Replaces any prior entry at the same key; trips LRU eviction if the cache is full.

fn invalidate_all(&self)

Drop every entry. Used by tests + explicit operator flushes; not on the hot path.

fn len(&self) -> usize

Current number of entries. For metrics / tests.

fn is_empty(&self) -> bool

Whether the cache holds no entries.