File: //usr/lib/python3.9/site-packages/pip/_vendor/resolvelib/__pycache__/resolvers.cpython-39.pyc
a
?�f�: � @ 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� de�ZG dd� de�Ze �dd�ZG dd� de
�Zdd � Ze �d d �Zd d � ZG d!d"� d"e�ZdS )#� 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 �D/usr/lib/python3.9/site-packages/pip/_vendor/resolvelib/resolvers.pyr
s r c s$ e Zd Z� fdd�Zdd� 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> � 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� fdd�Zdd� 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 ) r 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 Zreqr 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|tj�s 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 ^ r 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 r 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|tj�sBt |�}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 r z)Criterion.merged_with.<locals>.<listcomp>) r3 r, �appendr r0 r1 r r2 �typer- r )r r5 r r Zinfosr+ r r r r � merged_withc s
zCriterion.merged_withc sJ t | j�}|�� � � fdd�| jD �}|s0dS t| �|t | j�|�}|S )z�Build 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 r z)Criterion.excluded_of.<locals>.<listcomp>N)r3 r- r> r+ r? r, )r r( Z incompatsr+ r r rB r � excluded_ofp s
zCriterion.excluded_ofN) r
r r r
r r/ � classmethodr6 r" r; r@ rC r r r r r) - s
r) c @ s e Zd ZdS )�ResolutionErrorN)r
r r r r r r rE ~ s rE c s e Zd Z� fdd�Z� ZS )�ResolutionImpossiblec s t t| ��|� || _d S r )r rF r �causes)r rG r r r r � s z ResolutionImpossible.__init__�r
r r r r& r r r r rF � s rF c s e Zd Z� fdd�Z� ZS )�ResolutionTooDeepc s t t| ��|� || _d S r )r rI r � round_count)r rJ r r r r � s zResolutionTooDeep.__init__rH r r r r rI � s rI �Statezmapping criteriac @ sd e Zd ZdZdd� Zedd� �Zdd� Zdd � Zd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dd� ZdS )�
Resolutionz�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.
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 ty& td��Y n0 d S )N����state)rO �
IndexError�AttributeErrorr# r r r rR � s zResolution.statec C sZ z| j d }W n" ty0 tt�� i d�}Y n0 t|j�� |j�� d�}| j �|� dS )z�Push a new state into history.
This new state will be used to hold resolution results of the next
coming round.
rQ )�mapping�criteriaN) rO rS rK � collections� OrderedDictrU �copyrV r> )r �baserR r r r �_push_new_state� s �zResolution._push_new_statec C sf | j �||� | j�|�}z| jj| }W n" tyL t�| j||�}Y n0 |� | j||�}||fS r )
rN Zadding_requirementrM ZidentifyrR rV �KeyErrorr) r6 r@ )r r r �name�critr r r �_merge_into_criterion� s z Resolution._merge_into_criterionc C sD |\}}z| j j| }W n ty. d }Y n0 | j�||j|j�S r )rR rU r\ rM Zget_preferencer+ r, )r �itemr] r Zpinnedr r r � _get_criterion_item_preference� s
�z)Resolution._get_criterion_item_preferencec sB z�j j| � W n ty$ Y dS 0 t� �fdd�|�� D ��S )NFc 3 s | ]}�j �|� �V qd S r �rM Zis_satisfied_byr �Z current_pinr r r r � s �z8Resolution._is_current_pin_satisfying.<locals>.<genexpr>)rR rU r\ �allr" )r r] r r rc r �_is_current_pin_satisfying� s �z%Resolution._is_current_pin_satisfyingc C s4 i }| j �|�D ] }| j||d�\}}|||< q|S )Nr: )rM Zget_dependenciesr_ )r r( rV r r] r^ r r r �_get_criteria_to_update� s
z"Resolution._get_criteria_to_updatec s� g }|j D ]�� z��� �}W n< tyX } z$|�|j� W Y d }~q
W Y d }~n
d }~0 0 t� �fdd�|�� D ��}|s�t� |���j� � � �j
j � |d � � �j
j |< �j
j
�|� g S |S )Nc 3 s | ]}�j �|� �V qd S r rb r �r( r r r r � s �z7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>)r+ rf r r> r rd r" r' rN ZpinningrR rU �poprV �update)r r] r rG rV �eZ satisfiedr rg r �_attempt_to_pin_criterion� s$
"�
z$Resolution._attempt_to_pin_criterionc C s� | j d= t| j �dkr�| j �� }z|j�� \}}W n tyH Y qY n0 | j�|� | �� | j j
| � |�}|d u r�| j d= q|| j j
|< dS dS )NrQ � TF) rO �lenrh rU �popitemr\ rN Z backtrackingr[ rR rV rC )r Z
prev_stater] r( r r r r �
_backtrack� s
zResolution._backtrackc sD � j rtd��� �� |D ]X}z� j|d d�\}}W n0 tyd } zt|jj��W Y d }~n
d }~0 0 |� jj |< q� j
� � t |�D ]�}� j
�
|� � �� � j}� fdd�� jj �� D �} | s� j d= � j
�|� � j S t| � jd�\}}
� �||
�} | �r(� �� } | �s(dd� | D �}
t|
��� j
�||� q�t|��d S )Nzalready resolvedr: c s g | ]}� j |� s|�qS r )re )r r` r# r r r= 3 s
�z&Resolution.resolve.<locals>.<listcomp>rQ )�keyc S s g | ]}|j D ]}|�qqS r r9 )r r^ r8 r r r r= J s )rO � RuntimeErrorr[ r_ r rF r r, rR rV rN Zstarting�rangeZstarting_round�itemsZending�minra rk ro Z ending_roundrI )r r. �
max_roundsr r] r^ rj Z round_indexZcurrZunsatisfied_criterion_itemsr Zfailure_causes�resultrG r r# r �resolve sF "
�
�
�zResolution.resolveN)r
r r r
r �propertyrR r[ r_ ra re rf rk ro rw r r r r rL � s
!"rL 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)r; �idr\ �add�_has_route_to_root)rV rp �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||vrp|�|� |�� D ]J}z|t|� }W n ty� Y qxY n0 ||vr�|�|� |� ||� qxqDt
� fdd�|�� D �|| jd�S )Nc S s i | ]\}}t |�|�qS r )ry �r �k�vr r r �
<dictcomp>l r z!_build_result.<locals>.<dictcomp>c s i | ]\}}|� v r||�qS r r r� �r} r r r� � r )rU �graphrV ) rU rs ry r rz rV r{ r; r\ Zconnectr� )rR rU r| r� rp r r~ r r r� r �
_build_resultj s0
�r� c @ s e Zd ZdZeZddd�ZdS )�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.
)ru )rL r5 rP rw r� )r r. ru Z
resolutionrR r r r rw � s zResolver.resolveN)r� )r
r r r
r Zbase_exceptionrw r r r r r� � s r� )rW �compatr Z providersr Zstructsr �
namedtupler � Exceptionr r r' �objectr) rE rF rI rK rL r{ r� r� r� r r r r �<module> s( �
Q B