File: //usr/lib/python3/dist-packages/pip/_vendor/resolvelib/__pycache__/resolvers.cpython-310.pyc
o
@%Ne�D � @ s� d dl Z d dlZddlmZ ddlmZmZmZ e �dddg�Z G dd � d e
�Z G d
d � d e �Z G d d
� d
e �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� )�AbstractResolver)�
DirectedGraph�IteratorMapping�build_iter_view�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 �B/usr/lib/python3/dist-packages/pip/_vendor/resolvelib/resolvers.pyr
s r
c �$ e Zd Z� fdd�Zdd� Z� ZS )�RequirementsConflictedc � t t| ��|� || _d S �N)�superr �__init__� criterion)�selfr �� __class__r r r �
z RequirementsConflicted.__init__c C s d� d�dd� | j�� D ���S )NzRequirements conflict: {}�, c 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 r )�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 r 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 @ 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� information�incompatibilities)r r0 r1 r2 r r r r @ �
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# F s
�
�
�z%Criterion.__repr__.<locals>.<genexpr>z
Criterion({}))r& r1 r% )r � requirementsr r r �__repr__E s
�
zCriterion.__repr__c C � dd� | j D �S )Nc s � � | ]}|j V qd S r )r �r! �ir r r r# M � � z-Criterion.iter_requirement.<locals>.<genexpr>�r1 r( r r r r' L � zCriterion.iter_requirementc C r7 )Nc s r8 r �r r9 r r r r# P r; z(Criterion.iter_parent.<locals>.<genexpr>r< r( r r r � iter_parentO r= zCriterion.iter_parentN)r r r
r r r6 r' r? r r r r r. , s r. c @ s e Zd ZdS )�ResolutionErrorN)r r r
r r r r r@ S s r@ c � e Zd Z� fdd�Z� ZS )�ResolutionImpossiblec r r )r rB r �causes)r rC r r r r X s
z ResolutionImpossible.__init__�r r r
r r+ r r r r rB W � rB c rA )�ResolutionTooDeepc r r )r rF r � round_count)r rG r r r r _ r zResolutionTooDeep.__init__rD r r r r rF ^ rE rF �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 )�
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 �provider�reporterr r r r o r3 zResolution.__init__c C s$ z| j d W S ty td��w )N����state)rL �
IndexError�AttributeErrorr( r r r rP t s
�zResolution.statec C s> | j d }t|j�� |j�� |jdd� 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.
rO N��mapping�criteria�backtrack_causes)rL rH rT �copyrU rV �append)r �baserP r r r �_push_new_state{ s
�zResolution._push_new_statec C s� | j j||d� | jj|d�}|�|�}|r t|j�}ng }| jj|t|t �
d�||gi�t|t � d�||i�d�}|rJt|j �}|�
t||�� nt||�g}tt|�||d�}|js`t|��|||< d S )N)r r )�requirement_or_candidater' r2 ��
identifierr5 r2 r/ )rK �adding_requirementrJ �identify�get�listr2 � find_matchesr �operator� methodcaller�
attrgetterr1 rX r r. r r0 r ) r rU r r r] r r2 �matchesr1 r r r �_add_to_criteria� s>
���
� zResolution._add_to_criteriac C s> | j j|| jjt| jjt�d��t| jjt�d��| jjd�S )Nr0 r1 )r] � resolutionsr0 r1 rV ) rJ �get_preferencerP rT r rU rc re rV )r �namer r r �_get_preference� s ���zResolution._get_preferencec sB z�j j| � W n
ty Y dS w t� �fdd�|�� D ��S )NFc 3 � � | ] }�j j|� d �V qdS �)r r- N�rJ �is_satisfied_byr �� current_pinr r r r# � �
� �
�z8Resolution._is_current_pin_satisfying.<locals>.<genexpr>)rP rT �KeyError�allr' )r rj r r rp r �_is_current_pin_satisfying� s ��z%Resolution._is_current_pin_satisfyingc C s4 | j j�� }| jj|d�D ]
}| j|||d� q
|S )N�r- r> )rP rU rW rJ �get_dependenciesrg )r r- rU r r r r �_get_updated_criteria� s z Resolution._get_updated_criteriac s� �j j| }g }|jD ]V� z��� �}W n ty, } z |�|j� W Y d }~q d }~ww t� �fdd�|�� D ��}|sBt � |���j
j � d� �j j� |� �j j
�|d � � �j j
|< g S |S )Nc 3 rl rm rn r �r- r r r r# � rr z7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>rv )rP rU r0 rx r rX r rt r' r, rK �pinning�updaterT �pop)r rj r rC rU �e� satisfiedr ry r �_attempt_to_pin_criterion� s*
���
z$Resolution._attempt_to_pin_criterionc s� t �j�dkrI�jd= �j�� }|j�� \}}dd� |j�� D �� � �||gf� �jj |d� � �fdd�}��
� |� }|rBdS t �j�dksd 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.
� rO c S s g | ] \}}|t |j�f�qS r )ra r2 �r! �k�vr r r �
<listcomp> s ��z)Resolution._backtrack.<locals>.<listcomp>rv c s� � D ]R\} }|s qz�j j| }W n ty Y qw �jj| t�j jt�d��t�j jt�d�| |i�d�}t |�}|s@ dS |�
|j � t |t
|j�|d��j j| < qdS )Nr' r2 r\ Fr/ T)rP rU rs rJ rb r rc rd re r �extendr2 r. ra r1 )r� r2 r rf r0 �� incompatibilities_from_brokenr r r �_patch_criteria s< ���� �z.Resolution._backtrack.<locals>._patch_criteriaTF) �lenrL r| rT �popitemrU �itemsrX rK � backtrackingrZ )r � broken_staterj r- r� �successr r� r �
_backtrack� s
� �=zResolution._backtrackc sT � j rtd��� j�� tt�� i g d�g� _ |D ] }z � j� jj |d d� W q t
y9 } zt |j j
��d }~ww � �� t|�D ]c}� jj|d� � fdd�� jj �� D �}|sg� jj� jd� � j S t|� jd�}� �|�}|r�d d� |D �} � jj| d
� � �� }
| � jjd d �< |
s�t � jj��n� �� � jj|� jd � qBt|��) Nzalready resolvedrS r> )�indexc s g | ] \}}� � ||�s|�qS r )ru )r! �keyr r( r r r� h s
��z&Resolution.resolve.<locals>.<listcomp>)rP )r� c S s g | ]
}|j D ]}|�qqS r r< )r! �cr: r r r r� x s )rC )r� rP )rL � RuntimeErrorrK �startingrH � collections� OrderedDictrg rP rU r rB r r1 rZ �range�starting_roundr� �ending�minrk r �resolving_conflictsr� rV � ending_roundrF ) r r5 �
max_roundsr" r} � round_index�unsatisfied_namesrj �failure_causesrC r� r r( r �resolveL sL
�� ��
�
�zResolution.resolveN)r r r
r r �propertyrP rZ rg rk ru rx r r� r� r r r r rI h s
'
$ YrI c C s� ||v rdS || vr dS | | � � D ]/}z|t|� }W n ty% Y qw ||v r2|�|� dS t| |||�rA|�|� dS qdS )NTF)r? �idrs �add�_has_route_to_root)rU r� �all_keys� connected�p�pkeyr r r r� � s$ �
�r� �Resultzmapping graph criteriac
s� | j }dd� |�� D �}d |td �< t� }|�d � d h� | j�� D ]>\}}t| j||� �s/q"||vr8|�|� |�� D ]#}z|t|� }W n tyO Y q<w ||vrY|�|� |� ||� q<q"t
� fdd�|�� D �|| jd�S )Nc S s i | ] \}}t |�|�qS r )r� r� r r r �
<dictcomp>� s z!_build_result.<locals>.<dictcomp>c s i | ] \}}|� v r||�qS r r r� �r� r r r� � s )rT �graphrU ) rT r� r� r r� rU r� r? rs �connectr� )rP rT r� r� r� r r� r� r r� r �
_build_result� s4
�
� �r� c @ s e Zd ZdZeZddd�ZdS )�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� )rI rM rN r� r� )r r5 r� �
resolutionrP r r r r� � s zResolver.resolveN)r� )r r r
r r
�base_exceptionr� r r r r r� � s r� )r� rc � providersr �structsr r r �
namedtupler � Exceptionr
r r, �objectr. r@ rB rF rH rI r� r� r� r� r r r r �<module> s, �
' %