Show More
@@ -58,6 +58,8 b' def _revdescendants(repo, revs, followfi' | |||
|
58 | 58 | |
|
59 | 59 | def iterate(): |
|
60 | 60 | cl = repo.changelog |
|
61 | # XXX this should be 'parentset.min()' assuming 'parentset' is a | |
|
62 | # smartset (and if it is not, it should.) | |
|
61 | 63 | first = min(revs) |
|
62 | 64 | nullrev = node.nullrev |
|
63 | 65 | if first == nullrev: |
@@ -85,6 +87,8 b' def _revsbetween(repo, roots, heads):' | |||
|
85 | 87 | visit = list(heads) |
|
86 | 88 | reachable = set() |
|
87 | 89 | seen = {} |
|
90 | # XXX this should be 'parentset.min()' assuming 'parentset' is a smartset | |
|
91 | # (and if it is not, it should.) | |
|
88 | 92 | minroot = min(roots) |
|
89 | 93 | roots = set(roots) |
|
90 | 94 | # open-code the post-order traversal due to the tiny size of |
@@ -614,6 +618,8 b' def _children(repo, narrow, parentset):' | |||
|
614 | 618 | if not parentset: |
|
615 | 619 | return baseset(cs) |
|
616 | 620 | pr = repo.changelog.parentrevs |
|
621 | # XXX this should be 'parentset.min()' assuming 'parentset' is a smartset | |
|
622 | # (and if it is not, it should.) | |
|
617 | 623 | minrev = min(parentset) |
|
618 | 624 | for r in narrow: |
|
619 | 625 | if r <= minrev: |
@@ -1217,6 +1223,8 b' def branchpoint(repo, subset, x):' | |||
|
1217 | 1223 | cl = repo.changelog |
|
1218 | 1224 | if not subset: |
|
1219 | 1225 | return baseset() |
|
1226 | # XXX this should be 'parentset.min()' assuming 'parentset' is a smartset | |
|
1227 | # (and if it is not, it should.) | |
|
1220 | 1228 | baserev = min(subset) |
|
1221 | 1229 | parentscount = [0]*(len(repo) - baserev) |
|
1222 | 1230 | for r in cl.revs(start=baserev + 1): |
General Comments 0
You need to be logged in to leave comments.
Login now