HEX
Server: Apache
System: Linux pdx1-shared-a1-38 6.6.104-grsec-jammy+ #3 SMP Tue Sep 16 00:28:11 UTC 2025 x86_64
User: mmickelson (3396398)
PHP: 8.1.31
Disabled: NONE
$ pwd: /usr/lib/python3/dist-packages/mercurial/__pycache__/
Upload Files
File: //usr/lib/python3/dist-packages/mercurial/__pycache__/dagop.cpython-310.pyc
o

�]LbF��@sxddlmZddlZddlmZddlmZddlmZm	Z	m
Z
mZmZm
Z
e
jZe
jZdZdd	�Zd@dd�Zd@d
d�Zdd�Z	dAdd�Zdd�Zdd�Zdd�ZdBdd�Zdd�ZGdd�de�Zdd �Zd@d!d"�Zd#d$�Zd@d%d&�Z d'd(�Z!ej"d)d)d*�Gd+d,�d,e��Z#ej"d)d)d*�Gd-d.�d.e��Z$d/d0�Z%d1d2�Z&d3d4�Z'dBd5d6�Z(dCd8d9�Z)d:d;�Z*dBd<d=�Z+d>d?�Z,dS)D�)�absolute_importN�)�attr��nullrev)�error�mdiff�patch�pycompat�scmutil�smartsetlccs6�|durd}|dur
t}|dkrdS|dkrt�d��|r!d}nd}|�|�t|�}g}t|d�}|durAt�|||df�d}	|r�t�|�\}
}||
}
|
|krgt|d�}|durgt�|||df�|
|	k}|rv||krv|
}	|
V|d}
|r�|
|kr�||
�D]}|t	kr�t�||||
f�q�|sEdSdS)a(Walk DAG using 'pfunc' from the given 'revs' nodes

    'pfunc(rev)' should return the parent/child revisions of the given 'rev'
    if 'reverse' is True/False respectively.

    Scan ends at the stopdepth (exlusive) if specified. Revisions found
    earlier than the startdepth are omitted.
    Nrsnegative stopdepth���r)
�maxlogdepthr�ProgrammingError�sort�iter�next�heapq�heappush�heappopr)�pfunc�revs�
startdepth�	stopdepth�reverse�heapsign�irevs�pendingheap�inputrev�lastrev�currev�curdepth�foundnew�pdepth�prev�r%�1/usr/lib/python3/dist-packages/mercurial/dagop.py�_walkrevtreesJ�	



��r'Fc#s��i�g���fdd�}|rd}nd}|D]}||�q�rDt���}��|�}||fV|D]}|��d|�D]}||�q:q0�s�rHJ�dS)z�Like filectx.ancestors(), but can walk from multiple files/revisions,
    and includes the given fctxs themselves

    Yields (rev, {fctx, ...}) pairs in descending order.
    cs<t�|�}|�vrt��|<t��|��|�|�dS�N)r�intrev�setrr�add)�fctx�rev��visit�	visitheapr%r&�addvisit\s


z"filectxancestors.<locals>.addvisitrN)rr�pop�parents)�fctxs�followfirstr1�cut�cr �curfctxs�parentr%r.r&�filectxancestorsSs&�



��r:cCs dd�t||�D�}t|dd�S)z�Like filectx.ancestors(), but can walk from multiple files/revisions,
    and includes the given fctxs themselves

    Returns a smartset.
    css�|]\}}|VqdSr(r%)�.0r-�_csr%r%r&�	<genexpr>z��z#filerevancestors.<locals>.<genexpr>F��iterasc)r:�generatorset)r4r5�genr%r%r&�filerevancestorstsrCcsd|rd�nd��j����fdd���dur�}n��fdd�}|��fdd��}t||||dd�S)	NrcsHz
