ó вEbc@sJddlZddlmZddlmZmZejdddgƒZdefd „ƒYZ d e fd „ƒYZ d e fd „ƒYZ de fd„ƒYZ de fd„ƒYZdefd„ƒYZdefd„ƒYZejddƒZde fd„ƒYZd„ZejddƒZd„Zdefd„ƒYZdS( iÿÿÿÿNi(tAbstractResolver(t DirectedGraphtbuild_iter_viewtRequirementInformationt requirementtparenttResolverExceptioncBseZdZRS(sÆA base class for all exceptions raised by this module. Exceptions derived by this class should all be handled in this module. Any bubbling pass the resolver should be treated as a bug. (t__name__t __module__t__doc__(((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR stRequirementsConflictedcBseZd„Zd„ZRS(cCs#tt|ƒj|ƒ||_dS(N(tsuperR t__init__t criterion(tselfR ((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR scCs)djdjd„|jjƒDƒƒƒS(NsRequirements conflict: {}s, css|]}t|ƒVqdS(N(trepr(t.0tr((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pys s(tformattjoinR titer_requirement(R((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt__str__s(RRR R(((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR s tInconsistentCandidatecBseZd„Zd„ZRS(cCs/tt|ƒj||ƒ||_||_dS(N(R RR t candidateR (RRR ((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR s cCs/dj|jdjd„|jjƒDƒƒƒS(Ns+Provided candidate {!r} does not satisfy {}s, css|]}t|ƒVqdS(N(R(RR((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pys (s(RRRR R(R((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR%s(RRR R(((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyRs t CriterioncBsSeZdZd„Zd„Zed„ƒZd„Zd„Zd„Z d„Z RS(sQRepresentation of possible resolution results of a package. This holds three attributes: * `information` is a collection of `RequirementInformation` pairs. Each pair is a requirement contributing to this criterion, and the candidate that provides the requirement. * `incompatibilities` is a collection of all known not-to-work candidates to exclude from consideration. * `candidates` is a collection containing all possible candidates deducted from the union of contributing requirements and known incompatibilities. It should never be empty, except when the criterion is an attribute of a raised `RequirementsConflicted` (in which case it is always empty). .. note:: This class is intended to be externally immutable. **Do not** mutate any of its attribute containers. cCs||_||_||_dS(N(t candidatest informationtincompatibilities(RRRR((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR @s  cCs)djd„|jDƒƒ}dj|ƒS(Ns, css'|]\}}dj||ƒVqdS(s({!r}, via={!r})N(R(RtreqR((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pys Gss Criterion({})(RRR(Rt requirements((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt__repr__EscCsXt|j|gƒƒ}t||ƒg}|||dgƒ}|sTt|ƒ‚n|S(s%Build an instance from a requirement.R(Rt find_matchesRR (tclstproviderRRtcandstinfosR ((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pytfrom_requirementLs cCsd„|jDƒS(Ncss|]}|jVqdS(N(R(Rti((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pys Ws(R(R((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyRVscCsd„|jDƒS(Ncss|]}|jVqdS(N(R(RR%((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pys Zs(R(R((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt iter_parentYsc Cst|jƒ}|jt||ƒƒt|jg|D]\}}|^q5ƒƒ}t|ƒ||t|jƒƒ}|s‰t|ƒ‚n|S(s5Build a new instance from this and a new requirement.( tlistRtappendRRRttypeRR ( RR!RRR#Rt_R"R ((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt merged_with\s.!cCsH|jj|ƒ}|sdS|j|}t|ƒ|t|jƒ|ƒS(sBuild a new instance from this, but excluding specified candidates. Returns the new instance, or None if we still have no valid candidates. N(Rt excludingtNoneRR)R'R(RRR"t incompats((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt excluded_offs  ( RRR R Rt classmethodR$RR&R+R/(((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR,s     tResolutionErrorcBseZRS((RR(((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR1rstResolutionImpossiblecBseZd„ZRS(cCs#tt|ƒj|ƒ||_dS(N(R R2R tcauses(RR3((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR ws(RRR (((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR2vstResolutionTooDeepcBseZd„ZRS(cCs#tt|ƒj|ƒ||_dS(N(R R4R t round_count(RR5((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR ~s(RRR (((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR4}stStatesmapping criteriat ResolutioncBsneZdZd„Zed„ƒZd„Zd„Zd„Zd„Z d„Z d„Z d „Z d „Z RS( s­Stateful resolution object. This is designed as a one-off object that holds information to kick start the resolution process, and holds the results afterwards. cCs||_||_g|_dS(N(t_pt_rt_states(RR!treporter((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR Žs  cCs3y|jdSWntk r.tdƒ‚nXdS(Niÿÿÿÿtstate(R:t IndexErrortAttributeError(R((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR<“s cCsH|jd}td|jjƒd|jjƒƒ}|jj|ƒdS(s‰Push a new state into history. This new state will be used to hold resolution results of the next coming round. iÿÿÿÿtmappingtcriteriaN(R:R6R?tcopyR@R((RtbaseR<((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt_push_new_statešs  cCs‡|jj||ƒ|jj|ƒ}y|jj|}Wn)tk rdtj|j||ƒ}nX|j |j||ƒ}||fS(N( R9tadding_requirementR8tidentifyR<R@tKeyErrorRR$R+(RRRtnametcrit((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt_merge_into_criterion§s cCs=|\}}|jj|jjj|ƒ|jjƒ|jƒS(N(R8tget_preferenceR<R?tgetRtfor_preferenceR(RtitemRGR ((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt_get_criterion_item_preference²s    csLyˆjj|‰Wntk r(tSXt‡‡fd†|jƒDƒƒS(Nc3s$|]}ˆjj|ˆƒVqdS(N(R8tis_satisfied_by(RR(t current_pinR(s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pys Às(R<R?RFtFalsetallR(RRGR ((RPRs=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt_is_current_pin_satisfyingºs cCsLi}x?|jj|ƒD]+}|j|d|ƒ\}}|||Ùs(RRUR R(R RRRRR9tpinningR<R?tpopR-R@tupdate(RRGR R3R@tet satisfied((RRs=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt_attempt_to_pin_criterionËs$csÔxÍtˆjƒdkrψjd=ˆjjƒ}|jjƒ\}}g|jjƒD]\}}||jf^qV‰ˆj||gfƒˆj j |ƒ‡‡fd†}ˆj ƒ|ƒ}|rt SqWt S(sèPerform backtracking. 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. Discard Z. 2. Discard Y but remember its incompatibility information gathered previously, and the failure we're dealing with right now. 3. Push a new state Y' based on X, and apply the incompatibility information from Y to Y'. 4a. If this causes Y' to conflict, we need to backtrack again. Make Y' the new Z and go back to step 2. 4b. If the incompatibilities apply cleanly, end backtracking. iiÿÿÿÿcsxzˆD]r\}}|sqnyˆjj|}Wntk rIqnX|j|ƒ}|dkritS|ˆjj|  !   ) (RRR R tpropertyR<RCRIRNRSRUR[RgRw(((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR7‡s    ! HcCs­||krtS||kr tSx†||jƒD]t}y|t|ƒ}Wntk raq1nX||kr|j|ƒtSt||||ƒr1|j|ƒtSq1WtS(N(R\RQR&tidRFtaddt_has_route_to_root(R@Rhtall_keyst connectedtptpkey((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR{os       tResultsmapping graph criteriacsH|j}d„|jƒDƒ}d|tdƒ‡s R?cs+i|]!\}}|ˆkr||“qS(((RR]Re(R}(s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pys s tgraphR@( R?RbR-RyRRzR@R{R&RFtconnectR€(R<R?R|RRhR R~R((R}s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyt _build_result…s.       tResolvercBs eZdZeZdd„ZRS(s3The thing that performs the actual resolution work.idcCs4t|j|jƒ}|j|d|ƒ}t|ƒS(sTake 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. Rr(R7R!R;RwRƒ(RRRrt resolutionR<((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyRw¨s(RRR Rtbase_exceptionRw(((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyR„£s(Rkt providersRtstructsRRt namedtupleRt ExceptionRR RtobjectRR1R2R4R6R7R{R€RƒR„(((s=/tmp/pip-build-UPPWic/pip/pip/_vendor/resolvelib/resolvers.pyts"   Fè