+ :1j NRt^RIHt^RIHt]!]4tRtRt Rt RRlt R#) z#Topological sorting implementation.)reduce) getLoggerc #X"\V4^8XdR#VP4FwrVPV4K \\P VP 44\ VP44, pTPVUu/uF qD\ 4bK up4\VP4UUu0uFwrE\V4^8XgKVkK upp4pV'gMSVFpVxVPVR4K \VP 44FpV\ V4,pK K\V4^8wdD^RI H pRpV!VPRPRVP44444hR#uupiuuppi5i)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. N)CondaValueErrorz/Cyclic dependencies exist among these items: {}z -> c38"TFp\V4xK R#5i)N)repr).0xs& 5lib/python3.14/site-packages/conda/common/toposort.py _toposort..-s4RkT!WWks)lenitemsdiscard_reducesetunionvalueskeysupdatesortedpop exceptionsrformatjoin) datakvextra_items_in_depsitemdeporderedrmsgs & r _toposortr# sB 4yA~  ! "#))T[[];c$))+>NNKK)<=)<su)<=>  N 94CA $$ NO DJ HHT4 $++-(C 3w< C) 4yA~0?cjj4Rdiik4R)RSTT >Ns+BF*F' F*F$ F$ &F*6B4F*c\VP4RR7pV^,^,pVPV4VP4FpVP V4K V#)z| Pop an item from the graph that has the fewest dependencies in the case of a tie The winners will be sorted alphabetically c8\V^,4V^,3#))r )rs&r pop_key..5s3tAw<a2I)key)rrrrr)rrr*r s& r pop_keyr+0sR 4::<%I JE (1+CHHSM{{} C Jr)c#N"\V4^8XdR#\V4p\V4pVxK \dXp\P TP ^,4T'gRp?R#\T4x\T4pRp?KpRp?i\dR#i;i5i)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. N) r r#next ValueErrorlogdebugargsr+ StopIteration)rtvalueerrs& r _safe_toposortr6@s~ 4yA~$A  GEK  IIchhqk "$- $A    sHB%3B% B".B,B%2B B% B"B"B%!B""B%cVP4UUu/uFwr#V\V4bK pppRV9dVR,PR4V'd\\ V44#\\ V44#uuppi)pythonpip)rrrlistr6r#)rsaferrs&& r toposortr<`si"&**, /,$!As1vI,D /4 Xu% N4())IdO$$ 0sA=N)T) __doc__ functoolsrrloggingr__name__r/r#r+r6r<r)r rBs1*'"UJ  @%r)