codekingpro/portable-devtools
114k
1+
2 ��i-& � �` � ^ RI Ht RR.tR tR3t ! R R4 t ! R R]4 t ! R R4 tR# ) � )� GenericAlias�TopologicalSorter�4CycleErrorc �* a � ] tR t^ t o RtR tRtV tR# )� _NodeInfoc �. � Wn ^ V n . V n R# )r N��node�
npredecessors�5successors)�selfr6 s &&�Lib\graphlib.py�__init__�_NodeInfo.__init__ s � �� �7 ��� ��� r N)�__name__�8__module__� __qualname__�__firstlineno__� __slots__r �__static_attributes__�__classdictcell__��
__classdict__s @r r r s �� � �5�I� � r r c � � ] tR t^tRtRtR# )r a# Subclass of ValueError raised by TopologicalSorter.prepare if cycles9exist in the working graph.10 11If multiple cycles exist, only one undefined choice among them will be reported12and included in the exception. The detected cycle can be accessed via the second13element in the *args* attribute of the exception instance and consists in a list14of nodes, such that each node is, in the graph, an immediate predecessor of the15next node in the list. In the reported list, the first and the last node will be16the same, to make it clear that it is cyclic.17� N)r r r r �__doc__r r r r r r s � � � r c �t a � ] tR t^)t o RtRR ltR tR tR tR t R t18R t R19 t R t
R t]! ]4 tR
tV tR# )r zFProvides functionality to topologically sort a graph of hashable nodesNc � � / V n R V n ^ V n ^ V n Ve0 VP 4 F w r#V P20 ! V.VO5! K R # R # �N)�21_node2info� _ready_nodes� _npassedout�22_nfinished�items�add)r
�graphr23 � predecessorss && r r �TopologicalSorter.__init__, sO � � ��� ��� ������ � �&+�k�k�m�"������-� �-� '4� r c �x � V P P V4 ;pf \ V4 ;V P V& pV# r )r! �getr )r
r24 �results && r �
_get_nodeinfo� TopologicalSorter._get_nodeinfo6 s8 � ��o�o�)�)�$�/� /�F� 8�-6�t�_� <�D�O�O�D� !�F��
r c � � V P e \ R4 hV P V4 pV;P \ V4 ,
un V F/ pV P V4 pVP25 P
V4 K1 R# )a; Add a new node and its predecessors to the graph.26 27Both the *node* and all elements in *predecessors* must be hashable.28 29If called multiple times with the same node argument, the set of dependencies30will be the union of all dependencies passed in.31 32It is possible to add a node with no dependencies (*predecessors* is not provided)33as well as provide a dependency twice. If a node that has not been provided before34is included among *predecessors* it will be automatically added to the graph with35no predecessors of its own.36 37Raises ValueError if called after "prepare".38Nz/Nodes cannot be added after a call to prepare())r" �39ValueErrorr- r �lenr �append)r
r40 r( �nodeinfo�pred� pred_infos &&* r r& �TopologicalSorter.add; st � � � � � (� � N�O� O� �%�%�d�+��� � �#�l�"3�3� � !�D� �*�*�4�0�I� � � � '� '�� -� !r c �B � V P ^ 8� d \ R4 hV P fL V P P 4 Uu. uF! qP41 ^ 8X g K VP NK# upV n V P 4 pV' d
\ RV4 hR# u upi )a� Mark the graph as finished and check for cycles in the graph.42 43If any cycle is detected, "CycleError" will be raised, but "get_ready" can44still be used to obtain as many nodes as possible until cycles block more45progress. After a call to this function, the graph cannot be modified and46therefore no more nodes can be added using "add".47 48Raise ValueError if nodes have already been passed out of the sorter.49 50z$cannot prepare() after starting sortNznodes are in a cycle) r# r0 r" r! �valuesr r51 � _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 �& � V P f \ R4 h\ V P 4 pV P pV F p\ W#, n K V P P
4 V ;P \ V4 ,
un V# )ay Return a tuple of all the nodes that are ready.52 53Initially it returns all nodes with no predecessors; once those are marked54as processed by calling "done", further calls will return all new nodes that55have all their predecessors already processed. Once no more progress can be made,56empty tuples are returned.57 58Raises ValueError if called without calling "prepare" previously.59� prepare() must be called first) r" r0 �tupler! � _NODE_OUTr �clearr# r1 )r
r, �n2ir60 s & r � get_ready�TopologicalSorter.get_readyp sy � � � � � $� � =�>� >� �t�(�(�)���o�o���D�&/�C�I� #� �61
��� � �!� ���C��K�'���
r c � � V P f \ R4 hV P V P 8 ;' g \ V P 4 # )a Return ``True`` if more progress can be made and ``False`` otherwise.62 63Progress can be made if cycles do not block the resolution and either there64are still nodes ready that haven't yet been returned by "get_ready" or the65number of nodes marked "done" is less than the number that have been returned66by "get_ready".67 68Raises ValueError if called without calling "prepare" previously.69r? )r" r0 r$ r# �bool�r
s &r � is_active�TopologicalSorter.is_active� sD � � � � � $� � =�>� >�����!1�!1�1�L�L�T�$�:K�:K�5L�Lr c �" � V P 4 # r )rI rH s &r �__bool__�TopologicalSorter.__bool__� s � ��~�~� � r c �j � V P f \ R4 hV P pV EF pVP V4 ;pf \ RV: R24 hVP pV\70 8w dA V^ 8� d \ RV: R24 hV\ 8X d \ RV: R24 hQ RT: RT 24 h\ Vn VP FR pW&, pV;P ^, un VP ^ 8X g K7 V P P V4 KT V ;P ^,
un EK R# )a� Marks a set of nodes returned by "get_ready" as processed.71 72This method unblocks any successor of each node in *nodes* for being returned73in the future by a call to "get_ready".74 75Raises ValueError if any node in *nodes* has already been marked as76processed by a previous call to this method, if a node was not added to the77graph by using "add" or if called without calling "prepare" previously or if78node has not yet been returned by "get_ready".79Nr? znode z was not added using add()z% was not passed out (still not ready)z was already marked donez: unknown status )80r" r0 r! r+ r rA �81_NODE_DONEr r2 r$ )r
�nodesrC r82 r3 �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�I�E�$��1B�4�&�"I�I�5� &0�H� "� &� 0� 0� �!$� �� �,�,��1�,�!�/�/�1�4��%�%�,�,�Y�7� 1�83
�O�O�q� �O�O�9 r c � � V P p. p. p\ 4 p/ pV F� pWd9 d K Wd9 d We9 d W%V, R V., u # McVP V4 VP \ W, P84 4 P 4 \ V4 WV& VP V4 V' d VR, ! 4 pK� K� R# \ d% YRP 4 TP 4 KM i ; i)TN�����)85r! �setr& r2 �iterr �__next__r1 �
StopIteration�pop)r
rC �stack�itstack�seen� node2stackir86 s & r r9 � 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�87�K�%��L�L��&� �&� &�r�{�}�� �88 �7 �8 �� )� &� '� � � � 4� � � �
�&�s �9C�+C>�=C>c # � " � V P 4 V P 4 ' d- V P 4 pT Rj x�L89 V P ! V! KB R# L5i)a) Returns an iterable of nodes in a topological order.90 91The particular order that is returned may depend on the specific92order in which the items were inserted in the graph.93 94Using this method does not require to call "prepare" or "done". If any95cycle is detected, :exc:`CycleError` will be raised.96N)r< rI rD rT )r
�97node_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< rD rI rL rT r9 rd � classmethodr �__class_getitem__r r r s @r r r ) sJ �� � �P�.��98.�6<�4�4 M� �-!�^#�J
#� $�L�1�r NrW �����) �typesr �__all__rA rO r r0 r r r r r �<module>rk s> �� � � �99-�� � �
�100� � �" �� � U2� U2r