FA-8717 / Notification interfaces / Member archive

Toast queue lifecycle: Updating one toast overwrites all toast messages · case 02

Updating one toast overwrites all toast messages.

Member previewVariant 2 · 3 implementations · 10 checks per implementation

Case contract

Toast IDs deduplicate additions; equal content may belong to distinct IDs; keep newest within capacity; update/dismiss target one ID; clear removes all.

Why this case matters

A deterministic model of toast queue lifecycle; this isolates one interface invariant without requiring a browser.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
update	`[{"id": "a", "message": "new"}, {"id": "b", "message": "new"}]`	`[{"id": "a", "message": "new"}, {"id": "b", "message": "b"}]`	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.