Viewing File: /opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pyo

ó
“tÆ_c@sÊddlZddlZddlmZddlmZddlmZmZddlm	Z
ddlmZddl
mZddlmZdd	lmZdd
lmZddlmZddlmZd
dlmZd
dlmZerddlmZmZm Z m!Z!m"Z"ddl#m$Z$ddl%m&Z&ddl'm(Z(ddl)m*Z*ddl+m,Z,ddl
m-Z-ddlm.Z.nej/e0ƒZ1defd„ƒYZ	d„Z2d„Z3dS(iÿÿÿÿN(tsix(tcanonicalize_name(tBaseReportertResolutionImpossible(tResolver(tInstallationError(tcheck_invalid_constraint_type(tRequirementSet(tBaseResolver(tPipProvider(tdist_is_editable(tMYPY_CHECK_RUNNINGi(t
Constraint(tFactory(tDicttListtOptionaltSettTuple(tResult(tGraph(t
WheelCache(t
PackageFinder(tRequirementPreparer(tInstallRequirement(tInstallRequirementProviderRcBs8eZdddhZded„Zd„Zd„ZRS(teagersonly-if-neededsto-satisfy-onlyc

Cstt|ƒjƒ|r)tjdƒntd|d|d|d|d|d|	d|d	|d
|d|ƒ
|_||_|
|_d|_
dS(NsÊpip is using lazily downloaded wheels using HTTP range requests to obtain dependency information. This experimental feature is enabled through --use-feature=fast-deps and it is not ready for production.tfindertpreparertmake_install_reqtwheel_cachet
use_user_sitetforce_reinstalltignore_installedtignore_requires_pythontpy_version_infot
lazy_wheel(tsuperRt__init__tloggertwarningR
tfactorytignore_dependenciestupgrade_strategytNonet_result(
tselfRRRRRR*R!R"R R+R#R$((s]/opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pyR&'s$
		cCsái}tƒ}g}xí|D]å}|jr¢t|ƒ}|rLt|ƒ‚n|jƒs^qnt|jƒ}||krŒ||c|M<qtj|ƒ||<q|j	rÍ|jrÍ|j
t|jƒƒn|jj|ddƒ}	|	dk	r|j|	ƒqqWtd|jd|d|jd|jd|ƒ}
tƒ}t|
|ƒ}y"d}
|j|d|
ƒ|_Wn5tk
r¦}|jj|ƒ}tj||ƒnXtd	|ƒ}x$|jjjƒD]}|jƒ}|dkríqÉn|jj|ƒ}|dkrt|_ nZ|jj!r/t"|_ nB|j#|j$krMt"|_ n$t%|ƒ|j&krÉt"|_ nqÉ|j'}|rÌ|j(rÌd
j)d|jd|j$d
|d|j*p¶dƒ}t+j,|ƒn|j-|ƒqÉW|S(Ntrequested_extrasR)tconstraintsR*R+tuser_requestedi€„t
max_roundstcheck_supported_wheelsu–The candidate selected for download or install is a yanked version: {name!r} candidate (version {version} at {link})
Reason for being yanked: {reason}tnametversiontlinktreasonu<none given>((.tsett
constraintRRt
match_markersRR4Rt	from_ireqt
user_suppliedtaddR)t!make_requirement_from_install_reqR,tappendR	R*R+Rt
RLResolvertresolveR-Rtget_installation_errorRt
raise_fromRtmappingtvaluestget_install_requirementtget_dist_to_uninstalltFalsetshould_reinstallR tTruetparsed_versionR5R
tis_editabletsource_linkt	is_yankedtformatt
yanked_reasonR'R(tadd_named_requirement(R.t	root_reqsR3R0R1trequirementstreqtproblemR4trtprovidertreportertresolvert try_to_avoid_resolution_too_deepteterrortreq_sett	candidatetireqtinstalled_distR6tmsg((s]/opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pyRAQsx	
							
				cCse|jj}t|ƒ}t|jjƒdtjtd|ƒdt	ƒ}g|D]\}}|^qOS(sGet 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.
        tkeytweightstreverse(
R-tgraphtget_topological_weightstsortedRStitemst	functoolstpartialt_req_set_item_sorterRJ(R.R]ReRctsorted_itemst_R_((s]/opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pytget_installation_order¯s	N(t__name__t
__module__t_allowed_strategiesR,RHR&RARn(((s]/opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pyR$s
	^cs5tƒ‰i‰‡‡‡‡fd†‰ˆdƒˆS(sŸAssign 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.
    cs}|ˆkrdSˆj|ƒx!ˆj|ƒD]}ˆ|ƒq-Wˆj|ƒˆj|dƒ}t|tˆƒƒˆ|<dS(Ni(R=t
iter_childrentremovetgettmaxtlen(tnodetchildtlast_known_parent_count(RetpathtvisitRc(s]/opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pyR{Þs

N(R8R,(Re((ReRzR{Rcs]/opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pyRfÉs
	
cCst|dƒ}|||fS(s)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.
    i(R(titemRcR4((s]/opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pyRk÷s(4Ritloggingtpip._vendorRtpip._vendor.packaging.utilsRtpip._vendor.resolvelibRRRR@tpip._internal.exceptionsRtpip._internal.req.req_installRtpip._internal.req.req_setRtpip._internal.resolution.baseRt,pip._internal.resolution.resolvelib.providerR	tpip._internal.utils.miscR
tpip._internal.utils.typingRtbaseRR)R
ttypingRRRRRt pip._vendor.resolvelib.resolversRtpip._vendor.resolvelib.structsRtpip._internal.cacheRt"pip._internal.index.package_finderRt pip._internal.operations.prepareRRRt	getLoggerRoR'RfRk(((s]/opt/alt/python35/lib/python3.5/site-packages/pip/_internal/resolution/resolvelib/resolver.pyt<module>s6(¥	.
Back to Directory File Manager