관리-도구
편집 파일: resolvers.cpython-38.pyc
U ʗRe�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 ��/builddir/build/BUILDROOT/alt-python38-pip-22.2.1-2.el8.x86_64/opt/alt/python38/lib/python3.8/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> 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 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 ( 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' 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 @ 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 �reqr r r r r F s �z%Criterion.__repr__.<locals>.<genexpr>z Criterion({}))r! r, r )r � requirementsr r r �__repr__E s �zCriterion.__repr__c C s dd� | j D �S )Nc s s | ] }|j V qd S r )r �r �ir r r r M s z-Criterion.iter_requirement.<locals>.<genexpr>�r, r# r r r r" L s zCriterion.iter_requirementc C s dd� | j D �S )Nc s s | ] }|j V qd S r �r r1 r r r r P s z(Criterion.iter_parent.<locals>.<genexpr>r3 r# r r r � iter_parentO 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 S s r6 c s e Zd Z� fdd�Z� ZS )�ResolutionImpossiblec s t t| ��|� || _d S r )r r7 r �causes)r r8 r r r r X s z ResolutionImpossible.__init__�r r r r r& r r r r r7 W s r7 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__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 )� 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 s zResolution.__init__c C s. z | j d W S tk r( td��Y nX d S )N����state)r@ � IndexError�AttributeErrorr# r r r rD 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. rC N��mapping�criteria�backtrack_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�||gi�t|t � d�||i�d�}|r�t|j �}|� t||�� n t||�g}tt|�||d�}|js�t|��|||< d S )N)r r )�requirement_or_candidater" r- �� identifierr/ r- r* )r? �adding_requirementr> �identify�get�listr- � find_matchesr �operator� methodcaller� attrgetterr, rL r r) r r+ r ) r rI r r rQ r r- �matchesr, r r r �_add_to_criteria� s> ��� �zResolution._add_to_criteriac C s> | j j|| jjt| jjt�d��t| jjt�d��| jjd�S )Nr+ r, )rQ � resolutionsr+ r, rJ ) r> �get_preferencerD rH r rI rW rY rJ )r �namer r r �_get_preference� s ���zResolution._get_preferencec sD z�j j| � W n tk r& Y dS X t� �fdd�|�� D ��S )NFc 3 s | ]}�j j|� d �V qdS �)r r( N�r> �is_satisfied_byr �� current_pinr r r r � s �z8Resolution._is_current_pin_satisfying.<locals>.<genexpr>)rD rH �KeyError�allr" )r r^ r r rc 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( r4 )rD rI rK r> �get_dependenciesr[ )r r( rI r r r r �_get_updated_criteria� s z Resolution._get_updated_criteriac s� �j j| }g }|jD ]�� z��� �}W n6 tk r^ } z|�|j� W Y �qW 5 d }~X Y nX t� �fdd�|�� D ��}|s�t � |���j j � d� �j j� |� �j j �|d � � �j j |< g S |S )Nc 3 s | ]}�j j|� d �V qdS r` ra r �r( r r r r � s �z7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>rh )rD rI r+ rj r rL r rf r" r' r? �pinning�updaterH �pop)r r^ r r8 rI �e� satisfiedr rk r �_attempt_to_pin_criterion� s& � z$Resolution._attempt_to_pin_criterionc s� t �j�dkr��jd= �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 |j�f�qS r )rU r- �r �k�vr r r � <listcomp> s �z)Resolution._backtrack.<locals>.<listcomp>rh c s� � D ]�\} }|sqz�j j| }W n tk r: Y qY nX �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)rD rI re r> rV r rW rX rY r �extendr- r) rU r, )rt r- r rZ r+ �� incompatibilities_from_brokenr r r �_patch_criteria s: ��� �z.Resolution._backtrack.<locals>._patch_criteriaTF) �lenr@ rn rH �popitemrI �itemsrL r? � backtrackingrN )r � broken_stater^ r( rz �successr rx r � _backtrack� s � zResolution._backtrackc sh � j rtd��� j�� tt�� i g d�g� _ |D ]L}z� j� jj |d d� W q2 t k r| } zt |j j ��W 5 d }~X Y q2X q2� �� t|�D ]�}� jj|d� � fdd�� jj �� D �}|sڈ jj� jd� � j S t|� jd�}� �|�}|�r@d d� |D �} � jj| d � � �� } | � jjd d �< | �sHt � jj��n� �� � jj|� jd � q�t|��d S ) Nzalready resolvedrG r4 )�indexc s g | ]\}}� � ||�s|�qS r )rg )r �keyr r# r r rv h s �z&Resolution.resolve.<locals>.<listcomp>)rD )r� c S s g | ]}|j D ]}|�qqS r r3 )r �cr2 r r r rv x s )r8 )r� rD )r@ � RuntimeErrorr? �startingr< � collections� OrderedDictr[ rD rI r r7 r r, rN �range�starting_roundr} �ending�minr_ rq �resolving_conflictsr� rJ � ending_roundr: ) r r/ � max_roundsr ro � round_index�unsatisfied_namesr^ �failure_causesr8 r� r r# r �resolveL sF �� � zResolution.resolveN)r r r r r �propertyrD rN r[ r_ rg rj rq r� r� r r r r r= h s ' $Yr= c C s� ||kr dS || krdS | | � � D ]d}z|t|� }W n tk rP Y q$Y nX ||krj|�|� dS t| |||�r$|�|� dS q$dS )NTF)r5 �idre �add�_has_route_to_root)rI 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||krp|�|� |�� D ]L}z|t|� }W n tk r� Y qxY nX ||kr�|�|� |� ||� qxqDt � fdd�|�� D �|| jd�S )Nc S s i | ]\}}t |�|�qS r )r� rs r r r � <dictcomp>� s z!_build_result.<locals>.<dictcomp>c s i | ]\}}|� kr||�qS r r rs �r� r r r� � s )rH �graphrI ) rH r} r� r r� rI r� r5 re �connectr� )rD rH 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= rA rB r� r� )r r/ r� � resolutionrD r r r r� � s zResolver.resolveN)r� )r r r r r �base_exceptionr� r r r r r� � s r� )r� rW � providersr �structsr r r � namedtupler � Exceptionr r r' �objectr) r6 r7 r: r< r= r� r� r� r� r r r r �<module> s, � ' %