q"h1SSKrSSKrSSKrSSKrSSKJrJrJrJrJ r J r J r SSK J r SSKJrJrJr SSKJr SSKJr SSKJr SSKJr SS KJr SS KJr SS KJr SS K J!r! SS K"J#r# SSK$J%r%J&r& SSK'J(r( SSK)J*r*J+r+ SSK,J-r- SSK.J/r/J0r0 SSK1J2r2 \(aSSK3J4r5 \5\0\/\64r4\Rn"\85r9"SS\%5rSSS\ \6S\\\6\:44Sjr;S\ \6\!4S\\\6\:4S\ \:\644Sjreageronly-if-neededto-satisfy-onlypreparerfinder wheel_cachemake_install_req use_user_siteignore_dependenciesignore_installedignore_requires_pythonforce_reinstallupgrade_strategypy_version_info.c >[T U]5 XR;de[UUUUUU UUU S9 UlX`lXlSUlg)N) r)r(r+r*r,r0r.r/r2)super__init___allowed_strategiesr!factoryr-r1_result) selfr(r)r*r+r,r-r.r/r0r1r2 __class__s ^/var/www/html/env/lib/python3.13/site-packages/pip/_internal/resolution/resolvelib/resolver.pyr5Resolver.__init__*s^ #;#;;;;-#'+-#9+   $7 0)- root_reqscheck_supported_wheelsreturnc URRU5n[URURURUR UR S9nS[R;a [5nO [5n[UU5nSnURURUS9=ol[)US9n [+UR,R/5SS9GH6n U R15n U cU R2U R4:wav[6R8"[:5 U R=U R45nU R?[AU[=U R25RB55 SSS5 MURREU 5nUcS U l#OURRH(aS U l#OURJU RJ:waS U l#OU RL(dURN(aS U l#OuU RP(aaU RPRR(aFU RPRT(a#[VRYS U R25 GMS U l#OGMU RPnU(a_URZ(aNS R]U R2U RJUUR^=(d S S9n[VRaU5 U R?U 5 GM9 U RbnURRdRgU5 UHnS Ul4S Ul5M U $![a7n URR![#SU 5UR5n XeSn A f[$a [&Sef=f!,(df  GNA=f)N)r7 constraintsr-r1user_requestedPIP_RESOLVER_DEBUGi@ ) max_roundsz,ResolutionImpossible[Requirement, Candidate])r?c4URUR:g$N)name project_name)cs r;"Resolver.resolve..ss166Q^^3Kr=)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 )rHversionlinkreason)6r7collect_root_requirementsrrBr-r1rCosenvironrr RLResolverresolve requirementsr8r get_installation_errorr rrrsortedmappingvaluesget_install_requirementrHrI contextlibsuppressKeyErrorradd_named_requirementrextrasget_dist_to_uninstallshould_reinstallr0rN is_editableeditable source_linkis_fileis_wheelloggerinfo is_yankedformat yanked_reasonwarningall_requirementsr( prepare_linked_requirements_morepreparedneeds_more_preparation)r9r>r? collectedproviderreporterresolver#limit_how_complex_resolution_can_beresulteerrorreq_set candidateireqreqinstalled_distrOmsgreqss r;rUResolver.resolveJs/LL::9E LL!-- $ 8 8!22$33   2:: -BVBXH"}H>Y%;%;;#,,X6%55i6L6LM555 #_Y^^%D%K%K7"\\?? JN%(-%--(,%''9+<+<<(,%&&.*A*A)-%&&9+@+@+H+H((11KK5  )-%((DD&"%----?  s#  ) )$ /C F'' >>tDCCL).C &m$ LL77CQG%%E   3(d 2 376s%"M$*AN8$ N5.2N  N58 O rzcURcS5eUR(d/$URRn[U[ URR 555n[ URR5[R"[US9SS9nUVVs/sHupVUPM snn$s snnf)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, 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)rMreverse) r8rVgraphget_topological_weightssetkeysrXitems functoolspartial_req_set_item_sorter)r9rzrr sorted_items_r|s r;get_installation_orderResolver.get_installation_orders||'D)DD'##I "")%W5I5I5N5N5P1QR  & & (!!"6H %11LL111s*B<)r8r7r-r1rG)__name__ __module__ __qualname____firstlineno__r6rrrrrboolstrrintr5rrrrUr__static_attributes__ __classcell__)r:s@r;rr'sH6:.%..j) . 5 .  ."..!%..."%S/2..@p01pKOp pd2%2  !22r=rrzDirectedGraph[Optional[str]]requirement_keysr@c^^^^ ^ [5m0m S[[SS4UUUU U 4Sjjm [5nTH2nUcMTRU5Hn M UR U5 M4 U(dO@[ T5S- nUHnUT;aM UT U'M UHnTR U5 M MT "S5 [T R55RT5nU(aU5eT $)agAssign 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. noder@Nc>UT;agTRU5 TRU5H nT"U5 M TRU5 UT;agTRUS5n[ U[ T55TU'g)Nr)add iter_childrenremovegetmaxlen)rchildlast_known_parent_countrpathrvisitrs r;r&get_topological_weights..visitst 4<  ((.E %L/ D ' ' ")++dA"63SY? r=r) rrrrrrrr difference) rrleavesrM_childweightleafrrrrs `` @@@r;rrs8 #uD(*G@HSM@d@@, C{--c23  3 UaD++"GDM D LL + 4 $KW\\^$//0@AJ%:%> Nr=itemrc*[US5nXU4$)aKey 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 )rrrHs r;rr5s T!W %D =$ r=)=r\rloggingrRtypingrrrrrrr pip._vendor.packaging.utilsr pip._vendor.resolvelibr r rrrTpip._vendor.resolvelib.structsrpip._internal.cacherpip._internal.exceptionsr"pip._internal.index.package_finderr pip._internal.operations.preparerpip._internal.req.constructorsrpip._internal.req.req_installrpip._internal.req.req_setrpip._internal.resolution.baserr,pip._internal.resolution.resolvelib.providerr,pip._internal.resolution.resolvelib.reporterrrpip._internal.utils.packagingrbaserr r7r! pip._vendor.resolvelib.resolversr"RLResultr getLoggerrrhrrrr=r;rs HHH9XX98*;<@D<4RD:(C k9c1 2F   8 $r2|r2jV )V=@XV (3- Vr  '' (  (3-$ %  38_ r=