Show More
@@ -204,9 +204,11 b' def revtree(ui, args, repo, full="tree",' | |||||
204 | l[chunk - x:] = [0] * (chunk - x) |
|
204 | l[chunk - x:] = [0] * (chunk - x) | |
205 | break |
|
205 | break | |
206 | if full is not None: |
|
206 | if full is not None: | |
|
207 | if (i + x) in repo: | |||
207 | l[x] = repo[i + x] |
|
208 | l[x] = repo[i + x] | |
208 | l[x].changeset() # force reading |
|
209 | l[x].changeset() # force reading | |
209 | else: |
|
210 | else: | |
|
211 | if (i + x) in repo: | |||
210 | l[x] = 1 |
|
212 | l[x] = 1 | |
211 | for x in xrange(chunk - 1, -1, -1): |
|
213 | for x in xrange(chunk - 1, -1, -1): | |
212 | if l[x] != 0: |
|
214 | if l[x] != 0: | |
@@ -259,6 +261,8 b' def revtree(ui, args, repo, full="tree",' | |||||
259 | # walk the repository looking for commits that are in our |
|
261 | # walk the repository looking for commits that are in our | |
260 | # reachability graph |
|
262 | # reachability graph | |
261 | for i, ctx in chlogwalk(): |
|
263 | for i, ctx in chlogwalk(): | |
|
264 | if i not in repo: | |||
|
265 | continue | |||
262 | n = repo.changelog.node(i) |
|
266 | n = repo.changelog.node(i) | |
263 | mask = is_reachable(want_sha1, reachable, n) |
|
267 | mask = is_reachable(want_sha1, reachable, n) | |
264 | if mask: |
|
268 | if mask: |
General Comments 0
You need to be logged in to leave comments.
Login now