| Server IP : 121.121.20.254 / Your IP : 216.73.216.202 Web Server : Microsoft-IIS/10.0 System : Windows NT WEB-SERVER 10.0 build 20348 (Windows Server 2022) AMD64 User : IUSR ( 0) PHP Version : 8.3.28 Disable Function : NONE MySQL : ON | cURL : ON | WGET : OFF | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /Python315/Lib/__pycache__/ |
Upload File : |
R
>lqj�1 c �b � ] QH Gs QQ,sP sQs Q Q2 s Q Q\2 s Q Q2 sP! ) � )� GenericAlias�TopologicalSorter�
CycleErrorc �, ` � \ sQ s] s n QsQ sQsU sP! )� _NodeInfoc �0 � Vm ] U m , U m P! )r ��node�
npredecessors�
successors)�selfr s &&� C:\Python315\\Lib\graphlib.py�__init__�_NodeInfo.__init__ s � �� �
��� ��� r )�__name__�
__module__� __qualname__�__firstlineno__� __slots__r �__static_attributes__�__classdictcell__��
__classdict__s @r
r r s �� � �5�I� � r r c � � \ sQ s]sQsQsP! )r a# Subclass of ValueError raised by TopologicalSorter.prepare if cycles
exist in the working graph.
If multiple cycles exist, only one undefined choice among them will be reported
and included in the exception. The detected cycle can be accessed via the second
element in the *args* attribute of the exception instance and consists in a list
of nodes, such that each node is, in the graph, an immediate predecessor of the
next node in the list. In the reported list, the first and the last node will be
the same, to make it clear that it is cyclic.
� )r r r r �__doc__r r r r
r r s � � � r c �v ` � \ sQ s])s n QsQ
Q ksQ sQ sQ sQ s Q s
Q s Q s Q
s
Q s\ \2 sQ sU sP! )r zFProvides functionality to topologically sort a graph of hashable nodesc � � - U m PU m ] U m ] U m Ud2 UO 2 F D v q#U O
U,UN3 J P! P! �N)�
_node2info� _ready_nodes� _npassedout�
_nfinished�items�add)r �graphr � predecessorss && r
r �TopologicalSorter.__init__, sO � � ��� ��� ������ � �&+�k�k�m�"������-� �-� '4� r c �z � U O O U2 9oe [ U2 9U O U$ oU! r )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 O d [ Q2 gU O U2 oU9O [ U2 *
tm SF D/ oU O U2 oUO
O
U2 J1 P! )a; Add a new node and its predecessors to the graph.
Both the *node* and all elements in *predecessors* must be hashable.
If called multiple times with the same node argument, the set of dependencies
will be the union of all dependencies passed in.
It is possible to add a node with no dependencies (*predecessors* is not provided)
as well as provide a dependency twice. If a node that has not been provided before
is included among *predecessors* it will be automatically added to the graph with
no predecessors of its own.
Raises ValueError if called after "prepare".
z/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 �F � U O ] 6� c [ Q2 gU O eM U O O 2 Tt, tF D! pO
] 6X f J UO MJ# toU m U O 2 oU% c
[ QU2 gP! t toh )a� Mark the graph as finished and check for cycles in the graph.
If any cycle is detected, "CycleError" will be raised, but "get_ready" can
still be used to obtain as many nodes as possible until cycles block more
progress. After a call to this function, the graph cannot be modified and
therefore no more nodes can be added using "add".
Raise ValueError if nodes have already been passed out of the sorter.
z$cannot prepare() after starting sortznodes are in a cycle) r" r/ r! r �valuesr
r � _find_cycler )r �i�cycles & r
�prepare�TopologicalSorter.prepareV s� � � � � �a� � � C�D� D� � � � $� $��� 6� 6� 8�!� 8�1�O�O�q�<P����� 8�!�D� � � � �"�� � � 3�U�;� ;� ��!s �B � B c �* � U O e [ Q2 g[ U O 2 oU O oSF D o[ V#* m J U O O
2 U 9O [ U2 *
tm U! )ay Return a tuple of all the nodes that are ready.
Initially it returns all nodes with no predecessors; once those are marked
as processed by calling "done", further calls will return all new nodes that
have all their predecessors already processed. Once no more progress can be made,
empty tuples are returned.
Raises ValueError if called without calling "prepare" previously.
� prepare() must be called first) r! r/ �tupler � _NODE_OUTr
�clearr" r0 )r r+ �n2ir s & r
� get_ready�TopologicalSorter.get_readyp sy � � � � � $� � =�>� >� �t�(�(�)���o�o���D�&/�C�I� #� �
��� � �!� ���C��K�'���
r c � � U O e [ Q2 gU O U O 6 9% f [ U O 2 ! )a Return ``True`` if more progress can be made and ``False`` otherwise.
Progress can be made if cycles do not block the resolution and either there
are still nodes ready that haven't yet been returned by "get_ready" or the
number of nodes marked "done" is less than the number that have been returned
by "get_ready".
Raises ValueError if called without calling "prepare" previously.
r> )r! r/ r# r" �bool�r s &r
� is_active�TopologicalSorter.is_active� sD � � � � � $� � =�>� >�����!1�!1�1�L�L�T�$�:K�:K�5L�Lr c �$ � U O 2 ! r )rH rG s &r
�__bool__�TopologicalSorter.__bool__� s � ��~�~� � r c �P � U O e [ Q2 gU O oSF D� oUO U2 9oe [ QU8 Q02 gUO oU[
6w c3 U] 6� c [ QU8 Q02 gU[ 6X c [ QU8 Q02 g[ Um UO F DR oV&* oU9O ]* tm UO ] 6X f J7 U O O U2 JT U 9O ]*
tm J� P! )a� Marks a set of nodes returned by "get_ready" as processed.
This method unblocks any successor of each node in *nodes* for being returned
in the future by a call to "get_ready".
Raises ValueError if any node in *nodes* has already been marked as
processed by a previous call to this method, if a node was not added to the
graph by using "add" or if called without calling "prepare" previously or if
node has not yet been returned by "get_ready".
r> znode z was not added using add()z% was not passed out (still not ready)z was already marked done)
r! r/ r r* r
r@ �
_NODE_DONEr r1 r# )r �nodesrB r r2 �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 O o, o, o[ 2 o- oSF D� oVd7 c J Vd7 c Ve7 c V%U* P U,* t ! LcUO U2 UO [ V* O
2 O 2 [ U2 VV$ UO U2 U% c UP * 2 oJ� J� P! [ c% XRO 2 SO 2 JM h 9 h)T)
r �setr% r1 �iterr �__next__r0 �
StopIteration�pop)r rB �stack�itstack�seen� node2stackir s & r
r8 � 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�{�}�� � �; �< �� )� &� (� � � � 4� � � �
� &�s �<C� D� !D� Dc # � � U O 2 U O 2 % c0 U O 2 oSF Pi w� K
U O U JE P! K3h)a) Returns an iterable of nodes in a topological order.
The particular order that is returned may depend on the specific
order in which the items were inserted in the graph.
Using this method does not require to call "prepare" or "done". If any
cycle is detected, :exc:`CycleError` will be raised.
)r; rH rC rS )r �
node_groups & r
� static_order� TopologicalSorter.static_order� sF � � �
� � ���n�n� � � � � �)�J�!� !� !� �I�I�z� "� � !�s �'A �A � A�A )r# r r" r! r )r r r r r r r, r% r; rC rH rK rS r8 rb � classmethodr �__class_getitem__r r r s @r
r r ) sJ �� � �P�.��
.�6<�4�4 M� �-!�`%�N
#� $�L�1�r ���) �typesr �__all__r@ rN r r/ r r r r r
�<module>ri s> �� � � �
-�� � �
�
� � �" �� � X2� X2r