Struct EvalCache 

pub struct EvalCache { /* private fields */ }

Zero-copy cache store With parallel feature: Uses DashMap for thread-safe concurrent access Without parallel feature: Uses HashMap + RefCell for ultra-fast single-threaded access Values are stored behind Arc to enable cheap cloning

Implementations

impl EvalCache

pub fn new() -> Self

Create a new empty cache

pub fn with_capacity(capacity: usize) -> Self

Create cache with preallocated capacity

pub fn get(&self, key: &CacheKey) -> Option<Arc<Value>>

Get cached result (zero-copy via Arc clone) Returns None if not cached Ultra-fast single-threaded access

pub fn insert(&self, key: CacheKey, value: Value)

Insert result into cache (wraps in Arc for zero-copy sharing) Ultra-fast single-threaded access

pub fn insert_arc(&self, key: CacheKey, value: Arc<Value>)

Insert with Arc-wrapped value (zero-copy if already Arc) Ultra-fast single-threaded access

pub fn clear(&self)

Clear all cached entries

pub fn hit_rate(&self) -> f64

Get cache hit rate (0.0 to 1.0)

pub fn stats(&self) -> CacheStats

Get cache statistics

pub fn len(&self) -> usize

Get number of cached entries

pub fn is_empty(&self) -> bool

Check if cache is empty

pub fn remove(&self, key: &CacheKey) -> Option<Arc<Value>>

Remove specific entry

pub fn retain<F>(&self, predicate: F)

where F: Fn(&CacheKey, &Arc<Value>) -> bool,

Remove entries based on a predicate function Predicate returns true to keep the entry, false to remove it

pub fn invalidate_dependencies(&self, changed_paths: &[String])

Invalidate cache entries that depend on changed paths Efficiently removes only affected entries

Trait Implementations

impl Default for EvalCache

fn default() -> Self

Returns the “default value” for a type.