FA-10422 / Caching / Member archive

A newly requested cached key is evicted before its hit updates recency · case 02

A newly requested cached key is evicted before its hit updates recency.

Member previewVariant 2 · 3 implementations · 4 checks per implementation

Case contract

A nonempty full unique-key LRU list receives a read hit or miss, then a distinct incoming key. Return order after touch and one capacity-preserving insertion. Empty capacity stores nothing.

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	`["b", "c"]`	`["a", "c"]`	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.