FA-46655 / Bounded deques / Member archive

Deque iterator batch counts entries before its cursor as remaining · case 05

Deque iterator batch counts entries before its cursor as remaining.

Member previewVariant 5 · 3 implementations · 7 checks per implementation

Case contract

A fail-fast deque iterator tracks consumed logical count, captured structural epoch and traversal direction. Read at most limit elements; stale iterators emit no items and preserve position.

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	`["ok", 3, [6], 4]`	`["ok", 2, [6], 4]`	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.