HEX

File: //lib/python3/dist-packages/mercurial/__pycache__/ancestor.cpython-310.pyc
o

�]Lb2�@szddlmZddlZddlmZddlmZmZmZe�	d�Z
dd�Zd	d
�ZGdd�de
�Zd
d�ZGdd�de
�ZdS)�)�absolute_importN�)�nullrev)�dagop�policy�pycompat�parserscGs�t|t�s	t|�}t|vrt�St|�dkr|Sdt|�>d}dgt|�d}t|�D]
\}}d|>||<q-d|d>}t�}t|�}t|�d}	|	dkr�|r�|	}
|	d8}	||
s\qK||
}||kr||d8}||kr||�|
�||O}|
|vr||
hS||kr�||
�D]$}||}
|tkr�q�|
dkr�|||<|d7}q�|
|kr�|||O<q�n||
�D]}|tkr�q�||}
|
r�|
|kr�|d8}|||<q�|	dkr�|sQ|S)z�Returns a set with the heads of all common ancestors of all nodes,
    heads(::nodes[0] and ::nodes[1] and ...) .

    pfunc must return a list of parent vertices for a given vertex.
    rr)�
isinstance�setr�len�max�	enumerate�add)�pfunc�nodes�allseen�seen�i�n�poison�gca�interesting�nv�v�sv�p�sp�r�4/usr/lib/python3/dist-packages/mercurial/ancestor.py�commonancestorsheadss`


��

� rcs4�fdd�}t�g|�R�}t|�dkr|S||�S)z�
    Returns the common ancestors of a and b that are furthest from a
    root (as measured by longest path).

    pfunc must return a list of parent vertices for a given vertex.
    csi}t|�d}dg|}dg|}g}tt|��D]\}}d||<d|>}|||<d||<|�||f�q|d}	|	dkr�t|�dkr�|	}
|	d8}	||
}|dkrSq:||
}�|
�D]o}
|
tkrbq[||
}||
}||kr�|d||
<||kr�||d7<|||
<|r�||d8<||dkr�||=q[||dkr�||B}||kr�q[|||
<|�|d�||d7<||d8<||dkr�||=q[||d8<||dkr�||=|	dkr�t|�dksDt|�dkr�gSd�|D]}�|O�q�fdd�|D�S)Nrrcsh|]
\}}�|@r|�qSrr)�.0rr��krr�	<setcomp>�sz-ancestors.<locals>.deepest.<locals>.<setcomp>)rr
�sorted�appendrr�
setdefault)rr�count�depthr�mappingrr�brr�dvrr�dpr�nsp�rr!r�deepestWsn

���#
zancestors.<locals>.deepestr)rr)r�	orignodesr/rrr.r�	ancestorsOs
8r1c@s@eZdZdZdd�Zdd�Zdd�Zdd	�Zd
d�Zdd
�Z	dS)�incrementalmissingancestorsapersistent state used to calculate missing ancestors incrementally

    Although similar in spirit to lazyancestors below, this is a separate class
    because trying to support contains and missingancestors operations with the
    same internal data structures adds needless complexity.cCs&t|�|_|js|j�t�||_dS�N)r
�basesrrr)�selfrr4rrr�__init__�s

z$incrementalmissingancestors.__init__cCs|jo|jthkS)z0whether the common set has any non-trivial bases)r4r�r5rrr�hasbases�sz$incrementalmissingancestors.hasbasescCs|j�|�dS)z)grow the ancestor set by adding new basesN)r4�update)r5�newbasesrrr�addbases�sz$incrementalmissingancestors.addbasescCst�|j|j�Sr3)r�headrevsr4rr7rrr�
basesheads�sz&incrementalmissingancestors.basesheadscs�|j}|j}|�|�|�t�|sdSt|��t�fdd�|D��}t|�|kr+dSt�	�t
|�dd�D]}||vr=q6|�|�|�||��t|�|krRdSq6dS)z:remove all ancestors of bases from the set revs (in place)Nc3s�|]	}|�krdVqdS)rNr�r �r��startrr�	<genexpr>�s�zBincrementalmissingancestors.removeancestorsfrom.<locals>.<genexpr>r���)r4r�difference_update�discardrr�sumrr�xrange�minr9)r5�revsr4r�	keepcount�currrr@r�removeancestorsfrom�s&


��z/incrementalmissingancestors.removeancestorsfromcCs:t|�}|j}|j}|�|�}|�|�|sgStt|�t|��}g}t�|td�D]l}|s0ng||vrP|�	|�||�D]}	|�
|	�|�|	�|�|	�q=q*||vrc|�|�|�	|�|}
|}n
||vrl|}
|}nq*||�D]$}	|	tkrxqq|	|vs�|	|vr�|�
|	�|�|	�|�|	�qq|
�|	�qqq*|�
�|S)areturn all the ancestors of revs that are not ancestors of self.bases

        This may include elements from revs.

        Equivalent to the revset (::revs - ::self.bases). Revs are returned in
        revision number order, which is a topological order.rC)r
r4r�intersectionrDrrrGr�removerErr%�reverse)r5rI�	revsvisit�
basesvisitr�	bothvisitrA�missingrKr�	thisvisit�
othervisitrrr�missingancestors�sN








�
z,incrementalmissingancestors.missingancestorsN)
�__name__�
__module__�__qualname__�__doc__r6r8r;r=rLrVrrrrr2�sr2ccs6�th}tj}tj}tj}|j}|r$dd�|D�}	|�|�t�|	�n.g}	t�|	�|D]$}
||
�\}}||vrC||	|�||�||vrQ||	|�||�q-|	r�|	d}
|
|kr_dS|
V||
�\}}||vr�|
|dkrx||	d<n||	|�||�n||	�||vr�||	|�||�|	sTdSdS)NcSsg|]}|�qSrrr>rrr�
<listcomp>sz&_lazyancestorsiter.<locals>.<listcomp>rr)r�heapq�heappush�heappop�heapreplacerr9�heapify)�
parentrevs�initrevs�stoprev�	inclusiverr]r^r_�see�visitr?�p1�p2�currentrrr�_lazyancestorsitersJ�

�

�rjc@s2eZdZddd�Zdd�ZeZdd�Zd	d
�ZdS)
�
lazyancestorsrFcsJ||_�fdd�|D�|_�|_||_t�|_t|j|j|j|j�|_dS)a�Create a new object generating ancestors for the given revs. Does
        not generate revs lower than stoprev.

        This is computed lazily starting from revs. The object supports
        iteration and membership.

        cl should be a changelog and revs should be an iterable. inclusive is
        a boolean that indicates whether revs should be included. Revs lower
        than stoprev will not be generated.

        Result does not include the null revision.csg|]}|�kr|�qSrrr>�rcrrr[Nsz*lazyancestors.__init__.<locals>.<listcomp>N)�_parentrevs�	_initrevs�_stoprev�
_inclusiver
�
_containsseenrj�
_containsiter)r5rrIrcrdrrlrr6As
�zlazyancestors.__init__cCs(z	tt|��WdStyYdSw)z*False if the set is empty, True otherwise.TF)�next�iter�
StopIterationr7rrr�__nonzero__Ws�zlazyancestors.__nonzero__cCst|j|j|j|j�S)aGenerate the ancestors of _initrevs in reverse topological order.

        If inclusive is False, yield a sequence of revision numbers starting
        with the parents of each revision in revs, i.e., each revision is
        *not* considered an ancestor of itself. Results are emitted in reverse
        revision number order. That order is also topological: a child is
        always emitted before its parent.

        If inclusive is True, the source revisions are also yielded. The
        reverse revision number order is still enforced.)rjrmrnrorpr7rrr�__iter__as�zlazyancestors.__iter__cCs�|j}||vr	dS|j}|durdS|durdS|j}z	t|�}||�||kr,WdS||kr3WdSqty@d|_YdSw)z5Test whether target is an ancestor of self._initrevs.TNF)rqrrrrsru)r5�targetrrtre�revrrr�__contains__ps,��zlazyancestors.__contains__N)rF)rWrXrYr6rv�__bool__rwrzrrrrrk@s
rk)�
__future__rr\�noder�rrr�	importmodrrr1�objectr2rjrkrrrr�<module>s
9G~,