a [g @sdZddlmZddlmZddlmZddlmZddlmZddlmZddlm Z dd lm Z dd lm Z dd lm Z d d l mZd dlmZe dedZgdZddddddZd)dddddddZddd dd!d"Zd#d$d%d&d'Zd(S)*zTopological sorting algorithms.) annotations)Any) Collection) DefaultDict)Iterable)Iterator)Sequence)Set)Tuple)TypeVar)util)CircularDependencyError_T)bound)sortsort_as_subsets find_cycleszCollection[Tuple[_T, _T]]zCollection[_T]zIterator[Sequence[_T]])tuplesallitemsreturnc#stt}|D]\}}|||qt|}t|rg}|D]}||rB||qB|sztdt||t | |fdd|D}|Vq6dS)NzCircular dependency detected.csg|]}|vr|qSr).0tZtodo_setri/var/www/html/cobodadashboardai.evdpl.com/venv/lib/python3.9/site-packages/sqlalchemy/util/topological.py 6z#sort_as_subsets..) r defaultdictsetaddlist isdisjointappendrr _gen_edgesdifference_update)rredgesparentchildtodooutputnoderrrrs&    rTboolz Iterator[_T])rrdeterministic_orderrccst||D]}|EdHq 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)rrr-set_rrrr:srzIterable[Tuple[_T, _T]]z Iterable[_T]zSet[_T]c Cstt}|D]\}}|||qt|}t}|D]}|g}||} |r8|d} || D]R}||vr|||d} | | || || vr`||| |qLq`| }qLq8|S)N) r rrr differenceindexr%updater#removepop) rrr&r'r(Z nodes_to_testr*r+stackr)topZcycrrrrMs*          rzDefaultDict[_T, Set[_T]]zSet[Tuple[_T, _T]])r&rcsfddDS)Ncs"h|]}|D] }||fqqSrr)rleftrightr&rr xrz_gen_edges..rr9rr9rr$wsr$N)T)__doc__ __future__rtypingrrrrrrr r r r excrr__all__rrrr$rrrrs&             *