a $lJhP@s"ddlmZddlZddlZddlZddlmZmZmZm Z m Z ddl m Z m Z mZmZmZmZmZmZmZddlmZmZddlmZdd lmZmZmZmZmZerdd l m!Z!m"Z"dd l#m$Z$d d dddZ%Gdddeee e fZ&Gdddeee e fZ'ddddddddZ(dS)) annotationsN) TYPE_CHECKING CollectionGenericIterableMapping) CTKTRT DirectedGraph IterableViewIteratorMappingRequirementInformationStatebuild_iter_view)AbstractResolverResult) Criterion)InconsistentCandidateRequirementsConflictedResolutionImpossibleResolutionTooDeepResolverException)AbstractProvider Preference) BaseReporterState[RT, CT, KT]Result[RT, CT, KT])statereturnc s|j}dd|D}d|td<t}|ddh|jD]\}}t|j||s^qD||vrp|||D]J}z|t|}WntyYqxYn0||vr||| ||qxqDt fdd|D||jdS)NcSsi|]\}}t||qS)id.0kvr"r"]/var/www/shaz/venv/lib/python3.9/site-packages/pip/_vendor/resolvelib/resolvers/resolution.py $z!_build_result..csi|]\}}|vr||qSr"r"r$ connectedr"r(r):r*)mappinggraphcriteria) r-itemsr#r addr/_has_route_to_root iter_parentKeyErrorconnectr)r r-all_keysr.key criterionppkeyr"r+r( _build_result"s0       r;c@seZdZdZddddddZedd d d Zdd d d ZdddddddZddddddZ dddddZ ddddd d!Z d"dd#d$d%Z dd&dd'd(Z d)dd*d+d,Zd-dd.d/d0Zd&d-d1d2d3Zd4d5dd6d7d8Zd9S): 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. zAbstractProvider[RT, CT, KT]zBaseReporter[RT, CT, KT]None)providerreporterr!cCs||_||_g|_dSN)_p_r_states)selfr>r?r"r"r(__init__GszResolution.__init__r)r!c Cs@z |jdWSty:}ztd|WYd}~n d}~00dS)Nr )rC IndexErrorAttributeError)rDer"r"r(r Ps zResolution.statecCs>|jd}t|j|j|jddd}|j|dS)zPush a new state into history. This new state will be used to hold resolution results of the next coming round. rFNr-r/backtrack_causes)rCrr-copyr/rKappend)rDbaser r"r"r(_push_new_stateWs  zResolution._push_new_statezdict[KT, Criterion[RT, CT]]r z CT | None)r/ requirementparentr!c Cs|jj||d|jj|d}||}|r8t|j}ng}|jj|t|t d||git|t d||id}|rt|j }| t||n t||g}tt|||d}|jst||||<dS)N)rPrQ)requirement_or_candidateiter_requirementincompatibilities identifier requirementsrT candidates informationrT)rBadding_requirementrAidentifygetlistrT find_matchesroperator methodcaller attrgetterrZrMrrrrYr) rDr/rPrQrVr8rTmatchesrZr"r"r(_add_to_criteriaes>    zResolution._add_to_criteriazCollection[KT])r/parentsr!csDsdS|D].\}}t|jfdd|jD|j||<qdS)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. Ncs,g|]$}|jdus$j|jvr|qSr@)rQrAr\)r%rZrerDr"r( s z@Resolution._remove_information_from_criteria..)r0rrYrZrT)rDr/rer7r8r"rfr(!_remove_information_from_criterias  z,Resolution._remove_information_from_criteriar r)namer!c Cs>|jj||jjt|jjtdt|jjtd|jjdS)NrYrZ)rV resolutionsrYrZrK) rAget_preferencer r-rr/r`rbrK)rDrir"r"r(_get_preferenceszResolution._get_preferencezCriterion[RT, CT]bool)rir8r!csBzjj|Wnty$YdS0tfdd|DS)NFc3s|]}jj|dVqdS)rP candidateNrAis_satisfied_byr%r current_pinrDr"r( sz8Resolution._is_current_pin_satisfying..)r r-r4allrS)rDrir8r"rtr(_is_current_pin_satisfyings z%Resolution._is_current_pin_satisfyingr )ror!cCs4|jj}|jj|dD]}|j|||dq|S)NrorQ)r r/rLrAget_dependenciesrd)rDror/rPr"r"r(_get_updated_criterias z Resolution._get_updated_criteriazlist[Criterion[RT, CT]]c sjj|}g}|jD]ȉz}WnLtyt}z4j|j||jWYd}~qWYd}~n d}~00t fdd| D}|st |jj djj |jj|djj|<gS|S)Nc3s|]}jj|dVqdSrnrprrrorDr"r(rvsz7Resolution._attempt_to_pin_criterion..ry)r r/rYr|rrBZrejecting_candidater8rMrwrSrpinningupdater-pop)rDrir8causesr/rI satisfiedr"r}r(_attempt_to_pin_criterions(   "  z$Resolution._attempt_to_pin_criterionzlist[tuple[KT, list[CT]]])incompatibilities_from_brokenr!c Cs|D]\}}|sqz|jj|}Wnty8YqYn0|jj|t|jjtdt|jjtd||id}t |}|sdS| |j t |t |j|d|jj|<qdS)NrSrTrUFrXT)r r/r4rAr_rr`rarbrextendrTrr^rZ)rDrr&rTr8rcrYr"r"r(_patch_criterias:     zResolution._patch_criteriaz$list[RequirementInformation[RT, CT]])rr!c s tdd|Ddd|D}fdd|D}tjdkrjd=j}zj}|j\}}Wn tt fyt |dYn0||vrqȇfd dj |D}| |sq|jsPqqPd d |jD}|||gf|} | r2d Sq2d 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. css|]}|jdur|jVqdSr@rzr%cr"r"r(rv5r*z'Resolution._backjump..css|] }|jVqdSr@)rPrr"r"r(rv6r*csh|]}j|qSr"rAr\rrrDr"r( 8r*z'Resolution._backjump..rFNcsh|]}j|qSr"r)r%drr"r(rNscSsg|]\}}|t|jfqSr")r^rTr$r"r"r(rgZsz(Resolution._backjump..TF) itertoolschainlenrCr rr-popitemrGr4rrAr{ isdisjointr/r0rMrOr) rDrZincompatible_reqsZincompatible_deps broken_stateriroZcurrent_dependenciesrsuccessr"rr( _backjumps>       zResolution._backjump)criteronr!cCstdd|DS)z5Extract causes from list of criterion and deduplicatecSs"i|]}|jD]}t||qqSr")rZr#)r%rir"r"r(r)rr*z.Resolution._extract_causes..)r^values)rDrr"r"r(_extract_causesnszResolution._extract_causes Iterable[RT]intrW max_roundsr!c s,jrtdjttigdg_|D]P}zjjj |ddWq2t y}zt |j j |WYd}~q2d}~00q2t|D]}jj|dfddjj D}|sjjjdjStjj t|t|dkrJtjj|jjtjj td tjj td jjd }n|}|s\td t|dkrzt|jd }n|d} |} | r؈!| } jj"| d#| } | jjdd<| s t jjn4fddjj D} $jj | jj%|jdqt&|dS)Nzalready resolvedrJrz)indexcs g|]\}}||s|qSr"rxr%r7r8rr"r(rgs z&Resolution.resolve..)r rrYrZ)Z identifiersrjrYrZrKz-narrow_requirement_selection returned 0 names)r7r)rcs(h|] \}}|vr||s|qSr"rrZsatisfied_namesrDr"r(rs z%Resolution.resolve..)rr )'rC RuntimeErrorrBstartingr collections OrderedDictrdr r/rrr8rZrOrangestarting_roundr0endingsetkeysrr^rAZnarrow_requirement_selectionr-rr`rbrKminrlrrZresolving_conflictsrrh ending_roundr) rDrWrrsrI round_indexZunsatisfied_namesZnarrowed_unstatisfied_namesriZfailure_criterionrrZnewly_unsatisfied_namesr"rr(resolvets~ &        zResolution.resolveN)__name__ __module__ __qualname____doc__rEpropertyr rOrdrhrlrxr|rrrrrr"r"r"r(r<@s , %#Yr<c@s(eZdZdZeZd ddddddZd S) Resolverz3The thing that performs the actual resolution work.drrrrcCs$t|j|j}|j||d}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)r<r>r?rr;)rDrWr resolutionr r"r"r(rs zResolver.resolveN)r)rrrrrbase_exceptionrr"r"r"r(rsrzMapping[KT, Criterion[RT, CT]]z KT | Nonezdict[int, KT | None]zset[KT | None]rm)r/r7r6r,r!c Cs||vr dS||vrdS|dus$J||D]b}z|t|}WntyZYq0Yn0||vrt||dSt||||r0||dSq0dS)NTF)r3r#r4r1r2)r/r7r6r,r9r:r"r"r(r2s"     r2)) __future__rrrr`typingrrrrrstructsr r r r r rrrrZabstractrrr8r exceptionsrrrrr providersrr reportersrr;r<rr2r"r"r"r(s$ ,    *