Resolve occurrence between two first-class feasts #31

New issue

Closed

opened 2026-07-01 00:51:27 +00:00 by manlycucumber · 0 comments

manlycucumber commented

2026-07-01 00:51:27 +00:00

(Migrated from github.com)

Problem

When two first-class observances fall on the same day, one is celebrated and the other is commemorated or transferred. This is the highest-stakes occurrence rule.

Acceptance criteria

The higher-ranked first-class day wins the office
The loser is commemorated or queued for transfer per the rubric
Temporal vs sanctoral precedence at first class is correct
Unit tests cover at least three real collisions

Notes

Validate against the oracle fixture for these dates.

## Problem When two first-class observances fall on the same day, one is celebrated and the other is commemorated or transferred. This is the highest-stakes occurrence rule. ## Acceptance criteria - [ ] The higher-ranked first-class day wins the office - [ ] The loser is commemorated or queued for transfer per the rubric - [ ] Temporal vs sanctoral precedence at first class is correct - [ ] Unit tests cover at least three real collisions ## Notes Validate against the oracle fixture for these dates.