FA-47064 / Bounded deques / Member archive

Ring gap insertion reads backing array order as logical order · case 04

Ring gap insertion reads backing array order as logical order.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

Insert into a valid logical gap by moving the shorter ring side, preferring the right side on equal cost. Left shifts decrement physical head; reconstruct live arc and clear all vacant slots. Full ring rejects atomically.

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
1	`[[null, null, 6, 7, null], 2, 4, true, 1]`	`[[6, null, 4, 7, 5], 2, 4, true, 1]`	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.