[scheduling] Optimize AddCycleConstraints when re-applying scheduling - #4703
Draft
copybara-service[bot] wants to merge 1 commit into
Draft
[scheduling] Optimize AddCycleConstraints when re-applying scheduling#4703copybara-service[bot] wants to merge 1 commit into
copybara-service[bot] wants to merge 1 commit into
Conversation
copybara-service
Bot
force-pushed
the
test_958361823
branch
from
August 3, 2026 14:58
77c7109 to
6c912e5
Compare
When trying to preserve an existing schedule, we previously did a quadratic-complexity scan for existing or contradictory constraints; we now just populate a hash map for linear-time lookup. PiperOrigin-RevId: 958361823
copybara-service
Bot
force-pushed
the
test_958361823
branch
from
August 3, 2026 18:10
6c912e5 to
c46a9ad
Compare
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
[scheduling] Optimize AddCycleConstraints when re-applying scheduling
When trying to preserve an existing schedule, we previously did a quadratic-complexity scan for existing or contradictory constraints; we now just populate a hash map for linear-time lookup.