U cUh01@sddlZddlZddlZddlZddlmZmZmZmZm Z m Z m Z ddl m Z ddlmZmZddlmZddlmZddlmZddlmZdd lmZdd lmZdd lmZdd lm Z dd l!m"Z"m#Z#ddl$m%Z%ddl&m'Z'm(Z(ddl)m*Z*ddl+m,Z,m-Z-ddl.m/Z/er4ddl0m1Z2e2e-e,e3fZ1e4e5Z6Gddde"Zde e3eee3e7fdddZ8e e3efeee3e7fe e7e3fdddZ9dS)N) TYPE_CHECKINGDictListOptionalSetTuplecastcanonicalize_name) BaseReporterResolutionImpossible)Resolver) DirectedGraph) WheelCache) PackageFinder)RequirementPreparer)install_req_extend_extras)InstallRequirement)RequirementSet) BaseResolverInstallRequirementProvider) PipProvider)PipDebuggingReporter PipReporter)get_requirement) Candidate Requirement)Factory)Resultcs|eZdZdddhZdeeeeee e e e e e ee e dfd fdd Z eee ed d d Zeeed d dZZS)r eagerzonly-if-neededzto-satisfy-onlyN.) preparerfinder wheel_cachemake_install_req use_user_siteignore_dependenciesignore_installedignore_requires_pythonforce_reinstallupgrade_strategypy_version_infoc sJt| |jkstt|||||| ||| d |_||_| |_d|_dS)N) r"r!r$r#r%r)r'r(r+) super__init___allowed_strategiesAssertionErrorrfactoryr&r*_result) selfr!r"r#r$r%r&r'r(r)r*r+ __class__l/opt/bot/vods_filmes/script/venv/lib/python3.8/site-packages/pip/_internal/resolution/resolvelib/resolver.pyr-)s   zResolver.__init__) root_reqscheck_supported_wheelsreturnc Cs0|j|}t|j|j|j|j|jd}dtjkr:t }nt }t ||}zd}|j |j |d}|_Wn>tk r} z |jtd| |j} | | W5d} ~ XYnXt|d} t|jddd D]4} | } | dkr(| j| jkrtt*| | j}| t|t| jjW5QRXq|j | }|dkrFd | _!nr|jj"rXd | _!n`|j#| j#krnd | _!nJ| j$s~|j%rd | _!n2| j&r| j&j'r| j&j(rt)*d | jqd | _!nq| j&}|r|j+rd j,| j| j#||j-pdd}t).|| | q| j/}|jj01||D]}d |_2d |_3q| S)N)r0 constraintsr&r*user_requestedZPIP_RESOLVER_DEBUGi@ )Z max_roundsz,ResolutionImpossible[Requirement, Candidate])r8cSs |j|jkS)N)name project_name)cr5r5r6pz"Resolver.resolve..)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 )r<versionlinkreason)4r0Zcollect_root_requirementsrr:r&r*r;osenvironrr RLResolverresolve requirementsr1r Zget_installation_errorrrsortedmappingvaluesZget_install_requirementr<r= contextlibsuppressKeyErrorradd_named_requirementrextrasZget_dist_to_uninstallshould_reinstallr)rB is_editableeditableZ source_linkis_fileis_wheelloggerinfo is_yankedformat yanked_reasonwarningall_requirementsr! prepare_linked_requirements_morepreparedneeds_more_preparation)r2r7r8Z collectedproviderZreporterresolverZ#limit_how_complex_resolution_can_beresulteerrorreq_set candidateireqreqinstalled_distrCmsgreqsr5r5r6rHIs                 zResolver.resolve)rfr9cCsd|jdk std|jsgS|jj}t|t|j}t|jt j t |ddd}dd|DS)aZGet 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. Nzmust call resolve() first)weightsT)rAreversecSsg|] \}}|qSr5r5).0_rhr5r5r6 sz3Resolver.get_installation_order..) r1r/rIgraphget_topological_weightssetkeysrJitems functoolspartial_req_set_item_sorter)r2rfrrrmZ sorted_itemsr5r5r6get_installation_orders zResolver.get_installation_order)N)__name__ __module__ __qualname__r.rrrrrboolstrrintr-rrrrHrz __classcell__r5r5r3r6r &s, ! qr zDirectedGraph[Optional[str]])rrrequirement_keysr9cstittddfdd t}D],}|dkrBq4|D]}q4qL||q4|shqtd}|D]}|krqx||<qx|D]}|qq*dt}|rt |S)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 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. N)noder9csf|kr dS||D] }|q ||krDdS|d}t|t|<dS)Nr)add iter_childrenremovegetmaxlen)rchildZlast_known_parent_countrrpathrvisitrmr5r6rs    z&get_topological_weights..visitr) rtrrrrrrru differencer/)rrrleavesrAZ_childZweightZleafrr5rr6rss.     rs)itemrmr9cCst|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 )rrmr<r5r5r6ry2s ry):rMrwloggingrEtypingrrrrrrrZpip._vendor.packaging.utilsr Zpip._vendor.resolvelibr r r rGZpip._vendor.resolvelib.structsrpip._internal.cacher"pip._internal.index.package_finderr pip._internal.operations.preparerpip._internal.req.constructorsrZpip._internal.req.req_installrZpip._internal.req.req_setrpip._internal.resolution.baserrZ,pip._internal.resolution.resolvelib.providerrZ,pip._internal.resolution.resolvelib.reporterrrpip._internal.utils.packagingrbaserrr0rZ pip._vendor.resolvelib.resolversrZRLResultr getLoggerr{rWrrsryr5r5r5r6sD$              5 Z