��|�d��WStjy#dd��|��d��D�YSw)Ncs��|]}|��VqdSr(�r-�r;�pctxr%r%r&r=�r>z7_genrevancestors.<locals>.plainpfunc.<locals>.<genexpr>)�
parentrevsr�WdirUnsupportedr3rE)�clr6�repor%r&�
plainpfunc�s
"�z$_genrevancestors.<locals>.plainpfunccs�fdd��|�D�S)Ncsg|]}�|�s|�qSr%r%�r;�r��cutfuncr%r&�
<listcomp>��z6_genrevancestors.<locals>.<lambda>.<locals>.<listcomp>r%rE)rPrLr%r&�<lambda>�sz"_genrevancestors.<locals>.<lambda>cs
�|�Sr(r%rErOr%r&rS�s
T�r)�	changelog�filterr')rKrr5rrrPrr%)rJr6rPrLrKr&�_genrevancestors~srWcCst||||||�}t|dd�S)a�Like revlog.ancestors(), but supports additional options, includes
    the given revs themselves, and returns a smartset

    Scan ends at the stopdepth (exlusive) if specified. Revisions found
    earlier than the startdepth are omitted.

    If cutfunc is provided, it will be used to cut the traversal of the DAG.
    When cutfunc(X) returns True, the DAG traversal stops - revision X and
    X's ancestors in the traversal path will be skipped. This could be an
    optimization sometimes.

    Note: if Y is an ancestor of X, cutfunc(X) returning True does not
    necessarily mean Y will also be cut. Usually cutfunc(Y) also wants to
    return True in this case. For example,

        D     # revancestors(repo, D, cutfunc=lambda rev: rev == B)
        |\    # will include "A", because the path D -> C -> A was not cut.
        B C   # If "B" gets cut, "A" might want to be cut too.
        |/
        A
    Fr?)rWrA)rKrr5rrrPrBr%r%r&�revancestors�s�rXc	cs��|rd}nd}|j}|��}|tkr |V|D]}|VqdSt|�}|�|�D](}||vr3|Vq)|�|�d|�D]}|tkrP||vrP|�|�|Vnq<q)dS)Nr)rU�minrr*rrHr+)	rKrr5r6rJ�first�i�seen�xr%r%r&�_genrevdescendants�s.��
��r^cCs�|j}dd�t�|t|��D�}|�|d�D])}|�|�\}}||kr-|||�|�|s@|tkr@||kr@|||�|�q|S)z6Build map of 'rev -> child revs', offset from startrevcSsg|]}g�qSr%r%)r;�_revr%r%r&rQ�sz(_builddescendantsmap.<locals>.<listcomp>r)rUr
�xrange�lenrrH�appendr)rK�startrevr5rJ�descmapr �p1rev�p2revr%r%r&�_builddescendantsmap�s�rgcs4|���t|�|����fdd�}t||||dd�S)Ncs�|�Sr(r%rE�rdrcr%r&r�sz(_genrevdescendantsofdepth.<locals>.pfuncFrT)rYrgr')rKrr5rrrr%rhr&�_genrevdescendantsofdepth�sricCsB|dur|dus|tkrt|||�}nt|||||�}t|dd�S)z�Like revlog.descendants() but supports additional options, includes
    the given revs themselves, and returns a smartset

    Scan ends at the stopdepth (exlusive) if specified. Revisions found
    earlier than the startdepth are omitted.
    NTr?)rr^rirA)rKrr5rrrBr%r%r&�revdescendants�s
�rjccsz�t|�}|tkr|�D]}|VqdSt|�}||dd�D]}||�D]}|tkr9||vr9|�|�|Vnq%qdS)akGenerate revision number descendants in revision order.

    Yields revision numbers starting with a child of some rev in
    ``revs``. Results are ordered by revision number and are
    therefore topological. Each revision is not considered a descendant
    of itself.

    ``revsfn`` is a callable that with no argument iterates over all
    revision numbers and with a ``start`` argument iterates over revision
    numbers beginning with that value.

    ``parentrevsfn`` is a callable that receives a revision number and
    returns an iterable of parent revision numbers, whose values may include
    nullrev.
    Nr��start)rYrr*r+)r�revsfn�parentrevsfnrZr-r\r$r%r%r&�descendantrevs�s�

