| Server IP : 127.0.0.1 / Your IP : 216.73.216.109 Web Server : Apache/2.4.54 (Win64) OpenSSL/1.1.1q PHP/8.1.10 System : Windows NT DESKTOP-E5T4RUN 10.0 build 19045 (Windows 10) AMD64 User : SERVERWEB ( 0) PHP Version : 8.1.10 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : OFF | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : C:/cygwin64/lib/python3.7/site-packages/pip/_vendor/resolvelib/__pycache__/ |
Upload File : |
B
�N�a�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 �D/usr/lib/python3.7/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: {}z, c s s | ]}t |�V qd S )N)�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� fdd�Zdd� Z� ZS )�InconsistentCandidatec s" t t| ��||� || _|| _d S )N)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 {}z, c s s | ]}t |�V qd S )N)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 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 )N)�
candidates� information�incompatibilities)r r# r$ r% r r r r A s zCriterion.__init__c C s d� dd� | jD ��}d�|�S )Nz, c s s | ]\}}d � ||�V qdS )z({!r}, via={!r})N)r )r Zreqr r r r r H s z%Criterion.__repr__.<locals>.<genexpr>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 )N)r )r �ir r r r N s z-Criterion.iter_requirement.<locals>.<genexpr>)r$ )r r r r r M 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 Q s z(Criterion.iter_parent.<locals>.<genexpr>)r$ )r r r r � iter_parentP s zCriterion.iter_parentN)r r r
r r r' r r) r r r r r" - s
r" c @ s e Zd ZdS )�ResolutionErrorN)r r r
r r r r r* T s r* c s e Zd Z� fdd�Z� ZS )�ResolutionImpossiblec s t t| ��|� || _d S )N)r r+ r �causes)r r, )r r r r Y s z ResolutionImpossible.__init__)r r r
r r r r )r r r+ X s r+ c s e Zd Z� fdd�Z� ZS )�ResolutionTooDeepc s t t| ��|� || _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- �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 )N)�_p�_r�_states)r �provider�reporterr r r r p s zResolution.__init__c C s, y
| j d S tk
r& td��Y nX d S )N����state)r3 �
IndexError�AttributeError)r r r r r7 u 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.
r6 N)�mapping�criteria�backtrack_causes)r3 r/ r: �copyr; r< �append)r �baser7 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�||gi�t|t � d�||i�d�}|r�t|j �}|�
t||�� n t||�g}tt|�||d�}|js�t|��|||< d S )N)r r )Zrequirement_or_candidater r% )�
identifierr& r% )r# r$ r% )r2 Zadding_requirementr1 Zidentify�get�listr% � find_matchesr �operator� methodcaller�
attrgetterr$ r> r r" r r# r ) r r; r r rA r r% �matchesr$ r r r �_add_to_criteria� s6
zResolution._add_to_criteriac C s> | j j|| jjt| jjt�d��t| jjt�d��| jjd�S )Nr# r$ )rA Z resolutionsr# r$ r< ) r1 Zget_preferencer7 r: r r; rE rG r< )r �namer r r �_get_preference� s
zResolution._get_preferencec sB y�j j| � W n tk
r$ dS X t� �fdd�|�� D ��S )NFc 3 s | ]}�j j|� d �V qdS ))r r! N)r1 �is_satisfied_by)r r )� current_pinr r r r � s z8Resolution._is_current_pin_satisfying.<locals>.<genexpr>)r7 r: �KeyError�allr )r rJ r r )rM r r �_is_current_pin_satisfying� s z%Resolution._is_current_pin_satisfyingc C s8 | j j�� }x&| jj|d�D ]}| j|||d� q W |S )N)r! )r )r7 r; r= r1 Zget_dependenciesrI )r r! r; r r r r �_get_updated_criteria� s z Resolution._get_updated_criteriac s� �j j| }g }x�|jD ]�� y��� �}W n0 tk
rZ } z|�|j� wW d d }~X Y nX t� �fdd�|�� D ��}|s�t � |���j
j � d� �j j� |� �j j
�|d � � �j j
|< g S W |S )Nc 3 s | ]}�j j|� d �V qdS ))r r! N)r1 rL )r r )r! r r r r � s z7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>)r! )r7 r; r# rQ r r> r rO r r r2 Zpinning�updater: �pop)r rJ r r, r; �eZ satisfiedr )r! r r �_attempt_to_pin_criterion� s&
z$Resolution._attempt_to_pin_criterionc s� x�t �j�dkr��jd= �j�� }|j�� \}}dd� |j�� D �� � �||gf� �jj |d� � �fdd�}��
� |� }|rdS qW 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.
� r6 c S s g | ]\}}|t |j�f�qS r )rC r% )r �k�vr r r �
<listcomp> s z)Resolution._backtrack.<locals>.<listcomp>)r! c s� x�� D ]�\} }|sqy�j j| }W n tk
r: wY nX �jj| t�j jt�d��t�j jt�d�| |i�d�}t |�}|s�dS |�
|j � t |t
|j�|d��j j| < qW dS )Nr r% )rA r& r% F)r# r$ r% T)r7 r; rN r1 rD r rE rF rG r �extendr% r" rC r$ )rW r% r rH r# )� incompatibilities_from_brokenr r r �_patch_criteria! s2
z.Resolution._backtrack.<locals>._patch_criteriaTF) �lenr3 rS r: �popitemr; �itemsr> r2 Z backtrackingr@ )r Z broken_staterJ r! r\ �successr )r[ r r �
_backtrack� s
zResolution._backtrackc
sZ � j rtd��� j�� tt�� i g d�g� _ xT|D ]L}y� j� jj |d d� W q4 t
k
r~ } zt |j j
��W d d }~X Y q4X q4W � �� x�t|�D ]�}� jj|d� � fdd�� jj �� D �}|s܈ jj� jd� � jS t|� jd�}� �|�}|�r0� �� } d d� |D �� jjd d �< | �s8t � jj��n� �� � jj|� jd
� q�W t|��d S ) Nzalready resolved)r: r; r< )r )�indexc s g | ]\}}� � ||�s|�qS r )rP )r �keyr )r r r rY j s z&Resolution.resolve.<locals>.<listcomp>)r7 )rc c S s g | ]}|j D ]}|�qqS r )r$ )r �cr( r r r rY } s )rb r7 )r3 � RuntimeErrorr2 Zstartingr/ � collections� OrderedDictrI r7 r; r r+ r r$ r@ �rangeZstarting_roundr_ Zending�minrK rU ra r< Z ending_roundr- )
r r& �
max_roundsr rT Z round_indexZunsatisfied_namesrJ Zfailure_causesr` r )r r �resolveM s<
"
zResolution.resolveN)r r r
r r �propertyr7 r@ rI rK rP rQ rU ra rk r r r r r0 i s '
$Yr0 c C s� ||kr dS || krdS xn| | � � D ]^}y|t|� }W n tk
rP w&Y nX ||krh|�|� dS t| |||�r&|�|� dS q&W dS )NTF)r) �idrN �add�_has_route_to_root)r; rc �all_keys� connected�p�pkeyr r r ro � s
ro �Resultzmapping graph criteriac
s� | j }dd� |�� D �}d |td �< t� }|�d � d h� x�| j�� D ]�\}}t| j||� �s`qF||krr|�|� xV|�� D ]J}y|t|� }W n tk
r� w|Y nX ||kr�|�|� |� ||� q|W qFW t
� fdd�|�� D �|| jd�S )Nc S s i | ]\}}|t |��qS r )rm )r rW rX r r r �
<dictcomp>� s z!_build_result.<locals>.<dictcomp>c s i | ]\}}|� kr||�qS r r )r rW rX )rq r r ru � s )r: �graphr; ) r: r_ rm r rn r; ro r) rN Zconnectrt )r7 r: rp rv rc r rr rs r )rq r �
_build_result� s.
rw 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.
)rj )r0 r4 r5 rk rw )r r& rj Z
resolutionr7 r r r rk � s zResolver.resolveN)ry )r r r
r r
Zbase_exceptionrk r r r r rx � s rx )rf rE Z providersr Zstructsr r r �
namedtupler � Exceptionr
r r �objectr" r* r+ r- r/ r0 ro rt rw rx r r r r �<module> s(
' %