U
|
¸ý°dü ã @ sø 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 dedZdddgZddddddZd(ddddd d dZd d d dd!dZd"d#d$d%d&Zd'S ))z Topological sorting algorithms.é )Ú annotations)ÚAny)Ú
|
Collection)Ú DefaultDict)ÚIterable)ÚIterator)ÚSequence)ÚSet)ÚTuple)ÚTypeVaré )Úutil)ÚCircularDependencyErrorÚ_T)ÚboundÚsortÚsort_as_subsetsÚ find_cycleszCollection[Tuple[_T, _T]]zCollection[_T]zIterator[Sequence[_T]])ÚtuplesÚallitemsÚreturnc # s¢ t t¡}| D ]\}}|| |¡ qt|}t| rg }|D ] } || ¡rB| |¡ qB|sztdt| |t |
|
|¡ fdd|D }|V q6d S )Nz Circular dependency detected.c s g | ]}| kr|qS © r )Ú.0Út©Ztodo_setr úRd:\z\workplace\vscode\pyvenv\venv\Lib\site-packages\sqlalchemy/util/topological.pyÚ
|
<listcomp>7 s z#sort_as_subsets.<locals>.<listcomp>) r Ú defaultdictÚsetÚaddÚlistÚ
|
isdisjointÚappendr r Ú
|
_gen_edgesÚdifference_update)r r ÚedgesÚparentÚchildÚtodoÚoutputÚnoder r r r s&
|
ý
|
TÚboolz Iterator[_T])r r Údeterministic_orderr c c s t | |D ]}|E dH q
|
dS )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 r, Úset_r r r r ; s zIterable[Tuple[_T, _T]]z Iterable[_T]zSet[_T]c C sÄ t t¡}| D ]\}}|| |¡ qt|}t }|D ]}|g}| |¡} |r8|d }
|
||
|
D ]R}||kr|| |¡d
} | | ¡ | | ¡ || kr`| |¡ | |¡ qLq`|
|
¡ }qLq8|S )Néÿÿÿÿ) r r r r Ú
|
differenceÚindexr$ Úupdater" ÚremoveÚpop) r r r% r& r' Z nodes_to_testr) r* Ústackr( ÚtopZcycr r r r N s*
|
|
|
|
|
|
zDefaultDict[_T, Set[_T]]zSet[Tuple[_T, _T]])r% r c s fdd D S )Nc s" h | ]} | D ] }||fqqS r r )r ÚleftÚright©r% r r Ú <setcomp>y s
|
z _gen_edges.<locals>.<setcomp>r r8 r r8 r r# x s r# N)T)Ú__doc__Ú
|
__future__r Útypingr r r r r r r r
|
r Ú r Úexcr r Ú__all__r r r r# r r r r Ú<module> s&
|
ý*
|
