Qh]HUddlmZddlZddlZddlZddlmZmZddlm Z m Z m Z m Z m Z mZmZmZmZddlmZmZddlmZdd lmZmZmZmZmZerdd lmZmZm Z dd l!m"Z"m#Z#dd l$m%Z%d Z&de'd<ddZ(Gddee e e fZ)Gddee e e fZ* ddZ+y)) annotationsN) TYPE_CHECKINGGeneric) CTKTRT DirectedGraph IterableViewIteratorMappingRequirementInformationStatebuild_iter_view)AbstractResolverResult) Criterion)InconsistentCandidateRequirementsConflictedResolutionImpossibleResolutionTooDeepResolverException) CollectionIterableMapping)AbstractProvider Preference) BaseReporterg?float_OPTIMISTIC_BACKJUMPING_RATIOc|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 g/var/www/teggl/fontify/venv/lib/python3.12/site-packages/pip/_vendor/resolvelib/resolvers/resolution.py _build_resultr6&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 Zdd ZddZ ddZddZy) 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|_t|_d|_d|_yN)_p_r_statesr _optimistic_backjumping_ratio _save_states_optimistic_start_round)selfproviderreporters r5__init__zResolution.__init__Ks4 02 .K*<@37$c\ |jdS#t$r}td|d}~wwxYw)Nr,)r= IndexErrorAttributeError)rAes r5r,zResolution.stateYs3 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. rGNr"r$backtrack_causes)r=rr"copyr$rMappend)rAbaser,s r5_push_new_statezResolution._push_new_state`s^ ||BLL%%']]'')!2215  E"rEc 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 requirementsrW candidates informationrW)r<adding_requirementr;identifygetlistrW find_matchesr operator methodcaller attrgetterr]rOr rrr\r) rAr$rSrTrYr2rWmatchesr]s r5_add_to_criteriazResolution._add_to_criterians1 ""{6"JWW%%{%K LL,  $Y%@%@ A  " ''&&!(%%&89k]+ .##$78./'   y445K   5k6J K1+vFGK&w/#/ ##(3 3(rEc "|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%rr\r]rTr;r_rW)rAr$parentsr1r2r]s r5!_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*allrV)rArnr2rxs` @r5_is_current_pin_satisfyingz%Resolution._is_current_pin_satisfyingsU **,,T2K //1     sA A  A c|jjj}|jj |D]}|j ||||S)NrsrT)r,r$rNr;get_dependenciesrg)rArsr$rSs r5_get_updated_criteriaz Resolution._get_updated_criteriasW::&&++-7733i3H KK  ! !(K ! J KrEcjj|}g}|jD] j}tfd|jD}|s t|j jjjj|jjj|djj|<gcS|S#t$rL}j j |j|j|jYd}~d}~wwxYw)Nc3XK|]!}jj|#ywrrrt)rvrwrsrAs r5ryz7Resolution._attempt_to_pin_criterion..s-''A'Krzr~)r,r$r\rrr<rejecting_candidater2rOr{rVrpinningupdater"pop)rArnr2causesr$rJ satisfiedrss` @r5_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)NrVrWrXFr[T)r,r$r*r;rbr rcrdrerextendrWrrar])rAincompatibilities_from_brokenr-rWr2rfr\s r5_patch_criteriazResolution._patch_criterias %B  A $  JJ//2 gg**,JJ''))*<=#2JJ''''(;<)*# + G,;7+CJ  $ $Y%@%@ A%.% !6!67"3&DJJ   "/ 8/  sD DDc |ji|jDcgc]M}t|jj |j j |j ddOc}|_yycc}w)zCSave states for potential rollback if optimistic backjumping fails.NrL)r?r=rr"rNr$rM)rAss r5 _save_statezResolution._save_statesj    $ !  IINN,ZZ__.%&%7%7%:!D  %!sAA7c\d|_|jr|j|_d|_yy)z3Rollback states and disable optimistic backjumping.gN)r>r?r=)rAs r5_rollback_stateszResolution._rollback_states*s--0*   ,,DL $D  rEc2tjd|Dd|D}|Dchc]}|jj|}}t |j dk\r|j d=|j } |j j}|jj\}}|js||vrn|jr |j||vr|j|jj!|Dchc]}|jj|} }| j#|sn|jsn|j$j'D cgc]\} } | t)| j*f} } } | j-||gf|j/|j1| } | ryt |j dk\rycc}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|jywr:rrvcs r5ryz'Resolution._backjump..Qs >!)=QXX >s%%c34K|]}|jywr:)rSrs r5ryz'Resolution._backjump..Rs +qQ]] +srGTNF) itertoolschainr;r_lenr=r,rr"popitemrHr*rr>r?rr isdisjointr$r%rarWrOrQr)rArincompatible_reqsrwincompatible_deps broken_staternrsdcurrent_dependenciesr-r.rsuccesss r5 _backjumpzResolution._backjump1s>09 >v > +F +0 ;LLQTWW--a0LL$,,1$ R  ::LA#'<<#3#3#5L&2&:&:&B&B&DOD) ::$55 66))1$55$$& 261I1I)1T(,-DGG$$Q'($(,667HI $++MRxG!GARUAXGUGNNPQQGs$A c |jr td|jjt t j igg|_|D]+} |j|jj|d-|jd}d}t|D]}|jj!||j"r\|j$P|3|}t'||z |j"z}|dkr,|j)m|||z |k\r|j)|jjj+D cgc]\}} |j-|| s|} }} | s4|jj/|j|jcSt1|jjj3t1| z } t5| dkDrt7|j8j;| |jj<t?|jjtAjBdt?|jjtAjBd |jjD } n| } | s td t5| dkDrtG| |jH } n| d} |jK| }|r|jM|}|jjO|  |jQ|}tS| xr|j"xr |j$}|r|j$r|j)n||jjDddst|jjD|jjj+D chc]\}} || vr|j-|| s|}}} |jU|jj||j|jjW||jtY|#t$r%}t|jj|d}~wwxYwcc} }w#t$r |j"r|j$rd}nYowxYwcc} }w)Nzalready resolvedrLr)indexr)r,rr\r]) identifiersrlr\r]rMz-narrow_requirement_selection returned 0 names)r1)rT)rr,)-r= RuntimeErrorr<startingr collections OrderedDictrgr,r$rrr2r]rQrangestarting_roundr>r?intrr%r|endingsetkeysrrar;narrow_requirement_selectionr"r rcrerMminrorrresolving_conflictsrboolrj ending_roundr)rArZ max_roundsrwrJoptimistic_rounds_cutoff"optimistic_backjumping_start_round round_indexr1r2unsatisfied_namessatisfied_namesnarrowed_unstatisfied_namesrnfailure_criterionrrfailed_optimistic_backjumpingnewly_unsatisfied_namess r5resolvezResolution.resolves <<12 2  #//1!#    KA K%%djj&9&91T%J K 04 9=* ,o FK GG " " " 511d6G6G6S5=9D6/2#k1T5W5WW0,014--/ -9#&HH34--/ '+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+: "nnV4G59# . >>. --51 1T5F5F))+5;DJJ//2#24::3N3NOO +/***=*=*C*C*E+&Yo- ;;CK+'+ 66JJ'')@$$& GG {$** E_o Fb ++{* K*1;;+B+BCJ KD!l,99d>O>O8<56.+s6(Q,R#R#"S, R5 RR#%S  S N)rBzAbstractProvider[RT, CT, KT]rCzBaseReporter[RT, CT, KT]returnNone)rState[RT, CT, KT])rr)r$dict[KT, Criterion[RT, CT]]rSr rTz CT | Nonerr)r$rrizCollection[KT]rr)rnrrr)rnrr2zCriterion[RT, CT]rr)rsrrr)rnrrlist[Criterion[RT, CT]])rzlist[tuple[KT, list[CT]]]rr)r$list[RequirementInformation[RT, CT]]rr)rrrr)rZ Iterable[RT]rrrr)__name__ __module__ __qualname____doc__rDpropertyr,rQrgrjror|rrrrrrrrrEr5r8r8Ds 8. 8+ 8  811 #*)-*)*) *)  *)X3>L 6      #4     #J!-F! !F %dLR/R -R N,rEr8c*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)r8rBrCrr6)rArZr resolutionr,s r5rzResolver.resolve3s9@  t}}= ""rs")   / ==8('*u*