comparison mercurial/revset.py @ 33002:272a44cac57e

revset: add depth limit to ancestors()

This is proposed by the issue5374, and will be a building block of set{gen}
(set subscript) operator.

https://www.mercurial-scm.org/wiki/RevsetOperatorPlan#ideas_from_mpm

  # reverse(ancestors(tip)) using hg repo
  2) 0.075408
  3) 0.075951

33001:92d0945a15e0

    if anc is not None and anc.rev() in subset:
        return baseset([anc.rev()])
    return baseset()

def _ancestors(repo, subset, x, followfirst=False):
    heads = getset(repo, fullreposet(repo), x)
    if not heads:
        return baseset()
    s = dagop.revancestors(repo, heads, followfirst)
    return subset & s

@predicate('ancestors(set)', safe=True)
def ancestors(repo, subset, x):
    """Changesets that are ancestors of changesets in set, including the
    given changesets themselves.
    """
    args = getargsdict(x, 'ancestors', 'set')
    if 'set' not in args:
        # i18n: "ancestors" is a keyword
        raise error.ParseError(_('ancestors takes at least 1 argument'))
    return _ancestors(repo, subset, args['set'])

@predicate('_firstancestors', safe=True)
def _firstancestors(repo, subset, x):
    # ``_firstancestors(set)``
    # Like ``ancestors(set)`` but follows only the first parents.

33002:272a44cac57e

    if anc is not None and anc.rev() in subset:
        return baseset([anc.rev()])
    return baseset()

def _ancestors(repo, subset, x, followfirst=False, stopdepth=None):
    heads = getset(repo, fullreposet(repo), x)
    if not heads:
        return baseset()
    s = dagop.revancestors(repo, heads, followfirst, stopdepth)
    return subset & s

@predicate('ancestors(set[, depth])', safe=True)
def ancestors(repo, subset, x):
    """Changesets that are ancestors of changesets in set, including the
    given changesets themselves.

    If depth is specified, the result only includes changesets up to
    the specified generation.
    """
    args = getargsdict(x, 'ancestors', 'set depth')
    if 'set' not in args:
        # i18n: "ancestors" is a keyword
        raise error.ParseError(_('ancestors takes at least 1 argument'))
    stopdepth = None
    if 'depth' in args:
        # i18n: "ancestors" is a keyword
        n = getinteger(args['depth'], _("ancestors expects an integer depth"))
        if n < 0:
            raise error.ParseError(_("negative depth"))
        stopdepth = n + 1
    return _ancestors(repo, subset, args['set'], stopdepth=stopdepth)

@predicate('_firstancestors', safe=True)
def _firstancestors(repo, subset, x):
    # ``_firstancestors(set)``
    # Like ``ancestors(set)`` but follows only the first parents.