+ fj6^RIHt^RIt^RIt^RIt^RIt^RIHtHt^RI H t ^RI H t H t Ht^RI Ht^RIHt^RIHt^R IHt^R IHt^R IHt^R IHt^R IHt^RIH t ^RI!H"t"H#t#^RI$H%t%^RI&H't'H(t(^RI)H*t*^RI+H,t,H-t-^RI.H/t/]'d^RI0H1t2]2]-],]33,t1]Ph!]54t6!RR]"4tRRlt7RRlt8R#)) annotationsN) TYPE_CHECKINGcastcanonicalize_name) BaseReporterResolutionImpossibleResolutionTooDeep)Resolver) DirectedGraph) WheelCache)ResolutionTooDeepError) PackageFinder)RequirementPreparer)install_req_extend_extras)InstallRequirement)RequirementSet) BaseResolverInstallRequirementProvider) PipProvider)PipDebuggingReporter PipReporter)get_requirement) Candidate Requirement)Factory)ResultcRa]tRt^)t0RmtR RV3RllltRRltRRltRtV;t #) r cHV^8dQhRRRRRRRRR R R R R R R R RR RR RRRR/ #)preparerrfinderr wheel_cachezWheelCache | Nonemake_install_reqr use_user_siteboolignore_dependenciesonly_dependenciesignore_installedignore_requires_pythonforce_reinstallupgrade_strategystrpy_version_infoztuple[int, ...] | None)formats"g/var/www/html/bestweb/venv/lib/python3.14/site-packages/pip/_internal/resolution/resolvelib/resolver.py __annotate__Resolver.__annotate__,s!+!+%!+!+' !+ 5 !+  !+"!+ !+!+!%!+!+!+0!+c  <\S V`4WP9gQhV'd V'dQh\VVVVVV VV V R7 VnW`nWpnWnRVnR#)) r"r!r$r#r%r+r)r*r.N) super__init___allowed_strategiesrfactoryr'r(r,_result)selfr!r"r#r$r%r'r(r)r*r+r,r. __class__s&&&&&&&&&&&&&r1r7Resolver.__init__,sp #;#;;;;',=>>-#'+-#9+   $7 !2 0&* r4c$V^8dQhRRRRRR/#)r root_reqslist[InstallRequirement]check_supported_wheelsr&returnrr/)r0s"r1r2r3Os)rr1rKOr rr4c  6VPPV4p\VPVPVPVP VP VPR7pR\P9d \4pM\VPR7p\VV4pRpVPVPVR7;qn\+TR7p \-TP.P14RR 7EFNp T P34p T fT P4T P68wd\8P:!\<4;_uu_4T P?T P64pT PA\CT\?T P44PD44RRR4KTPPGT 4pTf R T n$MTPPJ'd R T n$MTPLT PL8wd R T n$MT PN'gTPP'd R T n$MxT PR'ddT PRPT'dHT PRPV'd$\XP[R T P44EKR T n$MEKT PRpT'deTP\'dSR P_T P4T PLTTP`;'gRR7p\XPcT4T PAT 4EKQ TP 'dHTPF7pTPeR4^,pT PPgTR4K9 T # \ d8p TPP#\%RT 4TP4p YhRp ? i\&d \(Rhi;i +'giELd;i))r9 constraintsr'r(r,user_requestedPIP_RESOLVER_DEBUG)rDi@ ) max_roundsz,ResolutionImpossible[Requirement, Candidate]N)rAc4VPVP8g#N)name project_name)cs&r1"Resolver.resolve..zs166Q^^3Kr4)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 )rJversionlinkreason[)4r9collect_root_requirementsrrDr'r(r,rEosenvironrr RLResolverresolve requirementsr:r get_installation_errorrr rrsortedmappingvaluesget_install_requirementrJrK contextlibsuppressKeyErrorradd_named_requirementrextrasget_dist_to_uninstallshould_reinstallr+rP is_editableeditable source_linkis_fileis_wheelloggerinfo is_yankedr0 yanked_reasonwarning partitionpop)r;r?rA collectedproviderreporterresolver#limit_how_complex_resolution_can_beresulteerrorreq_set candidateireqreqinstalled_distrQmsg requestedrKs&&& r1rXResolver.resolveOsnLL::9E LL!-- $ 8 8"44!22$33   2:: -BVBXH"x/C/CDH>Y%;%;;#,,X66%55i6L6LM555 #_Y^^%D%K%K7"\\?? JN%(-%---(,%''9+<+<<(,%&&&.*A*A*A)-%&&&9+@+@+H+H+H((111KK5  )-%((DD&"%----??  s#  ) )$ /C F  ! ! !&55 (2237: $$((t<6m$ LL77CQG%%E   3(d 2 3766s+,%N1AP1 P<2O.. P; P P c V^8dQhRRRR/#)r rzrrBr@r/)r0s"r1r2r3s22%2 !2r4c VPfQR4hVP'g.#VPPp\V\ VPP 444p\ VPP4\P!\VR7RR7pVUUu.uFwrVVNK upp#uuppi)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)rOreverse) r:rYgraphget_topological_weightssetkeysr[items functoolspartial_req_set_item_sorter)r;rzrr sorted_items_r|s&& r1get_installation_orderResolver.get_installation_orders||'D)DD'###I "")%W5I5I5N5N5P1QR  & & (!!"6H %11LL111s2 C)r:r9r'r(r,>eageronly-if-neededto-satisfy-onlyrI) __name__ __module__ __qualname____firstlineno__r8r7rXr__static_attributes__ __classcell__)r<s@r1r r )s%H!+!+Frh22r4r c$V^8dQhRRRRRR/#)r rzDirectedGraph[str | None]requirement_keyszset[str]rBdict[str | None, int]r/)r0s"r1r2r2s.dAdA $dA8@dAdAr4cJaaa a a \4o /o RVV VV V 3Rllo \4pSF3pVfK SPV4FpK VPV4K5 V'gMF\S4^, pVFpVS9dK V.S V&K VFpSP V4K KS !R4\S P 44P S4pV'dQV4hS P4UU u/uFwrV\V 4bK up p#uup pi)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. c V^8dQhRRRR/#)r nodez str | NonerBNoner/)r0s"r1r2-get_topological_weights..__annotate__s$$J$4$r4c6<VS9dR#SPV.4p\V4^8dR#SPV4SPV4F pS!V4K SP V4VS9dR#VP \S44VSV&R#rI)getlenadd iter_childrenremoveappend)r cur_weightschildrpathrvisitrs& r1r&get_topological_weights..visits 4< kk$+ { q  ((.E %L/ D ' ' 3t9%# r4N) rrrrrr differencermax) rrleavesrO_childweightleafrrwgtsrrrs ff @@@r1rrs 8 ED+-G$$B C{--c23  3 UaD++#HGDM D LL   $KW\\^$//0@AJ%:%>18  @ D#d)O @@ @sDc$V^8dQhRRRRRR/#)r itemztuple[str, InstallRequirement]rrrBztuple[int, str]r/)r0s"r1r2r2Js&   (  "  r4c:\V^,4pW,V3#)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. r)rrrJs&& r1rrJs T!W %D =$ r4)9 __future__rr_rloggingrUtypingrrpip._vendor.packaging.utilsrpip._vendor.resolvelibrr r r rWpip._vendor.resolvelib.structsr pip._internal.cacher pip._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.packagingrbaserrr9r pip._vendor.resolvelib.resolversrRLResultr- getLoggerrrkrrr/r4r1rs" &9XX98*;<@D<4RD:(C k9c1 2F   8 $w2|w2tdAN r4