U
|
I=®dª: ã @ sø d dl Z ddlmZ ddlmZ ddlmZ e dddg¡ZG d d
|
d
|
e Z
|
G d d d e
|
Z G d d de
|
Z G dd de ZG dd de
|
ZG dd deZG dd deZe dd¡ZG dd de Zdd Ze d d ¡Zd d ZG d!d" d"eZdS )#é Né )Úcollections_abc)ÚAbstractResolver)Ú DirectedGraphÚRequirementInformationÚ requirementÚparentc @ s e Zd ZdZdS )ÚResolverExceptionzÆ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.
|
N)Ú__name__Ú
|
__module__Ú __qualname__Ú__doc__© r r úWD:\z\workplace\VsCode\pyvenv\venv\Lib\site-packages\pip/_vendor/resolvelib/resolvers.pyr s r c s$ e Zd Z fddZdd Z ZS )ÚRequirementsConflictedc s t t| |¡ || _d S ©N)Úsuperr Ú__init__Ú criterion)Úselfr ©Ú __class__r r r s z RequirementsConflicted.__init__c C s d d dd | j ¡ D ¡¡S )NzRequirements conflict: {}ú, c s s | ]}t |V qd S r ©Úrepr©Ú.0Úrr r r Ú <genexpr> s z1RequirementsConflicted.__str__.<locals>.<genexpr>)ÚformatÚjoinr Úiter_requirement©r r r r Ú__str__ s ÿz RequirementsConflicted.__str__©r
|
r r r r# Ú __classcell__r r r r r s r c s$ e Zd Z fddZdd Z ZS )ÚInconsistentCandidatec s" t t| ||¡ || _|| _d S r )r r& r Ú candidater )r r' r r r r r ! s z InconsistentCandidate.__init__c C s$ d | jd dd | j ¡ D ¡¡S )Nz+Provided candidate {!r} does not satisfy {}r c s s | ]}t |V qd S r r r r r r r ) s z0InconsistentCandidate.__str__.<locals>.<genexpr>)r r' r r r! r" r r r r# & s þz InconsistentCandidate.__str__r$ r r r r r& s r& c @ sL e Zd ZdZdd Zdd Zedd Zdd Zd
|
d Z d d Z
|
dd Z dS )Ú CriterionaQ Representation 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.
|
c C s || _ || _|| _d S r ©Ú
|
candidatesÚ informationÚincompatibilities)r r* r+ r, r r r r A s zCriterion.__init__c C s d dd | jD ¡}d |¡S )Nr c s s | ]\}}d ||¡V qdS )z({!r}, via={!r})N)r )r Úreqr r r r r G s ÿz%Criterion.__repr__.<locals>.<genexpr>z Criterion({}))r r+ r )r Ú requirementsr r r Ú__repr__F s
|
þzCriterion.__repr__c C sF | |g¡}t|tjs t|}| |t||gg d}|sBt||S )z.Build an instance from a requirement.
|
r) )Ú find_matchesÚ
|
isinstancer ÚSequenceÚlistr r )ÚclsÚproviderr r r* r r r r Úfrom_requirementM s
|
ýzCriterion.from_requirementc C s dd | j D S )Nc s s | ] }|j V qd S r )r ©r Úir r r r ^ s z-Criterion.iter_requirement.<locals>.<genexpr>©r+ r" r r r r! ] s zCriterion.iter_requirementc C s dd | j D S )Nc s s | ] }|j V qd S r ©r r7 r r r r a s z(Criterion.iter_parent.<locals>.<genexpr>r9 r" r r r Ú iter_parent` s zCriterion.iter_parentc C sh t | j}| t||¡ | dd |D ¡}t|tjsBt |}t| ||t | j }|sdt
|
||S )z>Build a new instance from this and a new requirement.
|
c S s g | ] \}}|qS r r )r r Ú_r r r Ú
|
<listcomp>h s z)Criterion.merged_with.<locals>.<listcomp>) r3 r+ Úappendr r0 r1 r r2 Útyper, r )r r5 r r Úinfosr* r r r r Ú merged_withc s
|
zCriterion.merged_withc sJ t | j}| ¡ fdd| jD }|s0dS t| |t | j|}|S )zBuild a new instance from this, but excluding specified candidate.
|
|
Returns the new instance, or None if we still have no valid candidates.
|
c s g | ]}| kr|qS r r )r Úc©r' r r r= w s z)Criterion.excluded_of.<locals>.<listcomp>N)r3 r, r> r* r? r+ )r r' Z incompatsr* r r rC r Ú excluded_ofp s
|
|
zCriterion.excluded_ofN) r
|
r r r r r/ Ú classmethodr6 r! r; rA rD r r r r r( - s
|
r( c @ s e Zd ZdS )ÚResolutionErrorN)r
|
r r r r r r rF ~ s rF c s e Zd Z fddZ ZS )ÚResolutionImpossiblec s t t| |¡ || _d S r )r rG r Úcauses)r rH r r r r s z ResolutionImpossible.__init__©r
|
r r r r% r r r r rG s rG c s e Zd Z fddZ ZS )ÚResolutionTooDeepc s t t| |¡ || _d S r )r rJ r Ú round_count)r rK r r r r s zResolutionTooDeep.__init__rI r r r r rJ s rJ ÚStatezmapping criteriac @ sd e Zd ZdZdd Zedd Zdd Zdd Zd
|
d Z d d Z
|
dd Z dd Z dd Z dd ZdS )Ú
|
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 C s || _ || _g | _d S r )Ú_pÚ_rÚ_states)r r5 Úreporterr r r r s zResolution.__init__c C s. z | j d W S tk
|
r( tdY nX d S )NéÿÿÿÿÚstate)rP Ú
|
IndexErrorÚAttributeErrorr" r r r rS s zResolution.statec C s\ z| j d }W n$ tk
|
r2 tt ¡ i d}Y nX t|j ¡ |j ¡ d}| j |¡ dS )zPush a new state into history.
|
|
This new state will be used to hold resolution results of the next
|
coming round.
|
rR )ÚmappingÚcriteriaN) rP rT rL Ú collectionsÚ OrderedDictrV ÚcopyrW r> )r ÚbaserS r r r Ú_push_new_state¦ s ÿzResolution._push_new_statec C sh | j ||¡ | j |¡}z| jj| }W n$ tk
|
rN t | j||¡}Y nX | | j||¡}||fS r )
|
rO Zadding_requirementrN ZidentifyrS rW ÚKeyErrorr( r6 rA )r r r ÚnameÚcritr r r Ú_merge_into_criterion¶ s z Resolution._merge_into_criterionc C sF |\}}z| j j| }W n tk
|
r0 d }Y nX | j ||j|j¡S r )rS rV r] rN Zget_preferencer* r+ )r Úitemr^ r Zpinnedr r r Ú _get_criterion_item_preferenceÁ s
|
ÿz)Resolution._get_criterion_item_preferencec sD zj j| W n tk
|
r& Y dS X t fdd| ¡ D S )NFc 3 s | ]}j | ¡V qd S r ©rN Zis_satisfied_byr ©Z current_pinr r r r Ð s ÿz8Resolution._is_current_pin_satisfying.<locals>.<genexpr>)rS rV r] Úallr! )r r^ r r rd r Ú_is_current_pin_satisfyingË s þz%Resolution._is_current_pin_satisfyingc C s4 i }| j |¡D ] }| j||d\}}|||< q|S )Nr: )rN Zget_dependenciesr` )r r' rW r r^ r_ r r r Ú_get_criteria_to_updateÕ s
|
|
z"Resolution._get_criteria_to_updatec sÀ g }|j D ]° z ¡}W n6 tk
|
rR } z| |j¡ W Y ¢q
|
W 5 d }~X Y nX t fdd| ¡ D }|s~t |j ¡ j
|
j |d ¡ j
|
j |< j
|
j |¡ g S |S )Nc 3 s | ]}j | ¡V qd S r rc r ©r' r r r r é s ÿz7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>)r* rg r r> r re r! r& rO ZpinningrS rV ÚpoprW Úupdate)r r^ r rH rW ÚeZ satisfiedr rh r Ú_attempt_to_pin_criterionÜ s$
|
þ
|
z$Resolution._attempt_to_pin_criterionc C s | j d= t| j dkr| j ¡ }z|j ¡ \}}W n tk
|
rJ Y qY nX | j |¡ | ¡ | j j
|
| |¡}|d kr| j d= q|| j j
|
|< dS dS )NrR é TF) rP Úlenri rV Úpopitemr] rO Z backtrackingr\ rS rW rD )r Z
|
prev_stater^ r' r r r r Ú
|
_backtracký s
|
|
zResolution._backtrackc sB j rtd ¡ |D ]V}z j|d d\}}W n. tk
|
rb } zt|jjW 5 d }~X Y nX | jj |< q j
|
¡ t |D ]°} j
|
|¡ ¡ j} fdd jj ¡ D } | sÞ j d= j
|
|¡ j S t| jd\}}
|
||
|
¡} | r& ¡ } | s&dd | D } t| j
|
||¡ qt|d S )Nzalready resolvedr: c s g | ]} j | s|qS r )rf )r ra r" r r r= 3 s
|
þz&Resolution.resolve.<locals>.<listcomp>rR )Úkeyc S s g | ]}|j D ]}|qqS r r9 )r r_ r8 r r r r= J s )rP Ú RuntimeErrorr\ r` r rG r r+ rS rW rO ZstartingÚrangeZstarting_roundÚitemsZendingÚminrb rl rp Z ending_roundrJ )r r. Ú
|
max_roundsr r^ r_ rk Z round_indexÚcurrZunsatisfied_criterion_itemsr Zfailure_causesÚresultrH r r" r Úresolve sF
|
|
|
þ
|
þ
|
ÿzResolution.resolveN)r
|
r r r r ÚpropertyrS r\ r` rb rf rg rl rp ry r r r r rM s
|
|
|
!"rM c C s ||kr dS || krdS | | ¡ D ]d}z|t| }W n tk
|
rP Y q$Y nX ||krj| |¡ dS t| |||r$| |¡ dS q$dS )NTF)r; Úidr] ÚaddÚ_has_route_to_root)rW rq Úall_keysÚ connectedÚpÚpkeyr r r r} T s
|
|
|
r} ÚResultzmapping graph criteriac
|
sê | j }dd | ¡ D }d |td < t }| d ¡ d h | j ¡ D ]\}}t| j|| s^qD||krp| |¡ | ¡ D ]L}z|t| }W n tk
|
r¤ Y qxY nX ||kr¸| |¡ | ||¡ qxqDt
|
fdd| ¡ D || jdS )Nc S s i | ]\}}t ||qS r )r{ ©r ÚkÚvr r r Ú
|
<dictcomp>l s z!_build_result.<locals>.<dictcomp>c s i | ]\}}| kr||qS r r r ©r r r r s )rV ÚgraphrW ) rV rt r{ r r| rW r} r; r] Úconnectr )rS rV r~ r rq r r r r r r Ú _build_resultj s0
|
|
|
|
ýr c @ s e Zd ZdZeZdddZdS )ÚResolverz8The thing that performs the actual resolution work.
|
éd c C s$ t | j| j}|j||d}t|S )a Take 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.
|
)rv )rM r5 rQ ry r )r r. rv Ú
|
resolutionrS r r r ry s zResolver.resolveN)r )r
|
r r r r Zbase_exceptionry r r r r r s r )rX Úcompatr Z providersr Ústructsr Ú
|
namedtupler Ú Exceptionr r r& Úobjectr( rF rG rJ rL rM r} r r r r r r r Ú<module> s* ÿ Q B
|
