Show More
@@ -854,7 +854,7 b' def bisect(ui, repo, rev=None, extra=Non' | |||
|
854 | 854 | ui.status(_('changeset %d:%s: %s\n') % (ctx, ctx, transition)) |
|
855 | 855 | hbisect.checkstate(state) |
|
856 | 856 | # bisect |
|
857 |
nodes, changesets, bgood = hbisect.bisect(repo |
|
|
857 | nodes, changesets, bgood = hbisect.bisect(repo, state) | |
|
858 | 858 | # update to next check |
|
859 | 859 | node = nodes[0] |
|
860 | 860 | mayupdate(repo, node, show_stats=False) |
@@ -867,7 +867,7 b' def bisect(ui, repo, rev=None, extra=Non' | |||
|
867 | 867 | hbisect.checkstate(state) |
|
868 | 868 | |
|
869 | 869 | # actually bisect |
|
870 |
nodes, changesets, good = hbisect.bisect(repo |
|
|
870 | nodes, changesets, good = hbisect.bisect(repo, state) | |
|
871 | 871 | if extend: |
|
872 | 872 | if not changesets: |
|
873 | 873 | extendnode = hbisect.extendrange(repo, state, nodes, good) |
@@ -21,7 +21,7 b' from . import (' | |||
|
21 | 21 | error, |
|
22 | 22 | ) |
|
23 | 23 | |
|
24 |
def bisect( |
|
|
24 | def bisect(repo, state): | |
|
25 | 25 | """find the next node (if any) for testing during a bisect search. |
|
26 | 26 | returns a (nodes, number, good) tuple. |
|
27 | 27 | |
@@ -32,6 +32,7 b' def bisect(changelog, state):' | |||
|
32 | 32 | if searching for a first bad one. |
|
33 | 33 | """ |
|
34 | 34 | |
|
35 | changelog = repo.changelog | |
|
35 | 36 | clparents = changelog.parentrevs |
|
36 | 37 | skip = set([changelog.rev(n) for n in state['skip']]) |
|
37 | 38 |
General Comments 0
You need to be logged in to leave comments.
Login now