)hP0ddlmZddlZddlZddlZddlmZmZmZm Z m Z ddl m Z m Z mZmZmZmZmZmZmZddlmZmZddlmZdd lmZmZmZmZmZerdd l m!Z!m"Z"dd l#m$Z$dd Z%Gd deee e fZ&Gddeee e fZ' ddZ(y)) annotationsN) TYPE_CHECKING CollectionGenericIterableMapping) CTKTRT DirectedGraph IterableViewIteratorMappingRequirementInformationStatebuild_iter_view)AbstractResolverResult) Criterion)InconsistentCandidateRequirementsConflictedResolutionImpossibleResolutionTooDeepResolverException)AbstractProvider Preference) BaseReporterc|j}|jDcic]\}}t||}}}d|td<t}|j ddh}|j jD]~\}}t |j |||s||vr|j ||jD]8} |t| } | |vr|j | |j| |:t|jDcic] \}}||vs ||c}}||j Scc}}w#t$rYwxYwcc}}w)N)mappinggraphcriteria) r itemsidr addr"_has_route_to_root iter_parentKeyErrorconnectr) stater kvall_keysr! connectedkey criterionppkeys ^/var/www/html/venv/lib/python3.12/site-packages/pip/_vendor/resolvelib/resolvers/resolution.py _build_resultr4"sFmmG;B==?%K41abeQh%KH%KHRX&3oE IIdO!%I....0 %Y!%..#xK  e  IIcN&&( %A 15  $ MM$ $ % % ")--/D$!QQ)^AD +&L  Es#D?E E %E  EEceZdZdZ ddZeddZddZ ddZ ddZ ddZ ddZ dd Z dd Z dd Zdd Z dd ZddZy) 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.||_||_g|_yN)_p_r_states)selfproviderreporters r3__init__zResolution.__init__Gs 02 c\ |jdS#t$r}td|d}~wwxYw)Nr*)r; IndexErrorAttributeError)r<es r3r*zResolution.statePs3 1<<# # 1 )q 0 1s + &+c|jd}t|jj|jj|j dd}|jj |y)zPush a new state into history. This new state will be used to hold resolution results of the next coming round. rBNr r"backtrack_causes)r;rr copyr"rHappend)r<baser*s r3_push_new_statezResolution._push_new_stateWs^ ||BLL%%']]'')!2215  E"r@c p|jj|||jj|}|j |}|rt |j }ng}|jj|t|tjd||git|tjd||i}|r1t |j}|jt||n t||g}tt!|||}|j"s t%||||<y)N) requirementparent)requirement_or_candidateiter_requirementincompatibilities identifier requirementsrR candidates informationrR)r:adding_requirementr9identifygetlistrR find_matchesroperator methodcaller attrgetterrXrJrrrrWr) r<r"rNrOrTr0rRmatchesrXs r3_add_to_criteriazResolution._add_to_criteriaes1 ""{6"JWW%%{%K LL,  $Y%@%@ A  " ''&&!(%%&89k]+ .##$78./'   y445K   5k6J K1+vFGK&w/#/ ##(3 3(r@c "|sy|jD]t\}}t|j|jDcgc]7}|j'|j j |j|vr|9c}|j||<vycc}w)aWRemove 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#rrWrXrOr9rZrR)r<r"parentsr/r0rXs r3!_remove_information_from_criteriaz,Resolution._remove_information_from_criterias &nn. NC%$$(1'<'<##**277++K,>,>?wN  ++ HSM sz8Resolution._is_current_pin_satisfying..s-  GG # #[ # I '*)r*r r(allrQ)r<rir0rss` @r3_is_current_pin_satisfyingz%Resolution._is_current_pin_satisfyingsU **,,T2K //1     sA A  A c|jjj}|jj |D]}|j ||||S)NrnrO)r*r"rIr9get_dependenciesrb)r<rnr"rNs r3_get_updated_criteriaz Resolution._get_updated_criteriasW::&&++-7733i3H KK  ! !(K ! J Kr@cjj|}g}|jD] j}tfd|jD}|s t|j jjjj|jjj|djj|<gcS|S#t$rL}j j |j|j|jYd}~d}~wwxYw)Nc3XK|]!}jj|#ywrmro)rqrrrnr<s r3rtz7Resolution._attempt_to_pin_criterion..s-''A'Krury)r*r"rWr|rr:rejecting_candidater0rJrvrQrpinningupdater pop)r<rir0causesr"rE satisfiedrns` @r3_attempt_to_pin_criterionz$Resolution._attempt_to_pin_criterionsJJ''- *,"-- I 55i@"335I+IyAA GGOOiO 0 JJ   & &x 0 JJ   " "4 .'0DJJ  t $I7 > 9* ++AKKC akk* sC77 E AEE c @|D]\}}|s |jj|}|jj |t |jjt jdt |jjt jd||i}t|}|sy|j|jt|t|j||jj|< y#t$rYwxYw)NrQrRrSFrVT)r*r"r(r9r]rr^r_r`rextendrRrr\rX)r<incompatibilities_from_brokenr+rRr0rarWs r3_patch_criteriazResolution._patch_criterias %B  A $  JJ//2 gg**,JJ''))*<=#2JJ''''(;<)*# + G,;7+CJ  $ $Y%@%@ A%.% !6!67"3&DJJ   "/ 8/  sD DDctjd|Dd|D}|Dchc]}|jj|}}t |j dk\rK|j d=|j } |j j}|jj\}}||vrna|jj|Dchc]}|jj|} }| j|sn|jsn|jj!D cgc]\} } | t#| j$f} } } | j'||gf|j)|j+| } | ryt |j dk\rKycc}w#ttf$r t|dwxYwcc}wcc} } w)a2Perform 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. c3NK|]}|j|jywr8rzrqcs r3rtz'Resolution._backjump..5s >!)=QXX >s%%c34K|]}|jywr8)rNrs r3rtz'Resolution._backjump..6s +qQ]] +srBTNF) itertoolschainr9rZlenr;r*rr popitemrCr(rr{ isdisjointr"r#r\rRrJrLr)r<rincompatible_reqsrrincompatible_deps broken_staterirndcurrent_dependenciesr+r,rsuccesss r3 _backjumpzResolution._backjumps>09 >v > +F +0 ;LLQTWW--a0LL$,,1$ R  ::LA#'<<#3#3#5L&2&:&:&B&B&DOD) 00 261I1I)1T(,-DGG$$Q'($(,667HI $++38xG!GARUAXGUGNNPQQGs$A c|jr td|jjt t j igg|_|D]+} |j|jj|d-|jt|D]}|jj!||jjj#Dcgc]\}}|j%||s|}}}|s4|jj'|j|jcSt)|jjj+t)|z } t-|dkDrt/|j0j3||jj4t7|jjt9j:dt7|jjt9j:d|jj< } n|} | s td t-| dkDrt?| |j@ } n| d } |jC| } | rx|jE| } |jjG| |jI| }| |jj<dd|st|jj<|jjj#Dchc]\}}|| vr|j%||s|}}}|jK|jj||j|jjM||j tO|#t$r%}t|jj|d}~wwxYwcc}}wcc}}w)Nzalready resolvedrGrz)index)r*rrWrX) identifiersrgrWrXrHz-narrow_requirement_selection returned 0 names)r/r)r)rr*)(r; RuntimeErrorr:startingr collections OrderedDictrbr*r"rrr0rXrLrangestarting_roundr#rwendingsetkeysrr\r9narrow_requirement_selectionr rr^r`rHminrjrrresolving_conflictsrre ending_roundr)r<rU max_roundsrrrE round_indexr/r0unsatisfied_namessatisfied_namesnarrowed_unstatisfied_namesrifailure_criterionrrnewly_unsatisfied_namess r3resolvezResolution.resolvets <<12 2  #//1!#    KA K%%djj&9&91T%J K  ,K FK GG " " " 5'+jj&9&9&?&?&A!"C66sIF! !%TZZ0zz!"$**"5"5":":"<=DU@VVO$%).2GG88$5$(JJ$6$6#2 JJ//$// =$%4 JJ//$// >%*.)D)D9 /+ /@+/"#RSS./!36D >t D  --.?@++6+:..017 ++A..tzz/J/JKK +/***=*=*C*C*E+&Yo- ;;CK+'+ 66JJ'')@$$& GG {$** EWK FZ ++k* K*1;;+B+BCJ K!x+s$(N8*O)("O/8 O& O!!O&N)r=zAbstractProvider[RT, CT, KT]r>zBaseReporter[RT, CT, KT]returnNone)rState[RT, CT, KT])rr)r"dict[KT, Criterion[RT, CT]]rNr rOz CT | Nonerr)r"rrdzCollection[KT]rr)rir rr)rir r0zCriterion[RT, CT]rbool)rnr rr)rir rlist[Criterion[RT, CT]])rzlist[tuple[KT, list[CT]]]rr)r$list[RequirementInformation[RT, CT]]rr)rrrr)rU Iterable[RT]rintrr)__name__ __module__ __qualname____doc__r?propertyr*rLrbrerjrwr|rrrrrr@r3r6r6@s 3.3+3  311 #*)-*)*) *)  *)X3>L 6      #4     #J!-F! !FWrR/R -R f,r@r6c*eZdZdZeZ d ddZy)Resolverz3The thing that performs the actual resolution work.c~t|j|j}|j||}t |S)aTake 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<rUr resolutionr*s r3rzResolver.resolves9@  t}}= ""rs"HH   / 8(