Struct LookupMemoryCache 

pub struct LookupMemoryCache { /* private fields */ }

quick_cache-backed in-memory lookup table cache.

Wraps [quick_cache::sync::Cache] with lookup-table semantics (composite table-scoped keys, lazy TTL expiry). Designed for Ring 0 (< 500ns per operation).

Thread safety

quick_cache::sync::Cache is internally sharded with per-shard locks held only for the duration of a map operation. LookupMemoryCache is Send + Sync.

Implementations

impl LookupMemoryCache

pub fn new(table_id: u32, config: LookupMemoryCacheConfig) -> Self

Create a new cache with the given configuration.

pub fn with_defaults(table_id: u32) -> Self

Create a cache with default configuration.

pub fn table_id(&self) -> u32

The table ID this cache is associated with.

pub fn get_cached(&self, key: &[u8]) -> LookupResult

Look up a key in the in-memory cache only (Ring 0, < 500ns).

When a TTL is configured, an entry older than the TTL is dropped and reported as a miss (lazy expiry), so the caller re-fetches a fresh value from the source. The removal re-checks expiry under the shard lock (remove_if), so a fresh value racing in between the read and the removal is preserved.

pub fn insert(&self, key: &[u8], value: RecordBatch)

Insert or update a cached entry. The TTL clock starts now.

pub fn invalidate(&self, key: &[u8])

Invalidate a cached entry.

pub fn len(&self) -> usize

Number of entries currently in the cache.

pub fn is_empty(&self) -> bool

Whether the cache is empty.

Trait Implementations

impl Debug for LookupMemoryCache

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

Formats the value using the given formatter.