T=j^V%SSKJr SSKrSSKrSSKrSSKJrJr SSKJ r J r J r J r J r JrJrJrJr SSKJrJr SSKJr SS KJrJrJrJrJr \(aSS KJrJrJ r SS K!J"r"J#r# SS K$J%r% S r&S\'S'SSjr("SS\\ \ \ 45r)"SS\\ \ \ 45r*SSjr+g)) annotationsN) TYPE_CHECKINGGeneric) CTKTRT DirectedGraph IterableViewIteratorMappingRequirementInformationStatebuild_iter_view)AbstractResolverResult) Criterion)InconsistentCandidateRequirementsConflictedResolutionImpossibleResolutionTooDeepResolverException) CollectionIterableMapping)AbstractProvider Preference) BaseReporterg?float_OPTIMISTIC_BACKJUMPING_RATIOcURnUR5VVs0sHup#[U5U_M nnnSU[S5'[5nUR S5 S1nUR R5Hupx[ UR XtU5(dM#Xu;aUR U5 UR5H9n U[U 5n X;aUR U 5 URX5 M; M [UR5VVs0sHup#X&;dM X#_M snnUUR S9$s snnf![a Mf=fs snnf)N)mappinggraphcriteria) r"itemsidr addr$_has_route_to_root iter_parentKeyErrorconnectr) stater"kvall_keysr# connectedkey criterionppkeys o/Users/stevendouglas/BidBrain/.venv/lib/python3.13/site-packages/pip/_vendor/resolvelib/resolvers/resolution.py _build_resultr6&s4mmG;B==?%K?41beQh?H%KHRX&3oE IIdO!%I....0!%..#KK    IIcN&&(A 1  $ MM$ $) 1 ")--/D/$!Q^/D +&L  Es#E E# E! 2E!  EEc\rSrSrSrSSjr\SSj5rSSjrSSjr SSjr SSjr SS jr SS jr SS jrSS jrSS jrSSjrSSjrSSjrS SjrSrg)! ResolutionDzStateful 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\XlX l/Ul[UlSUlSUlgN)_p_r_statesr _optimistic_backjumping_ratio _save_states_optimistic_start_round)selfproviderreporters r5__init__Resolution.__init__Ks0 02 .K*<@37$c^URS$![an[S5UeSnAff=f)Nr,)r> IndexErrorAttributeError)rBes r5r,Resolution.stateYs3 1<<# # 1 )q 0 1s , ',cURSn[URR5URR5UR SSS9nURR U5 g)zqPush a new state into history. This new state will be used to hold resolution results of the next coming round. rINr"r$backtrack_causes)r>rr"copyr$rPappend)rBbaser,s r5_push_new_stateResolution._push_new_state`s^ ||BLL%%']]'')!2215  E"rGc nURRX#S9 URRUS9nUR U5nU(a[ UR 5nO/nURRU[U[R"S5XB/05[U[R"S5XF05S9nU(a0[ UR5nUR[X#55 O [X#5/n[[!U5UUS9nUR"(d [%U5eXQU'g)N) requirementparent)requirement_or_candidateiter_requirementincompatibilities identifier requirementsr[ candidates informationr[)r=adding_requirementr<identifygetlistr[ find_matchesr operator methodcaller attrgetterrarRr rrr`r) rBr$rWrXr]r2r[matchesras r5_add_to_criteriaResolution._add_to_criterians$ ""{"JWW%%{%K LL,  $Y%@%@ A  " ''&&!(%%&89]+ .##$78/'   y445K   5kJ K1+FGK&w/#/ ##(3 3(rGc <U(dgUR5H{up4[URURVs/sH=nURb+UR R UR5U;dM;UPM? snUR5X'M} gs snf)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%rr`rarXr<rcr[)rBr$parentsr1r2ras r5!_remove_information_from_criteria,Resolution._remove_information_from_criterias &nn.NC%$$(1'<'<'< #**277++K,>,>?wN  '<++ HM/s :B :B c TURRUURR[ URR [ R"S55[ URR [ R"S55URRS9$)Nr`ra)r] resolutionsr`rarP) r<get_preferencer,r"r r$rgrirP)rBnames r5_get_preferenceResolution._get_preferencesww%% **& ####L1( ####M2"ZZ88&  rGc^^TRRUm[UU4SjUR 555$![a gf=f)NFc3X># UHnTRRUTS9v M! g7f)rW candidateNr<is_satisfied_by).0r current_pinrBs r5 8Resolution._is_current_pin_satisfying..s, 1 GG # #[ # I1'*)r,r"r*allrZ)rBrtr2rs` @r5_is_current_pin_satisfying%Resolution._is_current_pin_satisfyingsU **,,T2K //1     sA A AcURRR5nURR US9HnUR X#US9 M U$)NrzrX)r,r$rQr<get_dependenciesrk)rBrzr$rWs r5_get_updated_criteria Resolution._get_updated_criteriasO::&&++-7733i3HK  ! !( ! JIrGc^^TRRUn/nURHmTRT5n[UU4SjUR555nU(d [TU5eTR RTS9 TRRRU5 TRRRUS5 TTRRU'/s $ U$![aMnTR R URT5 URUR5 SnAGM#SnAff=f)Nc3X># UHnTRRUTS9v M! g7fryr{)r}r~rzrBs r5r7Resolution._attempt_to_pin_criterion..s,5A''A'K5rr)r,r$r`rrr=rejecting_candidater2rRrrZrpinningupdater"pop)rBrtr2causesr$rL satisfiedrzs` @r5_attempt_to_pin_criterion$Resolution._attempt_to_pin_criterionsJJ''- *,"--I 55i@"335I+IyAA GGOOiO 0 JJ   & &x 0 JJ   " "4 .'0DJJ  t $I7.> 9* ++AKKC akk* sC;; EAE  Ec RUGHup#U(dMURRUnURR U[ URR[ R"S55[ URR[ R"S5X#05S9n[U5nU(d gURUR5 [U[UR5US9URRU'GM g![a GM"f=f)NrZr[r\Fr_T)r,r$r*r<rfr rgrhrirextendr[rrera)rBincompatibilities_from_brokenr-r[r2rjr`s r5_patch_criteriaResolution._patch_criterias  %B A$  JJ//2 gg**,JJ''))*<=#2JJ''''(;<*# + G,;7+CJ  $ $Y%@%@ A%.% !6!67"3&DJJ   "/%B8/  sD D&%D&c URciURVs/sHKn[URR 5UR R 5UR SSS9PMM snUlggs snf)zCSave states for potential rollback if optimistic backjumping fails.NrO)r@r>rr"rQr$rP)rBss r5 _save_stateResolution._save_statesq    $ ! &A IINN,ZZ__.%&%7%7%: & !D  %!sAA8cfSUlUR(aURUlSUlgg)z3Rollback states and disable optimistic backjumping.gN)r?r@r>)rBs r5_rollback_statesResolution._rollback_states*s--0*   ,,DL $D  rGc[R"SU5SU55nUVs1sHo0RRU5iM nn[ UR 5S:GaUR S UR nUR R5nURR5upgUR(dXd;aOUR(a"URcXd;aUR5 URR!U5Vs1sHoRRU5iM n nU R#U5(dO9UR(dO'[ UR 5S::a [U5eGMUR$R'5V V s/sHupU [)U R*54PM n n n U R-Xg/45 UR/5 UR1U 5n U (ag[ UR 5S:aGMgs snf![[4a [U5Sef=fs snfs sn n f) 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. c3V# UHoRcMURv M! g7fr;rr}cs r5r'Resolution._backjump..Qs >v!XQXXvs))c38# UHoRv M g7fr;)rWrs r5rrRs +Fq]]FsrITNrF) itertoolschainr<rclenr>r,rr"popitemrJr*rr?r@rr isdisjointr$r%rer[rRrTr)rBrincompatible_reqsr~incompatible_deps broken_statertrzdcurrent_dependenciesr-r.rsuccesss r5 _backjumpResolution._backjump1s1>09 >v > +F +0 ;LL:KQWW--a0:KL$,,1$ R  ::LA#'<<#3#3#5L&2&:&:&B&B&DOD ::5 66))15$$& 261I1I)1T(1TAGG$$Q'1T%(,667HII $++t||$).v66W\ RuntimeErrorr=startingr collections OrderedDictrkr,r$rrr2rarTrangestarting_roundr?r@intrr%rendingsetkeysrrer<narrow_requirement_selectionr"r rgrirPminrurrresolving_conflictsrboolro ending_roundr)rBr^ max_roundsr~rLoptimistic_rounds_cutoff"optimistic_backjumping_start_round round_indexr1r2unsatisfied_namessatisfied_namesnarrowed_unstatisfied_namesrtfailure_criterionrrfailed_optimistic_backjumpingnewly_unsatisfied_namess r5resolveResolution.resolves~ <<12 2  #//1!#   A K%%djj&9&91T%J 04 9=* ,K GG " " " 511d6G6G6S5=9D6/2#1T5W5WW0,014--/ 5.9#H34--/ '+jj&9&9&?&?&A!&ANC66sF&A !%TZZ0zz!"$**"5"5":":"<=DU@VVO$%).2GG88$5$(JJ$6$6#2 JJ//$// =$%4 JJ//$// >%*.)D)D9 /+ /@+/"#RSS./!36 >t D  --.?@++6+: "nnV4G59# . >>. --51 1T5F5F))+5;JJ//2#24::3N3NOO#+/***=*=*C*C*E+*E-!;;CK*E(+ 66JJ'')@$$& GG {** E_-b ++{* K*1;;+B+BCJ KD!l,99d>O>O8<5 .+sH!%R* SS;S" T T8T* S4 SS".TT)r?rAr<r=r@r>N)rCzAbstractProvider[RT, CT, KT]rDzBaseReporter[RT, CT, KT]returnNone)rState[RT, CT, KT])rr)r$dict[KT, Criterion[RT, CT]]rWr rXz CT | Nonerr)r$rrnzCollection[KT]rr)rtrrr)rtrr2zCriterion[RT, CT]rr)rzrrr)rtrrlist[Criterion[RT, CT]])rzlist[tuple[KT, list[CT]]]rr)r$list[RequirementInformation[RT, CT]]rr)rrrr)r^ Iterable[RT]rrrr)__name__ __module__ __qualname____firstlineno____doc__rEpropertyr,rTrkrorurrrrrrrrr__static_attributes__rGr5r8r8Ds 8. 8+ 8  811 #*)-*)*) *)  *)X3>L 6      #4     #J!-F! !F %iVR/R -R N,rGr8c6\rSrSrSr\rSSSjjrSrg)Resolveri3z3The thing that performs the actual resolution work.cv[URUR5nURXS9n[ U5$)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)r8rCrDrr6)rBr^r resolutionr,s r5rResolver.resolve8s7@  t}}= ""<"GU##rGrN)d)r^rrrrResult[RT, CT, KT]) rrrrrrbase_exceptionrrrrGr5rr3s5=&N "$""$"$  "$"$rGrcX;agX;agUceXR5HNnU[U5nXS;aURU5 g[ XX#5(dM=URU5 g g![a M`f=f)NTF)r)r&r*r'r()r$r1r/r0r3r4s r5r(r(]s    ?? ] & & ( BqE?D   MM#  hh B B MM# )    sA77 BB)r,rrr) r$zMapping[KT, Criterion[RT, CT]]r1z KT | Noner/zdict[int, KT | None]r0zset[KT | None]rr), __future__rrrrgtypingrrstructsrrr r r r r rrabstractrrr2r exceptionsrrrrrcollections.abcrrr providersrr reportersrr __annotations__r6r8rr(rrGr5rs")   / ==8('*u*