o

���g�
�@
s�dZd
dl
mZ
d
dlmZ
d
dlmZ
d
dlmZ
d
dlmZ
d
dlmZ
d
dlm	Z	
d
d	lm
Z

d
d
lmZ
d
dlmZ
dd
l
mZ
ddlmZ
eded�Zgd�
Zd+dd�Z	d,d-dd�Zd.d#d$�Zd/d(d)�Zd*S)0zTopological sorting algorithms.�)
�annotations)
�Any)
�
Collection)
�DefaultDict)
�Iterable)
�Iterator)
�Sequence)
�Set)
�Tuple)
�TypeVar�)
�util)
�CircularDependencyError�_T)
�bound)�sort�sort_as_subsets�find_cycles�tuples�Collection[Tuple[_T, _T]]�allitems�Collection[_T]�return�Iterator[Sequence[_T]]c#
s��t�
t�
}|D]\}}||�|�

qt|
�
}t|
�
��rSg}|D]}��||�
r0|�|�

q"|s>td
t||
�t	|�
��
��
|�

�f
dd�|D�
}|V
�sdSdS)NzCircular dependency detected.c

sg|]}
|
�vr|
�qS�r)�.0�
t�
�todo_setr�F/usr/local/lib/python3.10/dist-packages/sqlalchemy/util/topological.py�
<listcomp>6sz#sort_as_subsets.<locals>.<listcomp>)r
�defaultdict�set�add�list�
isdisjoint�appendrr�
_gen_edges�difference_update)rr�edges�parent�child�todo�output�noderrrrs,�








�



�


�rT�deterministic_order�bool�Iterator[_T]cc
s �t||
�D]}|Ed
H
qd
S)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)rrr/�set_rrrr:s�
�r�Iterable[Tuple[_T, _T]]�Iterable[_T]�Set[_T]cC
s�t�
t�
}|D]\}}||�|�

qt|�
}t�}|D]D}|g
}|�|�
}	|r`|d
}
||
D])}||vrI||�|�
d�}|	�|�

|�|�

||	vrY|�|�

|	�	|�


nq0|�
�}|s(q|S)N���)r
r!r"r#�
difference�indexr(�updater&�remove�pop)rrr)r*r+�
nodes_to_testr-r.�stackr,�top�cycrrrrMs0




















���rr)�DefaultDict[_T, Set[_T]]�Set[Tuple[_T, _T]]c


s�f
d
d��D�
S)Nc

s"h|]
}
�|
D]}||
f�qqSrr)r�left�right�
r)rr�	<setcomp>xs"z_gen_edges.<locals>.<setcomp>rrDrrDrr'ws
r'N)rrrrrr)
T)rrrrr/r0rr1)rr3rr4rr5)r)r@rrA)�__doc__�
__future__r�typingrrrrrrr	r
r�r
�excrr�__all__rrrr'rrrr�<module>
s(









�
*