comparison mercurial/revset.py @ 26304:bca60842e22d

update: move default destination into a revset

This is another step toward having "default" destination more clear and unified.
Not all the logic is there because some bookmark related computation happened
elsewhere. It will be moved later.

The function is private because as for the other ones, cleanup is needed before
we can proceed.

26303:c99b4d6efdd8

            node = nbhs[-1]
        else:
            node = nbhs[0]
    return subset & baseset([repo[node].rev()])

def adds(repo, subset, x):
    """``adds(pattern)``
    Changesets that add a file matching pattern.

    The pattern without explicit kind like ``glob:`` is expected to be

    s = subset
    return baseset([r for r in ls if r in s])

symbols = {
    "_mergedefaultdest": _mergedefaultdest,
    "adds": adds,
    "all": getall,
    "ancestor": ancestor,
    "ancestors": ancestors,
    "_firstancestors": _firstancestors,

26304:bca60842e22d

            node = nbhs[-1]
        else:
            node = nbhs[0]
    return subset & baseset([repo[node].rev()])

def _updatedefaultdest(repo, subset, x):
    # ``_updatedefaultdest()``

    # default destination for update.
    # # XXX: Currently private because I expect the signature to change.
    # # XXX: - taking rev as arguments,
    # # XXX: - bailing out in case of ambiguity vs returning all data.
    getargs(x, 0, 0, _("_updatedefaultdest takes no arguments"))
    # Here is where we should consider bookmarks, divergent bookmarks,
    # foreground changesets (successors), and tip of current branch;
    # but currently we are only checking the branch tips.
    node = None
    wc = repo[None]
    p1 = wc.p1()
    try:
        node = repo.branchtip(wc.branch())
    except error.RepoLookupError:
        if wc.branch() == 'default': # no default branch!
            node = repo.lookup('tip') # update to tip
        else:
            raise util.Abort(_("branch %s not found") % wc.branch())

    if p1.obsolete() and not p1.children():
        # allow updating to successors
        successors = obsmod.successorssets(repo, p1.node())

        # behavior of certain cases is as follows,
        #
        # divergent changesets: update to highest rev, similar to what
        #     is currently done when there are more than one head
        #     (i.e. 'tip')
        #
        # replaced changesets: same as divergent except we know there
        # is no conflict
        #
        # pruned changeset: no update is done; though, we could
        #     consider updating to the first non-obsolete parent,
        #     similar to what is current done for 'hg prune'

        if successors:
            # flatten the list here handles both divergent (len > 1)
            # and the usual case (len = 1)
            successors = [n for sub in successors for n in sub]

            # get the max revision for the given successors set,
            # i.e. the 'tip' of a set
            node = repo.revs('max(%ln)', successors).first()
    return subset & baseset([repo[node].rev()])

def adds(repo, subset, x):
    """``adds(pattern)``
    Changesets that add a file matching pattern.

    The pattern without explicit kind like ``glob:`` is expected to be

    s = subset
    return baseset([r for r in ls if r in s])

symbols = {
    "_mergedefaultdest": _mergedefaultdest,
    "_updatedefaultdest": _updatedefaultdest,
    "adds": adds,
    "all": getall,
    "ancestor": ancestor,
    "ancestors": ancestors,
    "_firstancestors": _firstancestors,