U
|
H=®d]' ã @ 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 er&d dlm 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 dl m-Z- d dlm.Z. e /e0¡Z1G dd deZ 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é )ÚFactory)ÚDictÚListÚOptionalÚSetÚTuple)Ú SpecifierSet)Ú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*tt|||||| ||| | 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# r0 r% r& r$ r1 r' r( ©Ú __class__© úcD:\z\workplace\VsCode\pyvenv\venv\Lib\site-packages\pip/_internal/resolution/resolvelib/resolver.pyr* ' s* ÿö zResolver.__init__c
|
C s i }t }g }|D ]}|jrbt|}|r0t|t|j}||krV|| |j@ ||< q |j||< q|jr~|jr~| t|j¡ | j j
|
|dd} | d k r| | ¡ qt | j || j | j|d}
|
t } t|
|
| } zd} | j|| d| _W n< tk
|
r } z | j |¡}t ||¡ W 5 d }~X Y nX t|d}| jj ¡ D ]Ä}| ¡ }|d krPq6| j |¡}|d krnd|_ nD| j j rd|_ n2|j |j krd|_ n t ||j!kr6d|_ nq6|j"}|rî|j#rîd j$|j|j ||j%pÞd
|
d }t& '|¡ | (|¡ q6|S ) Nr6 )Zrequested_extras)r/ Ú constraintsr0 r1 Úuser_requestedi )Z
|
max_rounds)Úcheck_supported_wheelsFTzThe 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 r r; Ú specifierÚ user_suppliedÚaddr/ Z!make_requirement_from_install_reqÚappendr r0 r1 r Ú
|
RLResolverÚresolver2 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)r3 Ú root_reqsr: r8 r9 Ú requirementsÚreqÚproblemr; ÚrZproviderZreporterÚresolverZ try_to_avoid_resolution_too_deepÚeÚerrorÚreq_setÚ candidateÚireqZinstalled_distr= Úmsgr6 r6 r7 rF Q s
|
ÿ û
|
ÿ
|
|
|
|
|
ÿ
|
ø
|
|
zResolver.resolvec C sN | j dk std| j j}t|}t|j ¡ tjt |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() first)ÚweightsT)ÚkeyÚreversec S s g | ] \}}|qS r6 r6 )Ú.0Ú_r[ r6 r6 r7 Ú
|
<listcomp>Å s z3Resolver.get_installation_order.<locals>.<listcomp>)
|
r2 r. ÚgraphÚget_topological_weightsÚsortedrR ÚitemsÚ functoolsÚpartialÚ_req_set_item_sorter)r3 rY rc r] Z sorted_itemsr6 r6 r7 Úget_installation_order® s ýz Resolver.get_installation_order)NF)Ú__name__Ú
|
__module__Ú __qualname__r- r* rF rj Ú __classcell__r6 r6 r4 r7 r $ s
|
ó*]r c sL t i fddd d dks4ttt ksHtS )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 sZ | kr d S | ¡ | ¡D ] }| q | ¡ | d¡}t|t| < d S )Nr )rC Z iter_childrenÚremoveÚgetÚmaxÚlen)ÚnodeÚchildZlast_known_parent_count©rc ÚpathÚvisitr] r6 r7 rw Ý s
|
|
|
z&get_topological_weights.<locals>.visitNr )r? r. rr )rc r6 ru r7 rd È s rd 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] r; r6 r6 r7 ri ö s ri )4rg ÚloggingÚ pip._vendorr Zpip._vendor.packaging.utilsr Zpip._vendor.resolvelibr r r rE Ú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 r/ r Útypingr r r r r Z pip._vendor.packaging.specifiersr Z pip._vendor.resolvelib.resolversr Z pip._vendor.resolvelib.structsr Úpip._internal.cacher Ú"pip._internal.index.package_finderr Ú pip._internal.operations.preparer r r Ú getLoggerrk r+ rd ri r6 r6 r6 r7 Ú<module> s8
|
%.
|
