/usr/local/lib/python3.9/site-packages/pip/_internal/resolution/resolvelib/__pycache__
a ���h15 � @ s~ d dl mZ d dlZd dlZd dlZd dlZd dlmZmZ d dl m Z d dl m Z m Z mZ d dl mZ d dlmZ d dlmZ d d lmZ d d lmZ d d lmZ d d lm Z d d l m Z d dl m Z d dl!m"Z"m#Z# d dl$m%Z% d dl&m'Z'm(Z( d dl)m*Z* ddl+m,Z,m-Z- ddl.m/Z/ e�r<d dl0m1Z2 e2e-e,e3f Z1e�4e5�Z6G dd� de"�Zdddd �d d �Z7d dd d!�d"d#�Z8dS )$� )� annotationsN)� TYPE_CHECKING�cast��canonicalize_name)� BaseReporter�ResolutionImpossible�ResolutionTooDeep)�Resolver)� DirectedGraph)� WheelCache)�ResolutionTooDeepError)� PackageFinder)�RequirementPreparer)�install_req_extend_extras)�InstallRequirement)�RequirementSet)� BaseResolver�InstallRequirementProvider)� PipProvider)�PipDebuggingReporter� PipReporter)�get_requirement� )� Candidate� Requirement)�Factory)�Resultc sb e Zd Zh d�Zdddddddddddd d � � fd d � Zd ddd�dd�Zdd d�dd�Z� ZS )r > zonly-if-neededzto-satisfy-only�eagerNr r zWheelCache | Noner �bool�strztuple[int, ...] | None) �preparer�finder� wheel_cache�make_install_req� use_user_site�ignore_dependencies�ignore_installed�ignore_requires_python�force_reinstall�upgrade_strategy�py_version_infoc sJ t � �� | | jv sJ �t|||||| ||| d� | _|| _| | _d | _d S )N) r" r! r$ r# r% r) r' r( r+ )�super�__init__�_allowed_strategiesr �factoryr& r* �_result) �selfr! r" r# r$ r% r& r' r( r) r* r+ �� __class__� �V/usr/local/lib/python3.9/site-packages/pip/_internal/resolution/resolvelib/resolver.pyr- , s � zResolver.__init__zlist[InstallRequirement]r )� root_reqs�check_supported_wheels�returnc C s^ | j �|�}t| j |j| j| j|jd�}dtjv r:t � }nt � }t ||�}z d}|j |j |d� }| _W nV ty� } z(| j �td| �|j�} | | �W Y d } ~ n d } ~ 0 ty� td �Y n0 t|d�} t|j�� dd� d �D �]J} | �� } | d u �rV| j| jkr�t� t ��4 | � | j�}| � t |t | j�j!�� W d � q�1 �sJ0 Y q�| j �"| �}|d u �rtd | _#nr| j j$�r�d | _#n`|j%| j%k�r�d | _#nJ| j&�s�|j'�r�d | _#n2| j(r�| j(j)r�| j(j*�r�t+�,d | j� q�d | _#nq�| j(}|�r"|j-�r"d j.| j| j%||j/�pdd�}t+�0|� | � | � q�| j1}| j j2�3|� |D ]}d |_4d |_5�qF| S )N)r/ � constraintsr& r* �user_requested�PIP_RESOLVER_DEBUGi@ )� max_roundsz,ResolutionImpossible[Requirement, Candidate])r7 c S s | j | jkS )N)�name� project_name)�cr4 r4 r5 �<lambda>u � z"Resolver.resolve.<locals>.<lambda>)�keyFTz�%s is already installed with the same version as the provided wheel. Use --force-reinstall to force an installation of the wheel.z�The candidate selected for download or install is a yanked version: {name!r} candidate (version {version} at {link}) Reason for being yanked: {reason}z <none given>)r= �version�link�reason)6r/ �collect_root_requirementsr r9 r& r* r: �os�environr r � RLResolver�resolve� requirementsr0 r �get_installation_errorr r r r �sorted�mapping�values�get_install_requirementr= r> � contextlib�suppress�KeyErrorr �add_named_requirementr �extras�get_dist_to_uninstall�should_reinstallr) rC � is_editable�editable� source_link�is_file�is_wheel�logger�info� is_yanked�format� yanked_reason�warning�all_requirementsr! � prepare_linked_requirements_more�prepared�needs_more_preparation)r1 r6 r7 � collected�provider�reporter�resolverZ#limit_how_complex_resolution_can_be�result�e�error�req_set� candidate�ireq�req�installed_distrD �msg�reqsr4 r4 r5 rJ L s� � ��� � ��$ �� � zResolver.resolve)rn r8 c C sd | j dusJ d��|js g S | j j}t|t|j�� ��}t|j�� tj t |d�dd�}dd� |D �S )aZ Get order for installation of requirements in RequirementSet. The returned list contains a requirement before another that depends on it. This helps ensure that the environment is kept consistent as they get installed one-by-one. The current implementation creates a topological ordering of the dependency graph, giving more weight to packages with less or no dependencies, while breaking any cycles in the graph at arbitrary points. We make no guarantees about where the cycle would be broken, other than it *would* be broken. Nzmust call resolve() first)�weightsT)rB �reversec S s g | ] \}}|�qS r4 r4 )�.0�_rp r4 r4 r5 � <listcomp>� rA z3Resolver.get_installation_order.<locals>.<listcomp>) r0 rK �graph�get_topological_weights�set�keysrM �items� functools�partial�_req_set_item_sorter)r1 rn rz ru � sorted_itemsr4 r4 r5 �get_installation_order� s �z Resolver.get_installation_order)N)�__name__� __module__� __qualname__r. r- rJ r� � __classcell__r4 r4 r2 r5 r ) s �( rr zDirectedGraph[str | None]zset[str]zdict[str | None, int])rz �requirement_keysr8 c s� t � �i �ddd�� ����fdd� �t � }� D ],}|du r>q0� �|�D ]} q0qH|�|� q0|sdq�t� �d }|D ]}|�vr�qt|g�|< qt|D ]}� �|� q�q&�d� t ��� ����}|r�J |��dd � ��� D �S ) a� Assign weights to each node based on how "deep" they are. This implementation may change at any point in the future without prior notice. We first simplify the dependency graph by pruning any leaves and giving them the highest weight: a package without any dependencies should be installed first. This is done again and again in the same way, giving ever less weight to the newly found leaves. The loop stops when no leaves are left: all remaining packages have at least one dependency left in the graph. Then we continue with the remaining graph, by taking the length for the longest path to any node from root, ignoring any paths that contain a single node twice (i.e. cycles). This is done through a depth-first search through the graph, while keeping track of the path to the node. Cycles in the graph result would result in node being revisited while also being on its own path. In this case, take no action. This helps ensure we don't get stuck in a cycle. When assigning weight, the longer path (i.e. larger length) is preferred. We are only interested in the weights of packages that are in the requirement_keys. z str | None�None)�noder8 c sz | �v r d S �� | g �}t|�dkr(d S ��| � � �| �D ] }�|� q<��| � | �vr`d S |�t��� |�| < d S )N� )�get�len�add� iter_children�remove�append)r� Z cur_weights�child�rz �pathr� �visitru r4 r5 r� � s z&get_topological_weights.<locals>.visitNr c S s i | ]\}}|t |��qS r4 )�max)rw r� Zwgtsr4 r4 r5 � <dictcomp>B rA z+get_topological_weights.<locals>.<dictcomp>)r| r� r� r� r� r} � differencer~ )rz r� ZleavesrB Z_childZweightZleafr� r4 r� r5 r{ � s. " r{ z tuple[str, InstallRequirement]ztuple[int, str])�itemru r8 c C s t | d �}|| |fS )a) Key function used to sort install requirements for installation. Based on the "weight" mapping calculated in ``get_installation_order()``. The canonical package name is returned as the second member as a tie- breaker to ensure the result is predictable, which is useful in tests. r r )r� ru r= r4 r4 r5 r� E s r� )9� __future__r rQ r �loggingrG �typingr r �pip._vendor.packaging.utilsr �pip._vendor.resolvelibr r r r rI Z pip._vendor.resolvelib.structsr �pip._internal.cacher �pip._internal.exceptionsr �"pip._internal.index.package_finderr � pip._internal.operations.preparer � pip._internal.req.constructorsr Z pip._internal.req.req_installr Zpip._internal.req.req_setr � pip._internal.resolution.baser r �,pip._internal.resolution.resolvelib.providerr �,pip._internal.resolution.resolvelib.reporterr r � pip._internal.utils.packagingr �baser r r/ r Z pip._vendor.resolvelib.resolversr ZRLResultr � getLoggerr� r] r{ r� r4 r4 r4 r5 �<module> s< 6g
.
Edit
..
Edit
__init__.cpython-39.pyc
Edit
base.cpython-39.pyc
Edit
candidates.cpython-39.pyc
Edit
factory.cpython-39.pyc
Edit
found_candidates.cpython-39.pyc
Edit
provider.cpython-39.pyc
Edit
reporter.cpython-39.pyc
Edit
requirements.cpython-39.pyc
Edit
resolver.cpython-39.pyc
Edit