jaNUddlmZddlZddlZddlZddlmZmZddlm 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<d#dZ(Gddee e e fZ)Gddee e e fZ*d$d"Z+dS)%) annotationsN) TYPE_CHECKINGGeneric) CTKTRT DirectedGraph IterableViewIteratorMappingRequirementInformationStatebuild_iter_view)AbstractResolverResult) Criterion)InconsistentCandidateRequirementsConflictedResolutionImpossibleResolutionTooDeepResolverException) CollectionIterableMapping)AbstractProvider Preference) BaseReporterg?float_OPTIMISTIC_BACKJUMPING_RATIOstateState[RT, CT, KT]returnResult[RT, CT, KT]c|j}d|D}d|td<t}|ddh|jD]\}}t |j||s||vr|||D]X} |t|}n#t$rY%wxYw||vr||| ||Ytfd|D||jS)Nc4i|]\}}t||S)id.0kvs YC:\Projects\DSCons\.venv\Lib\site-packages\pip\_vendor\resolvelib\resolvers\resolution.py z!_build_result..(s$%K%K%K41abeeQ%K%K%Kc$i|] \}}|v || Sr'r')r*r+r, connecteds r-r.z!_build_result..>s$DDD$!QQ)^^A^^^r/)mappinggraphcriteria) r2itemsr(r addr4_has_route_to_root iter_parentKeyErrorconnectr) r!r2all_keysr3key criterionppkeyr1s @r- _build_resultr@&sqmG%K%K7==??%K%K%KHHRXX&3ooE IIdOOO!%I...00 % %Y!%.#xKK   e   IIcNNN&&(( % %A 1    5   $ MM$ $ $ $ $ % DDDD'--//DDD   sC C('C(ceZdZdZd3dZed4d Zd5d Zd6dZd7dZ d8dZ d9dZ d:d Z d;d"Z dd,Zd?d1Zd2S)@ 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. providerAbstractProvider[RT, CT, KT]reporterBaseReporter[RT, CT, KT]r#Nonecd||_||_g|_t|_d|_d|_dSN)_p_r_statesr _optimistic_backjumping_ratio _save_states_optimistic_start_round)selfrCrEs r-__init__zResolution.__init__Ks: 02 .K*<@37$$$r/r"cb |jdS#t$r}td|d}~wwxYw)Nr!)rL IndexErrorAttributeError)rPes r-r!zResolution.stateYsC 1<# # 1 1 1 ))q 0 1s  .).c|jd}t|j|j|jdd}|j|dS)zPush a new state into history. This new state will be used to hold resolution results of the next coming round. rSNr2r4backtrack_causes)rLrr2copyr4rYappend)rPbaser!s r-_push_new_statezResolution._push_new_state`ss |BL%%'']''))!21115    E"""""r/r4dict[KT, Criterion[RT, CT]] requirementr parent CT | Nonec |j|||j|}||}|rt |j}ng}|j|t|tj d||git|tj d||i}|r8t |j }| t||nt||g}tt!|||}|jst%||||<dS)N)r_r`)requirement_or_candidateiter_requirementincompatibilities identifier requirementsre candidates informationre)rKadding_requirementrJidentifygetlistre find_matchesr operator methodcaller attrgetterrkr[r rrrjr) rPr4r_r`rgr=rematchesrks r-_add_to_criteriazResolution._add_to_criterians{ ""{6"JJJW%%{%KK LL,,  # $Y%@ A A   " '&&!(%&899k]+ .#$788./'     Hy455K   5k6JJ K K K K1+vFFGK&w//#/   # 4(33 3(r/parentsCollection[KT]csdS|D]5\}}t|jfd|jD|j||<6dS)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. Ncdg|],}|j!j|jv*|-SrI)r`rJrm)r*rkrvrPs r- z@Resolution._remove_information_from_criteria..sM##*27++K,>??wNN  ONNr/)r5rrjrkre)rPr4rvr<r=s` ` r-!_remove_information_from_criteriaz,Resolution._remove_information_from_criterias  F&nn..  NC%$'0'<+  HSMM  r/namerrc |j||jjt |jjt jdt |jjt jd|jjS)Nrjrk)rg resolutionsrjrkrY) rJget_preferencer!r2r r4rqrsrY)rPr|s r-_get_preferencezResolution._get_preferences~w%% *& ##L11( ##M22"Z8&   r/r=Criterion[RT, CT]boolc jj|n#t$rYdSwxYwtfd|DS)NFc3PK|] }j|V!dS)r_ candidateNrJis_satisfied_by)r*r current_pinrPs r- z8Resolution._is_current_pin_satisfying..sL   G # #[ # I I      r/)r!r2r9allrd)rPr|r=rs` @r-_is_current_pin_satisfyingz%Resolution._is_current_pin_satisfyings *,T2KK   55      //11      s  %%rrc|jj}|j|D]}|||||S)Nrr`)r!r4rZrJget_dependenciesru)rPrr4r_s r-_get_updated_criteriaz Resolution._get_updated_criterias_:&++--733i3HH K KK  ! !(K ! J J J Jr/list[Criterion[RT, CT]]cpjj|}g}|jD] }nQ#t$rD}j|j||jYd}~cd}~wwxYwtfd| D}|st|j jj |jj|djj|<gcS|S)Nc3PK|] }j|V!dSrr)r*rrrPs r-rz7Resolution._attempt_to_pin_criterion..sL''A'KKr/r)r!r4rjrrrKrejecting_candidater=r[rrdrpinningupdater2pop)rPr|r=causesr4rV satisfiedrs` @r-_attempt_to_pin_criterionz$Resolution._attempt_to_pin_criterionsjJ'- *,"-  I 55i@@)   ++AKCCC ak*** "3355I B+IyAAA GOOiO 0 0 0 J  & &x 0 0 0 J  " "4 . . .'0DJ t $III s8 B:BBincompatibilities_from_brokenlist[tuple[KT, list[CT]]]c |D]\}}|s |jj|}n#t$rY)wxYw|j|t |jjt jdt |jjt jd||i}t|}|sdS| |j t|t|j||jj|<dS)NrdrerfFriT)r!r4r9rJrpr rqrrrsrextendrerrork)rPrr+rer=rtrjs r-_patch_criteriazResolution._patch_criterias> %B   A $   J/2     g**,J')*<==#2J''(;<<)*## +  G,;7+C+CJ uu  $ $Y%@ A A A%.% !677"3&&&DJ  " " ts   --cD|jd|jD|_dSdS)zCSave states for potential rollback if optimistic backjumping fails.Nc g|]O}t|j|j|jddPS)NrX)rr2rZr4rY)r*ss r-rzz*Resolution._save_state..!sf!!!  INN,,Z__..%&%7%:!!!r/)rNrLrPs r- _save_statezResolution._save_states>   $!!  !!!D    % $r/cLd|_|jr|j|_d|_dSdS)z3Rollback states and disable optimistic backjumping.gN)rMrNrLrs r-_rollback_stateszResolution._rollback_states*s7-0*   %,DL $D    % %r/r$list[RequirementInformation[RT, CT]]ctjd|Dd|D}fd|D}tjdkrjd=j} j}|j\}}n%#ttf$rt|dwxYwj s||vrnj rj ||vr fdj|D}||sn0|jsn(tjd krt|d |jD}|||gf|} | rdStjdkd S) 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. c32K|]}|j |jVdSrIrr*cs r-rz'Resolution._backjump..Qs+ > >!)=QX)=)=)=)= > >r/c3$K|] }|jV dSrI)r_rs r-rz'Resolution._backjump..Rs$ + +qQ] + + + + + +r/cDh|]}j|Sr'rJrm)r*rrPs r- z'Resolution._backjump..Ts)LLLQTW--a00LLLr/rSTNcDh|]}j|Sr'r)r*drPs r-rz'Resolution._backjump..ws6(((,-DG$$Q''(((r/rc@g|]\}}|t|jfSr')rorer)s r-rzz(Resolution._backjump..s9---371aD,--.---r/F) itertoolschainlenrLr!rr2popitemrTr9rrMrNrrJr isdisjointr4r5r[r]r) rPrincompatible_reqsincompatible_deps broken_stater|rcurrent_dependenciesrsuccesss ` r- _backjumpzResolution._backjump1sn>09 > >v > > > + +F + + +0 0 MLLL:KLLL$,1$$ R  :L+ 7A#'<#3#3#5#5L&2&:&B&B&D&DOD))"H-AAA.v66D@A:$555 6')1$555$$&&& ((((151I1I)1T1T((($,667HII $+t|$$)).v666W+ 7Z--;G;P;V;V;X;X--- ) * 0 0$ 1D E E E  " " "**+HIIG t$,1$$Jus #5B"B;criteroncXtd|DS)z5Extract causes from list of criterion and deduplicatecBi|]}|jD]}t||Sr')rkr()r*ris r-r.z.Resolution._extract_causes..s/GGG!GGARUUAGGGGr/)rovalues)rPrs r-_extract_causeszResolution._extract_causess-GGxGGGNNPPQQQr/rh Iterable[RT] max_roundsintcjrtdjt t jigg_|D]Q} jj |d&#t$r}t|j j |d}~wwxYwd}d}t|D]l}j|jrajZ|8|}t'||z jz}|dkren |||z |krfdjj D}|s)jjjcSt/jj t/|z t3|dkrt5j|jjt=jj t?j d t=jj t?j d jj! } n|} | std t3| dkrtE| j# } n| d} $| } | r҉%| } j&|  '| } tQ| o joj}n"#t$rjr jrd}nYnwxYw|rjrn| jj!dd<| stjj!n_fdjj D})jj |j*|jntW|)Nzalready resolvedrXr)indexrcFg|]\}}|||Sr'r)r*r<r=rPs r-rzz&Resolution.resolve..sC!!!"C66sIFF!!!!r/)r!rrjrk) identifiersr~rjrkrYz-narrow_requirement_selection returned 0 names)r<)rTcNh|]!\}}|v |||"Sr'r)r*r<r=satisfied_namesrPs r-rz%Resolution.resolve.."sJ+++&Yo-- ;;CKK.---r/)rr!),rL RuntimeErrorrKstartingr collections OrderedDictrur!r4rrr=rkr]rangestarting_roundrMrNrrr5endingsetkeysrrorJnarrow_requirement_selectionr2r rqrsrYminrrrresolving_conflictsrrr{ ending_roundr)rPrhrrrVoptimistic_rounds_cutoff"optimistic_backjumping_start_round round_indexunsatisfied_namesnarrowed_unstatisfied_namesr|failure_criterionrrfailed_optimistic_backjumpingnewly_unsatisfied_namesrs` @r-resolvezResolution.resolves7 < 3122 2  #/11!#      K KA K%%dj&91T%JJJJ) K K K*1;+BCCJ K 04 9=* ,,o Fo FK G " " " 5 5 51 !d6G6S5=9D6/2#k1T5WW00,0144--/// 5.9#&HH344--/// !!!!&*j&9&?&?&A&A!!! % "TZ000z!!!"$*"5":":"<"<==DU@V@VVO$%%)).2G88$5$(J$6#2 J/$/ ==$$%4 J/$/ >>%%*.)D9  //++ /@+/ T"#RSSS.//!336D >t D D  ) '--.?@@++6+::: "nnV44G59# . >. -5511 ,9d>O8<55651PT5FP))++++5;DJ/2#P24:3NOOOP +++++*.**=*C*C*E*E+++' 66J')@$$&&& G {$* E E E E +++s* "B B, B''B,!MM43M4N)rCrDrErFr#rG)r#r")r#rG)r4r^r_r r`rar#rG)r4r^rvrwr#rG)r|rr#r)r|rr=rr#r)rrr#r^)r|rr#r)rrr#r)rrr#r)rrr#r)rhrrrr#r")__name__ __module__ __qualname____doc__rQpropertyr!r]rur{rrrrrrrrrrr'r/r-rBrBDsh 8 8 8 8111X1 # # # #*)*)*)*)X6           ####J!!!!F    %%%%iiiiVRRRR N,N,N,N,N,N,r/rBc"eZdZdZeZ d d d Zd S) Resolverz3The thing that performs the actual resolution work.drhrrrr#r$ct|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)rBrCrErr@)rPrhr resolutionr!s r-rzResolver.resolve8s>@  t}== ""r?s r-r7r7]s  it (u ??? c] & & ( (   BqEE?DD    H  9   MM#   44 hh B B  MM#   44  5sA AA)r!r"r#r$) r4rr<rr;rr1rr#r), __future__rrrrqtypingrrstructsrrr r r r r rrabstractrrr=r exceptionsrrrrrcollections.abcrrr providersrr reportersrr __annotations__r@rBrr7r'r/r-rs>"""""""))))))))                      /....... )==========88888888(((((('*****