관리-도구
편집 파일: resolvers.cpython-35.pyc
��Re�: � @ sZ d d l Z d d l m Z d d l m Z d d l m Z e j d d d g � Z Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z Gd d � d e � Z e j d d � Z Gd d � d e � Z d d � Z e j d d � Z d d � Z Gd! d" � d" e � Z d S)#� N� )�collections_abc)�AbstractResolver)� DirectedGraph�RequirementInformation� requirement�parentc @ s e Z d Z d Z d S)�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-python35-pip-20.2.4-5.el8.x86_64/opt/alt/python35/lib/python3.5/site-packages/pip/_vendor/resolvelib/resolvers.pyr s r c s. e Z d Z � f d d � Z d d � Z � S)�RequirementsConflictedc s# t t | � j | � | | _ d S)N)�superr �__init__� criterion)�selfr )� __class__r r r s z RequirementsConflicted.__init__c C s, d j d j d d � | j j � D� � � S)NzRequirements conflict: {}z, c s s | ] } t | � Vq d 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 r r )r r r s r c s. e Z d Z � f d d � Z d d � Z � S)�InconsistentCandidatec s/ t t | � j | | � | | _ | | _ d S)N)r r r � candidater )r r r )r r r r ! s z InconsistentCandidate.__init__c C s2 d j | j d j d d � | j j � D� � � S)Nz+Provided candidate {!r} does not satisfy {}z, c s s | ] } t | � Vq d 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 s r c @ sp e Z d Z d Z d d � Z d d � Z e d d � � Z d d � Z d d � Z d d � Z d d � Z d 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 j d d � | j D� � } d j | � S)Nz, c s s' | ] \ } } d j | | � Vq d S)z({!r}, via={!r})N)r )r �reqr 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 sm | j | g � } t | t j � s0 t | � } | d | d t | | � g d g � } | si t | � � | S)z.Build an instance from a requirement. r! r" r# )� find_matches� isinstancer �Sequence�listr r )�cls�providerr r r! r r r r �from_requirementM s zCriterion.from_requirementc C s d d � | j D� S)Nc s s | ] } | j Vq d S)N)r )r �ir r r r ^ s z-Criterion.iter_requirement.<locals>.<genexpr>)r" )r r r r r ] s zCriterion.iter_requirementc C s d d � | j D� S)Nc s s | ] } | j Vq d S)N)r )r r. r r r r a s z(Criterion.iter_parent.<locals>.<genexpr>)r" )r r r r � iter_parent` s zCriterion.iter_parentc C s� t | j � } | j t | | � � | j d d � | D� � } t | t j � s_ t | � } t | � | | t | j � � } | s� t | � � | S)z>Build a new instance from this and a new requirement. c S s g | ] \ } } | � q Sr r )r r �_r r r � <listcomp>h s z)Criterion.merged_with.<locals>.<listcomp>) r* r" �appendr r' r( r r) �typer# r )r r, r r �infosr! r r r r � merged_withc s ! zCriterion.merged_withc sg t | j � } | j � � � f d d � | j D� } | sB d St | � | t | j � | � } | S)z�Build a new instance from this, but excluding specified candidate. Returns the new instance, or None if we still have no valid candidates. c s" g | ] } | � k r | � q Sr r )r �c)r r r r1 w s z)Criterion.excluded_of.<locals>.<listcomp>N)r* r# r2 r! r3 r" )r r Z incompatsr! r r )r r � excluded_ofp s !zCriterion.excluded_ofN) r r r r r r& � classmethodr- r r/ r5 r7 r r r r r - s r c @ s e Z d Z d S)�ResolutionErrorN)r r r r r r r r9 ~ s r9 c s" e Z d Z � f d d � Z � S)�ResolutionImpossiblec s# t t | � j | � | | _ d S)N)r r: r �causes)r r; )r r r r � s z ResolutionImpossible.__init__)r r r r r r )r r r: � s r: c s" e Z d Z � f d d � Z � S)�ResolutionTooDeepc s# t t | � j | � | | _ 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< � s r< �Statezmapping criteriac @ s� e Z d Z d Z d d � Z e d d � � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d S)� 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 r, �reporterr r r r � s zResolution.__init__c C s4 y | j d SWn t k r/ t d � � Yn Xd S)Nr �state���)rB � IndexError�AttributeError)r r r r rD � s zResolution.statec C s| y | j d } Wn- t k r@ t d t j � d i � } Yn( Xt d | j j � d | j j � � } | j j | � d S)z�Push a new state into history. This new state will be used to hold resolution results of the next coming round. r �mapping�criteriaNrE ) rB rF r> � collections� OrderedDictrH �copyrI r2 )r �baserD r r r �_push_new_state� s !zResolution._push_new_statec C s� | j j | | � | j j | � } y | j j | } Wn* t k re t j | j | | � } Yn X| j | j | | � } | | f S)N) rA Zadding_requirementr@ ZidentifyrD rI �KeyErrorr r- r5 )r r r �name�critr r r �_merge_into_criterion� s z Resolution._merge_into_criterionc C sW | \ } } y | j j | } Wn t k r: d } Yn X| j j | | j | j � S)N)rD rH rO r@ Zget_preferencer! r" )r �itemrP r Zpinnedr r r � _get_criterion_item_preference� s z)Resolution._get_criterion_item_preferencec sS y � j j | � Wn t k r, d SYn Xt � � f d d � | j � D� � S)NFc 3 s$ | ] } � j j | � � Vq d S)N)r@ �is_satisfied_by)r r )� current_pinr r r r � s z8Resolution._is_current_pin_satisfying.<locals>.<genexpr>)rD rH rO �allr )r rP r r )rV r r �_is_current_pin_satisfying� s z%Resolution._is_current_pin_satisfyingc C sL i } x? | j j | � D]+ } | j | d | �\ } } | | | <q W| S)Nr )r@ Zget_dependenciesrR )r r rI r rP rQ r r r �_get_criteria_to_update� s z"Resolution._get_criteria_to_updatec s� g } x� | j D]� � y � j � � } Wn8 t k rc } z | j | j � w WYd d } ~ Xn Xt � � f d d � | j � D� � } | s� t � | � � � j j � � � j j j | d � � � j j | <� j j j | � g SW| S)Nc 3 s$ | ] } � j j | � � Vq d S)N)r@ rU )r r )r r r r r � s z7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>)r! rY r r2 r rW r r rA ZpinningrD rH �poprI �update)r rP r r; rI �eZ satisfiedr )r r r �_attempt_to_pin_criterion� s$ z$Resolution._attempt_to_pin_criterionc C s� | j d =x� t | j � d k r� | j j � } y | j j � \ } } Wn t k ra w Yn X| j j | � | j � | j j | j | � } | d k r� | j d =q | | j j | <d SWd S)Nr � TFrE rE ) rB �lenrZ rH �popitemrO rA Z backtrackingrN rD rI r7 )r Z prev_staterP r r r r r � _backtrack� s zResolution._backtrackc s� � j r t d � � � j � xw | D]o } y � j | d d �\ } } Wn7 t k r� } z t | j j � � WYd d } ~ Xn X| � j j | <q& W� j j � x� t | � D]� } � j j | � � j � � j } � f d d � � j j j � D� } | s(� j d =� j j | � � j St | d � j �\ } } � j | | � } | r�� j � } | s�d d � | D� } t | � � � j j | | � q� Wt | � � d S) Nzalready resolvedr c s% g | ] } � j | � s | � q Sr )rX )r rS )r r r r1 4 s z&Resolution.resolve.<locals>.<listcomp>r �keyc S s& g | ] } | j D] } | � q q Sr )r" )r rQ r. r r r r1 K s rE )rB � RuntimeErrorrN rR r r: r r" rD rI rA Zstarting�rangeZstarting_round�itemsZending�minrT r] ra Z ending_roundr< )r r% � max_roundsr rP rQ r\ Z round_index�currZunsatisfied_criterion_itemsr Zfailure_causes�resultr; r )r r �resolve s> % zResolution.resolveN)r r r r r �propertyrD rN rR rT rX rY r] ra rj r r r r r? � s ! "r? c C s� | | k r d S| | k r d Sx� | | j � D]u } y | t | � } Wn t k rb w1 Yn X| | k r� | j | � d St | | | | � r1 | j | � d Sq1 Wd S)NTF)r/ �idrO �add�_has_route_to_root)rI rb �all_keys� connected�p�pkeyr r r rn T s rn �Resultzmapping graph criteriac sF | j } d d � | j � D� } d | t d � <t � } | j d � d h � x� | j j � D]� \ } } t | j | | � � s� qa | | k r� | j | � xi | j � D][ } y | t | � } Wn t k r� w� Yn X| | k r� | j | � | j | | � q� Wqa Wt d � f d d � | j � D� d | d | j � S)Nc S s% i | ] \ } } | t | � � q Sr )rl )r �k�vr r r � <dictcomp>l s z!_build_result.<locals>.<dictcomp>rH c s+ i | ]! \ } } | � k r | | � q Sr r )r rt ru )rp r r rv � s �graphrI ) rH re rl r rm rI rn r/ rO �connectrs )rD rH ro rw rb r rq rr r )rp r � _build_resultj s. ry c @ s+ e Z d Z d Z e Z d d d � Z d S)�Resolverz8The thing that performs the actual resolution work. �d c C s4 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. rg )r? r, rC rj ry )r r% rg � resolutionrD r r r rj � s zResolver.resolveN)r r r r r Zbase_exceptionrj r r r r rz � s rz )rJ �compatr Z providersr �structsr � namedtupler � Exceptionr r r �objectr r9 r: r< r> r? rn rs ry rz r r r r �<module> s$ Q