Show More
@@ -38,7 +38,7 def bisect(repo, state): | |||
|
38 | 38 | |
|
39 | 39 | def buildancestors(bad, good): |
|
40 | 40 | badrev = min([changelog.rev(n) for n in bad]) |
|
41 | ancestors = [None] * (len(changelog) + 1) | |
|
41 | ancestors = collections.defaultdict(lambda: None) | |
|
42 | 42 | for rev in repo.revs("descendants(%ln) - ancestors(%ln)", good, good): |
|
43 | 43 | ancestors[rev] = [] |
|
44 | 44 | if ancestors[badrev] is None: |
General Comments 0
You need to be logged in to leave comments.
Login now