Show More
@@ -98,7 +98,7 b' def bisect(changelog, state):' | |||||
98 | tot = len(candidates) |
|
98 | tot = len(candidates) | |
99 | unskipped = [c for c in candidates if (c not in skip) and (c != badrev)] |
|
99 | unskipped = [c for c in candidates if (c not in skip) and (c != badrev)] | |
100 | if tot == 1 or not unskipped: |
|
100 | if tot == 1 or not unskipped: | |
101 |
return ([changelog.node( |
|
101 | return ([changelog.node(c) for c in candidates], 0, good) | |
102 | perfect = tot // 2 |
|
102 | perfect = tot // 2 | |
103 |
|
103 | |||
104 | # find the best node to test |
|
104 | # find the best node to test |
General Comments 0
You need to be logged in to leave comments.
Login now