FA-77044 / Calendar recurrence rules / Member archive

Window query for recurring instances with duration: fast forward · case 04

A long instance already in progress when the window opens is missing from the result.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

Instances start at dtstart + k*interval_hours for k < count and last duration_min minutes. A window [window_start, window_end) returns every instance whose half-open span [s, s+duration) overlaps it; a zero-duration instance is returned when window_start <= s < window_end. The query may skip ahead but COUNT is always counted from dtstart. Return ISO start times (minutes).

Why this case matters

Recurring calendar series are expanded into concrete instances for display, reminders and conflict checks.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
duration longer than interval	`["2024-02-01T08:00"]`	`["2024-02-01T06:00", "2024-02-01T08:00"]`	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.