�
c��j�% � �^ � d dl mZ ddgZdZdZ G d� d� Z G d� de� Z G d � d� Zy
) � )� GenericAlias�TopologicalSorter�
CycleError����������c � � e Zd ZdZd� Zy)� _NodeInfo��node�
npredecessors�
successorsc �. � || _ d| _ g | _ y �Nr r
)�selfr s �!/usr/lib64/python3.12/graphlib.py�__init__z_NodeInfo.__init__ s � ��� �
��� ��� N)�__name__�
__module__� __qualname__� __slots__r � r r r r s � �5�I� r r c � � e Zd Z y)r N)r r r r r r r r s � � � r c �\ � e Zd Z d d�Zd� Zd� Zd� Zd� Zd� Zd� Z d � Z
d
� Z d � Z e
e� Zy)
r Nc � � i | _ d | _ d| _ d| _ |�,|j � D ] \ }} | j
|g|��� � y y r )�
_node2info� _ready_nodes� _npassedout�
_nfinished�items�add)r �graphr � predecessorss r r zTopologicalSorter.__init__, sS � � ��� ��� ������ � �&+�k�k�m�"��l������-� �-� '4� r c �t � | j j |� x}�t |� x| j |< }|S �N)r �getr )r r �results r �
_get_nodeinfoz TopologicalSorter._get_nodeinfo6 s8 � ��o�o�)�)�$�/� /�F� 8�-6�t�_� <�D�O�O�D� !�F��
r c �� � | j � t d� �| j |� }|xj t |� z
c_ |D ]. }| j |� }|j
j
|� �0 y )Nz/Nodes cannot be added after a call to prepare())r �
ValueErrorr( r �lenr
�append)r r r# �nodeinfo�pred� pred_infos r r! zTopologicalSorter.add; sy � �
� � � � (� � N�O� O� �%�%�d�+��� � �#�l�"3�3� � !�D� �*�*�4�0�I� � � � '� '�� -� !r c � � | j � t d� �| j j � D �cg c] }|j dk( s�|j
�� c}| _ | j
� }|r t d|� �y c c}w )Nz cannot prepare() more than oncer znodes are in a cycle)r r* r �valuesr r � _find_cycler )r �i�cycles r �preparezTopologicalSorter.prepareV s� � � � � � � (� � >�?� ?� !�O�O� 2� 2� 4�
� 4�q����1�8L�A�F�F� 4�
��� � � �"�� � � 3�e�<� <� ��
s �A?�
A?c � � | j � t d� �t | j � }| j }|D ] }t || _ � | j j
� | xj t |� z
c_ |S �N� prepare() must be called first) r r* �tupler � _NODE_OUTr �clearr r+ )r r' �n2ir s r � get_readyzTopologicalSorter.get_readyl s� � � � � � � $� � =�>� >� �t�(�(�)���o�o���D�&/�C��I� #� �
��� � �!� ���C��K�'���
r c � � | j � t d� �| j | j k xs t | j � S r7 )r r* r r �bool�r s r � is_activezTopologicalSorter.is_active� sF � � � � � � $� � =�>� >�����!1�!1�1�L�T�$�:K�:K�5L�Lr c �" � | j � S r% )rA r@ s r �__bool__zTopologicalSorter.__bool__� s � ��~�~� � r c � � | j � t d� �| j }|D ]� }|j |� x}�t d|�d�� �|j }|t
k7 r,|dk\ rt d|�d�� �|t k( rt d|�d�� �t |_ |j D ]G }|| }|xj dz c_ |j dk( s�-| j j |� �I | xj dz
c_ �� y )Nr8 znode z was not added using add()r z% was not passed out (still not ready)z was already marked done� )
r r* r r& r r: �
_NODE_DONEr
r, r )r �nodesr< r r- �stat� successor�successor_infos r �donezTopologicalSorter.done� s � � � � � � $� � =�>� >��o�o���D� �G�G�D�M�)��2� �5���0J�!K�L�L� �)�)�D��y� ��1�9�$� ��x�'L�M�� � �Z�'�$�u�T�H�4L�%M�N�N�
&0�H� "� &� 0� 0� �!$�Y� �� �,�,��1�,�!�/�/�1�4��%�%�,�,�Y�7� 1�
�O�O�q� �O�9 r c �� � | j }g }g }t � }i }|D ]� }||v r� ||v r||v ro||| d |gz c S |j |� |j t || j
� j � t |� ||< |j |� |r |d � }n���� y # t $ r$ ||j � = |j � Y nw xY w|r�C�8)Nr )
r �setr! r, �iterr
�__next__r+ �
StopIteration�pop)r r< �stack�itstack�seen� node2stackir s r r2 z TopologicalSorter._find_cycle� s � ��o�o�������u��� ��D��t�|����4�<� �{�*� $�[��%6�%8� 9�T�F� B�B� �H�H�T�N��N�N�4��D� �(<�(<�#=�#F�#F�G�(+�E�
�K��%��L�L��&� �&� *�w�r�{�}�� �
�/ � �8 �� )� &� '�� � � � 4� � � �
�&�� �s �"
B1�1*C � C c # �� K � | j � | j � r;| j � }|E d { ��� | j |� | j � r�:y y 7 �&�wr% )r5 rA r= rK )r �
node_groups r � static_orderz TopologicalSorter.static_order� sR � �� � �
� � ���n�n� � � � �)�J�!� !� !� �D�I�I�z� "� �n�n� � !�s �7A"�A �#A"� A"r% )r r r r r( r! r5 r= rA rC rK r2 rX � classmethodr �__class_getitem__r r r r r ) sG � �P�.��
.�6=�,�4 M� �-!�^#�J
#� $�L�1�r N) �typesr �__all__r: rF r r* r r r r r �r] s> �� � � �
-�� � �
�
� � �" �� � Q2� Q2r