+ i^`a0t$^RIHt^RIt^RIt^RIt^RIHtHt^RI H t H t H t H t HtHtHtHtHt^RIHtHt^RIHt^RIHtHtHtHtHt]'d^RIHtH t H!t!^R I"H#t#H$t$^R I%H&t&R t'R ](R &RRlt)!RR]] ] ] 3,4t*!RR]] ] ] 3,4t+RRlt,R#)) annotationsN) TYPE_CHECKINGGeneric) CTKTRT DirectedGraph IterableViewIteratorMappingRequirementInformationStatebuild_iter_view)AbstractResolverResult) Criterion)InconsistentCandidateRequirementsConflictedResolutionImpossibleResolutionTooDeepResolverException) CollectionIterableMapping)AbstractProvider Preference) BaseReporterg?float_OPTIMISTIC_BACKJUMPING_RATIOc V^8dQhRRRR/#)stateState[RT, CT, KT]returnResult[RT, CT, KT])formats"r/home/wkmabra/.openclaw/workspace/venv/lib/python3.14/site-packages/pip/_vendor/resolvelib/resolvers/resolution.py __annotate__r(&s*/AcVPpVP4UUu/uFwr#\V4VbK pppRV\R4&\4pVP R4R0pVP P4Fwrx\ VP WtV4'gK$Wu9dVP V4VP4F>p V\V 4,p Y9dTP T 4TPY4K@ K \VP4UUu/uFwr#W&9gK W#bK uppVVP R7#uuppi \dKi;iuuppi)N)mappinggraphcriteria) r+itemsidr addr-_has_route_to_root iter_parentKeyErrorconnectr) r!r+kvall_keysr, connectedkey criterionppkeys & r' _build_resultr=&s4mmG;B==?%K?41beQh?H%KHRX&3oE IIdO!%I....0!%..#KK    IIcN&&(A 1  $ MM$ $) 1 ")--/D/$!Q^/D +&L  Es#EE) E+ 8E+  E('E(c]tRt^DtRtRRlt]RRl4tRRltRR lt R R lt R R lt RRlt RRlt RRltRRltRRltRRltRRltRRltRRltR tR!#)" ResolutionzStateful resolution object. This is designed as a one-off object that holds information to kick start the resolution process, and holds the results afterwards. c$V^8dQhRRRRRR/#)r providerzAbstractProvider[RT, CT, KT]reporterzBaseReporter[RT, CT, KT]r#Noner%)r&s"r'r(Resolution.__annotate__Ks( 8 8. 8+ 8  8r)c ^WnW n.Vn\VnRVnRVnR#N)_p_r_statesr_optimistic_backjumping_ratio _save_states_optimistic_start_round)selfrArBs&&&r'__init__Resolution.__init__Ks0 02 .K*<@37$r)cV^8dQhRR/#)r r#r"r%)r&s"r'r(rDZs11(1r)c hVPR,# \dp\R4ThRp?ii;i)r!N)rI IndexErrorAttributeError)rMes& r'r!Resolution.stateYs3 1<<# # 1 )q 0 1s 1 ,1cV^8dQhRR/#r r#rCr%)r&s"r'r(rD`s # # #r)c VPR,p\VPP4VPP4VP R,R7pVPP V4R#)zqPush a new state into history. This new state will be used to hold resolution results of the next coming round. NNNr+r-backtrack_causesNrS)rIr r+copyr-r]append)rMbaser!s& r'_push_new_stateResolution._push_new_state`s^ ||BLL%%']]'')!2215  E"r)c(V^8dQhRRRRRRRR/#) r r-dict[KT, Criterion[RT, CT]] requirementrparentz CT | Noner#rCr%)r&s"r'r(rDns2*)*)-*)*) *)  *)r)c  VPPW#R7VPPVR7pVP V4pV'd\ VP 4pM.pVPPV\V\P!R4WB./4\V\P!R4WF/4R7pV'd1\ VP4pVP\W#44M \W#4.p\\!V4VVR7pVP"'g \%V4hWQV&R#))rerf)requirement_or_candidateiter_requirementincompatibilities identifier requirementsrj candidates informationrjN)rHadding_requirementrGidentifygetlistrj find_matchesr operator methodcaller attrgetterrpr_r rrror) rMr-rerfrlr:rjmatchesrps &&&& r'_add_to_criteriaResolution._add_to_criterians' ""{"JWW%%{%K LL,  $Y%@%@ A  " ''&&!(%%&89]+ .##$78/'   y445K   5kJ K1+FGK&w/#/ ###(3 3(r)c$V^8dQhRRRRRR/#)r r-rdparentszCollection[KT]r#rCr%)r&s"r'r(rDs$3>L r)c  DV'gR#VP4F|wr4\VPVPUu.uF?pVPe-VP P VP4V9gK=VNKA upVP4W&K~ R#uupi)a/Remove information from parents of criteria. Concretely, removes all values from each criterion's ``information`` field that have one of ``parents`` as provider of the requirement. :param criteria: The criteria to update. :param parents: Identifiers for which to remove information from all criteria. N)r.rrorprfrGrrrj)rMr-r}r9r:rps&&& r'!_remove_information_from_criteria,Resolution._remove_information_from_criterias &nn.NC%$$(1'<'<'< #**277++K,>,>?wN  K'<++ HM/s :B =B c V^8dQhRRRR/#)r namerr#rr%)r&s"r'r(rDs   B  :  r)c  ZVPPVVPP\ VPP \ P!R44\ VPP \ P!R44VPPR7#)rorp)rl resolutionsrorpr]) rGget_preferencer!r+r r-rvrxr])rMrs&&r'_get_preferenceResolution._get_preferencesww%% **& ####L1( ####M2"ZZ88&  r)c$V^8dQhRRRRRR/#)r rrr:zCriterion[RT, CT]r#boolr%)r&s"r'r(rDs$     #4    r)c aaSPPV,o\;QJd.TT3RlTP 44F 'dK R# R#!TT3RlTP 444# \dR#i;i)Fc3^<"TF"pSPPVSR7xK$ R#5i)re candidateNrGis_satisfied_by).0r current_pinrMs& r' 8Resolution._is_current_pin_satisfying..s/ 1 GG # #[ # I I1*-T)r!r+r3allri)rMrr:rsf&&@r'_is_current_pin_satisfying%Resolution._is_current_pin_satisfyings **,,T2Ks //1 ss s s //1     sA99 BBc V^8dQhRRRR/#)r rrr#rdr%)r&s"r'r(rDsr6Qr)c VPPP4pVPP VR7FpVP W#VR7K V#)rrf)r!r-r^rGget_dependenciesrz)rMrr-res&& r'_get_updated_criteria Resolution._get_updated_criteriasO::&&++-7733i3HK  ! !( ! JIr)c V^8dQhRRRR/#)r rrr#list[Criterion[RT, CT]]r%)r&s"r'r(rDs##b#5L#r)c &aaSPPV,p.pVPEFoSPS4p\;QJd.TT3RlTP44F 'dK RM# RM!TT3RlTP444pT'g \ST4hSP PSR7SPPPT4SPPPTR4SSPPT&.u# V# \dNpSP P TPS4TPTP4Rp?EK]Rp?ii;i)Nc3^<"TF"pSPPVSR7xK$ R#5irr)rrrrMs& r'r7Resolution._attempt_to_pin_criterion..s/5A''A'KK5rFTr)r!r-rorrrHrejecting_candidater:r_rrirpinningupdater+pop)rMrr:causesr-rV satisfiedrsf& @r'_attempt_to_pin_criterion$Resolution._attempt_to_pin_criterions6JJ''- *,"--I 55i@"335"335I+IyAA GGOOiO 0 JJ   & &x 0 JJ   " "4 .'0DJJ  t $I7.> 9* ++AKKC akk* sD88 FAF  Fc V^8dQhRRRR/#)r incompatibilities_from_brokenzlist[tuple[KT, list[CT]]]r#rr%)r&s"r'r(rDs!!-F! !r)c  pVEFwr#V'gKVPPV,pTPP T\ TPP\ P!R44\ TPP\ P!R4Y#/4R7p\T4pT'gR#TPTP4\T\TP4TR7TPPT&EK R# \dEK1i;i)rirjrkFrnT)r!r-r3rGrur rvrwrxrextendrjrrtrp)rMrr5rjr:ryros&& r'_patch_criteriaResolution._patch_criterias  %B A$  JJ//2 gg**,JJ''))*<=#2JJ''''(;<*# + G,;7+CJ  $ $Y%@%@ A%.% !6!67"3&DJJ   "/%B8/  sD%% D54D5cV^8dQhRR/#rYr%)r&s"r'r(rDs  T r)c  VPfqVPUu.uFRp\VPP 4VP P 4VP R,R7NKT upVnR#R#uupi)zCSave states for potential rollback if optimistic backjumping fails.Nr[r\)rKrIr r+r^r-r])rMss& r' _save_stateResolution._save_statesq    $ ! &A IINN,ZZ__.%&%7%7%: & !D  %!sABcV^8dQhRR/#rYr%)r&s"r'r(rD*s%%$%r)c lRVnVP'dVPVnRVnR#R#)z3Rollback states and disable optimistic backjumping.gN)rJrKrI)rMs&r'_rollback_statesResolution._rollback_states*s0-0*    ,,DL $D  r)c V^8dQhRRRR/#)r r$list[RequirementInformation[RT, CT]]r#rr%)r&s"r'r(rD1sii Diir)c \P!RV4RV44pVUu0uFq0PPV4kK pp\ VP 4^8EdVP RVP pVP P4pVPP4wrgTP'gYd9dMTP'd%TPfYd9dTP4TPP!T4Uu0uFqPPT4kK p pT P#T4'gM;TP'gM(\ TP 4^8:gEK\T4hTP$P'4U U u.uFwrT \)T P*43NK p p p T P-Yg.34TP/4TP1T 4p T 'gEKR#R#uupi \\3d\T4Rhi;iuupiuup p i)arPerform backjumping. When we enter here, the stack is like this:: [ state Z ] [ state Y ] [ state X ] .... earlier states are irrelevant. 1. No pins worked for Z, so it does not have a pin. 2. We want to reset state Y to unpinned, and pin another candidate. 3. State X holds what state Y was before the pin, but does not have the incompatibility information gathered in state Y. Each iteration of the loop will: 1. Identify Z. The incompatibility is not always caused by the latest state. For example, given three requirements A, B and C, with dependencies A1, B1 and C1, where A1 and B1 are incompatible: the last state might be related to C, so we want to discard the previous state. 2. Discard Z. 3. Discard Y but remember its incompatibility information gathered previously, and the failure we're dealing with right now. 4. Push a new state Y' based on X, and apply the incompatibility information from Y to Y'. 5a. If this causes Y' to conflict, we need to backtrack again. Make Y' the new Z and go back to step 2. 5b. If the incompatibilities apply cleanly, end backtracking. c3X"TF qPfKVPxK" R#5irFrrcs& r'r'Resolution._backjump..Qs >v!XQXXvs**c38"TFqPxK R#5irF)rers& r'rrRs +Fq]]FsTNFrS) itertoolschainrGrrlenrIr!rr+popitemrTr3rrJrKrr isdisjointr-r.rtrjr_rar)rMrincompatible_reqsrincompatible_deps broken_staterrdcurrent_dependenciesr5r6rsuccesss&& r' _backjumpResolution._backjump1s >09 >v > +F +0 ;LL:KQWW--a0:KL$,,1$ R  ::LA#'<<#3#3#5L&2&:&:&B&B&DOD :::5 666))15$$& 261I1I)1T(1TAGG$$Q'1T%(,667HII $+++t||$).v66%*.)D)D9 /+ /@+/"#RSS./!36 >t D  --.?@++6+: "nnV4G59# .. >>.. --51 1T5F5F5F))+5;JJ//2#24::3N3NOO#+/***=*=*C*C*E+*E-!;;CKC*E(+ 66JJ'')@$$& GG {** E_-b ++{* K*1;;+B+BCJ KD!l,999d>O>O>O8<5 .+sT%(S(<TT0T! UU3U( T3 TT!U>UUU)rJrLrGrHrKrIN)__name__ __module__ __qualname____firstlineno____doc__rNpropertyr!rarzrrrrrrrrrrr__static_attributes__r%r)r'r?r?Dsn 811 #*)X6     #J!F %iVR N,N,r)r?c.]tRtRtRt]tRRRlltRtR#)Resolveri3z3The thing that performs the actual resolution work.c$V^8dQhRRRRRR/#)r rmrrrr#r$r%)r&s"r'r(Resolver.__annotate__8s("$"$""$"$  "$r)c |\VPVP4pVPWR7p\ V4#)afTake a collection of constraints, spit out the resolution result. The return value is a representation to the final resolution result. It is a tuple subclass with three public members: * `mapping`: A dict of resolved candidates. Each key is an identifier of a requirement (as returned by the provider's `identify` method), and the value is the resolved candidate. * `graph`: A `DirectedGraph` instance representing the dependency tree. The vertices are keys of `mapping`, and each edge represents *why* a particular package is included. A special vertex `None` is included to represent parents of user-supplied requirements. * `criteria`: A dict of "criteria" that hold detailed information on how edges in the graph are derived. Each key is an identifier of a requirement, and the value is a `Criterion` instance. The following exceptions may be raised if a resolution cannot be found: * `ResolutionImpossible`: A resolution cannot be found for the given combination of requirements. The `causes` attribute of the exception is a list of (requirement, parent), giving the requirements that could not be satisfied. * `ResolutionTooDeep`: The dependency tree is too deeply nested and the resolver gave up. This is usually caused by a circular dependency, but you can try to resolve this by increasing the `max_rounds` argument. )r)r?rArBrr=)rMrmr resolutionr!s&&& r'rResolver.resolve8s7@  t}}= ""<"GU##r)r%N)d) rrrrrrbase_exceptionrrr%r)r'rr3s=&N"$"$r)rc ,V^8dQhRRRRRRRRR R /#) r r-zMapping[KT, Criterion[RT, CT]]r9z KT | Noner7zdict[int, KT | None]r8zset[KT | None]r#rr%)r&s"r'r(r(]s:, #   r)c6W9dR#W9dR#VfQhW,P4FVpV\V4,pYS9dTPT4R#\ YY#4'gKDTPT4R# R# \dKji;i)TF)r2r/r3r0r1)r-r9r7r8r;r<s&&&& r'r1r1]s    ?? ] & & ( BqE?D   MM#  hh B B MM# )    sB  BB)-__conditional_annotations__ __future__rrrrvtypingrrstructsrrrr r r r r rabstractrrr:r exceptionsrrrrrcollections.abcrrr providersrr reportersrr__annotations__r=r?rr1)r s@r'rs"")   / ==8('*u*