opt
/
hc_python
/
lib
/
python3.12
/
site-packages
/
sqlalchemy
/
util
/
__pycache__
/
Go to Home Directory
+
Upload
Create File
root@0UT1S:~$
Execute
By Order of Mr.0UT1S
[DIR] ..
N/A
__init__.cpython-312.pyc
5.53 KB
Rename
Delete
_collections.cpython-312.pyc
30.90 KB
Rename
Delete
_concurrency_py3k.cpython-312.pyc
10.57 KB
Rename
Delete
_has_cy.cpython-312.pyc
1.05 KB
Rename
Delete
_py_collections.cpython-312.pyc
28.53 KB
Rename
Delete
compat.cpython-312.pyc
12.15 KB
Rename
Delete
concurrency.cpython-312.pyc
3.93 KB
Rename
Delete
deprecations.cpython-312.pyc
13.30 KB
Rename
Delete
langhelpers.cpython-312.pyc
82.70 KB
Rename
Delete
preloaded.cpython-312.pyc
5.73 KB
Rename
Delete
queue.cpython-312.pyc
14.21 KB
Rename
Delete
tool_support.cpython-312.pyc
8.47 KB
Rename
Delete
topological.cpython-312.pyc
3.80 KB
Rename
Delete
typing.cpython-312.pyc
23.85 KB
Rename
Delete
� #��g� � � � d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlm Z dd lm Z dd lm Z dd lm Z d d l mZ d dlmZ e de�� Zg d�Z dd�Z d dd�Z dd�Zdd�Zy) z Topological sorting algorithms.� )� annotations)�Any)� Collection)� DefaultDict)�Iterable)�Iterator)�Sequence)�Set)�Tuple)�TypeVar� )�util)�CircularDependencyError�_T)�bound)�sort�sort_as_subsets� find_cyclesc # � K � t j t � }| D ] \ }}|| j |� � t |� }t |� }|r~g }|D ]( }|j || � s�|j |� �* |s t dt | |� t |� � �|j |� |D � cg c] } | |v s�| �� }} |�� |r�}y y c c} w �w)Nz Circular dependency detected.) r � defaultdict�set�add�list� isdisjoint�appendr r � _gen_edges�difference_update) �tuples�allitems�edges�parent�child�todo�todo_set�output�node�ts �L/opt/hc_python/lib64/python3.12/site-packages/sqlalchemy/util/topological.pyr r s� � �� � '+�&6�&6�s�&;�E� � ��� �e� ���� � � ��>�D��8�}�H� ����D��"�"�5��;�/�� � �d�#� � �)�/��F�H�-��5�!�� � �"�"�6�*� �1�4�a�1��=��4��1�� � �� 2�s% �A+C�.A C�8 C�C�C�Cc # �F K � t | |� D ] }|E d{ ��� � y7 ��w)a, sort the given list of items by dependency. 'tuples' is a list of tuples representing a partial ordering. deterministic_order is no longer used, the order is now always deterministic given the order of "allitems". the flag is there for backwards compatibility with Alembic. N)r )r r �deterministic_order�set_s r( r r : s# � �� � ���1����� 2��s �!� �!c �� � t j t � }| D ] \ }}|| j |� � t |� }t � }|D ]� }|g}|j |� } |s�|d } || D ]d }||v r6||j |� d } | j | � |j | � || v s�B|j |� | j |� n |j � }|r���� |S )N���) r r r r � difference�indexr �updater �remove�pop) r r r r! r" � nodes_to_testr% r& �stackr# �top�cycs r( r r M s� � � '+�&6�&6�s�&;�E� � ��� �f� ���%� � ���J�M� �U�F� ����� �'�'��.�����)�C� �c� ���5�=� �� � �D� 1� 3�4�C��*�*�3�/��M�M�#�&��4�<��L�L��&��K�K��%�� #� �y�y�{�� � �" �M� c �J � | D ��ch c] }| | D ] }||f�� � c}}S c c}}w )N� )r �left�rights r( r r w s* � �&+� E�e�d��t���U�D�M��M�e� E�E�� Es � N)r �Collection[Tuple[_T, _T]]r �Collection[_T]�returnzIterator[Sequence[_T]])T)r r< r r= r* �boolr> z Iterator[_T])r zIterable[Tuple[_T, _T]]r z Iterable[_T]r> zSet[_T])r zDefaultDict[_T, Set[_T]]r> zSet[Tuple[_T, _T]])�__doc__� __future__r �typingr r r r r r r r r � r �excr r �__all__r r r r r9 r7 r( �<module>rF s� �� &� "� � � � � � � � � � � )� �T�� �� 4��� %��1?����> !%�� %�� �� �� � �&'� #�'�/;�'� �'�TFr7
Save