OwlCyberSecurity - MANAGER
Edit File: resolver.cpython-310.pyc
o ƚRel% � @ 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* er�d dl+m,Z- e-e(e'e.f Z,e�/e0�Z1G dd� de �Zddde2deee. e2f fdd�Z3de e.ef d eee. e2f de e2e.f fd d �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 s� e Zd Zh d�Z ddededee dede de d e d e d e d e d ee e df f� fdd� Z dee de defdd�Zdedee fdd�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_info.c sJ t � �� | | jv s J �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__� ��/builddir/build/BUILDROOT/alt-python310-pip-21.3.1-3.el8.x86_64/opt/alt/python310/lib/python3.10/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 ||�}zd}|j |j |d� }| _W n tyN } z| j �td| �|j�} | | �d } ~ ww t|d�} |j�� D ]m} | �� } | d u rdqY| j �| �}|d u rrd| _n4| j jrzd| _n,|j| jkr�d| _n"| js�|jr�d| _n| j r�| j j r�| j j r�t � d | j!� qYd| _nqY| j }|r�|j"r�d j#| j!| j||j$p�d d �}t �%|� | �&| � qY| j'}| j j(�)|� | S ) N)r- � constraintsr$ r( �user_requested�PIP_RESOLVER_DEBUGi�� )� max_roundsz,ResolutionImpossible[Requirement, Candidate])r5 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- �collect_root_requirementsr r7 r$ r( r8 �os�environr r � RLResolver�resolve� requirementsr. r �get_installation_errorr r �mapping�values�get_install_requirement�get_dist_to_uninstall�should_reinstallr' r< � is_editable�editable� source_link�is_file�is_wheel�logger�infor; � is_yanked�format� yanked_reason�warning�add_named_requirement�all_requirementsr � prepare_linked_requirements_more)r/ r4 r5 � collected�provider�reporter�resolver� try_to_avoid_resolution_too_deep�result�e�error�req_set� candidate�ireq�installed_distr= �msg�reqsr2 r2 r3 rC F s� � ����� � � zResolver.resolvera c C s^ | j dus J d��| 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. Nzmust call resolve() firstr )�expected_node_count)�weightsT)�key�reversec S s g | ]\}}|�qS r2 r2 )�.0�_rc r2 r2 r3 � <listcomp>� s z3Resolver.get_installation_order.<locals>.<listcomp>) r. �graph�get_topological_weights�lenrF �sortedrD �items� functools�partial�_req_set_item_sorter)r/ ra rn rh � sorted_itemsr2 r2 r3 �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 rC rw � __classcell__r2 r2 r0 r3 r # sL �������� � � � � �� �^��r rn z DirectedGraph[Optional[str]]rg r6 c sV t � �i �dtt ddf� ���fdd� ��d� �d dks!J �t��|ks)J ��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. �noder6 Nc sZ | �v rd S �� | � � �| �D ]}�|� q��| � ��| d�}t|t����| < d S )Nr )�add� iter_children�remove�get�maxrp )r �child�last_known_parent_count�rn �path�visitrh r2 r3 r� � s z&get_topological_weights.<locals>.visitr )�setr r| rp )rn rg r2 r� r3 ro � s ro �itemrh 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� rh r; r2 r2 r3 ru � s ru )5rs �loggingr@ �typingr r r r r r r �pip._vendor.packaging.utilsr �pip._vendor.resolvelibr r r rB Z pip._vendor.resolvelib.structsr �pip._internal.cacher �"pip._internal.index.package_finderr � pip._internal.operations.preparer 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 �baser r r- r Z pip._vendor.resolvelib.resolversr ZRLResultr| � getLoggerrx rP r} ro ru r2 r2 r2 r3 �<module> sL $ �� �. �� �