R jP>SSKJr SSKrSSKrSSKrSSKJrJrJrJ r J r SSK J r J r JrJrJrJrJrJrJr SSKJrJr SSKJr SS KJrJrJrJrJr \(aSS K J!r!J"r" SS K#J$r$ SS jr%"S S\\\ \ 45r&"SS\\\ \ 45r'SSjr(g)) annotationsN) TYPE_CHECKING CollectionGenericIterableMapping) CTKTRT DirectedGraph IterableViewIteratorMappingRequirementInformationStatebuild_iter_view)AbstractResolverResult) Criterion)InconsistentCandidateRequirementsConflictedResolutionImpossibleResolutionTooDeepResolverException)AbstractProvider Preference) BaseReportercURnUR5VVs0sHup#[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 WD:\diplom_project\venv\Lib\site-packages\pip/_vendor/resolvelib/resolvers/resolution.py _build_resultr4"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 jrSSjrSSjrSrg) Resolution@zStateful 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/UlgN_p_r_states)selfproviderreporters r3__init__Resolution.__init__Gs 02 c^URS$![an[S5UeSnAff=f)Nr*)r= IndexErrorAttributeError)r>es r3r*Resolution.statePs3 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. rENr r"backtrack_causes)r=rr copyr"rLappend)r>baser*s r3_push_new_stateResolution._push_new_stateWs^ ||BLL%%']]'')!2215  E"rCc 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 requirementsrW candidates informationrW)r<adding_requirementr;identifygetlistrW find_matchesroperator methodcaller attrgetterr]rNrrrr\r) r>r"rSrTrYr0rWmatchesr]s r3_add_to_criteriaResolution._add_to_criteriaes$ ""{"JWW%%{%K LL,  $Y%@%@ A  " ''&&!(%%&89]+ .##$78/'   y445K   5kJ K1+FGK&w/#/ ##(3 3(rCc <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\r]rTr;r_rW)r>r"parentsr/r0r]s r3!_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\r])rY resolutionsr\r]rL) r;get_preferencer*r rr"rcrerL)r>names r3_get_preferenceResolution._get_preferencesww%% **& ####L1( ####M2"ZZ88&  rCc^^TRRUm[UU4SjUR 555$![a gf=f)NFc3X># UHnTRRUTS9v M! g7f)rS candidateNr;is_satisfied_by).0r current_pinr>s r3 8Resolution._is_current_pin_satisfying..s, 1 GG # #[ # I1'*)r*r r(allrV)r>rpr0r{s` @r3_is_current_pin_satisfying%Resolution._is_current_pin_satisfyingsU **,,T2K //1     sA A AcURRR5nURR US9HnUR X#US9 M U$)NrvrT)r*r"rMr;get_dependenciesrg)r>rvr"rSs r3_get_updated_criteria Resolution._get_updated_criteriasO::&&++-7733i3HK  ! !( ! JIrCc^^TRRUn/nURHmTRT5n[UU4SjUR555nU(d [TU5eTR RTS9 TRRRU5 TRRRUS5 TTRRU'/s $ U$![aMnTR R URT5 URUR5 SnAGM#SnAff=f)Nc3X># UHnTRRUTS9v M! g7frurw)ryrzrvr>s r3r|7Resolution._attempt_to_pin_criterion..s,5A''A'K5r~r)r*r"r\rrr<rejecting_candidater0rNrrVrpinningupdater pop)r>rpr0causesr"rH satisfiedrvs` @r3_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)NrVrWrXFr[T)r*r"r(r;rbrrcrdrerextendrWrrar])r>incompatibilities_from_brokenr+rWr0rfr\s r3_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[R"SU5SU55nUVs1sHo0RRU5iM nn[ UR 5S:Ga`UR S UR nUR R5nURR5upgXd;aOnURRU5Vs1sHoRRU5iM n nU RU5(dOUR(dOMURR!5V V s/sHupU [#U R$54PM n n n U R'Xg/45 UR)5 UR+U 5n U (ag[ UR 5S:aGM`gs 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! g7fr9rrycs r3r|'Resolution._backjump..5s >v!XQXXvs))c38# UHoRv M g7fr9)rSrs r3r|r6s +Fq]]FsrETNF) itertoolschainr;r_lenr=r*rr popitemrFr(rr isdisjointr"r#rarWrNrPr)r>rincompatible_reqsrzincompatible_deps broken_staterprvdcurrent_dependenciesr+r,rsuccesss r3 _backjumpResolution._backjumps>09 >v > +F +0 ;LL:KQWW--a0:KL$,,1$ R  ::LA#'<<#3#3#5L&2&:&:&B&B&DOD 0 261I1I)1T(1TAGG$$Q'1T%(,667HII $++38criteronris r3_extract_causesResolution._extract_causesns<xGx!ARUAXUxGNNPQQGs)A c"UR(a [S5eURR5 [ [ R "50/S9/UlUH)nURURRUSS9 M+ UR5 [U5GHnURR!US9 URRR#5VVs/sHupgUR%Xg5(aMUPM! nnnU(d1URR'URS9 URs $[)URRR+55[)U5- n [-U5S:a[/UR0R3UURR4[7URR[8R:"S55[7URR[8R:"S55URR<S 95n OUn U (d [S 5e[-U 5S:a[?XR@S 9n OU S n URCU 5n U (azUREU 5n URRGU S 9 URIU 5nXRR<SS&U(d[URR<5eOURRR#5VVs1sH&upgXi;dM UR%Xg5(aM$UiM( nnnURKURRU5 UR5 URRMXPRS9 GM! [OU5e![a%n[URR5UeSnAff=fs snnfs snnf)Nzalready resolvedrKr)index)r*rr\r]) identifiersrnr\r]rLz-narrow_requirement_selection returned 0 names)r/r)r)rr*)(r= RuntimeErrorr<startingr collections OrderedDictrgr*r"rrr0r]rPrangestarting_roundr#rendingsetkeysrrar;narrow_requirement_selectionr rrcrerLminrqrrresolving_conflictsrrk ending_roundr)r>rZ max_roundsrzrH round_indexr/r0unsatisfied_namessatisfied_namesnarrowed_unstatisfied_namesrpfailure_criterionrrnewly_unsatisfied_namess r3resolveResolution.resolvetsv <<12 2  #//1!#   A K%%djj&9&91T%J  ,K GG " " " 5'+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+:..017 ++A..tzz/J/JKK+/***=*=*C*C*E+*E-!;;CK*E(+ 66JJ'')@$$& GG {** EW-Z ++k* K*1;;+B+BCJ K!x+s6!%O)P P: P  P !P  P O==Pr:N)r?zAbstractProvider[RT, CT, KT]r@zBaseReporter[RT, CT, KT]returnNone)rState[RT, CT, KT])rr)r"dict[KT, Criterion[RT, CT]]rSr rTz CT | Nonerr)r"rrjzCollection[KT]rr)rpr rr)rpr r0zCriterion[RT, CT]rbool)rvr rr)rpr rlist[Criterion[RT, CT]])rzlist[tuple[KT, list[CT]]]rr)r$list[RequirementInformation[RT, CT]]rr)rrrr)rZ Iterable[RT]rintrr)__name__ __module__ __qualname____firstlineno____doc__rApropertyr*rPrgrkrqrrrrrrr__static_attributes__rCr3r6r6@s 3.3+3  311 #*)-*)*) *)  *)X3>L 6      #4     #J!-F! !FWrR/R -R f,rCr6c6\rSrSrSr\rSSSjjrSrg)Resolveriz3The 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)r6r?r@rr4)r>rZr resolutionr*s r3rResolver.resolves7@  t}}= ""<"GU##rCrN)d)rZrrrrResult[RT, CT, KT]) rrrrrrbase_exceptionrrrrCr3rrs5=&N "$""$"$  "$"$rCrcX;agX;agUceXR5HNnU[U5nXS;aURU5 g[ XX#5(dM=URU5 g g![a M`f=f)NTF)r'r$r(r%r&)r"r/r-r.r1r2s r3r&r&s    ?? ] & & ( BqE?D   MM#  hh B B MM# )    sA77 BB)r*rrr) r"zMapping[KT, Criterion[RT, CT]]r/z KT | Noner-zdict[int, KT | None]r.zset[KT | None]rr)) __future__rrrrctypingrrrrrstructsr r r r rrrrrabstractrrr0r exceptionsrrrrr providersrr reportersrr4r6rr&rrCr3rs"HH   / 8(