FA-46718 / Bounded deques / Member archive

Bookmark insertion appends its values at the tail · case 03

Bookmark insertion appends its values at the tail.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Insert a batch at a deque gap atomically. Left-biased bookmarks at that gap stay before inserted values, right-biased bookmarks move after them, and later gaps shift by inserted length.

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	`[[3, 4, 5, 6], [[0, "left"], [1, "left"], [3, "right"], [4, "left"]], true, 3]`	`[[3, 5, 6, 4], [[0, "left"], [1, "left"], [3, "right"], [4, "left"]], true, 3]`	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.