FA-47099 / Bounded deques / Member archive

Deque compaction builds the inverse relocation table · case 04

Deque compaction builds the inverse relocation table.

Member previewVariant 4 · 3 implementations · 6 checks per implementation

Case contract

Compact a deque node arena using its logical live-ID chain. Preserve chain order, remap nullable stable cursors, return old-to-new relocation map, advance epoch, and identify reclaimed old storage IDs.

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	`[[6, 4, 5], [0, 1, 2], [3, null, null], {"0": 3, "1": 0, "2": 2}, 3, [1], 3]`	`[[6, 4, 5], [0, 1, 2], [1, 0, null], {"0": 1, "2": 2, "3": 0}, 3, [1], 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.