FA-4803 / Heap invariants / Member archive

Heapify required before successive pops · case 03

The operation returns a result or retained state that violates this contract: Build a min heap from arbitrary input and pop all values in sorted order, retaining duplicates.

Member previewVariant 3 · 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
arbitrary input order	`["c", "a", "b"]`	`["a", "b", "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.