FA-47293 / Bounded deques / Member archive

Deque range swap repeats the final node of its second range · case 03

Deque range swap repeats the final node of its second range.

Member previewVariant 3 · 3 implementations · 6 checks per implementation

Case contract

Swap two ordered, disjoint half-open ranges within a bounded deque. Preserve each range and middle order, permit unequal lengths, and remap stable cursors through the permutation.

Why this case matters

Controlled bounded deque implementation model with explicit storage and lifecycle observations.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
0	`[[6, 7, 4, 5, 3, 7, 8], [4, 2, 0, 1, 6], [3, 4, 1, 2, 0, 4, 5], 1, 2]`	`[[6, 7, 4, 5, 3, 8], [4, 2, 0, 1, 5], [3, 4, 1, 2, 0, 5], 1, 2]`	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.