mercurial-scm/hg: mercurial/hbisect.py comparison

localrepo: convert various repo.set() users to repo.revs()

comparison

equal deleted inserted replaced

-:e27561eb4a76
+:c1eb8398fe82
 # 'range' is all csets that make the bisection:
 #   - have a good ancestor and a bad descendant, or conversely
 # that's because the bisection can go either way
 range = '( bisect(bad)::bisect(good) | bisect(good)::bisect(bad) )'
-_t = [c.rev() for c in repo.set('bisect(good)::bisect(bad)')]
+_t = repo.revs('bisect(good)::bisect(bad)')
 # The sets of topologically good or bad csets
 if len(_t) == 0:
 # Goods are topologically after bads
 goods = 'bisect(good)::'    # Pruned good csets
 bads  = '::bisect(bad)'     # Pruned bad csets
 iba = '::bisect(bad) - ::bisect(good)'  # Ignored bads' ancestors
 iga = '::bisect(good) - ::bisect(bad)'  # Ignored goods' ancestors
 ignored = '( ( (%s) | (%s) ) - (%s) )' % (iba, iga, range)
 if status == 'range':
-return [c.rev() for c in repo.set(range)]
+return repo.revs(range)
 elif status == 'pruned':
-return [c.rev() for c in repo.set(pruned)]
+return repo.revs(pruned)
 elif status == 'untested':
-return [c.rev() for c in repo.set(untested)]
+return repo.revs(untested)
 elif status == 'ignored':
-return [c.rev() for c in repo.set(ignored)]
+return repo.revs(ignored)
 elif status == "goods":
-return [c.rev() for c in repo.set(goods)]
+return repo.revs(goods)
 elif status == "bads":
-return [c.rev() for c in repo.set(bads)]
+return repo.revs(bads)
 else:
 raise error.ParseError(_('invalid bisect state'))
 def label(repo, node, short=False):
 rev = repo.changelog.rev(node)

Mercurial > public > mercurial-scm > hg