FA-46067 / Bounded deques / Member archive

Deque partition gathers rejected elements backwards · case 02

Deque partition gathers rejected elements backwards.

Member previewVariant 2 · 3 implementations · 6 checks per implementation

Case contract

Stably partition a bounded deque into accepted and rejected values using an explicit set. Return the concatenation, split cursor, and rejected sequence.

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
all reject	`[[3, 2], 0, [3, 2]]`	`[[2, 3], 0, [2, 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.