FA-47313 / Bounded deques / Member archive

Sorted deque insertion places a new maximum before the old maximum · case 03

Sorted deque insertion places a new maximum before the old maximum.

Member previewVariant 3 · 3 implementations · 6 checks per implementation

Case contract

Insert a keyed entry into an ascending bounded deque after all existing equal keys. Full capacity rejects atomically. Return insertion position and number of suffix entries shifted.

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