��roc@sBeZdZdZddd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dS)�subsetparentswalkeraScan adjacent ancestors in the graph given by the subset

    This computes parent-child relations in the sub graph filtered by
    a revset. Primary use case is to draw a revisions graph.

    In the following example, we consider that the node 'f' has edges to all
    ancestor nodes, but redundant paths are eliminated. The edge 'f'->'b'
    is eliminated because there is a path 'f'->'c'->'b' for example.

          - d - e -
         /         \
        a - b - c - f

    If the node 'c' is filtered out, the edge 'f'->'b' is activated.

          - d - e -
         /         \
        a - b -(c)- f

    Likewise, if 'd' and 'e' are filtered out, this edge is fully eliminated
    since there is a path 'f'->'c'->'b'->'a' for 'f'->'a'.

           (d) (e)

        a - b - c - f

    Implementation-wise, 'f' is passed down to 'a' as unresolved through the
    'f'->'e'->'d'->'a' path, whereas we do also remember that 'f' has already
    been resolved while walking down the 'f'->'c'->'b'->'a' path. When
    processing the node 'a', the unresolved 'f'->'a' path is eliminated as
    the 'f' end is marked as resolved.

    Ancestors are searched from the tipmost revision in the subset so the
    results can be cached. You should specify startrev to narrow the search
    space to ':startrev'.
    NcCs�|dur|�d|�|@}|j}|r|�}n|��s(|��s(t�|�}|jdd�t|�}||_|j	|_
||_g|_i|_
i|_i|_t|_||_t|_|��dS)Ns%d:nullTrT)r�fastdesc�isdescending�istopor�basesetrr�_reporU�
_changelog�_subset�_tovisit�_pendingcnt�	_pointers�_parentsr�
_inputhead�
_inputtail�
_bottomrev�
_advanceinput)�selfrK�subsetrcrq�desciterr%r%r&�__init__9s(
zsubsetparentswalker.__init__cCst�|�|��S)zVLook up parents of the given revision in the subset, and returns
        as a smartset)rrtr3�r�r-r%r%r&�
