Show More
@@ -124,7 +124,7 b' def rangeset(repo, subset, x, y, order):' | |||||
124 |
|
124 | |||
125 | def rangeall(repo, subset, x, order): |
|
125 | def rangeall(repo, subset, x, order): | |
126 | assert x is None |
|
126 | assert x is None | |
127 |
return _makerangeset(repo, subset, 0, |
|
127 | return _makerangeset(repo, subset, 0, repo.changelog.tiprev(), order) | |
128 |
|
128 | |||
129 | def rangepre(repo, subset, y, order): |
|
129 | def rangepre(repo, subset, y, order): | |
130 | # ':y' can't be rewritten to '0:y' since '0' may be hidden |
|
130 | # ':y' can't be rewritten to '0:y' since '0' may be hidden | |
@@ -137,7 +137,8 b' def rangepost(repo, subset, x, order):' | |||||
137 | m = getset(repo, fullreposet(repo), x) |
|
137 | m = getset(repo, fullreposet(repo), x) | |
138 | if not m: |
|
138 | if not m: | |
139 | return baseset() |
|
139 | return baseset() | |
140 |
return _makerangeset(repo, subset, m.first(), |
|
140 | return _makerangeset(repo, subset, m.first(), repo.changelog.tiprev(), | |
|
141 | order) | |||
141 |
|
142 | |||
142 | def _makerangeset(repo, subset, m, n, order): |
|
143 | def _makerangeset(repo, subset, m, n, order): | |
143 | if m == n: |
|
144 | if m == n: | |
@@ -145,7 +146,7 b' def _makerangeset(repo, subset, m, n, or' | |||||
145 | elif n == node.wdirrev: |
|
146 | elif n == node.wdirrev: | |
146 | r = spanset(repo, m, len(repo)) + baseset([n]) |
|
147 | r = spanset(repo, m, len(repo)) + baseset([n]) | |
147 | elif m == node.wdirrev: |
|
148 | elif m == node.wdirrev: | |
148 |
r = baseset([m]) + spanset(repo, |
|
149 | r = baseset([m]) + spanset(repo, repo.changelog.tiprev(), n - 1) | |
149 | elif m < n: |
|
150 | elif m < n: | |
150 | r = spanset(repo, m, n + 1) |
|
151 | r = spanset(repo, m, n + 1) | |
151 | else: |
|
152 | else: |
General Comments 0
You need to be logged in to leave comments.
Login now