Normal
  6   ˆl–Ým_JJi?u8 ¸n 
bÑ¿�þB g�Ç,l·(ÞþÇƒh¹ÆÊÉ      0000004b
  $   ˆÄÃÆ639Âa–Ým_JJi?u8 ¸nõ1hßÊ     ‹      Õ—]o›0†ïû+<_ì.œ M·´„©•-M£”i›¦©r°ÁÞF¶Ó´ûõƒ@•5Ú‡X¢]�_^ŽÏãclì½n†áçéz^�ÑôÃÛñhˆpà£;Â zpjum€«	F˜“Ÿ¬V+kåZR%Î€›Ez
Ú(‹Šý¯ÔüäqFhqEž&eþ(£ìÉ�\-(;…\É4KcPRXj"‹Ò%e�óœ®Ýïö»°œhîAªuto.écÙ©ÝNEœuÊd¾î§¼U¾g8º'©H²62Ç¾'	Ò*`‘Ì4ÌS’}·cDR3À_FÃ›¯…/ßö=‚¸bñ ¿&7ƒ û²`�ç=×…çûc¢ZH*bÁè^óme¾?ö*OÀt¤Dn„Ì6V(·Q#™êœ¬½‚€«mWe¡¿5cz9»š„ÁhV	-Cl²û»raJË
„b‘‘ê±ª¢¿Ìæ:¿xj¢:]%n°�P=ëüFS$±Í~
Ÿ¥+¿+§–Å±¿¹ßÎu'9§ëœul»ãt‘Ý;wúí1ö¬³÷‡¦¸#4eÊu¶i6ZTö1¨"í0ÕJ;DýÃÅÙ}ƒgÝnƒÆ±^ž&‘Ú4p*á¿�oœ@µÒN…œÃ}“„4KT+íÔ¨wx¢mà”Í6X\ëÕáYŠ-Ÿíð<IíÌ¸#¬pš“ÐºÝMñÏ{wÇm«:îx2«e“¨–ÚYŽð‘0Õ@ª•vˆŽ°¯®¸Pi.es/ÚRÿýû›ç¨Od¬|T§ÌŸ—
>�È    8   ˆl–äY>”JeJe@†à¸Û*bÑ¿�þZhM¬Ü¡p¬ˆ$‘¦�üÿÉ„­4ßÈÇ¿Ë ?÷     # destutil.py - Mercurial utility function for command destination
#
#  Copyright Olivia Mackall <olivia@selenic.com> and other
#
# This software may be used and distributed according to the terms of the
# GNU General Public License version 2 or any later version.


from .i18n import _
from . import bookmarks, error, obsutil, scmutil, stack


def orphanpossibledestination(repo, rev):
    """Return all changesets that may be a new parent for orphan `rev`.

    This function works fine on non-orphan revisions, it's just silly
    because there's no destination implied by obsolete markers, so
    it'll return nothing.
    """
    tonode = repo.changelog.node
    parents = repo.changelog.parentrevs
    torev = repo.changelog.rev
    dest = set()
    tovisit = list(parents(rev))
    while tovisit:
        r = tovisit.pop()
        succsets = obsutil.successorssets(repo, tonode(r))
        if not succsets:
            # if there are no successors for r, r was probably pruned
            # and we should walk up to r's parents to try and find
            # some successors.
            tovisit.extend(parents(r))
        else:
            # We should probably pick only one destination from split
            # (case where '1 < len(ss)'), This could be the currently
            # tipmost, but the correct result is less clear when
            # results of the split have been moved such that they
            # reside on multiple branches.
            for ss in succsets:
                for n in ss:
                    dr = torev(n)
                    if dr != -1:
                        dest.add(dr)
    return dest


def _destupdateobs(repo, clean):
    """decide of an update destination from obsolescence markers"""
    node = None
    wc = repo[None]
    p1 = wc.p1()
    movemark = None

    if p1.obsolete() and not p1.children():
        # allow updating to successors
        successors = obsutil.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: update to the closest non-obsolete ancestor,
        # similar to what 'hg prune' currently does

        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(b'max(%ln)', successors).first()
        else:
            p1 = p1.p1()
            while p1.obsolete():
                p1 = p1.p1()
            node = p1.node()

        if node is not None and bookmarks.isactivewdirparent(repo):
            movemark = repo[b'.'].node()

    return node, movemark, None


def _destupdatebook(repo, clean):
    """decide on an update destination from active bookmark"""
    # we also move the active bookmark, if any
    node = None
    activemark, movemar