Repository navigation
fix: keep calendar event ordering consistent across offsets and invalid dates #171
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
charan-rathore
wants to merge
3
commits into
CopilotKit:main
Choose a base branch
from
charan-rathore:fix/calendar-mixed-offset-order
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+328
−55
Open
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,52 @@ | ||
| import assert from "node:assert/strict"; | ||
| import { test } from "node:test"; | ||
| import { compareEventStart, type EventStartLike } from "../packages/domain/src/date-time.ts"; | ||
|
|
||
| function permutations<T>(values: T[]): T[][] { | ||
| if (values.length === 0) return [[]]; | ||
| return values.flatMap((value, index) => | ||
| permutations(values.filter((_, i) => i !== index)).map((rest) => [value, ...rest]), | ||
| ); | ||
| } | ||
|
|
||
| test("mixed invalid dates cannot reorder valid instants across input permutations", () => { | ||
| const later = { start: "2026-10-10T09:00:00-07:00" }; | ||
| const invalid = { start: "2026-10-10T12:bad" }; | ||
| const earlier = { start: "2026-10-10T14:00:00+00:00" }; | ||
| for (const input of permutations([later, invalid, earlier])) { | ||
| assert.deepEqual([...input].sort(compareEventStart), [earlier, later, invalid]); | ||
| } | ||
| }); | ||
|
|
||
| test("event start ordering is antisymmetric and transitive across valid and invalid groups", () => { | ||
| const values: EventStartLike[] = [ | ||
| { start: "2026-10-10T09:00:00-07:00" }, | ||
| { start: "2026-10-10T12:bad" }, | ||
| { start: "2026-10-10T14:00:00+00:00" }, | ||
| { start: "", allDay: true }, | ||
| { start: "2026-10-10", allDay: true, timeZone: "Pacific/Auckland" }, | ||
| { start: "2026-10-10", allDay: true, timeZone: "invalid-zone" }, | ||
| { start: "not a date" }, | ||
| ]; | ||
| const sign = (value: number) => (value < 0 ? -1 : value > 0 ? 1 : 0); | ||
| for (const a of values) { | ||
| assert.equal(compareEventStart(a, a), 0); | ||
| for (const b of values) { | ||
| assert.equal(sign(compareEventStart(a, b)) + sign(compareEventStart(b, a)), 0); | ||
| for (const c of values) { | ||
| if (compareEventStart(a, b) <= 0 && compareEventStart(b, c) <= 0) { | ||
| assert.ok(compareEventStart(a, c) <= 0); | ||
| } | ||
| } | ||
| } | ||
| } | ||
| }); | ||
|
|
||
| test("invalid starts retain a deterministic text order after valid events", () => { | ||
| const valid = { start: "2026-10-10T14:00:00Z" }; | ||
| const invalid = [{ start: "!invalid" }, { start: "" }, { start: "garbage" }]; | ||
| const expected = [valid, ...[...invalid].sort((a, b) => a.start.localeCompare(b.start))]; | ||
| for (const input of permutations([valid, ...invalid])) { | ||
| assert.deepEqual([...input].sort(compareEventStart), expected); | ||
| } | ||
| }); |
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
[P2] Give invalid dates a separate, consistent sort position. Mixing chronological comparison for two valid starts with lexical comparison whenever either is invalid creates a cycle: A=2026-10-10T09:00:00-07:00, B=2026-10-10T12:bad, C=2026-10-10T14:00:00+00:00 yields A<B, B<C, and C<A. Reproduced on this head: sorting [A,B,C] leaves the 16:00Z event before the 14:00Z event, whereas another input permutation produces a different order. Partition valid versus invalid starts consistently (then compare instants or text within each group), and add mixed-invalid permutation coverage.