FA-45439 / Data systems / Member archive

UNION pagination reverses branch traversal · case 04

UNION pagination reverses branch traversal.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

Concatenate ordered input branches with bag semantics, then apply one global nonnegative offset and limit. Branch-local boundaries, empty branches, and repeated rows do not reset pagination counters. Output order is branch order then row order.

Why this case matters

A bounded deterministic data engine model makes representation and changelog faults reproducible.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
offset crosses branches	`[6, 4]`	`[6, 7]`	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.