3
Re: @ s d dl Z ddlmZ ddlmZ ddlmZ e jdddgZG 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 jddZG dd de
Zdd Ze jd d Zd d ZG d!d" d"eZdS )# N )collections_abc)AbstractResolver)
DirectedGraphRequirementInformation requirementparentc @ s e Zd ZdZdS )ResolverExceptionzA 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 /builddir/build/BUILDROOT/alt-python36-pip-20.2.4-5.el9.x86_64/opt/alt/python36/lib/python3.6/site-packages/pip/_vendor/resolvelib/resolvers.pyr
s r c s$ e Zd Z fddZdd Z ZS )RequirementsConflictedc s t t| j| || _d S )N)superr __init__ criterion)selfr ) __class__r r r s z RequirementsConflicted.__init__c C s dj djdd | jj D S )NzRequirements conflict: {}z, c s s | ]}t |V qd S )N)repr).0rr r r s z1RequirementsConflicted.__str__..)formatjoinr 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| j|| || _|| _d S )N)r r r candidater )r r r )r r r r ! s z InconsistentCandidate.__init__c C s$ dj | jdjdd | jj D S )Nz+Provided candidate {!r} does not satisfy {}z, c s s | ]}t |V qd S )N)r )r r r r r r ) s z0InconsistentCandidate.__str__..)r r r r r )r r r r r & s z InconsistentCandidate.__str__)r
r r r r 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 )N)
candidates informationincompatibilities)r r" r# r$ r r r r A s zCriterion.__init__c C s dj dd | jD }dj|S )Nz, c s s | ]\}}d j ||V qdS )z({!r}, via={!r})N)r )r reqr r r r r H s z%Criterion.__repr__..z
Criterion({}))r r# r )r requirementsr r r __repr__F s zCriterion.__repr__c C sF |j |g}t|tjs t|}| |t||gg d}|sBt||S )z.Build an instance from a requirement.
)r" r# r$ ) find_matches
isinstancer Sequencelistr r )clsproviderr 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 )N)r )r ir r r r ^ s z-Criterion.iter_requirement..)r# )r r r r r ] s zCriterion.iter_requirementc C s dd | j D S )Nc s s | ] }|j V qd S )N)r )r r/ r r r r a s z(Criterion.iter_parent..)r# )r r r r iter_parent` s zCriterion.iter_parentc C sh t | j}|jt|| |jdd |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
h s z)Criterion.merged_with..) r+ r# appendr r( r) r r* typer$ r )r r- r r infosr" r r r r merged_withc s
zCriterion.merged_withc sJ t | j}|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 r2 w s z)Criterion.excluded_of..N)r+ r$ r3 r" r4 r# )r r Z incompatsr" r r )r r excluded_ofp s
zCriterion.excluded_ofN) r
r r r
r r' classmethodr. r r0 r6 r8 r r r r r! - s
r! c @ s e Zd ZdS )ResolutionErrorN)r
r r r r r r r: ~ s r: c s e Zd Z fddZ ZS )ResolutionImpossiblec s t t| j| || _d S )N)r r; r causes)r r< )r r r r s z ResolutionImpossible.__init__)r
r r r r r r )r r r; s r; c s e Zd Z fddZ ZS )ResolutionTooDeepc s t t| j| || _d S )N)r r= r round_count)r r> )r r r r s zResolutionTooDeep.__init__)r
r r r r r r )r r r= s r= 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 )N)_p_r_states)r r- reporterr r r r s zResolution.__init__c C s, y
| j d S tk
r& tdY nX d S )Nr state)rC
IndexErrorAttributeError)r r r r rE s
zResolution.statec C s\ y| j d }W n$ tk
r2 ttj i d}Y nX t|jj |jj d}| j j| dS )zPush a new state into history.
This new state will be used to hold resolution results of the next
coming round.
r )mappingcriteriaNrF ) rC rG r? collections OrderedDictrI copyrJ r3 )r baserE r r r _push_new_state s zResolution._push_new_statec C sh | j j|| | jj|}y| jj| }W n$ tk
rN tj| j||}Y nX |j | j||}||fS )N)
rB Zadding_requirementrA ZidentifyrE rJ KeyErrorr! r. r6 )r r r namecritr r r _merge_into_criterion s z Resolution._merge_into_criterionc C sF |\}}y| j j| }W n tk
r0 d }Y nX | jj||j|jS )N)rE rI rP rA Zget_preferencer" r# )r itemrQ r Zpinnedr r r _get_criterion_item_preference s
z)Resolution._get_criterion_item_preferencec sB yj j| W n tk
r$ dS X t fdd|j D S )NFc 3 s | ]}j j| V qd S )N)rA is_satisfied_by)r r ) current_pinr r r r s z8Resolution._is_current_pin_satisfying..)rE rI rP allr )r rQ r r )rW r r _is_current_pin_satisfying s z%Resolution._is_current_pin_satisfyingc C s8 i }x.| j j|D ] }| j||d\}}|||< qW |S )N)r )rA Zget_dependenciesrS )r r rJ r rQ rR r r r _get_criteria_to_update s
z"Resolution._get_criteria_to_updatec s g }x|j D ] yj }W n0 tk
rN } z|j|j w W Y d d }~X nX t fdd|j D }|szt |jj j
j j |d j
j |< j
j
j| g S W |S )Nc 3 s | ]}j j| V qd S )N)rA rV )r r )r r r r r s z7Resolution._attempt_to_pin_criterion..)r" rZ r r3 r rX r r rB ZpinningrE rI poprJ update)r rQ r r< rJ eZ satisfiedr )r r r _attempt_to_pin_criterion s$
z$Resolution._attempt_to_pin_criterionc C s | j d= xt| j dkr| j j }y|jj \}}W n tk
rJ w
Y nX | jj| | j | j j
| j |}|d kr| j d= q
|| j j
|< dS W dS )Nr TFrF rF ) rC lenr[ rI popitemrP rB Z backtrackingrO rE rJ r8 )r Z
prev_staterQ r r r r r
_backtrack s
zResolution._backtrackc sF j rtd j x^|D ]V}y j|d d\}}W n. tk
rd } zt|jjW Y d d }~X nX | jj |< q W j
j xt |D ]} j
j
| j j} fdd jj j D } | s j d= j
j| jS t| jd\}}
j||
} | r( j } | s(dd | D }
t|
j
j|| qW t|d S ) Nzalready resolved)r c s g | ]} j | s|qS r )rY )r rT )r r r r2 4 s z&Resolution.resolve..r )keyc S s g | ]}|j D ]}|qqS r )r# )r rR r/ r r r r2 K s rF )rC RuntimeErrorrO rS r r; r r# rE rJ rB ZstartingrangeZstarting_rounditemsZendingminrU r^ rb Z ending_roundr= )r r&
max_roundsr rQ rR r] Z round_indexcurrZunsatisfied_criterion_itemsr Zfailure_causesresultr< r )r r resolve s>
zResolution.resolveN)r
r r r
r propertyrE rO rS rU rY rZ r^ rb rk r r r r r@ s
!"r@ c C s ||kr dS || krdS xn| | j D ]^}y|t| }W n tk
rP w&Y nX ||krh|j| dS t| |||r&|j| dS q&W dS )NTF)r0 idrP add_has_route_to_root)rJ rc all_keys connectedppkeyr r r ro T s
ro Resultzmapping graph criteriac
s | j }dd |j D }d |td < t }|jd d h x| jj D ]\}}t| j|| s`qF||krr|j| xV|j D ]J}y|t| }W n tk
r w|Y nX ||kr|j| |j || q|W qFW t
fdd|j D || jdS )Nc S s i | ]\}}|t |qS r )rm )r kvr r r
l s z!_build_result..c s i | ]\}}| kr||qS r r )r ru rv )rq r r rw s )rI graphrJ ) rI rf rm r rn rJ ro r0 rP connectrt )rE rI rp rx rc r rr rs r )rq r
_build_resultj s.
rz 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.
)rh )r@ r- rD rk rz )r r& rh
resolutionrE r r r rk s zResolver.resolveN)r| )r
r r r
r Zbase_exceptionrk r r r r r{ s r{ )rK compatr Z providersr structsr
namedtupler Exceptionr r r objectr! r: r; r= r? r@ ro rt rz r{ r r r r s&
Q B