Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pip/_internal/resolution/resolvelib/__pycache__/resolver.cpython-39.pyc
Ðазад
a "�h�1 � @ s� d dl Z d dlZd dlZd dlZd dlmZmZmZmZm Z m Z m Z d dl m Z d dlmZmZmZ d dlmZ d dlmZ d dlmZ d dlmZ d d lmZ d d l m Z d d l m Z d d l m!Z! d d l"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/m0Z0 ddl1m2Z2 e�rDd dl3m4Z5 e5e0e/e6f Z4e�7e8�Z9G dd� de%�Zde e6 eee6 e:f d�dd�Z;e e6e!f eee6 e:f e e:e6f d �d d �Z<dS ) � N)� TYPE_CHECKING�Dict�List�Optional�Set�Tuple�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 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-only�eagerzonly-if-neededN.) �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__� ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/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 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)r1 � constraintsr( r, �user_requested�PIP_RESOLVER_DEBUGi@ )� max_roundsz,ResolutionImpossible[Requirement, Candidate])r9 c S s | j | jkS )N)�name� project_name)�cr6 r6 r7 �<lambda>s � 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)6r1 �collect_root_requirementsr r; r( r, r< �os�environr r � RLResolver�resolve� requirementsr2 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+ rE � 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)r3 r8 r9 � collected�provider�reporter�resolver�#limit_how_complex_resolution_can_be�result�e�error�req_set� candidate�ireq�req�installed_distrF �msg�reqsr6 r6 r7 rL J s� � ��� � ��$ �� � zResolver.resolve)rq r: 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)rD �reversec S s g | ] \}}|�qS r6 r6 )�.0�_rs r6 r6 r7 � <listcomp>� rC z3Resolver.get_installation_order.<locals>.<listcomp>) r2 rM �graph�get_topological_weights�set�keysrO �items� functools�partial�_req_set_item_sorter)r3 rq r} rx � sorted_itemsr6 r6 r7 �get_installation_order� s �z Resolver.get_installation_order)N)�__name__� __module__� __qualname__r0 r r r r r �bool�strr �intr/ r r r rL r� � __classcell__r6 r6 r4 r7 r ' s* ��!� s�r z DirectedGraph[Optional[str]])r} �requirement_keysr: c s� t � �i �tt dd�� ����fdd� �t � }� D ],}|du rBq4� �|�D ]} q4qL|�|� q4|shq�t� �d }|D ]}|�vr�qx|�|< qx|D ]}� �|� q�q*�d� t ��� ����}|r�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 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)�noder: c sf | �v r d S �� | � � �| �D ] }�|� q ��| � | �vrDd S ��| d�}t|t����| < d S )Nr )�add� iter_children�remove�get�max�len)r� �child�last_known_parent_count�r} �pathr� �visitrx r6 r7 r� � s z&get_topological_weights.<locals>.visitr ) r r r� r� r� r� r� r� � difference)r} r� �leavesrD �_child�weight�leafr� r6 r� r7 r~ � s. r~ )�itemrx r: 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� rx r? r6 r6 r7 r� 5 s r� )=rS r� �loggingrI �typingr r r r r r r Zpip._vendor.packaging.utilsr �pip._vendor.resolvelibr r r r rK Z pip._vendor.resolvelib.structsr �pip._internal.cacher �pip._internal.exceptionsr �"pip._internal.index.package_finderr � pip._internal.operations.preparer � pip._internal.req.constructorsr � 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 r1 r Z pip._vendor.resolvelib.resolversr! ZRLResultr� � getLoggerr� r_ r� r~ r� r6 r6 r6 r7 �<module> sD $ 7� Z �
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка