← Back
Editing: graphlib.cpython-313.opt-2.pyc
� 9��i�% � �^ � S SK Jr SS/rSrSr " S S5 r " S S\5 r " S S5 rg ) � )� GenericAlias�TopologicalSorter� CycleError������c � � \ rS rSrSrS rSrg)� _NodeInfo� ��node� npredecessors� successorsc �, � Xl SU l / U l g �Nr r )�selfr s �//opt/alt/python313/lib64/python3.13/graphlib.py�__init__�_NodeInfo.__init__ s � �� � ��� ��� N)�__name__� __module__� __qualname__�__firstlineno__� __slots__r �__static_attributes__� r r r r s � �5�I� r r c � � \ rS rSrSrg)r � r N)r r r r r r r r r r s � � r c �d � \ rS rSrSS jrS rS rS rS rS r S r S r S r S r \" \5 rS rg)r �) Nc � � 0 U l S U l SU l SU l Ub- UR 5 H u p#U R " U/UQ76 M g g r )� _node2info� _ready_nodes� _npassedout� _nfinished�items�add)r �graphr � predecessorss r r �TopologicalSorter.__init__, sO � � ��� ��� ������ � �&+�k�k�m�"������-� �-� '4� r c �v � U R R U5 =nc [ U5 =U R U' nU$ �N)r" �getr )r r �results r � _get_nodeinfo� TopologicalSorter._get_nodeinfo6 s8 � ��o�o�)�)�$�/� /�F� 8�-6�t�_� <�D�O�O�D� !�F�� r c � � U R b [ S5 eU R U5 nU=R [ U5 - sl U H/ nU R U5 nUR R U5 M1 g )Nz/Nodes cannot be added after a call to prepare())r# � ValueErrorr/ r �lenr �append)r r r) �nodeinfo�pred� pred_infos r r' �TopologicalSorter.add; st � � � � � (� � N�O� O� �%�%�d�+��� � �#�l�"3�3� � !�D� �*�*�4�0�I� � � � '� '�� -� !r c � � U R b [ S5 eU R R 5 Vs/ s H oR S:X d M UR PM" snU l U R 5 nU( a [ SU5 eg s snf )Nz cannot prepare() more than oncer znodes are in a cycle)r# r2 r" �valuesr r � _find_cycler )r �i�cycles r �prepare�TopologicalSorter.prepareV s� � � � � � (� � >�?� ?� !�O�O� 2� 2� 4� � 4�q���1�8L�F�A�F�F� 4� ��� � � �"�� � � 3�e�<� <� �� s �B� Bc � � U R c [ S5 e[ U R 5 nU R nU H n[ X# l M U R R 5 U =R [ U5 - sl U$ �N� prepare() must be called first) r# r2 �tupler" � _NODE_OUTr �clearr$ r3 )r r. �n2ir s r � get_ready�TopologicalSorter.get_readyl sy � � � � � $� � =�>� >� �t�(�(�)���o�o���D�&/�C�I� #� � ��� � �!� ���C��K�'��� r c � � U R c [ S5 eU R U R : =( d [ U R 5 $ rA )r# r2 r% r$ �bool�r s r � is_active�TopologicalSorter.is_active� sA � � � � � $� � =�>� >�����!1�!1�1�L�T�$�:K�:K�5L�Lr c �" � U R 5 $ r, )rL rK s r �__bool__�TopologicalSorter.__bool__� s � ��~�~� � r c �$ � U R c [ S5 eU R nU H� nUR U5 =nc [ SU< S35 eUR nU[ :w a0 US:� a [ SU< S35 eU[ :X a [ SU< S35 e[ Ul UR HI nX& nU=R S- sl UR S:X d M. U R R U5 MK U =R S- sl M� g )NrB znode z was not added using add()r z% was not passed out (still not ready)z was already marked done� ) r# r2 r" r- r rD � _NODE_DONEr r4 r% )r �nodesrF r r5 �stat� successor�successor_infos r �done�TopologicalSorter.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� �!$� �� �,�,��1�,�!�/�/�1�4��%�%�,�,�Y�7� 1� �O�O�q� �O�9 r c �� � U R n/ n/ n[ 5 n0 nU H� nXd; a M Xd; a Xe; a X%U S U/- s $ O_UR U5 UR [ X R 5 R 5 [ U5 XV' UR U5 U( a US " 5 nOM� M� g ! [ a# XRR 5 UR 5 Of = fU( a ML NA)Nr ) r" �setr' r4 �iterr �__next__r3 � StopIteration�pop)r rF �stack�itstack�seen� node2stackir s r r; � TopologicalSorter._find_cycle� s� � ��o�o�������u��� ��D��|����<� �*� $��%6�%8� 9�T�F� B�B� +� �H�H�T�N��N�N�4�� �(<�(<�#=�#F�#F�G�(+�E� �K�%��L�L��&� �&� &�r�{�}�� � �/ � �8 �� )� &� '� � � � 4� � � � �&�� �es �) B;�;*C(�'C(c # �� # � U R 5 U R 5 ( aA U R 5 nU S h v�N U R " U6 U R 5 ( a M@ g g N,7fr, )r> rL rG rX )r � node_groups r � static_order� TopologicalSorter.static_order� sP � � � � � ���n�n� � � � � �)�J�!� !� !� �I�I�z� "� �n�n� � � !�s �;A,�A*�(A,�(A,)r% r" r$ r# r, )r r r r r r/ r' r> rG rL rO rX r; rg � classmethodr �__class_getitem__r r r r r r ) sD � �.�� .�6=�,�4 M� �-!�^#�J #� $�L�1�r N) �typesr �__all__rD rS r r2 r r r r r �<module>rm s> �� � � � -�� � � � � � �" �� � Q2� Q2r
Save File
Cancel