FA-46005 / Bounded deques / Member archive

Block lookup treats logical head as having a wrapped predecessor · case 05

Block lookup treats logical head as having a wrapped predecessor.

Member previewVariant 5 · 3 implementations · 6 checks per implementation

Case contract

For nonempty, variable-size deque blocks, resolve a logical index into [block index, local offset, value, total size, predecessor value, successor value]. Null neighbors mark sequence endpoints. Directory is built from cumulative block lengths.

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
first element	`[0, 0, 5, 3, 7, 6]`	`[0, 0, 5, 3, null, 6]`	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.