B `d@sddlZddlZddlmZddlmZddlmZmZddlm Z ddl m Z ddl mZddlmZdd lmZdd lmZd d lmZerdd lmZmZmZmZddlmZddlmZddl m!Z!ddl"m#Z#ddl$m%Z%ddlm&Z&e'e(Z)GdddeZ ddZ*dS)N)six)canonicalize_name) BaseReporterResolutionImpossible)Resolver)InstallationError)RequirementSet) BaseResolver) PipProvider)MYPY_CHECK_RUNNING)Factory)DictListOptionalTuple)Result) WheelCache) PackageFinder)RequirementPreparer)InstallRequirement)InstallRequirementProvidercs.eZdZdfdd ZddZddZZS) rNc s6tt|t|||| ||| d|_||_d|_dS)N)finderpreparermake_install_reqforce_reinstallignore_installedignore_requires_pythonpy_version_info)superr__init__r factoryignore_dependencies_result) selfrr wheel_cacher use_user_siter"rrrupgrade_strategyr) __class__P/tmp/pip-unpacked-wheel-hu9qqap1/pip/_internal/resolution/resolvelib/resolver.pyr !s zResolver.__init__c sPtdd|Drtdtjjd}t}t||}fdd|D}y||_Wnt k r}z~j |}|sx<|j D]2\} } t dt| | dkrdn d | jqWtd d d d|j Dt||Wdd}~XYnXt|d } xFjjD]6} || } | dkr.qj| | _| | qW| S)Ncss|] }|jVqdS)N) constraint).0rr)r)r* @sz#Resolver.resolve..z"Constraints are not yet supported.)r!r"csg|]}j|qSr))r!Z!make_requirement_from_install_req)r,r-)r$r)r* Ksz$Resolver.resolve..z8Could not find a version that satisfies the requirement z (from {})z#No matching distribution found for z, cSsg|]\}}|jqSr))name)r,r-_r)r)r*r/ds)check_supported_wheels)anyrr r!r"r RLResolverresolver#rZget_installation_errorZcausesloggercriticalstrformatr1joinr raise_fromrmappingvaluesZget_install_requirementshould_reinstalladd_named_requirement)r$ root_reqsr3ZproviderZreporterresolver requirementseerrorreqparentreq_set candidateireqr))r$r*r6<s@        zResolver.resolvec s|jdk stdi|jj}t|jjd}xt|krd}xl|D]d}|krTqFt||}tfdd|DszqF|rtfdd|Dd}nd}||<d }qFW|s0t d q0Wt |j t jtd d d }d d|DS)aCreate a list that orders given requirements for installation. The returned list should contain all requirements in ``req_set``, so the caller can loop through it and have a requirement installed before the requiring thing. The current implementation walks the resolved dependency graph, and make sure every node has a greater "weight" than all its parents. Nzmust call resolve() firstr Fc3s|]}|kVqdS)Nr))r,p)weightsr)r*r.sz2Resolver.get_installation_order..c3s|]}|VqdS)Nr))r,rK)rLr)r*r.srTzACould not determine installation order due to cicular dependency.)rL)keyreversecSsg|] \}}|qSr)r))r,r2rJr)r)r*r/sz3Resolver.get_installation_order..)r#AssertionErrorgraphlenr=listZ iter_parentsallmaxrsortedrCitems functoolspartial_req_set_item_sorter) r$rHrPZ key_countZ progressedrMparentsZweightZ sorted_itemsr))rLr*get_installation_orderss2    zResolver.get_installation_order)N)__name__ __module__ __qualname__r r6r[ __classcell__r)r))r(r*r s 7rcCst|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)itemrLr1r)r)r*rYs rY)+rWlogging pip._vendorrpip._vendor.packaging.utilsrZpip._vendor.resolvelibrrrr5pip._internal.exceptionsrZpip._internal.req.req_setrpip._internal.resolution.baser Z,pip._internal.resolution.resolvelib.providerr pip._internal.utils.typingr r!r typingrrrrZ pip._vendor.resolvelib.resolversrpip._internal.cacher"pip._internal.index.package_finderr pip._internal.operations.preparerZpip._internal.req.req_installrr getLoggerr\r7rYr)r)r)r*s.