changeset 30389 | e124e83fd159 |
parent 30126 | 755730fc1e48 |
child 35128 | fd8b6b183073 |
--- a/mercurial/hbisect.py Thu Nov 10 16:33:07 2016 -0500 +++ b/mercurial/hbisect.py Thu Nov 10 16:33:23 2016 -0500 @@ -98,7 +98,7 @@ tot = len(candidates) unskipped = [c for c in candidates if (c not in skip) and (c != badrev)] if tot == 1 or not unskipped: - return ([changelog.node(rev) for rev in candidates], 0, good) + return ([changelog.node(c) for c in candidates], 0, good) perfect = tot // 2 # find the best node to test