Repository navigation
post-1.0: add sliding row frames for window functions #183
Description
Roadmap source
ROADMAP.md: Phase 7.7a notes :rows N preceding sliding frames were deferred to the post-1.0 backlog.
Work item
Add bounded sliding row frames to window functions.
Acceptance criteria
- Extend parser and AST for
:rows N precedingframe syntax. - Evaluate aggregate window functions over bounded preceding frames.
- Preserve current unbounded-preceding behavior as the default.
- Add tests for edge rows, partitions, and ordering ties.
- Update Datalog reference documentation.
Activity
fix(api): revert QueryResult tuple variants for 1.x compat; add curre…
docs(roadmap): record v2.0 file-format policy and wave completion status
docs: bring TEST_COVERAGE.md fully current (998 tests)
adityamukho commentedon Oct 20, 2026
Moved to v3.1.0 (as ROADMAP/CLAUDE.md already list it), to be built after #551 so it exists only on the streaming engine, not on the executor that #551 deletes.
Depends on #547 (spec
docs/superpowers/specs/2026-10-20-aggregate-window-engine-design.md, merged in #640)::order-byvalue under one total value order (value_order, spec §3.1), then by the other:find-named variables, then input position (§4.1). Rows that tie on all of these are indistinguishable in the output, so row-based results are the same on every plan;:order-bygets the value at the last peer;Windowholds its whole sorted input (§6), so the work here is per-row evaluation only.For
:rows N preceding: an explicit ROWS frame over that total order. The default stays the peer rule above ("current unbounded-preceding behaviour" means peers once #547 lands, not the per-row running value of v2.x). Exact sliding sums: the exact float accumulator (§3.2) can remove the row leaving the frame without rounding error;min/maxvia a monotonic deque undervalue_order; registered window functions have no inverse and are recomputed per frame.docs: target row frames in v3.0.0 (#183)
feat(query): add bounded sliding row frames (#183) (#770)