a
ljl% @ 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* erd dl+m,Z- e-e(e'e.f Z,e/e0Z1G dd de Zde2eee. e2f dddZ3e e.ef eee. e2f e e2e.f dddZ4dS ) N)
TYPE_CHECKINGDictListOptionalSetTuplecastcanonicalize_name) BaseReporterResolutionImpossible)Resolver)
DirectedGraph)
WheelCache)
PackageFinder)RequirementPreparer)InstallRequirement)RequirementSet) BaseResolverInstallRequirementProvider) PipProvider)PipDebuggingReporter PipReporter ) Candidate Requirement)Factory)Resultc sz e Zd Zh dZd
eeee ee e e e e e
ee e df d fdd
Z
ee e eddd Zeee d
d d Z ZS )r
> zto-satisfy-onlyzonly-if-neededZeagerN.) preparerfinder wheel_cachemake_install_req
use_user_siteignore_dependenciesignore_installedignore_requires_pythonforce_reinstallupgrade_strategypy_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__ P/usr/lib/python3.9/site-packages/pip/_internal/resolution/resolvelib/resolver.pyr* & s
zResolver.__init__) root_reqscheck_supported_wheelsreturnc
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 rq| j | }|d u rd|
_nr| j jrd|
_n`|j| jkrd|
_nJ| js(|jr0d|
_n2| j r| j j r| j j rXt d |
j! qd|
_nq| j }|r|j"rd
j#| j!| j||j$pd d }t %| | &|
q| j'}| j j()| | S )
N)r, constraintsr# r' user_requestedZPIP_RESOLVER_DEBUGi )Z
max_roundsz,ResolutionImpossible[Requirement, Candidate])r4 FTz%s is already installed with the same version as the provided wheel. Use --force-reinstall to force an installation of the wheel.zThe candidate selected for download or install is a yanked version: {name!r} candidate (version {version} at {link})
Reason for being yanked: {reason}z )nameversionlinkreason)*r, Zcollect_root_requirementsr r6 r# r' r7 osenvironr r
RLResolverresolve requirementsr- r Zget_installation_errorr r mappingvaluesZget_install_requirementZget_dist_to_uninstallZshould_reinstallr& r9 Z is_editableZeditableZ source_linkis_fileZis_wheelloggerinfor8 Z is_yankedformatZ
yanked_reasonZwarningZadd_named_requirementZall_requirementsr Z prepare_linked_requirements_more)r. r3 r4 Z collectedZproviderZreporterZresolverZ try_to_avoid_resolution_too_deepresulteerrorreq_set candidateireqZinstalled_distr: msgZreqsr1 r1 r2 r? F s~
zResolver.resolve)rJ r5 c C s^ | j dusJ d| j j}t|t| j jd d}t|j tj t
|ddd}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)keyreversec S s g | ] \}}|qS r1 r1 ).0_rL r1 r1 r2
z3Resolver.get_installation_order..) r- graphget_topological_weightslenrA sortedr@ items functoolspartial_req_set_item_sorter)r. rJ rV rO Z sorted_itemsr1 r1 r2 get_installation_order s z Resolver.get_installation_order)N)__name__
__module__ __qualname__r+ r r r r r boolstrr intr* r r r r? r^
__classcell__r1 r1 r/ r2 r
# s* ! _r
z DirectedGraph[Optional[str]])rV rN r5 c sT t i tt dd fdd d d dks@J t|ksPJ 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)noder5 c sZ | v r d S | | D ] }| q | | d}t|t| < d S )Nr )addZ
iter_childrenremovegetmaxrX )rf childZlast_known_parent_countrV pathvisitrO r1 r2 rn s
z&get_topological_weights..visitr )setr rc rX )rV rN r1 rl r2 rW s rW )itemrO r5 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 )rp rO r8 r1 r1 r2 r] s
r] )5r[ 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 ZRLResultrc Z getLoggerr_ rD rd rW r] r1 r1 r1 r2 s< $
! /