FA-4830 / Heap invariants / Member archive

Heap priority ties use arrival order · case 05

The operation returns a result or retained state that violates this contract: Order [priority,label] jobs by priority, using arrival sequence to break equal priorities independently of label lexical order.

Member previewVariant 5 · 3 implementations · 4 checks per implementation

Case scope

A controlled failure with recorded boundary checks.

Why this case matters

A controlled local-runtime regression for collection APIs, language semantics, or ownership wrappers. Fixtures include boundary and interaction cases.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
equal priority stable	`["m", "a", "z"]`	`["m", "z", "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.