FA-10428 / Caching / Member archive

LFU eviction breaks equal-frequency ties by key name · case 03

LFU eviction breaks equal-frequency ties by key name.

Member previewVariant 3 · 3 implementations · 4 checks per implementation

Case contract

Entries are [key,frequency,last-access sequence]. Return the minimum (frequency,last access,key) victim, or None for an empty cache.

Why this case matters

A deterministic cache state transformation. Inputs are copied or treated as immutable; no remote storage, real clock, or concurrent interleaving is simulated.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
fixture 1	`"a"`	`"z"`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.