-
Notifications
You must be signed in to change notification settings - Fork 148
perf: fix O(n²) wait completion algorithm #620
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
perf: fix O(n²) wait completion algorithm #620
Conversation
🦋 Changeset detectedLatest commit: 31f2459 The changes in this PR will be included in the next version bump. This PR includes changesets to release 12 packages
Not sure what this means? Click here to learn what changesets are. Click here if you're a maintainer who wants to add another changeset to this PR |
|
The latest updates on your projects. Learn more about Vercel for GitHub.
|
🧪 E2E Test Results⏳ Tests are running... This comment will be updated with the results when the tests complete. Started at: 2025-12-16T02:49:42Z |
This stack of pull requests is managed by Graphite. Learn more about stacking. |
- Use Set for O(1) lookup of completed wait IDs instead of O(n) `.some()` per iteration - Create all wait_completed events in parallel with `Promise.all()` instead of sequentially 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
d3753b5 to
eece359
Compare
305979e to
31f2459
Compare
|
Closing - this work was superseded and included in #621 |

.some()per iterationPromise.all()instead of sequentially🤖 Generated with Claude Code
Co-Authored-By: Claude Opus 4.5 noreply@anthropic.com