관리-도구
편집 파일: resolvers.cpython-38.pyc
U &?�f 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 �N/opt/hc_python/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 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 �reqr 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 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 r �r r2 r r r r Q s 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 tk r( td��Y nX 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 )�requirement_or_candidater" r- �� identifierr/ r- r* )r@ �adding_requirementr? �identify�get�listr- � find_matchesr �operator� methodcaller� attrgetterr, rM r r) r r+ r ) r rJ r r rR 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 ks$�j�|j �� kr|�qS r )r r? rT )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, )rR � resolutionsr+ r, rK ) r? �get_preferencerE rI r rJ rX rZ rK )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>)rE rI �KeyError�allr" )r re r r rj 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_dependenciesr\ )r r( rJ r r r r �_get_updated_criteria� s z Resolution._get_updated_criteriac s� �j j| }g }|jD ] z��� �}W nF tk rn } z(�j�|j� � |�|j� W Y �qW 5 d }~X Y nX 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 rg rh r �r( r r r r � s �z7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>ro )rE rJ r+ rq r r@ �rejecting_candidater rM rm r" r' �pinning�updaterI �pop)r re r r9 rJ �e� satisfiedr rr r �_attempt_to_pin_criterion� s( � z$Resolution._attempt_to_pin_criterionc s t �dd� |D �dd� |D ��}�fdd�|D �}t�j�dk�r�jd= d}|s�z �j�� }|j�� \}}W n ttfk r� t |��Y nX �fd d��j � |�D �}|� |� }qNd 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 k r|j V qd S r r5 �r �cr r r r . s z'Resolution._backjump.<locals>.<genexpr>c s s | ] }|j V qd S r r1 rz r r r r / s c s h | ]}� j �|��qS r �r? rT r r# r r � <setcomp>1 s z'Resolution._backjump.<locals>.<setcomp>� rD Fc s h | ]}� j �|��qS r r| )r �dr# r r r} ? s �c S s g | ]\}}|t |j�f�qS r )rV r- �r �k�vr r r r_ G s �z(Resolution._backjump.<locals>.<listcomp>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- rQ Fr* T)rE rJ rl r? rW r rX rY rZ r �extendr- r) rV r, )r� r- r r[ r+ �� incompatibilities_from_brokenr r r �_patch_criteriaQ s: ��� �z-Resolution._backjump.<locals>._patch_criteriaT)� itertools�chain�lenrA rv rI �popitemrF rl r8 r? rp � isdisjointrJ r` rM rO ) r r9 �incompatible_reqs�incompatible_deps�incompatible_state� broken_statere r( �current_dependenciesr� �successr r� r � _backjump s< � ��� zResolution._backjumpc s� �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�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 �rn �r ra r r# r r r_ � s �z&Resolution.resolve.<locals>.<listcomp>)rE )ra c S s g | ]}|j D ]}|�qqS r r4 )r r{ r3 r r r r_ � s )r9 c s( h | ] \}}|� kr�� ||�s|�qS r r� r� ��satisfied_namesr r r r} � s �z%Resolution.resolve.<locals>.<setcomp>)r� rE ) rA � RuntimeErrorr@ �startingr= � collections� OrderedDictr\ rE rJ r r8 r r, rO �range�starting_roundr` �ending�set�keys�minrf ry �resolving_conflictsr� rK rb � ending_roundr; ) r r/ � max_roundsr rw � round_index�unsatisfied_namesre �failure_causesr9 r� �newly_unsatisfied_namesr r� r �resolve} sZ �� � � � �zResolution.resolveN)r r r r r �propertyrE rO r\ rb rf rn rq ry r� r� r r r r r> i s ' %or> 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)r6 �idrl �add�_has_route_to_root)rJ ra �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� r� r r r � <dictcomp>� s z!_build_result.<locals>.<dictcomp>c s i | ]\}}|� kr||�qS r r r� �r� r r r� � s )rI �graphrJ ) rI r` r� r r� rJ r� r6 rl �connectr� )rE rI r� r� ra 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� � resolutionrE r r r r� s zResolver.resolveN)r� )r r r r r �base_exceptionr� r r r r r� s r� )r� r� rX � providersr �structsr r r � namedtupler � Exceptionr r r' �objectr) r7 r8 r; r= r> r� r� r� r� r r r r �<module> s. � ' e