/
lib64
/
python3.9
/
site-packages
/
mercurial
/
__pycache__
/
Upload File
HOME
a �+�bC � @ s� d Z ddlmZ ddlmZ ddlmZ ddlmZm Z m Z m Z dZ dZ d Zd Ze d ed ed iZdd� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � ZejG d d!� d!e��Z d"d#� Z d$d%� Z d S )&a> supports walking the history as DAGs suitable for graphical output The most basic format we use is that of:: (id, type, data, [parentids]) The node and parent ids are arbitrary integers which identify a node in the context of the graph returned. Type is a constant specifying the node type. Data depends on type. � )�absolute_import� )�nullrev)�attr)�dagop�pycompat�smartset�util� C� P� G� M� |� :Nc # s� i }�D ]�}| | }�fdd�|� � D �� � fdd�|� � D �}dd� t� �D �}|D ]�}|�|�}|du r�t�tj�s�t����ttt�| �|g��� }||< |s�|� t |f� � � |� qV|� � fdd�|D �� � � |� qV|�� t||fV qdS ) a� cset DAG generator yielding (id, CHANGESET, ctx, [parentinfo]) tuples This generator function walks through revisions (which should be ordered from bigger to lower). It returns a tuple for each node. Each parentinfo entry is a tuple with (edgetype, parentid), where edgetype is one of PARENT, GRANDPARENT or MISSINGPARENT. The node and parent ids are arbitrary integers which identify a node in the context of the graph returned. c s h | ]}|� � � v r|� � �qS � ��rev��.0�p)�revsr �8/usr/lib64/python3.9/site-packages/mercurial/graphmod.py� <setcomp>= � z dagwalker.<locals>.<setcomp>c s, g | ]$}|� � tkr|� � � vr|� � �qS r )r r r ��psetr r � <listcomp>> s �z dagwalker.<locals>.<listcomp>c S s g | ] }t |f�qS r )�PARENTr r r r r C r Nc 3 s | ]}|� vrt |fV qd S �N)� GRANDPARENT)r �gr r r � <genexpr>S r z dagwalker.<locals>.<genexpr>)�parents�sorted�get� isinstancer Zbaseset�setr Zreachableroots�append� MISSINGPARENT�add�extend�updater � CHANGESET) �repor Zgpcacher �ctxZmparsr" ZmparZgpr )r r r � dagwalker* s, � � r/ c # sJ t |�� |D ]8}| | }� fdd�|�� D �}|�� t|t|�fV q dS )z�cset DAG generator yielding (id, CHANGESET, ctx, [parentids]) tuples This generator function walks the given nodes. It only returns parents that are in nodes, too. c s$ h | ] }|� � � v rt|�� f�qS r )�noder r r �Zincluder r r b s znodes.<locals>.<setcomp>N)r& r" r r, r# )r- �nodesr0 r. r" r r1 r r2 Y s �r2 c # s g }i }d}i � �j �d�D ]f\}}d|v r |�dd�\}}|dkrb|�� rbt|�� �|i �|< q |dkr |�� r |� �|i �|< q � r�t�� �fdd��} ndd� } | D �]b\} } } } | |vr�|� | � ||| < |d7 }|� | �}|� | �}|d d � ��fd d �| D �}|�||d �< t |�D ]*\}}|�s<|||< n|||< |d7 }�q$g }t |�D ]�\}}|�v �r�| |�}|� |�� |�|| |� dd �|� dd �f� nL|| k�r\| D ]<\}}| |�}|� |�� |�||� dd �|� dd �f� �q��q\| | | ||f|fV �}q�d S )ax annotates a DAG with colored edge information For each DAG node this function emits tuples:: (id, type, data, (col, color), [(col, nextcol, color)]) with the following new elements: - Tuple (col, color) with column and color index for the current node - A list of tuples indicating the edges between the current node and its parents. r s graph� .s widths colorc s � � �| �� i �S r )r$ �branchr )�configr- r r �<lambda>� r zcolored.<locals>.<lambda>c S s i S r r r r r r r6 � r Nc s g | ]\}}|� vr|�qS r r )r �ptr )�nextr r r � r zcolored.<locals>.<listcomp>���r )�uiZ configitems�rsplit�isdigit�int� setdefault�isalnumr Z lrucachefuncr' �index�pop� enumerater$ )Zdagr- �seenZcolorsZnewcolor�key�valr4 ZsettingZgetconfZcur�type�datar" �colZcolorZ addparents�ir �edgesZecolZeidZbconf�ptyper )r5 r8 r- r �coloredh sp � �� �� rL c # s� |j }||vr|�|� |�|��g }g }|D ]D\}} | |kr@q.| |v rT|�| � q.|�| � |j�|d�|j| < q.t|�} d| d } |dd� � |� ��d �< � �fdd�|D �} � |dd�< t|�dk�r4| ���f� | ���d f� d} | d7 } | || �| | | ffV d}�d7 �| d7 } g } |d= q�t|�dk�rP| ���f� t|�dk�rp| ���d f� t� �| } | dk�r�| d7 } |j�|d� | || �| | | ffV dS ) z9adds edge info to changelog DAG walk suitable for ascii()r r � Nc s g | ]}�� � |�f�qS r )r@ r �ZnextseenZnodeidxr r r � r z asciiedges.<locals>.<listcomp>� \r )rC r' r@ �stylesr$ rJ �lenrA )rF �char�stater r" rC Z knownparentsZ newparentsrK �parent�ncols�widthrJ Z nmorecolsr rN r � asciiedges� sN rW c C s2 t | �D ]$\}\}}||kr||d f| |< qd S )Nr )rB )rJ rI �start�endr r r �_fixlongrightedges� s rZ c C s� |rr||krr|dkrr|dkr\t |d |�}| |d |d d � }|�ddg|| � |S ddg|| d S n*|| d } | dkr�| | d d � S g S d S )Nr r9 r rM � /� rO )�maxr* ) �echars�idxZpidxrU �coldiffZpdiffZfix_tailrX �tail� remainderr r r �_getnodelineedgestail� s rc c C s� |D ]�\}}||d kr*d|d| d < q||d krHd|d| d < q||krf| d| |d| < qd| t |�krxqd|d| < ||kr�|| }}td| d d| �D ]}|| dkr�d||< q�qd S )Nr r[ rM rO � +� -)rQ �range)r^ rJ �nodelineZ interlinerX rY rI r r r � _drawedges s rh c C s� | d |d � }||d f|v s,||f|v rL|� | |d |d d � � n|� ddg� || d }|dkr�|� | |d d � � |S )NrM r r\ r )r* )r^ r_ rU rJ �linerb r r r �_getpaddingline s rj c s d|� � vrdS |ddd� }|r8|d du r8|�� q t|�d�d d d�}|jsZdnd}t| �|| k r�| �|dd� � q^|�r�g }g } |�d�} t|| dd� | d �D ].\� } | du r�|�� d � q�| �� d � q�t t | | t| �d d��} | dd� } | | d� D ]t}dgt|�| || d�< t t| ��D ]F� | � d }t|| � �| � < || � k�rvdn || � ||< �qB�q|j�s�d d d �ndd i�t| �D ]4\� }d|v�rƐq�� �fd d �|D �|dd�< �q�dd � |� � D �}|D ]}||= |� |� �q�dS )z�Draw ending lines for missing parent edges None indicates an edge that ends at between this node and the next Replace with a short line ending in ~ and add / lines to any edges to the right. NrM r9 r r � r\ r[ r � ~)r rM c s g | ]}|p�� � d ��qS )r\ �r$ �r �c�rI �mapr r r ` r z$_drawendinglines.<locals>.<listcomp>c S s g | ]\}}|d u r|�qS r r �r r ro r r r r c r ) �valuesrA r] �count� graphshortenrQ r' r@ rB �listrf �items�remove)�linesZextra�edgemaprC rS Z edgecharsZ shift_sizeZminlinesZemptiesZtoshiftZ first_emptyro �targetsZ positionsri �posrx rT r rp r �_drawendinglines5 sD * r} c @ sx e Zd ZdZejde�e�d�Zejde�e �d�Z ejddd�Z ejddd�Z ejde�e j�d�Zejddd�ZdS )� asciistatez State of ascii() graph renderingF)�init�defaultr N)�__name__� __module__� __qualname__�__doc__r ZibZFactoryrv rC �dictrJ � lastcoldiff� lastindex�EDGES�copyrP ru r r r r r~ i s r~ c C s( |D ] \}}| � || �� d � qdS )aX outputs an ASCII graph of a DAG this is a helper function for 'ascii' below. takes the following arguments: - ui to write to - graph data: list of { graph nodes/edges, text } this function can be monkey-patched by extensions to alter graph display without needing to mimic all of the edge-fixup logic in ascii() � N)�write�rstrip)r: ZgraphZlnZlogstrr r r � outputgraphu s r� c s� |\}}}} d| k r dk s&n J �|j |j � } � fdd�| D �} | �dt|| t| � d� � | dkrvt|� t|�dko�| dko�dd� |D �} t|�dko�| } | d |d � }|�|d g� |�t| ||j|| |j| �� | d |d � }t � d| �D ]}|� d � �q|| d }| dk�rNt � |�D ]}|�d d g� �q6nJ| dk�rx|�| |d d |d � � n t � |�D ]}|�d d g� �q�t | |||� |g}| �r�|� t | |||�� |j�r�tdd� |D ���r�|� |� n |� |� | d || d � }t|�t|�k �rFt|�t|�k �rF|� |d d � � �q t||� | |� t|�t|�k �rv|� d� �qVt||| ���fdd�|D �}t| t||�� | |_||_d S )a� prints an ASCII graph of the DAG takes the following arguments (one call per node in the graph): - ui to write to - Somewhere to keep the needed state in (init to asciistate()) - Column of the current node in the set of ongoing edges. - Type indicator of node data, usually 'C' for changesets. - Payload: (char, lines): - Character to use as node's symbol. - List of lines to display as the node's text. - Edges; a list of (col, next_col) indicating the edges between the current node and its parents. - Number of columns (ongoing edges) in the current revision. - The difference between the number of columns (ongoing edges) in the next revision and the number of columns (ongoing edges) in the current revision. That is: -1 means one column removed; 0 means no columns added or removed; 1 means one column added. ���rM c s& g | ] }� � |d �dfD ]}|�qqS �r r\ rm rr )rz r r r � r zascii.<locals>.<listcomp>r� r r9 c S s g | ]\}}|d |k r|�qS )r r )r �x�yr r r r � r Nr\ r r[ rO c s s | ]}|r|d v V qdS )s \/Nr rn r r r r! � r zascii.<locals>.<genexpr>r c s" g | ]}d d� d� |�f �qS )s %-*s rM r )�join)r ri )�indentation_levelr r r � s )rJ rC r* r] rQ rZ rc r� r� r Zxranger' rh rj ru �anyr} r� �zip)r: rS rF rR �textZcoldatar_ rJ rU r` rC r^ Zadd_padding_lineZfix_nodeline_tailrg Zshift_interlinerI rt ry Zextra_interliner )rz r� r �ascii� sp � �� �r� ) r� Z __future__r r0 r Z thirdpartyr � r r r r r, r r r( r� r/ r2 rL rW rZ rc rh rj r} �s�objectr~ r� r� r r r r �<module> s, /Z64