FA-233 / Runtime and resources / Member archive

A bounded queue admits only part of a logical batch · case 03

A queue exceeds capacity or silently drops a suffix after accepting a batch.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Capacity is nonnegative and the initial queue fits. Return [new queue,accepted]. A batch is atomic: all items append in order or none do. An empty batch succeeds even at zero capacity. The check and append are one serialized state transition in this model.

Why this case matters

Models bounded work admission for a logically indivisible request, isolating capacity reservation from the separate problem of locking a concurrent implementation.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
oversize batch is rejected intact	`[[0, 1, 2, "a", "b"], true]`	`[[0, 1, 2], false]`	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.