관리-도구
편집 파일: resolver.cpython-38.pyc
U &?�f01 � @ s� d dl Z d dlZd dlZd dlZd dlmZmZmZmZm Z m Z m Z d dl m Z d dlmZmZ d dlmZ d dlmZ d dlmZ d dlmZ d d lmZ d d lm Z d d l m Z d d l m Z d d l!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�r4d dl0m1Z2 e2e-e,e3f Z1e�4e5�Z6G dd� de"�Zde e3 eee3 e7f d�dd�Z8e e3e f eee3 e7f e e7e3f d�d d �Z9dS ) � N)� TYPE_CHECKING�Dict�List�Optional�Set�Tuple�cast��canonicalize_name)� BaseReporter�ResolutionImpossible)�Resolver)� DirectedGraph)� WheelCache)� PackageFinder)�RequirementPreparer)�install_req_extend_extras)�InstallRequirement)�RequirementSet)� BaseResolver�InstallRequirementProvider)� PipProvider)�PipDebuggingReporter� PipReporter)�get_requirement� )� Candidate� Requirement)�Factory)�Resultc s| e Zd ZdddhZdeeee ee e e e e e ee e df d� � fdd� Z ee e ed �d d �Zeee d �d d�Z� ZS )r �eagerzonly-if-neededzto-satisfy-onlyN.) �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 � �� | | jkst�t|||||| ||| d� | _|| _| | _d | _d S )N) r" r! r$ r# r% r) r' r( r+ ) �super�__init__�_allowed_strategies�AssertionErrorr �factoryr& r* �_result) �selfr! r" r# r$ r% r& r' r( r) r* r+ �� __class__� �Z/opt/hc_python/lib/python3.8/site-packages/pip/_internal/resolution/resolvelib/resolver.pyr- ) s � zResolver.__init__)� root_reqs�check_supported_wheels�returnc C s0 | j �|�}t| j |j| j| j|jd�}dtjkr:t � }nt � }t ||�}z d}|j |j |d� }| _W n> tk r� } z | j �td| �|j�} | | �W 5 d } ~ X Y nX t|d�} t|j�� dd� d �D �]4} | �� } | d k�r(| j| jkr�t�t��* | � | j�}| � t |t | j�j �� W 5 Q R X q�| j � | �}|d k�rFd | _!nr| j j"�rXd | _!n`|j#| j#k�rnd | _!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-�p�dd�}t)�.|� | � | � q�| j/}| j j0�1|� |D ]}d |_2d |_3�q| S )N)r0 � constraintsr& r* �user_requested�PIP_RESOLVER_DEBUGi@ )� max_roundsz,ResolutionImpossible[Requirement, Candidate])r8 c S s | j | jkS )N)�name� project_name)�cr5 r5 r6 �<lambda>p � 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)4r0 �collect_root_requirementsr r: r& r* r; �os�environr r � RLResolver�resolve� requirementsr1 r �get_installation_errorr r �sorted�mapping�values�get_install_requirementr> r? � contextlib�suppress�KeyErrorr �add_named_requirementr �extras�get_dist_to_uninstall�should_reinstallr) rD � 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)r2 r7 r8 � collected�provider�reporter�resolver�#limit_how_complex_resolution_can_be�result�e�error�req_set� candidate�ireq�req�installed_distrE �msg�reqsr5 r5 r6 rK I s� � � �� � �� �� � zResolver.resolve)rp r9 c C sd | j dk std��|js g S | j j}t|t|j�� ��}t|j�� t j 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)rC �reversec S s g | ] \}}|�qS r5 r5 )�.0�_rr r5 r5 r6 � <listcomp>� s z3Resolver.get_installation_order.<locals>.<listcomp>) r1 r/ rL �graph�get_topological_weights�set�keysrN �items� functools�partial�_req_set_item_sorter)r2 rp r| rw � sorted_itemsr5 r5 r6 �get_installation_order� s �z Resolver.get_installation_order)N)�__name__� __module__� __qualname__r. r r r r r �bool�strr �intr- r r r rK r� � __classcell__r5 r5 r3 r6 r & s, ��! � q�r z DirectedGraph[Optional[str]])r| �requirement_keysr9 c s� t � �i �tt dd�� ����fdd� �t � }� D ],}|dkrBq4� �|�D ]} q4qL|�|� q4|shq�t� �d }|D ]}|�kr�qx|�|< qx|D ]}� �|� q�q*�d� t ��� ����}|r�t |���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. N)�noder9 c sf | �kr d S �� | � � �| �D ] }�|� q ��| � | �krDd S ��| d�}t|t����| < d S )Nr )�add� iter_children�remove�get�max�len)r� �child�last_known_parent_count�r| �pathr� �visitrw r5 r6 r� � s z&get_topological_weights.<locals>.visitr ) r~ r r� r� r� r� r� r � differencer/ )r| r� �leavesrC �_child�weight�leafr� r5 r� r6 r} � s. r} )�itemrw r9 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� rw r> r5 r5 r6 r� 2 s r� ):rR r� �loggingrH �typingr r r r r r r Zpip._vendor.packaging.utilsr �pip._vendor.resolvelibr r r rJ Z pip._vendor.resolvelib.structsr �pip._internal.cacher �"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 r0 r Z pip._vendor.resolvelib.resolversr ZRLResultr� � getLoggerr� r^ r� r} r� r5 r5 r5 r6 �<module> sD $ 5 � Z �