grthtrhthjhtyjytjytkergtrhtrjytjerhrfh4:24 29/09/2026+ `^RIHtRR.tR tR t!RR4t!RR]4t!RR4tR#) ) GenericAliasTopologicalSorter CycleErrorc*a]tRt^ toRtRtRtVtR#) _NodeInfoc.Wn^Vn.VnR#)rNnode npredecessors successors)selfr s&&//opt/alt/python314/lib64/python3.14/graphlib.py__init___NodeInfo.__init__ s r N)__name__ __module__ __qualname____firstlineno__ __slots__r__static_attributes____classdictcell__ __classdict__s@rrr s5I  rrc]tRt^tRtRtR#)ra#Subclass of ValueError raised by TopologicalSorter.prepare if cycles exist in the working graph. If multiple cycles exist, only one undefined choice among them will be reported and included in the exception. The detected cycle can be accessed via the second element in the *args* attribute of the exception instance and consists in a list of nodes, such that each node is, in the graph, an immediate predecessor of the next node in the list. In the reported list, the first and the last node will be the same, to make it clear that it is cyclic. N)rrrr__doc__rrrrrrs   rcta]tRt^)toRtRRltRtRtRtRt Rt R t R t R t R t]!]4tR tVtR#)rzFProvides functionality to topologically sort a graph of hashable nodesNc/VnRVn^Vn^VnVe0VP 4Fwr#VP !V.VO5!K R#R#N) _node2info _ready_nodes _npassedout _nfinisheditemsadd)r graphr predecessorss&& rrTopologicalSorter.__init__,sO   &+kkm"- -'4 rcxVPPV4;pf\V4;VPV&pV#r )r!getr)r r results&& r _get_nodeinfoTopologicalSorter._get_nodeinfo6s8oo))$/ /F 8-6t_ >t(()ooD&/CI # ! CK' rc VPf \R4hVPVP8;'g\ VP4#)aReturn ``True`` if more progress can be made and ``False`` otherwise. Progress can be made if cycles do not block the resolution and either there are still nodes ready that haven't yet been returned by "get_ready" or the number of nodes marked "done" is less than the number that have been returned by "get_ready". Raises ValueError if called without calling "prepare" previously. r?)r"r0r$r#boolr s&r is_activeTopologicalSorter.is_activesD    $=> >!1!11LLT$:K:K5LLrc"VP4#r )rIrHs&r__bool__TopologicalSorter.__bool__s~~rc jVPf \R4hVPpVEFpVPV4;pf\RV: R24hVPpV\ 8wdAV^8d\RV: R24hV\ 8Xd\RV: R24hQRT: RT 24h\ VnVPFRpW&,pV;P^,unVP^8XgK7VPPV4KT V;P^, un EK R#)aMarks a set of nodes returned by "get_ready" as processed. This method unblocks any successor of each node in *nodes* for being returned in the future by a call to "get_ready". Raises ValueError if any node in *nodes* has already been marked as processed by a previous call to this method, if a node was not added to the graph by using "add" or if called without calling "prepare" previously or if node has not yet been returned by "get_ready". Nr?znode z was not added using add()z% was not passed out (still not ready)z was already marked donez: unknown status ) r"r0r!r+r rA _NODE_DONEr r2r$)r nodesrCr r3stat successorsuccessor_infos&* rdoneTopologicalSorter.dones.    $=> >ooD GGDM)2 50J!KLL))Dy 19$x'LMZ'$uTH4L%MNNIE$1B4&"II5&0H "&00 !$,,1,!//14%%,,Y7 1 OOq OO9rcVPp.p.p\4p/pVFpWd9dK Wd9dWe9dW%V,RV.,u#McVPV4VP\ W,P 4P 4\V4WV&VPV4V'dVR,!4pKK R# \d%YRP4TP4KMi;i)TN) r!setr&r2iterr __next__r1 StopIterationpop)r rCstackitstackseen node2stackir s& rr9TopologicalSorter._find_cyclesoou D|<*$%6%89TFBB+HHTNNN4 (<(<#=#F#FG(+E K%LL&&&r{} 78 )&' 4 &s9C+C>=C>c# "VP4VP4'd-VP4pTRjxL VP!V!KBR#L5i)a)Returns an iterable of nodes in a topological order. The particular order that is returned may depend on the specific order in which the items were inserted in the graph. Using this method does not require to call "prepare" or "done". If any cycle is detected, :exc:`CycleError` will be raised. N)r<rIrDrT)r node_groups& r static_orderTopologicalSorter.static_ordersF nn)J! ! ! IIz " !s&AAAA)r$r!r#r"r )rrrrrrr-r&r<rDrIrLrTr9rd classmethodr__class_getitem__rrrs@rrr)sJP. .6<44 M -!^#J #$L1rNrW) typesr__all__rArOrr0rrrrrrks>  -   "    U2U2r