Struct FoyerMemoryCache 

pub struct FoyerMemoryCache { /* private fields */ }

foyer-backed in-memory lookup table cache.

Wraps [foyer::Cache] with hit/miss counters and lookup-table semantics. Designed for Ring 0 (< 500ns per operation).

Thread safety

foyer::Cache is internally sharded and lock-free on the read path. FoyerMemoryCache is Send + Sync.

Implementations

impl FoyerMemoryCache

pub fn new(table_id: u32, config: FoyerMemoryCacheConfig) -> 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 hit_count(&self) -> u64

Total cache hits since creation.

pub fn miss_count(&self) -> u64

Total cache misses since creation.

pub fn hit_ratio(&self) -> f64

Cache hit ratio (0.0 – 1.0).

pub fn table_id(&self) -> u32

The table ID this cache is associated with.

Trait Implementations

impl Debug for FoyerMemoryCache

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

Formats the value using the given formatter.

impl LookupTable for FoyerMemoryCache

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

Look up a key in the in-memory cache only (Ring 0).

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

Look up a key, potentially checking slower storage tiers.

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

Insert or update a cached entry.

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

Invalidate a cached entry.

fn len(&self) -> usize

Number of entries currently in the cache.

fn is_empty(&self) -> bool

Whether the cache is empty.