관리-도구
편집 파일: resolver.cpython-39.opt-1.pyc
a [��fl% � @ s~ d dl Z d dlZd dlZd dlmZmZmZmZmZm Z m Z d dl m Z d dl mZmZ d dl mZ d dlmZ d dlmZ d dlmZ d d lmZ d d lmZ d d l m Z d d l m Z m Z d d l!m"Z" d dl#m$Z$m%Z% ddl&m'Z'm(Z( ddl)m*Z* e�rd dl+m,Z- e-e(e'e.f Z,e�/e0�Z1G dd� de �Zde2eee. e2f d�dd�Z3e e.ef eee. e2f e e2e.f d�dd�Z4dS ) � N)� TYPE_CHECKING�Dict�List�Optional�Set�Tuple�cast��canonicalize_name)� BaseReporter�ResolutionImpossible)�Resolver)� DirectedGraph)� WheelCache)� PackageFinder)�RequirementPreparer)�InstallRequirement)�RequirementSet)� BaseResolver�InstallRequirementProvider)� PipProvider)�PipDebuggingReporter� PipReporter� )� Candidate� Requirement)�Factory)�Resultc sz e Zd Zh d�Zd eeee ee e e e e e ee e df d� � fdd� Z ee e ed�dd �Zeee d �d d �Z� ZS )r > zto-satisfy-onlyzonly-if-neededZeagerN.) �preparer�finder� wheel_cache�make_install_req� use_user_site�ignore_dependencies�ignore_installed�ignore_requires_python�force_reinstall�upgrade_strategy�py_version_infoc s< t � �� t|||||| ||| d� | _|| _| | _d | _d S )N) r r r! r r" r& r$ r% r( )�super�__init__r �factoryr# r' �_result) �selfr r r r! r" r# r$ r% r& r' r( �� __class__� �P/usr/lib/python3.9/site-packages/pip/_internal/resolution/resolvelib/resolver.pyr* & s � zResolver.__init__)� 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 n@ ty� } z(| j �td| �|j�} | | �W Y d } ~ n d } ~ 0 0 t|d�} |j�� D ]�} | �� } | d u r�q�| j �| �}|d u r�d| _nr| j j�rd| _n`|j| jk�rd| _nJ| j�s(|j�r0d| _n2| j r�| j j r�| j j �rXt � d | j!� q�d| _nq�| j }|�r�|j"�r�d j#| j!| j||j$�p�d d �}t �%|� | �&| � q�| j'}| j j(�)|� | S ) N)r+ � constraintsr# r' �user_requestedZPIP_RESOLVER_DEBUGi�� )Z max_roundsz,ResolutionImpossible[Requirement, Candidate])r3 FTz�%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>)�name�version�link�reason)*r+ Zcollect_root_requirementsr r5 r# r' r6 �os�environr r � RLResolver�resolve� requirementsr, r Zget_installation_errorr r �mapping�valuesZget_install_requirementZget_dist_to_uninstallZshould_reinstallr& r8 Z is_editableZeditableZ source_link�is_fileZis_wheel�logger�infor7 Z is_yanked�formatZ yanked_reasonZwarningZadd_named_requirementZall_requirementsr Z prepare_linked_requirements_more)r- r2 r3 Z collectedZproviderZreporterZresolverZ try_to_avoid_resolution_too_deep�result�e�error�req_set� candidate�ireqZinstalled_distr9 �msgZreqsr0 r0 r1 r> F s~ � ��� �� � zResolver.resolve)rI r4 c C sL | j j}t|t| j j�d d�}t|j�� tj t |d�dd�}dd� |D �S )a 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, while breaking any cycles in the graph at arbitrary points. We make no guarantees about where the cycle would be broken, other than they would be broken. r )�expected_node_count)�weightsT)�key�reversec S s g | ] \}}|�qS r0 r0 )�.0�_rK r0 r0 r1 � <listcomp>� � z3Resolver.get_installation_order.<locals>.<listcomp>) r, �graph�get_topological_weights�lenr@ �sortedr? �items� functools�partial�_req_set_item_sorter)r- rI rU rN Z sorted_itemsr0 r0 r1 �get_installation_order� s � �z Resolver.get_installation_order)N)�__name__� __module__� __qualname__Z_allowed_strategiesr r r r r �bool�strr �intr* r r r r> r] � __classcell__r0 r0 r. r1 r # s* ��!� _�r z DirectedGraph[Optional[str]])rU rM r4 c s4 t � �i �tt dd�� ���fdd� ��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 take 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 it's 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. N)�noder4 c sZ | �v r d S �� | � � �| �D ] }�|� q ��| � ��| d�}t|t����| < d S )Nr )�addZ iter_children�remove�get�maxrW )re �childZlast_known_parent_count�rU �path�visitrN r0 r1 rm � s z&get_topological_weights.<locals>.visit)�setr rb )rU rM r0 rk r1 rV � s rV )�itemrN r4 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 )ro rN r7 r0 r0 r1 r\ � s r\ )5rZ Zloggingr; �typingr r r r r r r Zpip._vendor.packaging.utilsr Zpip._vendor.resolvelibr r r r= Z pip._vendor.resolvelib.structsr Zpip._internal.cacher Z"pip._internal.index.package_finderr Z pip._internal.operations.preparer Z pip._internal.req.req_installr Zpip._internal.req.req_setr Z pip._internal.resolution.baser r Z,pip._internal.resolution.resolvelib.providerr Z,pip._internal.resolution.resolvelib.reporterr r �baser r r+ r Z pip._vendor.resolvelib.resolversr ZRLResultrb Z getLoggerr^ rC rc rV r\ r0 r0 r0 r1 �<module> s< $ !� / �