parentssetVszsubsetparentswalker.parentssetcCs&|�|�dd�t|j�|g��D�S)z�Look up parents of the given revision in the subset

        The returned revisions are sorted by parent index (p1/p2).
        cSsg|]\}}|�qSr%r%)r;�_crNr%r%r&rQa�z/subsetparentswalker.parents.<locals>.<listcomp>)�_scanparents�sortedr{�getr�r%r%r&r3[s
zsubsetparentswalker.parentscCs^z|j�|�}|dtkr|dd�WS|WStjy.tdd�|jd��D��YSw)Nr
csrDr(rErFr%r%r&r=jr>z2subsetparentswalker._parentrevs.<locals>.<genexpr>)rvrHrrrI�tuplerur3)r�r-rr%r%r&�_parentrevscs �zsubsetparentswalker._parentrevscCsH|jtkrdSz	t|j�|_WdSty#|j|_td|_YdSw)zBAdvance the input iterator and set the next revision to _inputheadNr)r|rrr}�
StopIterationr~)r�r%r%r&rls
�z!subsetparentswalker._advanceinputcs|j�|j}|j�|j}|j}|s|jtk�r
��|�dkr dS|s.t�	||j�|�
�|j|dkrJt�	||j�|�
�|j|dks6t�|�}||jkrWdS|�vr`||vr`q|�v}��
|d�|rv||vsrJ�g||<|�|it�f�\}}|r�|��D]-\}	}
�|	d8<�|	dks�J�|	|vr�q�||	�|
|f��|	dkr�|�|	�q�|���fdd�|D�}|�|�}t�fdd�|D��}|r�|s�|�r{t|�dkr�||fg}
n1||f|��|��fg}
|D]"}	�|	d7<|
dd|	d7<|
dd|	d	7<q�t|�D]`\}}||k�s%J�t�	||�||v�rs||\}}|
|\}}|��D]*\}	}
|	|v�rf�|	d8<�|	dk�s[J�t|
||	�||	<�qA|
||	<�qA|�|��q|
|||<�qt|�dk�r�d
gndd	g}|�r�|�r�t|�D]\}}||}
||�|
|f��q��|dk�s�J�nQ|�rt|�D]7\}}||\}}||v�s�J�||}
|�v�r�||�|
|f�|�|��q��|d7<|
||<�q�d�|k�r�dk�sJ�J�|s|jtksdSdS)zNScan ancestors until the parents of the specified stoprev are
        resolvedrNrcsh|]
}�|dkr|�qS)rr%rM)�
pendingcntr%r&�	<setcomp>��z3subsetparentswalker._scanparents.<locals>.<setcomp>c3s�|]}|�vVqdSr(r%�r;�p)r�r%r&r=�r>z3subsetparentswalker._scanparents.<locals>.<genexpr>�1�2��)rwrxryrzr{r|rr�rrrrr~�
setdefaultr2r*�itemsrbr+�clearr��allra�copy�	enumeraterY�update)r��stoprev�tovisit�pointersr3r-�	curactive�
unresolved�resolvedrNr7rH�bothparentsactive�parentpointersr[r��knownunresolved�
knownresolved�
chaincodesr%)r�r�r&r�vs��

�
�


$�z subsetparentswalker._scanparentsr()
�__name__�
__module__�__qualname__�__doc__r�r�r3r�rr�r%r%r%r&rps
%	
rpcCs�|sgSt|�}t|�}t�}i}|j}|j}	|j}
|rE|
�}||vr*||�|s*q||�}|||<|D]}
|
|krB|
|vrB|	|
�q4|s|sJt�S|sN|St|�D]}||D]
}
|
|vrb||�qXqR|S�zSee revlog.reachableroots)r*�listr+rbr2rtr�)r�minroot�roots�heads�includepathr/�	reachabler\�reached�dovisit�	nextvisitr-r3r9r%r%r&�_reachablerootspuresB����r�cCsH|st�S|��}t|�}t|�}|j�||||�}t|�}|��|Sr�)rtrYr�rU�reachablerootsr)rKr�r�r�r�rr%r%r&r�(sr�cCs@t�|��|��|�}t�||�\}}tdd�|D��}||fS)z�Return `(diffinrange, linerange1)` where `diffinrange` is True
    if diff from fctx2 to fctx1 has changes in linerange2 and
    `linerange1` is the new line range for fctx1.
    css�|]	\}}|dkVqdS)�!Nr%)r;�_�styper%r%r&r=<s�z _changesrange.<locals>.<genexpr>)r�	allblocks�data�
blocksinrange�any)�fctx1�fctx2�
linerange2�diffopts�blocks�filteredblocks�
linerange1�diffinranger%r%r&�
_changesrange5sr�c
cs��t�|jj�}|��}|��|��f|||ffi}|rr|�t|��\}}|�	�}|r1|dd�}|s9||fVqd}	|D])}
t
|
|||�\}}|	pK|}	|d|dkrUq=|��|
_|
|f||
��|
��f<q=|	rn||fV|sdSdS)zgYield ancestors of `fctx` with respect to the block of lines within
    `fromline`-`toline` range.
    NrFr)
r	r�ru�ui�introfilectx�linkrev�filenoder2�maxr3r�r-�_descendantrev)
r,�fromline�toliner5r�r/r7r��pl�inranger��inrangepr�r%r%r&�blockancestors@s.�


�r�c
cs8�ztt|||��\}}Wn	tyYn
w||kr ||fVt�|jj�}|��}|��|||ffi}|�	|��g�D]\}|�
|�}d}	|�|�D]F}
z||
\}}Wn	ty^YqKwt
||||�\}
}|	pk|
}	||vr�||d|kr�t|||d�\}}t|�t|�f}||f||<qK|	r�||fVq=dS)ziYield descendants of `fctx` with respect to the block of lines within
    `fromline`-`toline` range.
    FrN)rr�r�r	r�rur��filelog�filerev�descendants�filectxrH�KeyErrorr��ziprYr�)r,r�r�r7r�r��flr\r[r�r]r�r�r��lbs�ubsr%r%r&�blockdescendantsbs<��

�
��r�T)�slots�frozenc@s4eZdZe��Ze��Zejdd�Zejdd�ZdS)�annotatelineF)�defaultN)	r�r�r�r�ibr,�lineno�skip�textr%r%r%r&r��s
r�c@s,eZdZe��Ze��Ze��Ze��ZdS)�_annotatedfileN)	r�r�r�rr�r4�linenos�skipsr�r%r%r%r&r��s
r�cCs*|�d�r
|�d�S|�d�tt|��S)N�
)�endswith�count�int�bool)r�r%r%r&�_countlines�s

r�cCs2t|�}t�d|d�}t|g||dg||�S)NrF)r�r
�	rangelistr�)r�r,�nr�r%r%r&�_decoratelines�sr�cs���fdd�|D�}|rdd�|D�}|D]7\}}|D]0\\}}	}
}}|dkrK|j||	��j|
|�<|j||	��j|
|�<|j||	��j|
|�<qq|r�|��dd�|D�}
t|�D]W\}\}}|D]N\\}}	}
}}|	|||
kr�t�|
|�D])}�j||kr�t|||
|	d�}|j|�j|<|j|�j|<d�j|<q|qf|
|d�||	|
|f�qfq^|
D]=\}}|D]6\}}	}
}t�|
|�D])}�j||kr�t|||
|	d�}|j|�j|<|j|�j|<d�j|<q�q�q��S)ap
    Given parent and child fctxes and annotate data for parents, for all lines
    in either parent that match the child, annotate the child with the parent's
    data.

    Additionally, if `skipchild` is True, replace all other lines with parent
    annotate data as well such that child is never blamed for any lines.

    See test-annotate.py for unit tests.
    cs$g|]}|tj|j�j�d�f�qS))�opts)rr�r�)r;r9��childr�r%r&rQ�s��z!_annotatepair.<locals>.<listcomp>cSsg|]
\}}|t|�f�qSr%)r�)r;r�r�r%r%r&rQ�r��=cSsg|]\}}|gf�qSr%r%)r;r9�_blocksr%r%r&rQ�rRrT)	r4r�r�rr�r
r`rYrb)r3�	childfctxr��	skipchildr��pblocksr9r��a1�a2�b1�b2�t�	remaining�idx�_t�bk�akr%r�r&�
_annotatepair�sR���

