a
ljD @ s d dl Z d dlZddlmZ ddlmZmZmZ e dddgZ G dd d e
Z G d
d d e Z G d d
d
e Z
G dd deZG dd de ZG dd deZG dd deZe ddZG dd deZdd Ze d d Zd d ZG d d! d!eZdS )" N )AbstractResolver)
DirectedGraphIteratorMappingbuild_iter_viewRequirementInformation 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 D/usr/lib/python3.9/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 ddd | j D S )NzRequirements conflict: {}, c s s | ]}t |V qd S r repr.0rr r r z1RequirementsConflicted.__str__..)formatjoinr iter_requirementr 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 | jddd | 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 ) r z0InconsistentCandidate.__str__..)r! r) r" r r# r$ r r r r% & s z InconsistentCandidate.__str__r& r r r r r( s r( c @ s0 e Zd ZdZdd Zdd Zdd Zdd Zd
S ) 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 informationincompatibilities)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 Zreqr r r r r G s z%Criterion.__repr__..z
Criterion({}))r" r- r! )r requirementsr r r __repr__F s
zCriterion.__repr__c C s dd | j D S )Nc s s | ] }|j V qd S r )r r ir r r r N r z-Criterion.iter_requirement..r- r$ r r r r# M s zCriterion.iter_requirementc C s dd | j D S )Nc s s | ] }|j V qd S r r r1 r r r r Q r z(Criterion.iter_parent..r3 r$ r r r iter_parentP s zCriterion.iter_parentN)r r r
r r r0 r# r5 r r r r r* - s
r* c @ s e Zd ZdS )ResolutionErrorN)r r r
r r r r r6 T s r6 c s e Zd Z fddZ ZS )ResolutionImpossiblec s t t| | || _d S r )r r7 r causes)r r8 r r r r Y s z ResolutionImpossible.__init__r r r
r r' r r r r r7 X s r7 c s e Zd Z fddZ ZS )ResolutionTooDeepc s t t| | || _d S r )r r: r round_count)r r; r r r r ` s zResolutionTooDeep.__init__r9 r r r r r: _ s r: Statez!mapping criteria backtrack_causesc @ 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 providerreporterr r r r p s zResolution.__init__c C s, z | j d W S ty& tdY n0 d S )Nstate)r@
IndexErrorAttributeErrorr$ r r r rD u s zResolution.statec C s> | j d }t|j |j |jdd d}| j | dS )zPush a new state into history.
This new state will be used to hold resolution results of the next
coming round.
rC Nmappingcriteriabacktrack_causes)r@ r< rH copyrI rJ append)r baserD r r r _push_new_state| s
zResolution._push_new_statec C s | j j||d | jj|d}||}|r8t|j}ng }| jj|t|t
d||git|t d||id}|rt|j }|
t|| n t||g}tt|||d}|jst||||< d S )N)r r )Zrequirement_or_candidater# r.
identifierr/ r. r+ )r? Zadding_requirementr> Zidentifygetlistr. find_matchesr operator methodcaller
attrgetterr- rL r r* r r, r ) r rI r r rP r r. matchesr- r r r _add_to_criteria s>
zResolution._add_to_criteriac C s> | j j|| jjt| jjtdt| jjtd| jjdS )Nr, r- )rP Z resolutionsr, r- rJ ) r> Zget_preferencerD rH r rI rT rV rJ )r namer r r _get_preference s zResolution._get_preferencec sB zj j| W n ty$ Y dS 0 t fdd| D S )NFc 3 s | ]}j j| d V qdS )r r) Nr> Zis_satisfied_byr Z current_pinr r r r s z8Resolution._is_current_pin_satisfying..)rD rH KeyErrorallr# )r rY r r r] r _is_current_pin_satisfying s z%Resolution._is_current_pin_satisfyingc C s4 | j j }| jj|dD ]}| j|||d q|S )Nr) r4 )rD rI rK r> Zget_dependenciesrX )r r) rI r r r r _get_updated_criteria s z Resolution._get_updated_criteriac s j j| }g }|jD ] z }W n< tyd } z$||j W Y d }~qW Y d }~n
d }~0 0 t fdd| D }|st |j
j d j j | j j
|d j j
|< g S |S )Nc 3 s | ]}j j| d V qdS r[ r\ r r) r r r r s z7Resolution._attempt_to_pin_criterion..ra )rD rI r, rb r rL r r_ r# r( r? ZpinningupdaterH pop)r rY r r8 rI eZ satisfiedr rc r _attempt_to_pin_criterion s&
"
z$Resolution._attempt_to_pin_criterionc s t jdkrjd= j }|j \}}dd |j D ||gf jj |d fdd}
| }|r dS q d S )
a 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.
rC c S s g | ]\}}|t |jfqS r )rR r. r kvr r r
s z)Resolution._backtrack..ra c s D ]\} }|sqzj j| }W n ty8 Y qY n0 jj| tj jtdtj jtd| |id}t |}|s dS |
|j t |t
|j|dj j| < qdS )Nr# r. rO Fr+ T)rD rI r^ r> rS r rT rU rV r extendr. r* rR r- )rj r. r rW r, Z incompatibilities_from_brokenr r r _patch_criteria! s:
z.Resolution._backtrack.._patch_criteriaTF) lenr@ re rH popitemrI itemsrL r? Z backtrackingrN )r Z broken_staterY r) ro successr rn r
_backtrack s
zResolution._backtrackc
sX j rtd j tt i g dg _ |D ]N}z j jj |d d W q2 t
y~ } zt |j j
W Y d }~q2d }~0 0 q2 t|D ]} jj|d fdd jj D }|s܈ jj jd j S t| jd} |}|r0 } d d |D jjd d < | s8t jjn jj| jd
qt|d S ) Nzalready resolvedrG r4 )indexc s g | ]\}} ||s|qS r )r` )r keyr r$ r r rl i s z&Resolution.resolve..)rD )rv c S s g | ]}|j D ]}|qqS r r3 )r cr2 r r r rl | s )ru rD )r@ RuntimeErrorr? Zstartingr< collections OrderedDictrX rD rI r r7 r r- rN rangeZstarting_roundrr ZendingminrZ rg rt rJ Z ending_roundr: )
r r/
max_roundsr rf Z round_indexZunsatisfied_namesrY Zfailure_causesrs r r$ r resolveM sF
$
zResolution.resolveN)r r r
r r propertyrD rN rX rZ r` rb rg rt r~ r r r r r= i s
'
$Yr= c C s ||v r dS || vrdS | | D ]b}z|t| }W n tyN Y q$Y n0 ||v rh|| dS t| |||r$|| dS q$dS )NTF)r5 idr^ add_has_route_to_root)rI rv all_keys connectedppkeyr r r r s
r Resultzmapping graph criteriac
s | j }dd | D }d |td < t }|d d h | j D ]\}}t| j|| s^qD||vrp|| | D ]J}z|t| }W n ty Y qxY n0 ||vr|| | || qxqDt
fdd| D || jdS )Nc S s i | ]\}}t ||qS r )r ri r r r
r z!_build_result..c s i | ]\}}| v r||qS r r ri r r r r r )rH graphrI ) rH rr r r r rI r r5 r^ Zconnectr )rD rH r r rv r r r r r r
_build_result s0
r c @ s e Zd ZdZeZdddZdS )Resolverz3The 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.
)r} )r= rA rB r~ r )r r/ r} Z
resolutionrD r r r r~ s zResolver.resolveN)r )r r r
r r
Zbase_exceptionr~ r r r r r s r )ry rT Z providersr Zstructsr r r
namedtupler Exceptionr
r r( objectr* r6 r7 r: r< r= r r r r r r r r s*
' %