FA-273 / Runtime and resources / Member archive

A busy batch never reaches its flush deadline · case 03

Each arrival postpones a batch timer, so sustained low-rate traffic starves publication.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Arrivals have nondecreasing integer timestamps and latency is nonnegative. Before admitting an arrival, flush an existing batch if its first-item deadline <= arrival time. At finish_time (>= last arrival), flush if due. Record the scheduled deadline as flush time. Return [flushed [time,values] batches,remaining values]; actual event-loop delay is outside this model.

Why this case matters

Models latency-bounded batching and the difference between a debounce timer and a maximum age guarantee for the oldest queued item.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
steady arrivals cannot postpone oldest	`[[], ["a", "b", "c"]]`	`[[[9, ["a", "b", "c"]]], []]`	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.