FA-10390 / Caching / Member archive

Replacing a cached value duplicates its recency entry · case 05

Replacing a cached value duplicates its recency entry.

Member previewVariant 5 · 3 implementations · 4 checks per implementation

Case contract

Put key at the most-recent end of a unique least-to-most-recent list, removing its previous position.

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