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``, |
240 Changesets marked in the specified bisect status: |
241 ``skip``), or any of the meta-status: |
241 |
242 |
242 - ``good``, ``bad``, ``skip``: csets explicitly marked as good/bad/skip |
243 - ``range`` : all csets taking part in the bisection |
243 - ``goods``, ``bads`` : csets topologicaly good/bad |
244 - ``pruned`` : csets that are good, bad or skipped |
244 - ``range`` : csets taking part in the bisection |
245 - ``untested`` : csets whose fate is yet unknown |
245 - ``pruned`` : csets that are goods, bads or skipped |
246 - ``ignored`` : csets ignored due to DAG topology |
246 - ``untested`` : csets whose fate is yet unknown |
|
247 - ``ignored`` : csets ignored due to DAG topology |
247 """ |
248 """ |
248 status = getstring(x, _("bisect requires a string")).lower() |
249 status = getstring(x, _("bisect requires a string")).lower() |
249 return [r for r in subset if r in hbisect.get(repo, status)] |
250 return [r for r in subset if r in hbisect.get(repo, status)] |
250 |
251 |
251 # Backward-compatibility |
252 # Backward-compatibility |