/usr/local/lib/python3.9/site-packages/pip/_vendor/resolvelib/resolvers/__pycache__
a ���h�] � @ s8 U d dl mZ d dlZd dlZd dlZd dlmZmZ ddlm Z m Z m Z m Z m Z mZmZmZmZ ddlmZmZ ddlmZ dd lmZmZmZmZm Z er�d d l m Z m Z m Z dd l!m"Z"m#Z# dd l$m%Z% d Z&de'd< ddd�dd�Z(G dd� dee e e f �Z)G dd� dee e e f �Z*dddd d d �d d �Z+dS )!� )� annotationsN)� TYPE_CHECKING�Generic� ) �CT�KT�RT� DirectedGraph� IterableView�IteratorMapping�RequirementInformation�State�build_iter_view� )�AbstractResolver�Result)� Criterion)�InconsistentCandidate�RequirementsConflicted�ResolutionImpossible�ResolutionTooDeep�ResolverException)� Collection�Iterable�Mapping)�AbstractProvider� Preference)� BaseReporterg�������?�float� _OPTIMISTIC_BACKJUMPING_RATIO�State[RT, CT, KT]�Result[RT, CT, KT])�state�returnc 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 � )�id��.0�k�vr$ r$ �U/usr/local/lib/python3.9/site-packages/pip/_vendor/resolvelib/resolvers/resolution.py� <dictcomp>( � z!_build_result.<locals>.<dictcomp>c s i | ]\}}|� v r||�qS r$ r$ r& �� connectedr$ r* r+ > r, )�mapping�graph�criteria) r/ �itemsr% r �addr1 �_has_route_to_root� iter_parent�KeyError�connectr )r" r/ �all_keysr0 �key� criterion�p�pkeyr$ r- r* � _build_result& s0 �r= c @ s e Zd ZdZdddd�dd�Zedd �d d ��Zdd �d d �Zddddd�dd�Zdddd�dd�Z ddd�dd �Z dd d d �d d!�Z d"dd#�d$d%�Z dd&d�d'd(�Z d)d d*�d+d,�Zdd �d-d.�Zdd �d/d0�Zd1d d2�d3d4�Zd&d1d5�d6d7�Zd8d9dd:�d;d<�Zd=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. z AbstractProvider[RT, CT, KT]zBaseReporter[RT, CT, KT]�None)�provider�reporterr# c C s( || _ || _g | _t| _d | _d | _d S �N)�_p�_r�_statesr � _optimistic_backjumping_ratio� _save_statesZ_optimistic_start_round)�selfr@ rA r$ r$ r* �__init__K s zResolution.__init__r )r# c C s@ z | j d W S ty: } ztd�|�W Y d }~n d }~0 0 d S )N���r" )rE � IndexError�AttributeError)rH �er$ r$ r* r" Y 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. rJ N�r/ r1 �backtrack_causes)rE r r/ �copyr1 rO �append)rH �baser" r$ r$ r* �_push_new_state` s �zResolution._push_new_statezdict[KT, Criterion[RT, CT]]r z CT | None)r1 � requirement�parentr# c 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)rT rU )�requirement_or_candidate�iter_requirement�incompatibilities�� identifier� requirementsrX �� candidates� informationrX )rD �adding_requirementrC �identify�get�listrX � find_matchesr �operator� methodcaller� attrgetterr^ rQ r r r r] r ) rH r1 rT rU rZ r: rX �matchesr^ r$ r$ r* �_add_to_criterian s> ��� �zResolution._add_to_criteriazCollection[KT])r1 �parentsr# c 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 rB )rU rC r` )r' r^ �ri rH r$ r* � <listcomp>� s �z@Resolution._remove_information_from_criteria.<locals>.<listcomp>)r2 r r] r^ rX )rH r1 ri r9 r: r$ rj r* �!_remove_information_from_criteria� s ��z,Resolution._remove_information_from_criteriar r )�namer# c C s> | j j|| jjt| jjt�d��t| jjt�d��| jjd�S )Nr] r^ )rZ � resolutionsr] r^ rO ) rC �get_preferencer" r/ r r1 rd rf rO )rH rm r$ r$ r* �_get_preference� s ���zResolution._get_preferencezCriterion[RT, CT]�bool)rm r: r# c sB z�j j| � W n ty$ Y dS 0 t� �fdd�|�� D ��S )NFc 3 s | ]}�j j|� d �V qdS �)rT � candidateN�rC �is_satisfied_by�r' �r�� current_pinrH r$ r* � <genexpr>� s �z8Resolution._is_current_pin_satisfying.<locals>.<genexpr>)r" r/ r6 �allrW )rH rm r: r$ rx r* �_is_current_pin_satisfying� s �z%Resolution._is_current_pin_satisfyingr )rs r# c C s4 | j j�� }| jj|d�D ]}| j|||d� q|S )N�rs �rU )r" r1 rP rC �get_dependenciesrh )rH rs r1 rT r$ r$ r* �_get_updated_criteria� s z Resolution._get_updated_criteriazlist[Criterion[RT, CT]]c 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 rr rt rv �rs rH r$ r* rz � s �z7Resolution._attempt_to_pin_criterion.<locals>.<genexpr>r} )r" r1 r] r� r rD Zrejecting_candidater: rQ r{ rW r �pinning�updater/ �pop)rH rm r: �causesr1 rM � satisfiedr$ r� r* �_attempt_to_pin_criterion� s( "� z$Resolution._attempt_to_pin_criterionzlist[tuple[KT, list[CT]]])� incompatibilities_from_brokenr# c 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 )NrW rX rY Fr\ T)r" r1 r6 rC rc r rd re rf r �extendrX r rb r^ )rH r� r( rX r: rg r] r$ r$ r* �_patch_criteria� s: ��� �zResolution._patch_criteriac C s | j du r dd� | jD �| _ dS )zCSave states for potential rollback if optimistic backjumping fails.Nc S s0 g | ](}t |j�� |j�� |jd d � d��qS )NrN )r r/ rP r1 rO )r' �sr$ r$ r* rk ! s � �z*Resolution._save_state.<locals>.<listcomp>)rG rE �rH r$ r$ r* � _save_state s �zResolution._save_statec C s d| _ | jr| j| _d| _dS )z3Rollback states and disable optimistic backjumping.g N)rF rG rE r� r$ r$ r* �_rollback_states* s zResolution._rollback_statesz$list[RequirementInformation[RT, CT]])r� r# c s2 t �dd� |D �dd� |D ��}� fdd�|D �}t� j�dk�r.� jd= � j}z � j�� }|j�� \}}W n tt fy� t |�d�Y n0 � j s�||vr�q� j r�� j du r�||vr�� � � � fd d�� j�|�D �}|�|�s�q�|jsPq�qPd d � |j�� D �}|�||gf� � �� � �|�} | r2d S q2d S )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 rB r~ �r' �cr$ r$ r* rz Q r, z'Resolution._backjump.<locals>.<genexpr>c s s | ] }|j V qd S rB )rT r� r$ r$ r* rz R r, c s h | ]}� j �|��qS r$ �rC r` rv r� r$ r* � <setcomp>T r, z'Resolution._backjump.<locals>.<setcomp>� rJ Nc s h | ]}� j �|��qS r$ r� )r' �dr� r$ r* r� w s c S s g | ]\}}|t |j�f�qS r$ )rb rX r& r$ r$ r* rk � s z(Resolution._backjump.<locals>.<listcomp>TF)� itertools�chain�lenrE r" r� r/ �popitemrK r6 r rF rG r� rC r � isdisjointr1 r2 rQ rS r� ) rH r� Zincompatible_reqsZincompatible_deps� broken_staterm rs Zcurrent_dependenciesr� �successr$ r� r* � _backjump1 sR � ����� � � zResolution._backjump)�criteronr# c C s t dd� |D ��� �S )z5Extract causes from list of criterion and deduplicatec S s" i | ]}|j D ]}t|�|�qqS r$ )r^ r% )r' r� �ir$ r$ r* r+ � r, z.Resolution._extract_causes.<locals>.<dictcomp>)rb �values)rH r� r$ r$ r* �_extract_causes� s zResolution._extract_causes� Iterable[RT]�int�r[ � max_roundsr# c s �j rtd���j�� tt�� i g d�g�_ |D ]P}z�j�jj |d d� W q2 t y� } zt |j j �|�W Y d }~q2d }~0 0 q2��� d }d }t|�D �]V}�jj|d� �j�r�jd u�r|d u r�|}t|| �j �}|dkr��� q�n"|d u�r|| |k�r��� q��fdd��jj �� D �}|�sR�jj�jd� �j S t�jj �� �t|� � t|�d k�r�t�jj |�jj t �jj t � d ��t �jj t � d ���jj!d ��} n|} | �s�td ��t| �d k�r�t"| �j#d�} n| d } ��$| �} | �r���%| �} �jj&| d� z��'| �} W n, t �yV �j�rP�j�rPd}n� Y n 0 t(| �on�j�on�j�}|�r��j�r���� n"| �jj!d d �< | �s�t �jj!��n4� �fdd��jj �� D �}��)�jj |� ��� �jj*|�jd� q�t+|��d S )Nzalready resolvedrN r~ )�indexr c s g | ]\}}� � ||�s|�qS r$ �r| �r' r9 r: r� r$ r* rk � s �z&Resolution.resolve.<locals>.<listcomp>)r" r r] r^ )Z identifiersrn r] r^ rO z-narrow_requirement_selection returned 0 names)r9 )r� Tc s( h | ] \}}|� v r�� ||�s|�qS r$ r� r� �Zsatisfied_namesrH r$ r* r� s �z%Resolution.resolve.<locals>.<setcomp>)r� r" ),rE � RuntimeErrorrD �startingr � collections� OrderedDictrh r" r1 r r r: r^ rS �range�starting_roundrF rG r� r� r2 �ending�set�keysr� rb rC Z narrow_requirement_selectionr/ r rd rf rO �minrp r� r� Zresolving_conflictsr� rq rl � ending_roundr )rH r[ r� rw rM Zoptimistic_rounds_cutoffZ"optimistic_backjumping_start_round� round_index�unsatisfied_namesZnarrowed_unstatisfied_namesrm Zfailure_criterionr� r� Z failed_optimistic_backjumpingZnewly_unsatisfied_namesr$ r� r* �resolve� s� ��& � �� � ���� �� ��zResolution.resolveN)�__name__� __module__� __qualname__�__doc__rI �propertyr" rS rh rl rp r| r� r� r� r� r� r� r� r� r$ r$ r$ r* r> D s" , %# fr> c @ s( e Zd ZdZeZd dddd�dd�Zd S ) �Resolverz3The thing that performs the actual resolution work.�d r� r� r! r� 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> r@ rA r� r= )rH r[ r� � resolutionr" r$ r$ r* r� 3 s zResolver.resolveN)r� )r� r� r� r� r �base_exceptionr� r$ r$ r$ r* r� . s �r� z Mapping[KT, Criterion[RT, CT]]z KT | Nonezdict[int, KT | None]zset[KT | None]rq )r1 r9 r8 r. r# c C s� ||v r dS || vrdS |d us$J �| | � � D ]b}z|t|� }W n tyZ Y q0Y n0 ||v rt|�|� dS t| |||�r0|�|� dS q0dS )NTF)r5 r% r6 r3 r4 )r1 r9 r8 r. r; r< r$ r$ r* r4 X s" r4 ),� __future__r r� r� rd �typingr r �structsr r r r r r r r r Zabstractr r r: r � exceptionsr r r r r �collections.abcr r r � providersr r � reportersr r �__annotations__r= r> r� r4 r$ r$ r$ r* �<module> s( , m*
.
Edit
..
Edit
__init__.cpython-39.pyc
Edit
abstract.cpython-39.pyc
Edit
criterion.cpython-39.pyc
Edit
exceptions.cpython-39.pyc
Edit
resolution.cpython-39.pyc
Edit