Struct JitFilterCache 

pub struct JitFilterCache { /* private fields */ }

Thread-safe, bounded cache of compiled JIT filter functions.

Thread safety

• Cache reads use a shared RwLock — many readers can proceed concurrently.
• Compilation uses an exclusive Mutex<FilterCompiler> — only one thread compiles at a time, but reads are never blocked during compilation.

Implementations

impl JitFilterCache

pub fn new(max_entries: usize) -> Result<Self, FilterCompilerError>

Create a new cache with the given capacity bound.

max_entries must be at least 1; values of 0 are clamped to 1.

pub fn get(&self, key: u64) -> Option<Arc<CompiledFilter>>

Return the compiled filter for key if it is already cached.

pub fn compile_and_insert( &self, key: u64, expr: &FilterExpr, var_map: VarIndexMap, ) -> Result<Option<Arc<CompiledFilter>>, FilterCompilerError>

Compile expr + var_map and insert the result under key.

If key is already in the cache (from a concurrent compile), the existing entry is returned without re-compiling.

Returns Ok(None) if the expression is not in the JIT-supported subset.

pub fn len(&self) -> usize

Return the number of entries currently in the cache.

pub fn is_empty(&self) -> bool

Return true if the cache is empty.

pub fn stats(&self) -> CacheStats

Return a snapshot of cache statistics.