-
Notifications
You must be signed in to change notification settings - Fork 1.2k
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
repro: introduce --continue-on-error #9705
Conversation
Codecov ReportPatch coverage:
Additional details and impacted files@@ Coverage Diff @@
## main #9705 +/- ##
==========================================
- Coverage 90.53% 90.47% -0.07%
==========================================
Files 480 480
Lines 36421 36480 +59
Branches 5232 5243 +11
==========================================
+ Hits 32975 33005 +30
- Misses 2855 2880 +25
- Partials 591 595 +4
☔ View full report in Codecov by Sentry. |
19f6ebf
to
1189a68
Compare
@skshetry Do you need QA? Product-wise, LGTM except for the long flag name, but I don't have any better ideas for it. |
yeah, I am still not sure about this PR. I do like the simplicity this execution order provides in terms of implementation, I prefer the existing execution order that tries to execute a subtree before moving on to the next one. |
Closing in favour of #9712. |
Fixes #8647 and #7292.
TODO:
This PR might change the execution order.
If you have a graph like this, the execution order would have been:
[4,5,3,6,7,2,1]
.It's a valid topological ordering.
But with this PR, we'll do order based on degree, so, zero-degree nodes
4,5,6,7
will get processed first, then3
and2
will be processed and then1
. i.e.[4,5,6,7,3,2,1]
.Which is still a valid topological ordering.
I think the new logic makes it simpler for implementing
--continue-on-error
, and allows easier parallelization in the future.