"j8|SrSSKJr SSKJr SSKJrJr SSKJ r J r J r SSK J r SSKJrJrJr \ (aSS KJr SS jrSS jrSS jrSS jrSSjrSSjrSSjrSSjrS SjrS!Sjr\ "S\\ S9rS"Sjrg)#zBTopological sorting of capabilities based on ordering constraints.) annotations)Sequence) CycleErrorTopologicalSorter) TYPE_CHECKINGAnyTypeVar) UserError)AbstractCapabilityCapabilityOrdering CapabilityRef)CapabilityPositionc ^[U5n[U5nUS::aU$UVs/sHn[U5PM nnUVs/sHn[U5PM nnUVVs/sHoUVs1sHn[ U5iM snPM nnn[ XU5 [ XX5$s snfs snfs snfs snnf)zSort capabilities to satisfy ordering constraints. Preserves the original order as a tiebreaker when constraints allow. Raises `UserError` on conflicts (missing requirements, cycles). r )listlencollect_leaves_effective_orderingtype_validate_requires _topo_sort) capabilitiescapsncap cap_leavesleaves orderingsleaf leaf_typess _/home/mande/repo/quber/.venv/lib/python3.13/site-packages/pydantic_ai/capabilities/_ordering.pysort_capabilitiesr"s  D D AAv VZ6[VZs~c7JVZJ6[\f1g\fRX2Ef2M\fI1gQ["\Q[v6#B64DJ6#BQ[J"\t 3 dz >> 7\1g#B"\s"BB B)#B$ 8B)$B)c `^[["5R"U6n[U5HupEU(dMUR(dM!URHNm[ U4SjU55(aM[ S[X5RSTRS35e M g)zValidate required dependencies.c3<># UHn[UT5v M g7fN issubclass).0treq_types r! %_validate_requires..1sKNq:a22N`z ` requires `z.` but it was not found among the capabilities.N)setrunion enumeraterequiresanyr __name__)rrr all_leaf_typesiorderingr*s @r!rr's !$D 1 1: >N +  8)))$--KNKKK#DM223<@Q@Q?RSGH.,c>[U5n[5n[U5HnURU5 M [ XTU5 [ XTXU5 [ UR55nUVs/sHo`UPM sn$![a [S5ef=fs snf)zTopological sort using graphlib.TopologicalSorter. Edges go from outer (earlier) to inner (later). TopologicalSorter preserves insertion order as tiebreaker for unconstrained nodes. z0Circular ordering constraints among capabilities) rrrangeadd_add_position_edges_add_relative_edgesr static_orderrr )rrr rrtsr6sorted_indicess r!rr8s D A!2!4B1X q y)yjALboo/0, ,^G^ ,, LJKKL -sB0BBc[U5VVs1sH"up4U(dMURS:XdM UiM$ nnn[U5VVs1sH"up4U(dMURS:XdM UiM$ nnnUH4n[U5H"nX:wdM X;dMURX5 M$ M6 UH4n [U5H"nX:wdM X;dMURX5 M$ M6 gs snnfs snnf)N outermost innermost)r1positionr:r;) r?rrr6orBrCoijiis r!r<r<Us )3W3tqqQZZ;=V3IW(3W3tqqQZZ;=V3IWqAw1-q  qAw1-r XWs! C*C*C* C0C0,C0c [U5HupVU(dMURHEn[U5H3nXX:wdM [XsUXH5(dM"UR X5 M5 MG UR HEn[U5H3nXX:wdM [XsUXH5(dM"UR XX5 M5 MG M gr%)r1wrapsr: _ref_matchesr; wrapped_by) r?rrr rr6r7refrGs r!r=r=js!+  >>C1X6l31 z}MMFF1L" &&C1X6l31 z}MMFF1L',r8c^[T[5(a[U4SjU55$[U4SjU55$)zCheck if a capability ref matches any leaf in a capability group. Type refs match via `issubclass`; instance refs match via `is` identity. c3<># UHn[UT5v M g7fr%r&)r(r)rMs r!r+_ref_matches..s:z!:a%%zr-c3*># UHoTLv M g7fr%)r(rrMs r!r+rPs.vts{vs) isinstancerr3)rMr rs` r!rKrKs4#t:z::: .v. ..r8cSn/n/n/nSnUHnUR5nUcMSnURb<Ub-XR:wa[SU<SUR<S35eURnURUR5 URUR 5 URUR 5 M U(dg[UUUUS9$)zGet the effective ordering for a capability, merging from all its leaves. For plain capabilities (single leaf), returns `get_ordering()` directly. For containers (`CombinedCapability`, `WrapperCapability`), merges constraints from all leaves. NFTz+Conflicting positions among nested leaves: z and zH. Wrap each tier in its own capability or expose the leaves as siblings.)rDrJrLr2) get_orderingrDr extendrJrLr2r )rmerged_position merged_wrapsmerged_wrapped_bymerged_requireshas_anyrr7s r!rrs26O(*L-/;=OG$$&       (*BSBS/SA/ATTYZbZkZkYno]^'//OHNN+  !4!45x001   $  r8c^[[U55nUSL=(a URS:H$)z]Whether a capability (merging the orderings of its nested leaves) is in the `innermost` tier.NrC)rrrD)rr7s r! is_innermostr]s,">##67H 4  DH$5$5$DDr8c@/nURUR5 U$)z@Collect all leaf capabilities using the `apply` visitor pattern.)applyappend)rrs r!rrs,.FIIfmm Mr8c.^[U4SjU55$)zRCheck whether any leaf in a capability list/tree is an instance of the given type.c3b># UH$n[U5Hn[UT5v M M& g7fr%rrS)r(rrcap_types r!r+&has_capability_type..s+b\cn]`Nadz$))Na)\s,/)r3)rrds `r!has_capability_typerfs b\b bbr8 CapabilityT)boundcfUH+n[U5Hn[X15(dMUs s $ M- g)z_Return the first leaf in a capability list/tree that is an instance of `cap_type`, else `None`.Nrc)rrdrrs r!find_capabilityrjs2 "3'D$)) ( r8N)r!Sequence[AbstractCapability[Any]]returnlist[AbstractCapability[Any]])rrmrlist[CapabilityOrdering | None]r list[set[type]]rlNone) rrmrrnr ror#list[list[AbstractCapability[Any]]]rlrm)r?TopologicalSorter[int]rintrrnrlrp) r?rrrrsrrnr rorrqrlrp)rMrr z set[type]rrmrlbool)rrmrlzCapabilityOrdering | None)rAbstractCapability[Any]rlrt)rrurlrm)rrkrdztype[AbstractCapability[Any]]rlrt)rrkrdztype[CapabilityT]rlzCapabilityT | None)__doc__ __future__rcollections.abcrgraphlibrrtypingrrr pydantic_ai.exceptionsr abstractr r rrr"rrr<r=rKrr]rrfrgrjrRr8r!r}sH"$2..,KK,?3?"?, '.  "- '-.- -4 - # -: / *!! !/! ! 4 !  !, /  / / * / /$NE c3c+c cm+=c+BC  3   r8