o g}el%@sddlZddlZddlZddlmZmZmZmZmZm Z m Z ddl m Z ddl mZmZddl mZddlmZddlmZddlmZdd lmZdd lmZdd lmZdd lmZm Z dd l!m"Z"ddl#m$Z$m%Z%ddl&m'Z'm(Z(ddl)m*Z*erddl+m,Z-e-e(e'e.fZ,e/e0Z1GdddeZddde2deee.e2ffddZ3de e.efdeee.e2fde e2e.ffddZ4dS)N) TYPE_CHECKINGDictListOptionalSetTuplecastcanonicalize_name) BaseReporterResolutionImpossible)Resolver) DirectedGraph) WheelCache) PackageFinder)RequirementPreparer)InstallRequirement)RequirementSet) BaseResolverInstallRequirementProvider) PipProvider)PipDebuggingReporter PipReporter) Candidate Requirement)Factory)ResultcseZdZhdZ ddededeedede de d e d e d e d e d ee e dfffdd Z deede defddZdedeefddZZS)r >zonly-if-neededzto-satisfy-onlyeagerNpreparerfinder wheel_cachemake_install_req use_user_siteignore_dependenciesignore_installedignore_requires_pythonforce_reinstallupgrade_strategypy_version_info.c sJt| |jvs Jt|||||| ||| d |_||_| |_d|_dS)N) r rr"r!r#r'r%r&r))super__init___allowed_strategiesrfactoryr$r(_result) selfrr r!r"r#r$r%r&r'r(r) __class__u/Users/abhinavbhinder/Documents/map/venv/lib/python3.10/site-packages/pip/_internal/resolution/resolvelib/resolver.pyr+&s   zResolver.__init__ root_reqscheck_supported_wheelsreturnc Cs|j|}t|j|j|j|j|jd}dtjvrt }nt }t ||}zd}|j |j |d}|_WntyN} z|jtd| |j} | | d} ~ wwt|d} |jD]m} | } | durdqY|j| }|durrd| _n4|jjrzd| _n,|j| jkrd| _n"| js|jrd| _n| jr| jjr| jjrt d | j!qYd| _nqY| j}|r|j"rd j#| j!| j||j$pd d }t%|| &| qY| j'}|jj()|| S) N)r- constraintsr$r(user_requestedZPIP_RESOLVER_DEBUGi)Z max_roundsz,ResolutionImpossible[Requirement, Candidate])r5FTz%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_requirementsrr7r$r(r8osenvironrr RLResolverresolve requirementsr.r Zget_installation_errorrrmappingvaluesZget_install_requirementZget_dist_to_uninstallshould_reinstallr'r: is_editableeditableZ source_linkis_fileis_wheelloggerinfor9 is_yankedformat yanked_reasonwarningadd_named_requirementall_requirementsr prepare_linked_requirements_more)r/r4r5Z collectedZproviderZreporterresolverZ try_to_avoid_resolution_too_deepresulteerrorreq_set candidateireqinstalled_distr;msgreqsr2r2r3r@Fs        zResolver.resolverVcCs^|jdus Jd|jj}t|t|jjdd}t|jtj t |ddd}dd |DS) aGet 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)keyreversecSsg|]\}}|qSr2r2).0_rXr2r2r3 sz3Resolver.get_installation_order..) r.graphget_topological_weightslenrBsortedrAitems functoolspartial_req_set_item_sorter)r/rVrcr]Z sorted_itemsr2r2r3get_installation_orders zResolver.get_installation_order)N)__name__ __module__ __qualname__r,rrrrrboolstrrintr+rrrr@rk __classcell__r2r2r0r3r #sL      ^r rczDirectedGraph[Optional[str]]r\r6csVtidttddffdd dddks!Jt|ks)JS)aAssign 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. noder6NcsZ|vrdS||D]}|q||d}t|t|<dS)Nr)addZ iter_childrenremovegetmaxre)rschildZlast_known_parent_countrcpathvisitr]r2r3r{s    z&get_topological_weights..visitr)setrrpre)rcr\r2ryr3rds rditemr]cCst|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. rr )r}r]r9r2r2r3rjs rj)5rhloggingr=typingrrrrrrrpip._vendor.packaging.utilsr Zpip._vendor.resolvelibr r r r?Zpip._vendor.resolvelib.structsrpip._internal.cacher"pip._internal.index.package_finderr pip._internal.operations.preparerZpip._internal.req.req_installrZpip._internal.req.req_setrpip._internal.resolution.baserrZ,pip._internal.resolution.resolvelib.providerrZ,pip._internal.resolution.resolvelib.reporterrrbaserrr-rZ pip._vendor.resolvelib.resolversrZRLResultrp getLoggerrlrIrqrdrjr2r2r2r3sL$              .