Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/celery/utils/__pycache__/graph.cpython-39.pyc
Ðазад
a t�hQ# � @ sn d Z ddlmZ ddlmZ ddlmZmZ dZG dd� d�Z G dd � d e �Z G d d � d �Z G d d � d �Z dS )z Dependency graph implementation.� )�Counter)�dedent)� bytes_to_str�safe_str)�DOT� CycleError�DependencyGraph�GraphFormatterc @ s6 e Zd ZdZed�ZdZdZdZdZ ddd �Z d Z d S ) r z$Constants related to the dot format.z= {IN}{type} {id} {{ {INp}graph [{attrs}] z{name}={value}z{INp}"{0}" [{attrs}]z {INp}"{0}" {dir} "{1}" [{attrs}]z, z--z->)�graph�digraphz{IN}}}N) �__name__� __module__� __qualname__�__doc__r �HEAD�ATTR�NODE�EDGE�ATTRSEP�DIRS�TAIL� r r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/celery/utils/graph.pyr s r c @ s e Zd ZdZdS )r z)A cycle was detected in an acyclic graph.N)r r r r r r r r r s r c @ s� e Zd ZdZd+dd�Zdd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dd� Z dd� Z dd� Z d,dd�Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Ze ZZd%d&� Zd-d)d*�ZdS ).r a6 A directed acyclic graph of objects and their dependencies. Supports a robust topological sort to detect the order in which they must be handled. Takes an optional iterator of ``(obj, dependencies)`` tuples to build the graph from. Warning: Does not support cycle detection. Nc C s( |pt � | _i | _|d ur$| �|� d S �N)r � formatter�adjacent�update)�self�itr r r r �__init__* s zDependencyGraph.__init__c C s | j �|g � dS )zAdd an object to the graph.N)r � setdefault�r �objr r r �add_arc0 s zDependencyGraph.add_arcc C s | | � |� dS )z]Add an edge from object ``A`` to object ``B``. I.e. ``A`` depends on ``B``. N)�append)r �A�Br r r �add_edge4 s zDependencyGraph.add_edgec C s | j �|j � dS )z Add nodes from another graph.N)r r )r r r r r �connect; s zDependencyGraph.connectc C s~ t � }| �� }dd� |D �}|D ]}|�|� q | D ]6}|| }| | D ] }|| }||krH|�||� qHq4dd� |�� D �S )z�Sort the graph topologically. Returns: List: of objects in the order in which they must be handled. c S s i | ]}|D ] }||�q qS r r )�.0� component�noder r r � <dictcomp>H s z+DependencyGraph.topsort.<locals>.<dictcomp>c S s g | ] }|d �qS )r r )r) �tr r r � <listcomp>S � z+DependencyGraph.topsort.<locals>.<listcomp>)r � _tarjan72r# r' �_khan62) r r � componentsZNCr* r+ Znode_c� successorZ successor_cr r r �topsort? s � zDependencyGraph.topsortc C sN zt | | �g}W n ty& Y dS 0 | | D ]}|�| �|�� q0t|�S )z5Return the valency (degree) of a vertex in the graph.r )�len�KeyErrorr$ � valency_of�sum)r r" �lr+ r r r r7 U s zDependencyGraph.valency_ofc C sH t |�}|D ]\}}| �|� q |D ] \}}|D ]}| �||� q0q$dS )z=Update graph with data from a list of ``(obj, deps)`` tuples.N)�listr# r' )r r Ztupsr" �_�deps�depr r r r _ s zDependencyGraph.updatec C s dd� | � � D �S )z8Return generator that yields for all edges in the graph.c s s | ]\}}|r|V qd S r r )r) r" Zadjr r r � <genexpr>j r/ z(DependencyGraph.edges.<locals>.<genexpr>)�items�r r r r �edgesh s zDependencyGraph.edgesc s� t � � g }| D ]"}| | D ]}� | d7 < qq� fdd�| D �}|r�|�� }|�|� | | D ]*}� | d8 < � | dkrb|�|� qbqD|�� |S )z�Perform Khan's simple topological sort algorithm from '62. See https://en.wikipedia.org/wiki/Topological_sorting � c s g | ]}� | s|�qS r r )r) r+ ��countr r r. w r/ z+DependencyGraph._khan62.<locals>.<listcomp>r )r �popr$ �reverse)r �resultr+ r3 �readyr rC r r1 l s zDependencyGraph._khan62c s: g g i ��� � ����fdd���D ] }�|� q(�S )z�Perform Tarjan's algorithm to find strongly connected components. See Also: :wikipedia:`Tarjan%27s_strongly_connected_components_algorithm` c s� | � v r d S t � �}|� | < t ��}��| � �| D ]"}�|� t� | � | �� | < q6|� | kr�t�|d � �}g �|d �< ��|� |D ]}t ��� |< q�d S r )r5 r$ �min�tuple)r+ �numZ stack_posr3 r* �item��lowrG r �stack�visitr r rP � s z(DependencyGraph._tarjan72.<locals>.visitr �r r+ r rM r r0 � s zDependencyGraph._tarjan72c s� t � �|p| j��fdd�� � ��fdd�}� ��� � | �� D ]>\}}|sX|�j|� |D ] }|�j|� � ��||�� q\q@� ��� � dS )z�Convert the graph to DOT format. Arguments: fh (IO): A file, or a file-like object to write the graph to. formatter (celery.utils.graph.GraphFormatter): Custom graph formatter to use. c s t t| �� d� d S )N)�file)�printr )�s)�fhr r �P� s z!DependencyGraph.to_dot.<locals>.Pc s. �� |��vr*� | |�� ���� |�� d S r )�label�add)Zfunr" )rV �draw�seenr r � if_not_seen� s z+DependencyGraph.to_dot.<locals>.if_not_seenN)�setr �headr? � terminal_noder+ �edge�tail)r rU r r[ r" r �reqr )rV rY rU rZ r �to_dot� s zDependencyGraph.to_dotc C s | j r| � |�S |S r )r r! r r r �format� s zDependencyGraph.formatc C s t | j�S r )�iterr r@ r r r �__iter__� s zDependencyGraph.__iter__c C s | j | S r �r rQ r r r � __getitem__� s zDependencyGraph.__getitem__c C s t | j�S r )r5 r r@ r r r �__len__� s zDependencyGraph.__len__c C s || j v S r rf r! r r r � __contains__� s z DependencyGraph.__contains__c C s | j �� S r )r r? r@ r r r �_iterate_items� s z DependencyGraph._iterate_itemsc s d� � fdd�� D ��S )N� c 3 s | ]}� � |�V qd S r )� repr_node)r) �Nr@ r r r> � r/ z+DependencyGraph.__repr__.<locals>.<genexpr>)�joinr@ r r@ r �__repr__� s zDependencyGraph.__repr__rB �{0}({1})c C s| |� || �|��g}|| v rr| | D ]L}|� || �|��}|�d| | � |�| �||d ��d�dd � � q$d�|�S )Nz rB rk )rc r7 r$ �extendrl �splitrn )r r" �level�fmt�output�other�dr r r rl � s &zDependencyGraph.repr_node)NN)N)rB rp )r r r r r r# r' r( r4 r7 r rA r1 r0 rb rc re rg rh ri rj r? � iteritemsro rl r r r r r s* r c @ s� e Zd ZdZej�� Zej�� Z ej �� Z ej �� Z ej�� ZejZeej�Zddddd�Zddd d �Zd d d �Zddd �ZddiZd/dd�Zdd� Zd0dd�Z dd � Z d d � Z d d � Z d!d"� Z d#d$� Z!d%d&� Z"d'd(� Z#d)d*� Z$d1d+d,�Z%d2d-d.�Z&dS )3r zFormat dependency graphs.�boxZveeZfilledZ HelveticaNeue)�shapeZ arrowhead�styleZfontnameZ darkseagreen4�blackgffffff�?)�colorZ arrowcolorZ arrowsizeZ palegreen3Z palegreen4)Z fillcolorr} Z palegreen1Z palegreen2�bgcolorZ mintcreamNr � c K sr |pd| _ || _|pd| _| j| j | _||p0d | _| j| | _t| jfi |��| _t| j | � | j�d�| _ d S )N� dependenciesr r )�root) �idr� �type�_dirs� direction�IN�INp�dict�scheme� graph_schemerW )r r� r� r� �indentZinwr� r r r r � s zGraphFormatter.__init__c C s d|� d�}| j | j||d�S )N�")�name�value)�FMT�_attr)r r� r� r r r �attr s zGraphFormatter.attrc sH t � jfi |r"t |fi |p i ��n|��}� j�� fdd�|�� D ��S )Nc 3 s" | ]\}}t � �||��V qd S r )r r� )r) �k�vr@ r r r> s z'GraphFormatter.attrs.<locals>.<genexpr>)r� r� �_attrseprn r? )r rw r� r r@ r �attrs s *�zGraphFormatter.attrsc K s" | j | j| j| j| �|| j�d�S )N)r� r� r� )r� �_headr� r� r� r� )r r� r r r r] s �zGraphFormatter.headc C s | � | j�S r )r� �_tailr@ r r r r` s zGraphFormatter.tailc C s |S r r r! r r r rW s zGraphFormatter.labelc K s | � || j|�S r )� draw_node� node_scheme�r r" r� r r r r+ s zGraphFormatter.nodec K s | � || j|�S r )r� � term_schemer� r r r r^ s z GraphFormatter.terminal_nodec K s | j ||fi |��S r )� draw_edge)r �a�br� r r r r_ ! s zGraphFormatter.edgec C s |� dd�S )Nzutf-8�ignore)�encode)r rT r r r �_enc$ s zGraphFormatter._encc O s$ | � |j|i t|| j| jd����S )N)r� r� )r� rc r� r� r� )r rt �args�kwargsr r r r� ' s ��zGraphFormatter.FMTc C s. | j | j| �|�| �|�| j| �|| j�d�S )N)�dirr� )r� �_edgerW r� r� � edge_scheme)r r� r� r� r� r r r r� , s �zGraphFormatter.draw_edgec C s | j | j| �|�| �||�d�S )N)r� )r� �_noderW r� )r r" r� r� r r r r� 2 s �zGraphFormatter.draw_node)NNNr r )N)NN)NN)'r r r r r r �stripr� r r� r r� r r� r r� r r� r� r r� r� r� r� r� r� r r� r� r] r` rW r+ r^ r_ r� r� r� r� r r r r r � sF �� � r N)r � collectionsr �textwrapr Zkombu.utils.encodingr r �__all__r � Exceptionr r r r r r r �<module> s D
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка