comparison mercurial/revset.py @ 15136:18219c0789ae

revset.bisect: add new 'range' set to the bisect keyword The 'range' set is made of all changesets that make the bisection range, that is - csets that are ancestors of bad csets and descendants of good csets or - csets that are ancestors of good csets and descendants of bad csets That is, roughly equivalent of: bisect(good)::bisect(bad) | bisect(bad)::bisect(good) Signed-off-by: "Yann E. MORIN" <yann.morin.1998@anciens.enib.fr>
author "Yann E. MORIN" <yann.morin.1998@anciens.enib.fr>
date Sat, 17 Sep 2011 17:33:34 +0200
parents f19de58af225
children 91f93dcd72aa
comparison
equal deleted inserted replaced
15135:f19de58af225 15136:18219c0789ae
235 n = getstring(x, _("author requires a string")).lower() 235 n = getstring(x, _("author requires a string")).lower()
236 return [r for r in subset if n in repo[r].user().lower()] 236 return [r for r in subset if n in repo[r].user().lower()]
237 237
238 def bisect(repo, subset, x): 238 def bisect(repo, subset, x):
239 """``bisect(string)`` 239 """``bisect(string)``
240 Changesets marked in the specified bisect status (good, bad, skip). 240 Changesets marked in the specified bisect status (``good``, ``bad``,
241 ``skip``), or any of the meta-status:
242
243 - ``range`` : all csets taking part in the bisection
241 """ 244 """
242 status = getstring(x, _("bisect requires a string")).lower() 245 status = getstring(x, _("bisect requires a string")).lower()
243 return [r for r in subset if r in hbisect.get(repo, status)] 246 return [r for r in subset if r in hbisect.get(repo, status)]
244 247
245 # Backward-compatibility 248 # Backward-compatibility