���

���rcs�|g}i}|di}|r6|��}||vrq	||�}|||<|D]}	|�|	d�d||	<|	|vr3|�|	�q|s|g|dd�<i�|r�|d}|�vrN|��q?d}
||}|D]
}	|	�vrcd}
|�|	�qV|
r�|��t|��|�}d}|dur||j|v}t�fdd�|D�||||�}|D]}	||	dkr��|	=||	=q�||	d8<q�|�|<||=|sA�|}
d	d�t|
j|
j	|
j
t�|
j
��D�S)
zrCore algorithm for filectx.annotate()

    `parents(fctx)` is a function returning a list of parent filectxs.
    rrNr
TFcsg|]}�|�qSr%r%r���histr%r&rQr�zannotate.<locals>.<listcomp>cSsg|]}t|��qSr%)r�rMr%r%r&rQ+s��)r2r�rbr�r��	_changeidrr�r4r�r�r�
splitnewlinesr�)�baser3�skiprevsr�r/�pcache�needed�fr�r��ready�currr��ar%rr&�annotate�sd
��
�
���rr%c#s&�|jdd�t|�}g|fg}g}t�}t�|�tj}tj}|D]�}	|	|vr3|||	�|�|	�d��|	kr�||��|����fdd�t|�D�}
|
r||
�	d�}||\}}
|
D]}||}|�
|d�|
|dO}
q]t|
�D]}||=qunt|�}|�
g�hf�||}�|	kr�|d�
��|d���dd�|��D�}|d�|�|D]}||vr�|�|�|||�q�|s�t|�dkr�d}|d}n|d|@s�d}|dur�||dO}|dD]}|Vq�|r�||=ng|ddd�<�|	ks9q"|D]}|dD]}|V�q�qdS)	a"Yield revisions from heads to roots one (topo) branch at a time.

    This function aims to be used by a graph generator that wishes to minimize
    the number of parallel branches and their interleaving.

    Example iteration order (numbers show the "true" order in a changelog):

      o  4
      |
      o  1
      |
      | o  3
      | |
      | o  2
      |/
      o  0

    Note that the ancestors of merges are understood by the current
    algorithm to be on the same branch. This means no reordering will
    occur behind a merge.
    TrTNcs g|]\}}�|dvr|�qS)rr%)r;r[�grEr%r&rQ�s ztoposort.<locals>.<listcomp>rrcSsg|]}|tkr|�qSr%rr�r%r%r&rQ�rR)rr*r�heapifyrrr+�remover�r2�extend�reversedrarbr�)r�parentsfunc�firstbranch�	unblocked�groupsr�
