Struct TableLruCache 

pub struct TableLruCache { /* private fields */ }

O(1) slab-based LRU cache for reference table rows.

Uses an FxHashMap<String, usize> for key→slot lookup and a Vec<LruNode> slab with intrusive doubly-linked list pointers for LRU ordering.

Implementations

impl TableLruCache

pub fn new(max_entries: usize) -> Self

Create a new LRU cache with the given maximum capacity.

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

Look up a key, promoting it to most-recently-used on hit.

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

Insert a key-value pair. Returns the evicted entry if the cache was full.

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

Remove a key from the cache. Returns true if it was present.

pub fn clear(&mut self)

Clear all entries.

pub fn len(&self) -> usize

Number of entries currently in the cache.

pub fn is_empty(&self) -> bool

Whether the cache is empty.

pub fn max_entries(&self) -> usize

Maximum capacity.

pub fn hit_rate(&self) -> f64

Cache hit rate as a fraction in [0.0, 1.0]. Returns 0.0 if no gets.

pub fn total_gets(&self) -> u64

Total number of get calls.

pub fn total_hits(&self) -> u64

Total cache hits.

pub fn total_evictions(&self) -> u64

Total evictions.