[h dZddlmZddlmZddlmZddlmZddlmZddlmZddlm Z dd lm Z dd lm Z dd lm Z d d l mZd dlmZe deZgdZd'dZ d(d)dZd*d!Zd+d%Zd&S),zTopological sorting algorithms.) annotations)Any) Collection) DefaultDict)Iterable)Iterator)Sequence)Set)Tuple)TypeVar)util)CircularDependencyError_T)bound)sortsort_as_subsets find_cyclestuplesCollection[Tuple[_T, _T]]allitemsCollection[_T]returnIterator[Sequence[_T]]c#Ktjt}|D] \}}|||!t |}t|rg}|D]2}||r||3|s,tdt||t| |fd|D}|VdSdS)NzCircular dependency detected.cg|]}|v| Sr).0ttodo_sets j/var/www/api.easyaligner.net/htdocs/venv_linux/lib/python3.11/site-packages/sqlalchemy/util/topological.py z#sort_as_subsets..6s111a1=====) r defaultdictsetaddlist isdisjointappendrr _gen_edgesdifference_update) rredgesparentchildtodooutputnoder s @r!rrs1'+&6s&;&;E!!  e     >>D8}}H  $ $D""5;// $ d### )/FH--5!!  ""6***11114111  r#Tdeterministic_orderbool Iterator[_T]c#@Kt||D] }|Ed{V 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)rrr2set_s r!rr:s> 11r#Iterable[Tuple[_T, _T]] Iterable[_T]Set[_T]c>tjt}|D] \}}|||!t|}t}|D]}|g}||} |r|d} || D]}}||vrG|||d} | | || || vr,||| |n~| }||S)N) rr$r%r& differenceindexr+updater)removepop) rrr,r-r. nodes_to_testr0r1stackr/topcycs r!rrMsH '+&6s&;&;E!!  f %    JJM UUF##''.. #)Cc # #5== D 1 1 3 34C**3///MM#&&&4<<LL&&&KK%%%E yy{{ # Mr#r,DefaultDict[_T, Set[_T]]Set[Tuple[_T, _T]]c fdDS)Nc.h|]}|D]}||fSrr)rleftrightr,s r! z_gen_edges..xs. E E Edt E EUDM E E E Er#r)r,s`r!r*r*ws E E E Ee E E EEr#N)rrrrrr)T)rrrrr2r3rr4)rr7rr8rr9)r,rErrF)__doc__ __future__rtypingrrrrrr r r r rexcrr__all__rrrr*rr#r!rRso&%"""""")))))) WT 4 4 4>!%&''''TFFFFFFr#