FA-45375 / Data systems / Member archive

Different stable functions share one cached result · case 05

Different stable functions share one cached result.

Member previewVariant 5 · 3 implementations · 8 checks per implementation

Case contract

Evaluate projection expressions over row IDs. Expressions are [kind,key] with stable, volatile, or row. A deterministic counter starts at seed and increments on each stable first call or volatile call; stable calls cache by key for the whole query. Row expressions return the current row ID. Preserve expression and 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
distinct stable keys	`[[6, 6]]`	`[[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.