Dashboard
PHP:
8.2.30
OS:
Linux
User:
dh_nv8b2m
/
/
usr
/
lib
/
python3
/
dist-packages
/
mercurial
/
__pycache__
📤 Upload
📝 New File
📁 New Folder
Close
Editing: ancestor.cpython-310.pyc
o �]Lb2 � @ 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�s t|�}t|v rt� S t|�dkr|S dt|�> d }dgt|�d }t|�D ] \}}d|> ||< q-d|d > }t� }t|�}t|�d } | dkr�|r�| } | d8 } || s\qK|| } | |k r||d8 }| |kr||�| � | |O } | |v r|| hS | |k r�| | �D ]$} || } | tkr�q�| dkr�| || < |d7 }q�| | kr�|| | O < q�n | | �D ]} | tkr�q�|| } | r�| |k r�|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. r r )� 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�commonancestorsheads s` �� � 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 ]\}}d||< d|> }|||< d||< |�||f� q|d } | dkr�t|�dkr�| } | d8 } || } | dkrSq:|| } �| �D ]o} | tkrbq[|| }|| }|| kr�| d || < || kr�|| d7 < | || < |r�|| d8 < || dkr�||= q[| |d kr�|| B }||kr�q[||| < |�|d� || d7 < || d8 < || dkr�||= q[|| d8 < || dkr�|| = | dkr�t|�dksDt|�dkr�g S d� |D ]}� |O � q� fdd�|D �S )Nr r c s h | ] \}}� |@ r|�qS r r )�.0r r ��kr r � <setcomp>� s z-ancestors.<locals>.deepest.<locals>.<setcomp>)r r �sorted�appendr r � setdefault)r r �count�depthr �mappingr r �br r �dvr r �dpr �nsp�r r! r �deepestW sn � � � # zancestors.<locals>.deepestr )r r )r � orignodesr/ r r r. r � ancestorsO s 8 r1 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 r4 r r r �__init__� s z$incrementalmissingancestors.__init__c C s | j o| j thkS )z0whether the common set has any non-trivial bases)r4 r �r5 r r r �hasbases� s z$incrementalmissingancestors.hasbasesc C s | j �|� dS )z)grow the ancestor set by adding new basesN)r4 �update)r5 �newbasesr r r �addbases� s z$incrementalmissingancestors.addbasesc C s t �| j| j�S r3 )r �headrevsr4 r r7 r r r � basesheads� s z&incrementalmissingancestors.basesheadsc s� | j }| j}|�|� |�t� |sdS t|�� t� fdd�|D ��}t|�|kr+dS t� � t |�d d�D ] }||vr=q6|�|� |� ||�� t|�|krR dS q6dS )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>� s � zBincrementalmissingancestors.removeancestorsfrom.<locals>.<genexpr>r ���) r4 r �difference_update�discardr r �sumr r �xrange�minr9 )r5 �revsr4 r � keepcount�currr r@ r �removeancestorsfrom� s& ��z/incrementalmissingancestors.removeancestorsfromc C s: t |�}| j}| j}|�|�}|�|� |sg S tt|�t|��}g }t�|td�D ]l}|s0 ng||v rP|� |� ||�D ]} |� | � |� | � |� | � q=q*||v rc|� |� |� |� |} |} n ||v rl|} |} nq*||�D ]$} | tkrxqq| | v s�| |v r�|� | � |� | � |� | � qq| � | � qqq*|� � |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.rC )r r4 r � intersectionrD r r rG r �removerE r r% �reverse) r5 rI � revsvisit� basesvisitr � bothvisitrA �missingrK r � thisvisit� othervisitr r r �missingancestors� sN � z,incrementalmissingancestors.missingancestorsN) �__name__� __module__� __qualname__�__doc__r6 r8 r; r= rL rV r r r r r2 � s r2 c c s6 � t h}tj}tj}tj}|j}|r$dd� |D �} |�|� t�| � n.g } t�| � |D ]$} | | �\} } | |vrC|| | � || � | |vrQ|| | � || � q-| r�| d } | |k r_d S | V | | �\} } | |vr�| | dkrx| | d< n|| | � || � n|| � | |vr�|| | � || � | sTd S d S )Nc S s g | ]}| �qS r r r> r r r � <listcomp> s z&_lazyancestorsiter.<locals>.<listcomp>r r )r �heapq�heappush�heappop� heapreplacer r9 �heapify)� parentrevs�initrevs�stoprev� inclusiver r] r^ r_ �see�visitr? �p1�p2�currentr r r �_lazyancestorsiter sJ � � �rj 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 r> �rc r r r[ N s z*lazyancestors.__init__.<locals>.<listcomp>N)� _parentrevs� _initrevs�_stoprev� _inclusiver � _containsseenrj � _containsiter)r5 r rI rc rd r rl r r6 A s �zlazyancestors.__init__c C s( z t t| �� W dS ty Y dS w )z*False if the set is empty, True otherwise.TF)�next�iter� StopIterationr7 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.)rj rm rn ro rp r7 r r r �__iter__a s �zlazyancestors.__iter__c C s� | j }||v r dS | j}|du rdS |du rdS |j}z t|�}||� ||kr,W dS ||k r3W dS q ty@ d| _Y dS w )z5Test whether target is an ancestor of self._initrevs.TNF)rq rr r rs ru )r5 �targetr rt re �revr r r � __contains__p s, � �zlazyancestors.__contains__N)r F)rW rX rY r6 rv �__bool__rw rz r r r r rk @ s rk )� __future__r r\ �noder � r r r � importmodr r r1 �objectr2 rj rk r r r r �<module> s 9G~,
Save
Cancel