FA-46238 / Bounded deques / Member archive
Deque merge takes right-run ties before left-run ties · case 03
Deque merge takes right-run ties before left-run ties.
Case contract
Merge sorted deque runs by key, placing equal keys from the left run first and preserving each run order. Split the merged stream at output capacity.
Why this case matters
Controlled bounded deque implementation model with explicit storage and lifecycle observations.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| 0 | [[[1, 5], [1, 3], [2, 4]], [[3, 6]]] | [[[1, 3], [1, 5], [2, 4]], [[3, 6]]] | 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 ↗