wBf JdZddlmZddlmZeeZdZdZ dZ d dZ y) z#Topological sorting implementation.)reduce) getLoggerc #Kt|dk(ry|jD]\}}|j|ttj |j t |jz }|j|Dcic] }|t c} t|jDchc]\}}t|dk(s|c}}}|snJ|D]}||j|dt|j D]}|t |z}t|dk7rCddl m }d}||jdjd|jDycc}wcc}}ww)a;Dependencies are expressed as a dictionary whose keys are items and whose values are a set of dependent items. Output is a list of sets in topological order. The first set consists of items with no dependences, each subsequent set consists of items that depend upon items in the preceding sets. rN)CondaValueErrorz/Cyclic dependencies exist among these items: {}z -> c32K|]}t|yw)N)repr).0xs 5lib/python3.12/site-packages/conda/common/toposort.py z_toposort..-s4RT!W4Rs)lenitemsdiscard_reducesetunionvalueskeysupdatesortedpop exceptionsrformatjoin) datakvextra_items_in_depsitemdeporderedrmsgs r _toposortr$ sQ 4yA~ 1 ! "#))T[[];c$))+>NNKK)<=su=>  N94CA $NO  !DJ HHT4  !$++-( C 3w< C   4yA~0?cjj4Rdiik4R)RSTT >Ns%B F  F F >F F B2F ct|jd}|dd}|j||jD]}|j ||S)z Pop an item from the graph that has the fewest dependencies in the case of a tie The winners will be sorted alphabetically c(t|d|dfS)Nr)r)r s r zpop_key..5s3tAw<a2I)keyr)rrrrr)rrr*r!s r pop_keyr+0sW 4::<%I JE (1+CHHSM{{} C Jr)c#$Kt|dk(ryt|} t|}|#t$rK}tj |j d|sYd}~yt|t|}Yd}~ad}~wt$rYywxYww)a<Dependencies are expressed as a dictionary whose keys are items and whose values are a set of dependent items. Output is a list of sets in topological order. The first set consists of items with no dependencies, each subsequent set consists of items that depend upon items in the preceding sets. rN) rr$next ValueErrorlogdebugargsr+ StopIteration)rtvalueerrs r _safe_toposortr6@s 4yA~$A  GEK   IIchhqk "$- $A    sBB/B B $A>B!A>9B> B  B B  Bc|jDcic]\}}|t|}}}d|vr|djd|rtt |Stt |Scc}}w)Npythonpip)rrrlistr6r$)rsaferrs r toposortr<`sj"&**, /$!QAs1vI /D /4 Xu% N4())IdO$$ 0sA/N)T) __doc__ functoolsrrloggingr__name__r/r$r+r6r<r)r rBs1*'"UJ  @%r)