FA-46403 / Bounded deques / Member archive

Block merge reverses adjacency order · case 03

Block merge reverses adjacency order.

Member previewVariant 3 · 3 implementations · 6 checks per implementation

Case contract

Merge adjacent deque storage blocks if combined occupancy fits one block. Preserve the left block ID, retire the right ID once, and advance the directory epoch only on success.

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