o !7hP@sddlmZddlZddlZddlZddlmZmZmZm Z m Z ddl m Z m Z mZmZmZmZmZmZmZddlmZmZddlmZdd lmZmZmZmZmZerbdd l m!Z!m"Z"dd l#m$Z$d!ddZ%Gdddeee e fZ&Gdddeee e fZ'd"dd Z(dS)#) annotationsN) TYPE_CHECKING CollectionGenericIterableMapping) CTKTRT DirectedGraph IterableViewIteratorMappingRequirementInformationStatebuild_iter_view)AbstractResolverResult) Criterion)InconsistentCandidateRequirementsConflictedResolutionImpossibleResolutionTooDeepResolverException)AbstractProvider Preference) BaseReporterstateState[RT, CT, KT]returnResult[RT, CT, KT]c s|j}dd|D}d|td<t}|ddh|jD]>\}}t|j||s/q"||vr8|||D]#}z|t|}Wn tyOYq$sz!_build_result..csi|] \}}|vr||qSr"r"r$ connectedr"r(r):s)mappinggraphcriteria) r,itemsr#r addr._has_route_to_root iter_parentKeyErrorconnectr)rr,all_keysr-key criterionppkeyr"r*r( _build_result"s4       r:c@seZdZdZd>dd Zed?d d Zd@d dZdAddZdBddZ dCddZ dDd#d$Z dEd'd(Z dFd*d+Z dGd.d/ZdHd2d3ZdId5d6ZdJd;d<Zd=S)K 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 NonecCs||_||_g|_dSN)_p_r_states)selfr<r>r"r"r(__init__Gs zResolution.__init__rc Cs0z|jdWSty}ztd|d}~ww)Nr)rD IndexErrorAttributeError)rEer"r"r(rPs   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. rGNr,r.backtrack_causes)rDrr,copyr.rLappend)rEbaserr"r"r(_push_new_stateWs  zResolution._push_new_stater.dict[KT, Criterion[RT, CT]] requirementr parent CT | Nonec Cs|jj||d|jj|d}||}|rt|j}ng}|jj|t|t d||git|t d||id}|rJt|j }| t||nt||g}tt|||d}|js`t||||<dS)N)rRrS)requirement_or_candidateiter_requirementincompatibilities identifier requirementsrW candidates informationrW)rCadding_requirementrBidentifygetlistrW find_matchesroperator methodcaller attrgetterr]rNrrrr\r) rEr.rRrSrYr7rWmatchesr]r"r"r(_add_to_criteriaes>     zResolution._add_to_criteriaparentsCollection[KT]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|]}|jdusj|jvr|qSrA)rSrBr_)r%r]rhrEr"r( s  z@Resolution._remove_information_from_criteria..)r/rr\r]rW)rEr.rhr6r7r"rjr(!_remove_information_from_criterias   z,Resolution._remove_information_from_criterianamer rc Cs>|jj||jjt|jjtdt|jjtd|jjdS)Nr\r])rY resolutionsr\r]rL) rBget_preferencerr,rr.rcrerL)rErmr"r"r(_get_preferenceszResolution._get_preferencer7Criterion[RT, CT]boolcsBzjj|Wn tyYdSwtfdd|DS)NFc3 |] }jj|dVqdS)rR candidateNrBis_satisfied_byr%r current_pinrEr"r(  z8Resolution._is_current_pin_satisfying..)rr,r3allrV)rErmr7r"rzr(_is_current_pin_satisfyings z%Resolution._is_current_pin_satisfyingrur cCs4|jj}|jj|dD] }|j|||dq |S)NrurS)rr.rMrBget_dependenciesrg)rErur.rRr"r"r(_get_updated_criterias z Resolution._get_updated_criterialist[Criterion[RT, CT]]c sjj|}g}|jD]^z}Wn ty4}zj|j||jWYd}~q d}~wwt fdd| D}|sJt |jj djj |jj|djj|<gS|S)Nc3rsrtrvrxrurEr"r(r|r}z7Resolution._attempt_to_pin_criterion..r)rr.r\rrrCrejecting_candidater7rNr~rVrpinningupdater,pop)rErmr7causesr.rJ satisfiedr"rr(_attempt_to_pin_criterions,       z$Resolution._attempt_to_pin_criterionincompatibilities_from_brokenlist[tuple[KT, list[CT]]]c Cs|D]R\}}|s qz|jj|}Wn tyYqw|jj|t|jjtdt|jjtd||id}t |}|s@dS| |j t |t |j|d|jj|<qdS)NrVrWrXFr[T)rr.r3rBrbrrcrdrerextendrWrrar])rErr&rWr7rfr\r"r"r(_patch_criterias<    zResolution._patch_criteriar$list[RequirementInformation[RT, CT]]c stdd|Ddd|D}fdd|D}tjdkrjd=j} zj}|j\}}Wntt fyDt |d w||vrJnfd dj |D}| |s]n|jsanq(d d |jD}|||gf|} | rdStjdks d 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|jVqdSrArr%cr"r"r(r|5sz'Resolution._backjump..css|]}|jVqdSrA)rRrr"r"r(r|6sch|]}j|qSr"rBr_rxrEr"r( 8sz'Resolution._backjump..rGTNcrr"r)r%drr"r(rNs cSsg|] \}}|t|jfqSr")rarWr$r"r"r(rkZsz(Resolution._backjump..F) itertoolschainlenrDrrr,popitemrHr3rrBr isdisjointr.r/rNrPr) rErincompatible_reqsincompatible_deps broken_statermrucurrent_dependenciesrsuccessr"rr( _backjumpsF        3zResolution._backjumpcriteroncCstdd|DS)z5Extract causes from list of criterion and deduplicatecSs"i|] }|jD]}t||qqSr")r]r#)r%rir"r"r(r)rs"z.Resolution._extract_causes..)ravalues)rErr"r"r(_extract_causesnszResolution._extract_causesrZ Iterable[RT] max_roundsintc sjrtdjttigdg_|D]!}z jjj |ddWqt y:}zt |j j |d}~wwt|D]}jj|dfddjj D}|shjjjdjStjj t|t|dkrtjj|jjtjj td tjj td jjd }n|}|std t|dkrt|jd }n|d} |} | r߈!| } jj"| d#| } | jjdd<| st jjnfddjj D} $jj | jj%|jdqCt&|)Nzalready resolvedrKr)indexcs g|] \}}||s|qSr"rr%r6r7rr"r(rks  z&Resolution.resolve..)rrr\r]) identifiersrnr\r]rLz-narrow_requirement_selection returned 0 names)r6r)rcs(h|]\}}|vr||s|qSr"rrsatisfied_namesrEr"r(rs z%Resolution.resolve..)rr)'rD RuntimeErrorrCstartingr collections OrderedDictrgrr.rrr7r]rPrangestarting_roundr/endingsetkeysrrarBnarrow_requirement_selectionr,rrcrerLminrprrresolving_conflictsrrl ending_roundr) rErZrryrJ round_indexunsatisfied_namesnarrowed_unstatisfied_namesrmfailure_criterionrrnewly_unsatisfied_namesr"rr(resolvets             zResolution.resolveN)r<r=r>r?r r@)r r)r r@)r.rQrRr rSrTr r@)r.rQrhrir r@)rmr r r)rmr r7rqr rr)rur r rQ)rmr r r)rrr rr)rrr rr)rrr r)rZrrrr r)__name__ __module__ __qualname____doc__rFpropertyrrPrgrlrprrrrrrrr"r"r"r(r;@s      ,    % # Yr;c@s"eZdZdZeZ d d d d Zd S)Resolverz3The thing that performs the actual resolution work.drZrrrr r!cCs$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:)rErZr resolutionrr"r"r(rs zResolver.resolveN)r)rZrrrr r!)rrrrrbase_exceptionrr"r"r"r(rs rr.Mapping[KT, Criterion[RT, CT]]r6 KT | Noner5dict[int, KT | None]r+set[KT | None]rrc Cs||vrdS||vr dS|dusJ||D]/}z|t|}Wn ty+Yqw||vr8||dSt||||rG||dSqdS)NTF)r2r#r3r0r1)r.r6r5r+r8r9r"r"r(r1s&    r1)rrr r!) r.rr6rr5rr+rr rr)) __future__rrrrctypingrrrrrstructsr r r r r rrrrabstractrrr7r exceptionsrrrrr providersrr reportersrr:r;rr1r"r"r"r(s& ,    *