FA-45788 / Data systems / Member archive

Recursive UNION ALL deduplicates its anchor relation · case 03

Recursive UNION ALL deduplicates its anchor relation.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Evaluate a bounded recursive UNION ALL query. Anchors are integer values; each frontier value joins all rules [source,target], preserving duplicate anchors and duplicate rules. Emit [depth,value] for depth zero through max-depth, expanding only the newest frontier. Preserve anchor and rule encounter 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
duplicate anchors	`[[0, 3], [1, 4]]`	`[[0, 3], [0, 3], [1, 4], [1, 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.