Comments
Patch
@@ -2367,7 +2367,7 @@
if newtree != tree:
ui.note(revset.prettyformat(newtree), "\n")
func = revset.match(ui, expr)
- for c in func(repo, range(len(repo))):
+ for c in func(repo):
ui.write("%s\n" % c)
@command('debugsetparents', [], _('REV1 [REV2]'))
@@ -403,7 +403,7 @@
'''Return a list of revisions matching the given revset'''
expr = revset.formatspec(expr, *args)
m = revset.match(None, expr)
- return [r for r in m(self, list(self))]
+ return [r for r in m(self)]
def set(self, expr, *args):
'''
@@ -1838,7 +1838,9 @@
if ui:
tree = findaliases(ui, tree)
weight, tree = optimize(tree, True)
- def mfunc(repo, subset):
+ def mfunc(repo, subset=None):
+ if subset is None or repo == subset:
+ subset = _safesubset(repo)
return getset(repo, subset, tree)
return mfunc
@@ -618,7 +618,7 @@
# fall through to new-style queries if old-style fails
m = revset.match(repo.ui, spec)
- dl = [r for r in m(repo, list(repo)) if r not in seen]
+ dl = [r for r in m(repo) if r not in seen]
l.extend(dl)
seen.update(dl)