FA-10458 / Caching / Member archive
Tag invalidation keeps entries sharing only one requested tag · case 03
Tag invalidation keeps entries sharing only one requested tag.
Case contract
Entries are [key,tags]. Remove every entry having any tag in the requested set, preserving input order; empty requested tags remove 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 fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| fixture 1 | [["a", ["red"]], ["b", ["blue"]], ["c", []]] | [["b", ["blue"]], ["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.
Sign in to the archive ↗