FA-10515 / Caching / Member archive

An expiration sweep stops at a live entry and leaves later expired entries · case 05

An expiration sweep stops at a live entry and leaves later expired entries.

Member previewVariant 5 · 3 implementations · 4 checks per implementation

Case contract

Entries have arbitrary order and are [key,exclusive expiration timestamp]. Sweep every expired entry while preserving survivor order; do not assume expiration and recency share order.

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