/
lib64
/
python3.9
/
site-packages
/
mercurial
/
__pycache__
/
Upload File
HOME
a �+�b2 � @ sz d dl mZ d dlZddlmZ ddlmZmZmZ e� d�Z dd� Z d d � Z G d d � d e �Zd d� ZG dd� de �ZdS )� )�absolute_importN� )�nullrev)�dagop�policy�pycompat�parsersc G s� t |t�st|�}t|v r t� S t|�dkr0|S dt|�> d }dgt|�d }t|�D ]\}}d|> ||< qZd|d > }t� }t|�}t|�d } | dk�r�|�r�| } | d8 } || s�q�|| } | |k r�|d8 }| |kr�|�| � | |O } | |v r�| hS | |k �rd| | �D ]R} || } | tk�r(�q| dk�rD| || < |d7 }n| | k�r|| | O < �qq�| | �D ]<} | tk�r~�ql|| } | �r�| |k �r�|d8 }| || < �qlq�|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. r r )� isinstance�setr �len�max� enumerate�add)�pfunc�nodesZallseen�seen�i�nZpoison�gca� interesting�nv�v�sv�p�sp� r �8/usr/lib64/python3.9/site-packages/mercurial/ancestor.py�commonancestorsheads sZ r c s4 � 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. c s i }t | �d }dg| }dg| }g }tt| ��D ]6\}}d||< d|> }|||< d||< |�||f� q4|d } | dk�r�t|�dk�r�| } | d8 } || } | dkr�qt|| } �| �D ]�} | tkr�q�|| }|| }|| k�r<| d || < || k�r�|| d7 < | || < |�r�|| d8 < || dk�r�||= q�| |d kr�|| B }||k�r\q�||| < |�|d� || d7 < || d8 < || dkr�||= q�|| d8 < || dkrt|| = qtt|�dk�r�g S d� |D ]}� |O � �q� fdd�|D �S )Nr r c s h | ]\}}� |@ r|�qS r r )�.0r r ��kr r � <setcomp>� � z-ancestors.<locals>.deepest.<locals>.<setcomp>)r r �sorted�appendr r � setdefault)r r �count�depthr �mappingr r �br r Zdvr r Zdpr Znsp�r r r �deepestW sh zancestors.<locals>.deepestr )r r )r Z orignodesr+ r r r* r � ancestorsO s 8 r, c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dS )�incrementalmissingancestorsa persistent 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.c C s& t |�| _| js | j�t� || _d S �N)r �basesr r r )�selfr r/ r r r �__init__� s z$incrementalmissingancestors.__init__c C s | j o| j thkS )z0whether the common set has any non-trivial bases)r/ r �r0 r r r �hasbases� s z$incrementalmissingancestors.hasbasesc C s | j �|� dS )z)grow the ancestor set by adding new basesN)r/ �update)r0 Znewbasesr r r �addbases� s z$incrementalmissingancestors.addbasesc C s t �| j| j�S r. )r Zheadrevsr/ r r2 r r r � basesheads� s z&incrementalmissingancestors.basesheadsc s� | j }| j}|�|� |�t� |s(dS t|�� t� fdd�|D ��}t|�|krVdS t� � t |�d d�D ]6}||vrzql|�|� |� ||�� t|�|krl q�qldS )z:remove all ancestors of bases from the set revs (in place)Nc 3 s | ]}|� krd V qdS )r Nr �r �r��startr r � <genexpr>� r" zBincrementalmissingancestors.removeancestorsfrom.<locals>.<genexpr>r ���) r/ r �difference_update�discardr r �sumr r �xrange�minr4 )r0 �revsr/ r Z keepcount�currr r9 r �removeancestorsfrom� s" z/incrementalmissingancestors.removeancestorsfromc C s@ t |�}| j}| j}|�|�}|�|� |s0g S tt|�t|��}g }t�|td�D ]�}|sb �q4||v r�|� |� ||�D ]"} |� | � |� | � |� | � q|qT||v r�|� |� |� |� |} |} n||v rT|} |} nqT||�D ]L} | tkr�q�| | v �s| |v �r&|� | � |� | � |� | � q�| � | � q�qT|� � |S )a return 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.r< )r r/ r � intersectionr= r r r@ r �remover> r r$ �reverse) r0 rB Z revsvisitZ basesvisitr Z bothvisitr: �missingrC r Z thisvisitZ othervisitr r r �missingancestors� sL z,incrementalmissingancestors.missingancestorsN) �__name__� __module__� __qualname__�__doc__r1 r3 r5 r6 rD rI r r r r r- � s r- c c s2 t h}tj}tj}tj}|j}|rFdd� |D �} |�|� t�| � n\g } t�| � |D ]H} | | �\} } | |vr�|| | � || � | |vrX|| | � || � qX| �r.| d } | |k r��q.| V | | �\} } | |v�r| | dkr�| | d< n || | � || � n|| � | |vr�|| | � || � q�d S )Nc S s g | ] }| �qS r r r7 r r r � <listcomp> r" z&_lazyancestorsiter.<locals>.<listcomp>r r )r �heapq�heappush�heappop� heapreplacer r4 �heapify)Z parentrevsZinitrevs�stoprev� inclusiver rP rQ rR �seeZvisitr8 Zp1Zp2�currentr r r �_lazyancestorsiter sD rX c @ s2 e Zd Zd dd�Zdd� ZeZdd� Zd d � Zd S ) � lazyancestorsr Fc sJ || _ � 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.c s g | ]}|� kr|�qS r r r7 �rT r r rN N r" z*lazyancestors.__init__.<locals>.<listcomp>N)� _parentrevs� _initrevs�_stoprev� _inclusiver � _containsseenrX � _containsiter)r0 r rB rT rU r rZ r r1 A s �zlazyancestors.__init__c C s, zt t| �� W dS ty& Y dS 0 dS )z*False if the set is empty, True otherwise.TFN)�next�iter� StopIterationr2 r r r � __nonzero__W s zlazyancestors.__nonzero__c C s t | j| j| j| j�S )a Generate 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.)rX r[ r\ r] r^ r2 r r r �__iter__a s �zlazyancestors.__iter__c C s� | j }||v rdS | j}|du r$dS |du r0dS |j}z2t|�}||� ||krVW dS ||k r8W dS q8W n ty� d| _Y dS 0 dS )z5Test whether target is an ancestor of self._initrevs.TNF)r_ r` r ra rc )r0 �targetr rb rV Zrevr r r � __contains__p s& zlazyancestors.__contains__N)r F)rJ rK rL r1 rd �__bool__re rg r r r r rY @ s rY )Z __future__r rO Znoder � r r r Z importmodr r r, �objectr- rX rY r r r r �<module> s 9G~,