| 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.9/site-packages/pip/_vendor/resolvelib/__pycache__/ |
Upload File : |
a
X��e P � @ s d dl Z d dlZd dlZddlmZ ddlmZmZmZ e � dddg�Z
G dd � d e �Z G d
d � d e �Z
G d d
� d
e �ZG 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.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 @ 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 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 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.<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 r �r r2 r r r r Q r z(Criterion.iter_parent.<locals>.<genexpr>r4 r$ r r r � iter_parentP s zCriterion.iter_parentN)r r r
r r r0 r# r6 r r r r r* - s
r* c @ s e Zd ZdS )�ResolutionErrorN)r r r
r r r r r7 T s r7 c s e Zd Z� fdd�Z� ZS )�ResolutionImpossiblec s t t| ��|� || _d S r )r r8 r �causes)r r9 r r r r Y s z ResolutionImpossible.__init__�r r r
r r' r r r r r8 X s r8 c s e Zd Z� fdd�Z� ZS )�ResolutionTooDeepc s t t| ��|� || _d S r )r r; r � round_count)r r< r r r r ` s zResolutionTooDeep.__init__r: r r r r r; _ s r; �Statez!mapping criteria backtrack_causesc @ sl e Zd ZdZdd� Zedd� �Zdd� Zdd � Zd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dd� Zdd� 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 p s zResolution.__init__c C s, z | j d W S ty& td��Y n0 d S )N����state)rA �
IndexError�AttributeErrorr$ r r r rE 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.
rD N��mapping�criteria�backtrack_causes)rA r= rI �copyrJ rK �append)r �baserE 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@ Zadding_requirementr? �identify�get�listr. � find_matchesr �operator� methodcaller�
attrgetterr- rM r r* r r, r ) r rJ r r rQ r r. �matchesr- r r r �_add_to_criteria� s>
���
�zResolution._add_to_criteriac sD � sdS |� � D ].\}}t|j� �fdd�|jD �|j�||< qdS )aW Remove information from parents of criteria.
Concretely, removes all values from each criterion's ``information``
field that have one of ``parents`` as provider of the requirement.
:param criteria: The criteria to update.
:param parents: Identifiers for which to remove information from all criteria.
Nc s, g | ]$}|j d u s$�j�|j �� vr|�qS r )r r? rR )r r- ��parentsr r r �
<listcomp>� s
�z@Resolution._remove_information_from_criteria.<locals>.<listcomp>)�itemsr* r, r- r. )r rJ r\ �keyr r r[ r �!_remove_information_from_criteria� s ��z,Resolution._remove_information_from_criteriac C s> | j j|| jjt| jjt�d��t| jjt�d��| jjd�S )Nr, r- )rQ Z resolutionsr, r- rK ) r? Zget_preferencerE rI r rJ rV rX rK )r �namer r r �_get_preference� s ���zResolution._get_preferencec sB z�j j| � W n ty$ Y dS 0 t� �fdd�|�� D ��S )NFc 3 s | ]}�j j|� d �V qdS �)r r) N�r? Zis_satisfied_byr �Z current_pinr r r r � s �z8Resolution._is_current_pin_satisfying.<locals>.<genexpr>)rE rI �KeyError�allr# )r ra r r re 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) r5 )rE rJ rL r? �get_dependenciesrZ )r r) rJ r r r r �_get_updated_criteria� s z Resolution._get_updated_criteriac s� �j j| }g }|jD ]ȉ z��� �}W nL tyt } z4�j�|j� � |�|j� W Y d }~qW Y d }~n
d }~0 0 t � �fdd�|�
� D ��}|s�t � |���jj � d� �j j�
|� �j j�|d � � �j j|< g S |S )Nc 3 s | ]}�j j|� d �V qdS rc rd r �r) r r r r � s �z7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>ri )rE rJ r, rk r r@ Zrejecting_candidater rM rg r# r( Zpinning�updaterI �pop)r ra r r9 rJ �eZ satisfiedr rl r �_attempt_to_pin_criterion� s(
"�
z$Resolution._attempt_to_pin_criterionc s t �dd� |D �dd� |D ��}�fdd�|D �}t�j�dkr��jd= d}|s�z �j�� }|j�� \}}W n ttfy� t |��Y n0 �fd d��j
� |�D �}|� |� }qLd
d � |j
�� D �� � �||gf� � �fd d
�} ��� | � }
|
r2dS q2dS )a2 Perform backjumping.
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. Identify Z. The incompatibility is not always caused by the latest
state. For example, given three requirements A, B and C, with
dependencies A1, B1 and C1, where A1 and B1 are incompatible: the
last state might be related to C, so we want to discard the
previous state.
2. Discard Z.
3. Discard Y but remember its incompatibility information gathered
previously, and the failure we're dealing with right now.
4. Push a new state Y' based on X, and apply the incompatibility
information from Y to Y'.
5a. If this causes Y' to conflict, we need to backtrack again. Make Y'
the new Z and go back to step 2.
5b. If the incompatibilities apply cleanly, end backtracking.
c s s | ]}|j d ur|j V qd S r r5 �r �cr r r r . r z'Resolution._backjump.<locals>.<genexpr>c s s | ] }|j V qd S r r1 rq r r r r / r c s h | ]}� j �|��qS r �r? rR r r$ r r � <setcomp>1 r z'Resolution._backjump.<locals>.<setcomp>� rD Fc s h | ]}� j �|��qS r rs )r �dr$ r r rt ? s �c S s g | ]\}}|t |j�f�qS r )rT r. �r �k�vr r r r] G s �z(Resolution._backjump.<locals>.<listcomp>c s� � D ]�\} }|sqz�j j| }W n ty8 Y qY n0 �jj| t�j jt�d��t�j jt�d�| |i�d�}t |�}|s� dS |�
|j � t |t
|j�|d��j j| < qdS )Nr# r. rP Fr+ T)rE rJ rf r? rU r rV rW rX r �extendr. r* rT r- )rx r. r rY r, �Z incompatibilities_from_brokenr r r �_patch_criteriaQ s:
��� �z-Resolution._backjump.<locals>._patch_criteriaT)� itertools�chain�lenrA rn rI �popitemrF rf r8 r? rj �
isdisjointrJ r^ rM rO ) r r9 Zincompatible_reqsZincompatible_depsZincompatible_stateZ broken_statera r) Zcurrent_dependenciesr| �successr r{ r � _backjump s< �
��� zResolution._backjumpc s� �j rtd���j�� tt�� i g d�g�_ |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�jj �� �t|� � t|�jd�}��|�}|�r^d d� |D �} �jj| d
� ��| �}
| �jjd d �< |
�s�t �jj��n4� �fd d ��jj �� D �} ���jj | � ��� �jj |�jd
� q�t |��d S )Nzalready resolvedrH r5 )�indexc s g | ]\}}� � ||�s|�qS r �rh �r r_ r r$ r r r] � s �z&Resolution.resolve.<locals>.<listcomp>)rE )r_ c S s g | ]}|j D ]}|�qqS r r4 )r rr r3 r r r r] � r )r9 c s( h | ] \}}|� v r�� ||�s|�qS r r� r� �Zsatisfied_namesr r r rt � s �z%Resolution.resolve.<locals>.<setcomp>)r� rE ) rA � RuntimeErrorr@ Zstartingr= � collections� OrderedDictrZ rE rJ r r8 r r- rO �rangeZstarting_roundr^ Zending�set�keys�minrb rp Zresolving_conflictsr� rK r` Z ending_roundr; ) r r/ �
max_roundsr ro Z round_indexZunsatisfied_namesra Zfailure_causesr9 r� Znewly_unsatisfied_namesr r� r �resolve} sX
��$
�
�
��zResolution.resolveN)r r r
r r �propertyrE rO rZ r` rb rh rk rp r� r� r r r r r> i s
'
%or> 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)r6 �idrf �add�_has_route_to_root)rJ 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^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 )r� rw r r r �
<dictcomp>� r z!_build_result.<locals>.<dictcomp>c s i | ]\}}|� v r||�qS r r rw �r� r r r� � r )rI �graphrJ ) rI r^ r� r r� rJ r� r6 rf Zconnectr� )rE rI r� r� r_ r r� r� r r� r �
_build_result� s0
�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� )r> rB rC r� r� )r r/ r� Z
resolutionrE r r r r� s zResolver.resolveN)r� )r r r
r r
Zbase_exceptionr� r r r r r� s r� )r� r} rV Z providersr Zstructsr r r �
namedtupler � Exceptionr
r r( �objectr* r7 r8 r; r= r> r� r� r� r� r r r r �<module> s, �
' e