Show More
@@ -2111,7 +2111,7 b' def debugsuccessorssets(ui, repo, *revs)' | |||||
2111 | for rev in scmutil.revrange(repo, revs): |
|
2111 | for rev in scmutil.revrange(repo, revs): | |
2112 | ctx = repo[rev] |
|
2112 | ctx = repo[rev] | |
2113 | ui.write('%s\n'% ctx2str(ctx)) |
|
2113 | ui.write('%s\n'% ctx2str(ctx)) | |
2114 | for succsset in obsutil.successorssets(repo, ctx.node(), cache): |
|
2114 | for succsset in obsutil.successorssets(repo, ctx.node(), cache=cache): | |
2115 | if succsset: |
|
2115 | if succsset: | |
2116 | ui.write(' ') |
|
2116 | ui.write(' ') | |
2117 | ui.write(node2str(succsset[0])) |
|
2117 | ui.write(node2str(succsset[0])) |
@@ -958,7 +958,7 b' def _computedivergentset(repo):' | |||||
958 | continue # emergency cycle hanging prevention |
|
958 | continue # emergency cycle hanging prevention | |
959 | seen.add(prec) |
|
959 | seen.add(prec) | |
960 | if prec not in newermap: |
|
960 | if prec not in newermap: | |
961 | obsutil.successorssets(repo, prec, newermap) |
|
961 | obsutil.successorssets(repo, prec, cache=newermap) | |
962 | newer = [n for n in newermap[prec] if n] |
|
962 | newer = [n for n in newermap[prec] if n] | |
963 | if len(newer) > 1: |
|
963 | if len(newer) > 1: | |
964 | divergent.add(ctx.rev()) |
|
964 | divergent.add(ctx.rev()) |
General Comments 0
You need to be logged in to leave comments.
Login now