Edit File: resolver.cpython-37.pyc
B �j�cq' � @ sT d dl Z d dlZd dlmZ d dlmZ d dlmZmZ d dlm Z d dl m Z d dl mZ d dlmZ d d lmZ d d lmZ d d lmZ d d lmZ d dlmZ d dlm Z e�r&d dl m Z m Z m Z m!Z!m"Z" d dl#m$Z$ d dl%m&Z& d dl'm(Z( d dl)m*Z* d dl+m,Z, d dl m-Z- d dlm.Z. e�/e0�Z1G dd� de�Z dd� Z2d d � Z3dS ) � N)�six)�canonicalize_name)� BaseReporter�ResolutionImpossible)�Resolver)�InstallationError)� check_invalid_constraint_type)�RequirementSet)� BaseResolver)� PipProvider)�dist_is_editable)�MYPY_CHECK_RUNNING� )� Constraint)�Factory)�Dict�List�Optional�Set�Tuple)�Result)�Graph)� WheelCache)� PackageFinder)�RequirementPreparer)�InstallRequirement)�InstallRequirementProviderc s8 e Zd ZdddhZd � fdd� Zdd � Zd d � Z� ZS ) r �eagerzonly-if-neededzto-satisfy-onlyNFc s^ t t| ��� | r t�d� | | jks*t�t|||||| ||| | d� | _|| _ | | _ d | _ d S )Nz�pip is using lazily downloaded wheels using HTTP range requests to obtain dependency information. This experimental feature is enabled through --use-feature=fast-deps and it is not ready for production.) �finder�preparer�make_install_req� wheel_cache� use_user_site�force_reinstall�ignore_installed�ignore_requires_python�py_version_info� lazy_wheel) �superr �__init__�logger�warning�_allowed_strategies�AssertionErrorr �factory�ignore_dependencies�upgrade_strategy�_result) �selfr r r! r r" r/ r$ r% r# r0 r& r' )� __class__� ��/builddir/build/BUILDROOT/alt-python37-pip-20.2.4-5.el8.x86_64/opt/alt/python37/lib/python3.7/site-packages/pip/_internal/resolution/resolvelib/resolver.pyr) ' s& zResolver.__init__c C s i }t � }g }x�|D ]�}|jrpt|�}|r2t|��|�� s<qt|j�}||kr`|| |M < q�t�|�||< q|j r�|jr�|� t|j�� | j j |dd�} | d k r|� | � qW t| j || j| j|d�} t� } t| | �} yd} | j|| d�| _W n< tk �r. } z | j �|�}t�||� W d d }~X Y nX t|d�}x�| jj�� D ]�}|� � }|d k�rb�qH| j � |�}|d k�r�d|_ nD| j j �r�d|_ n2|j |j!k�r�d|_ n t"|�|j#k�rHd|_ n�qH|j$}|�r |j%�r d j&|j|j!||j'�p�d d �}t(�)|� |�*|� �qHW |S ) Nr4 )Zrequested_extras)r. � constraintsr/ r0 �user_requestedi�� )Z max_rounds)�check_supported_wheelsFTz�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)+�set� constraintr r � match_markersr r9 r Z from_ireq� user_supplied�addr. Z!make_requirement_from_install_req�appendr r/ r0 r � RLResolver�resolver1 r Zget_installation_errorr � raise_fromr �mapping�valuesZget_install_requirementZget_dist_to_uninstall�should_reinstallr# �parsed_versionr: r � is_editableZ source_link� is_yanked�format� yanked_reasonr* r+ �add_named_requirement)r2 � root_reqsr8 r6 r7 � requirements�req�problemr9 �rZproviderZreporter�resolverZ try_to_avoid_resolution_too_deep�e�error�req_set� candidate�ireqZinstalled_distr; �msgr4 r4 r5 rD Q sx zResolver.resolvec C sN | j dk std��| j j}t|�}t|j�� tjt |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() first)�weightsT)�key�reversec S s g | ] \}}|�qS r4 r4 )�.0�_rY r4 r4 r5 � <listcomp>� s z3Resolver.get_installation_order.<locals>.<listcomp>) r1 r- �graph�get_topological_weights�sortedrP �items� functools�partial�_req_set_item_sorter)r2 rW ra r[ Z sorted_itemsr4 r4 r5 �get_installation_order� s z Resolver.get_installation_order)NF)�__name__� __module__� __qualname__r, r) rD rh � __classcell__r4 r4 )r3 r5 r $ s ^r c sL t � �i �� ���fdd���d� �d dks4t�t��t� �ksHt��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. c s^ | �kr d S �� | � x� �| �D ] }�|� q"W ��| � ��| d�}t|t����| < d S )Nr )rA Z iter_children�remove�get�max�len)�node�childZlast_known_parent_count)ra �path�visitr[ r4 r5 rt � s z&get_topological_weights.<locals>.visitNr )r= r- rp )ra r4 )ra rs rt r[ r5 rb � s rb 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 )�itemr[ r9 r4 r4 r5 rg � s rg )4re �logging� pip._vendorr Zpip._vendor.packaging.utilsr Zpip._vendor.resolvelibr r r rC �pip._internal.exceptionsr Z pip._internal.req.req_installr Zpip._internal.req.req_setr � pip._internal.resolution.baser Z,pip._internal.resolution.resolvelib.providerr �pip._internal.utils.miscr �pip._internal.utils.typingr �baser r. r �typingr r r r r Z pip._vendor.resolvelib.resolversr Z pip._vendor.resolvelib.structsr �pip._internal.cacher �"pip._internal.index.package_finderr � pip._internal.operations.preparer r r � getLoggerri r* rb rg r4 r4 r4 r5 �<module> s8 &.