Ë
|
ñúh15 ã ó¢ d dl mZ d dlZd dlZd dlZd dlZd dlmZmZ d dl m
|
Z
|
d dl m Z m Z mZ d dl mZ d dlmZ d dlmZ d d lmZ d d
|
lmZ d d lmZ d d lm Z d d l m Z d dl 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,m-Z- ddl.m/Z/ erd dl0m1Z2 e2e-e,e3f Z1 ejh e5« Z6 G d de"« Z ddZ7 d dZ8y) é )Ú annotationsN)Ú TYPE_CHECKINGÚ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 óz e Zd Zh d£Z d d fd Z ddZ ddZ xZS ) r > úonly-if-neededúto-satisfy-onlyÚeagerc ó t | « |
|
| j v sJ t |||||| ||| ¬« | _ || _ |
|
| _ d | _ y )N) ÚfinderÚpreparerÚmake_install_reqÚ wheel_cacheÚ use_user_siteÚforce_reinstallÚignore_installedÚignore_requires_pythonÚpy_version_info)ÚsuperÚ__init__Ú_allowed_strategiesr ÚfactoryÚignore_dependenciesÚupgrade_strategyÚ_result) Úselfr% r$ r' r& r( r1 r* r+ r) r2 r, Ú __class__s ú_H:\Change_password\venv_build\Lib\site-packages\pip/_internal/resolution/resolvelib/resolver.pyr. zResolver.__init__, sd ø ô ÑÔØ 4×#;Ñ#;Ñ;Ð;Ð;ä ØØ Ø -Ø#Ø'Ø +Ø -Ø#9Ø +ô
|
|
ð $7Ô Ø 0Ô Ø&* ó c
|
ó2 | j j |« }t | j |j | j | j
|
|j ¬« }dt j v r t « }n
|
t « }t ||« } d}|j |j |¬« x}| _ t) |¬« } t+ |j, j/ « d ¬« D ] } | j1 « } | | j2 | j4 k7 rut7 j8 t: « 5 | j= | j4 « }| j? tA |t= | j2 « jB « « d d d « ¥| j jE | « }|d | _# nÃ| j jH rd
|
| _# n¥|jJ | jJ k7 rd
|
| _# n| jL s |jN rd
|
| _# nd| jP rV| jP jR r@| jP jT r"tV jY d | j2 « d
|
| _# n| jP }|rX|jZ rLd j] | j2 | jJ ||j^ xs d ¬« }tV ja |« | j? | « | jb }| j jd jg |« |D ] }d
|
|_4 d |_5 | S # t $ r8} | j j! t# d| « |j « }
|
|
|
| d } ~ wt$ $ r t& d w xY w# 1 sw Y xY w)N)r0 Ú constraintsr1 r2 Úuser_requestedÚPIP_RESOLVER_DEBUGi@ )Ú
|
max_roundsz,ResolutionImpossible[Requirement, Candidate])Úcheck_supported_wheelsc ó4 | j | j k7 S ©N)ÚnameÚ project_name)Úcs r6 ú<lambda>z"Resolver.resolve.<locals>.<lambda>u s °1·6±6¸Q¿^¹^Ñ3K r7 )ÚkeyFTz%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 <none given>)r@ ÚversionÚlinkÚreason)6r0 Úcollect_root_requirementsr r9 r1 r2 r: ÚosÚenvironr r Ú
|
RLResolverÚresolveÚ requirementsr3 r Úget_installation_errorr r
|
r r ÚsortedÚmappingÚvaluesÚget_install_requirementr@ rA Ú
|
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)r4 Ú root_reqsr= Ú collectedÚproviderÚreporterÚresolverÚ#limit_how_complex_resolution_can_beÚresultÚeÚerrorÚreq_setÚ candidateÚireqÚreqÚinstalled_distrF ÚmsgÚreqss r6 rL zResolver.resolveL sF ð LL×:Ñ:¸9ÓE Ü ØLLØ!×-Ñ-Ø $× 8Ñ 8Ø !× 2Ñ 2Ø$×3Ñ3ô
|
ð ¤2§:¡:Ñ -ÜBVÓBXHä"}HÜ<FØ Ø ó=
|
ð
|
3Ø28Ð /Ø$,×$4Ñ$4Ø×&Ñ&Ð3Vð %5ó %ð FT\ô !Ð8NÔOô
|
Ø NN× !Ñ !Ó #Ñ)Kô
|
ó A 0Ið ×4Ñ4Ó6DØ|Ø >> Y×%;Ñ%;Ò;ä#×,Ñ,¬XÓ6ñ Ø %× 5Ñ 5°i×6LÑ6LÓ MØ ×5Ñ5Ü 5Ø #¤_°Y·^±^Ó%D×%KÑ%Kó ô÷ð ð "\\× ?Ñ ?À Ó JNØ Ð%à(-Õ%Ø ×-Ò-à(,Õ%Ø ×'Ñ'¨9×+<Ñ+<Ò<à(,Õ%Ø×&Ò&¨.×*AÒ*Að )-Õ%Ø×&Ò&¨9×+@Ñ+@×+HÒ+Hà ×(Ñ(×1Ò1äKKð5ð ô ñ ð )-Õ%áà ×(Ñ(DÙðD÷ &Ø" Ø %× -Ñ -Ø Ø ×-Ñ-Ò?° ð ó ð ô sÔ#à × )Ñ )¨$Ö /ðCA 0ðF ×'Ñ'Ø × Ñ ×>Ñ>¸tÔDØò /CØ CLØ).CÕ &ð /ð øôm $ò ØLL×7Ñ7ÜÐCÀQÓGØ×%Ñ%óEð QÐ ûÜ ò 3Ü(¨dÐ 2ð 3ú÷ ñ ús% Â&L9 Ä2AN Ì9 N Í3M5Í5N Î N c ó~ | j J d« |j sg S | j j }t |t |j j « « « }t |j j « t j t |¬« d¬« }|D cg c] \ }}| c}}S c c}}w )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.
|
zmust call resolve() first)ÚweightsT)rD Úreverse) r3 rM ÚgraphÚget_topological_weightsÚsetÚkeysrO ÚitemsÚ functoolsÚpartialÚ_req_set_item_sorter)r4 rr r| rz Ú sorted_itemsÚ_rt s r6 Úget_installation_orderz Resolver.get_installation_order¾ s¡ ð ||Ð'ÐDÐ)DÓDÐ'à×#Ò#àIà ×"Ñ"Ü)¨%´°W×5IÑ5I×5NÑ5NÓ5PÓ1QÓRä Ø × Ñ × &Ñ &Ó (Ü×!Ñ!Ô"6ÀÔHØô
|
ð
|
%1×1DÓ1Ð1ùÓ1s Â) B9r? )r% r r$ r r' zWheelCache | Noner& r r( Úboolr1 r r* r r+ r r) r r2 Ústrr, ztuple[int, ...] | None)ri úlist[InstallRequirement]r= r Úreturnr )rr r r r )Ú__name__Ú
|
__module__Ú __qualname__r/ r. rL r Ú __classcell__)r5 s @r6 r r ) s· ø ÚHÐð 37ð +à%ð +ð ð +ð 'ð +ð
|
5ð +ð ð +ð "ð +ð ð +ð !%ð +ð ð +ð ð +ð 0õ +ð@pØ1ðpØKOðpà ópðd 2Ø%ð 2à !÷ 2r7 r c ó
|
t «
|
i d
|
fd t « } D ]- }| j |« D ] } |j |« / |sn9t « dz
|
}|D ] }|vr|g |< |D ] } j |« x d« t j « « j « }|rJ |« j « D ci c] \ }} |t | « c} }S c c} }w )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.
|
c ó | v ry j | g « }t |« dk\ ry j | « j | « D ]
|
} |« j | « | vry |j t « « || < y )Né )ÚgetÚlenÚaddÚ iter_childrenÚremoveÚappend)ÚnodeÚ cur_weightsÚchildr| ÚpathÚrequirement_keysÚvisitrz s r6 r z&get_topological_weights.<locals>.visitý s ø Ø 4<à ð kk $¨Ó+ Ü {Ó qÒ Ø ð Ø×(Ñ(¨Ó.ò EÙ %Lð à DÔà Ð'Ñ 'Ø à×Ñ3t9Ô%Ø# r7 Nr )r z
|
str | Noner ÚNone) r~ r r r r r Ú
|
differencer Úmax) r| r ÚleavesrD Ú_childÚweightÚleafr r Úwgtsr r rz s `` @@@r6 r} r} Þ s" ü ô8 EDØ+-G÷$ñ $ðB ÜØò CØ{ØØ ×-Ñ-¨cÓ2ò áð ð
|
|
|
3ð ñ à äUa Øò %DØÐ+Ñ+ØØ #HGDMð %ð
|
ò DØ LLÕ ð ð+ ñ6
|
$Kô W\\^Ó$×/Ñ/Ð0@ÓAJÙÐ%:Ó%>ð 18· ± ³× @¡ tD#d)OÓ @Ð@ùÓ @s Ã!C;c ó, 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 )Úitemrz r@ s r6 r r E s! ô T !WÓ %DØ 4=$Ð Ð r7 )r| zDirectedGraph[str | None]r zset[str]r údict[str | None, int])r§ z tuple[str, InstallRequirement]rz r¨ r ztuple[int, str])9Ú
|
__future__r rS r ÚloggingrI Útypingr r Úpip._vendor.packaging.utilsr Úpip._vendor.resolvelibr r r
|
r rK Ú 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 Úpip._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 r0 r Ú pip._vendor.resolvelib.resolversr ÚRLResultr Ú getLoggerr r_ r} r © r7 r6 ú<module>r¿ sÐ ðÝ "ã Û Û Û ß &å 9ß XÑ XÝ 9Ý 8å *Ý ;Ý <Ý @Ý DÝ <Ý 4ß RÝ D÷õ :ç (Ý áÝCà k 9¨cÐ1Ñ 2Fð
|
× Ñ 8Ó $ôr2|ô r2ðjdAØ $ðdAØ8@ðdAàódAðN Ø
|
(ð à "ð ð ô r7
|
