Struct TailCellMomentCache 

pub struct TailCellMomentCache { /* private fields */ }

Affine-tail cell-moment memo.

Stand-alone instances (TailCellMomentCache::new()) are useful when a caller needs deterministic hit/miss bookkeeping that is not polluted by concurrent traffic on the global memo. The production path uses the global instance behind evaluate_cell_moments.

All methods take &self: the LRU is internally synchronized (sharded for the concurrent global memo) and the counters are atomics, so the global instance needs no outer Mutex. The previous OnceLock<Mutex<…>> wrapper serialized every tail-cell evaluation across all rayon workers of the marginal-slope exact-cache build — the same contention class the sharded per-family cell-moment LRU fix removed.

Implementations

impl TailCellMomentCache

pub fn new() -> Self

Construct an empty cache. Hits/misses start at zero.

pub fn clear(&self)

Reset the cache to its empty state. Existing entries are dropped and the hit/miss counters are zeroed.

pub fn stats(&self) -> TailCellMomentCacheStats

Snapshot of the cache’s current usage stats.

pub fn evaluate( &self, cell: DenestedCubicCell, max_degree: usize, ) -> Result<CellMomentState, String>

Look up cell at max_degree, computing and inserting the result on miss. Cells outside the affine-tail keyset bypass the cache and run the uncached evaluator directly without touching the counters.

Stat semantics: every cache hit increments hits; a miss is counted when this call computed the value itself. Under concurrent access two workers racing on the same cold key may both count a miss (each computes the identical pure-function value); single-threaded bookkeeping is exact.

Trait Implementations

impl Debug for TailCellMomentCache

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

Formats the value using the given formatter.

impl Default for TailCellMomentCache

fn default() -> Self

Returns the “default value” for a type.