o g @sdZddlmZddlmZddlmZddlmZddlmZddlmZddlm Z dd lm Z dd lm Z dd lm Z d d l mZd dlmZe dedZgdZd+ddZ d,d-ddZd.d#d$Zd/d(d)Zd*S)0zTopological 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#stt}|D] \}}|||qt|}t|rSg}|D]}||r0||q"|s>tdt||t | |fdd|D}|VsdSdS)NzCircular dependency detected.csg|]}|vr|qSr).0ttodo_setr]/var/www/html/ecg_monitoring/venv/lib/python3.10/site-packages/sqlalchemy/util/topological.py 6sz#sort_as_subsets..) r defaultdictsetaddlist isdisjointappendrr _gen_edgesdifference_update)rredgesparentchildtodooutputnoderrrrs,     rTdeterministic_orderbool Iterator[_T]ccs t||D]}|EdHqdS)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 rIterable[Tuple[_T, _T]] Iterable[_T]Set[_T]c Cstt}|D] \}}|||qt|}t}|D]D}|g}||} |r`|d} || D])}||vrI|||d} | | || || vrY||| |nq0| }|s(q|S)N) r r!r"r# differenceindexr(updater&removepop) rrr)r*r+ nodes_to_testr-r.stackr,topcycrrrrMs0         rr)DefaultDict[_T, Set[_T]]Set[Tuple[_T, _T]]csfddDS)Ncs"h|] }|D]}||fqqSrr)rleftrightr)rr xs"z_gen_edges..rrDrrDrr'wsr'N)rrrrrr)T)rrrrr/r0rr1)rr3rr4rr5)r)r@rrA)__doc__ __future__rtypingrrrrrrr r r r excrr__all__rrrr'rrrrs(               *