pendingsetrr�
currentrev�matching�	targetidx�trevs�tparentsr[�grr3r�rNrr%rEr&�toposort1s|�3	





�
�
���^
��r#cCs8t|�}th}|j}|D]}|||��q|�|�|S)a�Resolve the set of heads from a set of revisions.

    Receives an iterable of revision numbers and a callbable that receives a
    revision number and returns an iterable of parent revision numbers, possibly
    including nullrev.

    Returns a set of revision numbers that are DAG heads within the passed
    subset.

    ``nullrev`` is never included in the returned set, even if it is provided in
    the input set.
    )r*rr��difference_update)r�	parentsfn�headrevsr3�upr-r%r%r&r&�s

r&cCs�|durt}t|p
g�}|h}|h}||dd�D](}||�D]!}||vr3||vr.|�|�|�|�||vr@||vr@|�|�qq|S)a�Returns the set of all revs that have no children with control.

    ``revsfn`` is a callable that with no arguments returns an iterator over
    all revision numbers in topological order. With a ``start`` argument, it
    returns revision numbers starting at that number.

    ``parentrevsfn`` is a callable receiving a revision number and returns an
    iterable of parent revision numbers, where values can include nullrev.

    ``startrev`` is a revision number at which to start the search.

    ``stoprevs`` is an iterable of revision numbers that, when encountered,
    will stop DAG traversal beyond them. Parents of revisions in this
    collection will be heads.
    Nrrk)rr*r+r)rmrnrc�stoprevsr�r�r-r$r%r%r&�headrevssubsets 


��	r)cCs�ttt||�dd��}t�}g}|rQ|��}|dkr.|d}||vr-|�|�|�|�n!|�|d�||�D]}|tksH||vsH||vrIq:|�|�q:|st|�t|�ks[J�|S)a�Linearize and topologically sort a list of revisions.

    The linearization process tries to create long runs of revs where a child
    rev comes immediately after its first parent. This is done by visiting the
    heads of the revs in inverse topological order, and for each visited rev,
    visiting its second parent, then its first parent, then adding the rev
    itself to the output list.

    Returns a list of revision numbers.
    TrTrr)	r�r�r&r*r2rbr+rra)rr%r/�finished�resultr-r$r%r%r&�	linearize4s&


��r,)F)FNNN)NN)r%)-�
__future__rr�
thirdpartyr�noder�rrr	r
rrrtrArr'r:rCrWrXr^rgrirjro�objectrpr�r�r�r�r��sr�r�r�r�rrr#r&r)r,r%r%r%r&�<module>sN 	
5
!

�

 r
$
"(	
F
BH
%
@ Telegram