Refactor event scheduler to use binary min-heap #1463
Merged
Conversation
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
Replace the linear scan for finding the next event with a binary min-heap data structure. This improves the complexity from O(n) to O(log n) for schedule/reschedule/unschedule operations, and O(1) for finding the minimum. The heap uses an index array to track each event type's position, enabling efficient updates and removals by event type. Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
kareltucek
force-pushed
the
feature/event-scheduler-heap
branch
from
337b46a to
63989b5
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Summary
Test plan
🤖 Generated with Claude Code