File manager - Edit - /home/newsbmcs.com/public_html/static/img/logo/resolvelib.tar
Back
requirements.py 0000644 00000012517 15030161315 0007642 0 ustar 00 from pip._vendor.packaging.specifiers import SpecifierSet from pip._vendor.packaging.utils import NormalizedName, canonicalize_name from pip._internal.req.req_install import InstallRequirement from .base import Candidate, CandidateLookup, Requirement, format_name class ExplicitRequirement(Requirement): def __init__(self, candidate: Candidate) -> None: self.candidate = candidate def __str__(self) -> str: return str(self.candidate) def __repr__(self) -> str: return "{class_name}({candidate!r})".format( class_name=self.__class__.__name__, candidate=self.candidate, ) @property def project_name(self) -> NormalizedName: # No need to canonicalize - the candidate did this return self.candidate.project_name @property def name(self) -> str: # No need to canonicalize - the candidate did this return self.candidate.name def format_for_error(self) -> str: return self.candidate.format_for_error() def get_candidate_lookup(self) -> CandidateLookup: return self.candidate, None def is_satisfied_by(self, candidate: Candidate) -> bool: return candidate == self.candidate class SpecifierRequirement(Requirement): def __init__(self, ireq: InstallRequirement) -> None: assert ireq.link is None, "This is a link, not a specifier" self._ireq = ireq self._extras = frozenset(ireq.extras) def __str__(self) -> str: return str(self._ireq.req) def __repr__(self) -> str: return "{class_name}({requirement!r})".format( class_name=self.__class__.__name__, requirement=str(self._ireq.req), ) @property def project_name(self) -> NormalizedName: assert self._ireq.req, "Specifier-backed ireq is always PEP 508" return canonicalize_name(self._ireq.req.name) @property def name(self) -> str: return format_name(self.project_name, self._extras) def format_for_error(self) -> str: # Convert comma-separated specifiers into "A, B, ..., F and G" # This makes the specifier a bit more "human readable", without # risking a change in meaning. (Hopefully! Not all edge cases have # been checked) parts = [s.strip() for s in str(self).split(",")] if len(parts) == 0: return "" elif len(parts) == 1: return parts[0] return ", ".join(parts[:-1]) + " and " + parts[-1] def get_candidate_lookup(self) -> CandidateLookup: return None, self._ireq def is_satisfied_by(self, candidate: Candidate) -> bool: assert candidate.name == self.name, ( f"Internal issue: Candidate is not for this requirement " f"{candidate.name} vs {self.name}" ) # We can safely always allow prereleases here since PackageFinder # already implements the prerelease logic, and would have filtered out # prerelease candidates if the user does not expect them. assert self._ireq.req, "Specifier-backed ireq is always PEP 508" spec = self._ireq.req.specifier return spec.contains(candidate.version, prereleases=True) class RequiresPythonRequirement(Requirement): """A requirement representing Requires-Python metadata.""" def __init__(self, specifier: SpecifierSet, match: Candidate) -> None: self.specifier = specifier self._candidate = match def __str__(self) -> str: return f"Python {self.specifier}" def __repr__(self) -> str: return "{class_name}({specifier!r})".format( class_name=self.__class__.__name__, specifier=str(self.specifier), ) @property def project_name(self) -> NormalizedName: return self._candidate.project_name @property def name(self) -> str: return self._candidate.name def format_for_error(self) -> str: return str(self) def get_candidate_lookup(self) -> CandidateLookup: if self.specifier.contains(self._candidate.version, prereleases=True): return self._candidate, None return None, None def is_satisfied_by(self, candidate: Candidate) -> bool: assert candidate.name == self._candidate.name, "Not Python candidate" # We can safely always allow prereleases here since PackageFinder # already implements the prerelease logic, and would have filtered out # prerelease candidates if the user does not expect them. return self.specifier.contains(candidate.version, prereleases=True) class UnsatisfiableRequirement(Requirement): """A requirement that cannot be satisfied.""" def __init__(self, name: NormalizedName) -> None: self._name = name def __str__(self) -> str: return f"{self._name} (unavailable)" def __repr__(self) -> str: return "{class_name}({name!r})".format( class_name=self.__class__.__name__, name=str(self._name), ) @property def project_name(self) -> NormalizedName: return self._name @property def name(self) -> str: return self._name def format_for_error(self) -> str: return str(self) def get_candidate_lookup(self) -> CandidateLookup: return None, None def is_satisfied_by(self, candidate: Candidate) -> bool: return False base.py 0000644 00000012144 15030161315 0006025 0 ustar 00 from typing import FrozenSet, Iterable, Optional, Tuple, Union from pip._vendor.packaging.specifiers import SpecifierSet from pip._vendor.packaging.utils import NormalizedName, canonicalize_name from pip._vendor.packaging.version import LegacyVersion, Version from pip._internal.models.link import Link, links_equivalent from pip._internal.req.req_install import InstallRequirement from pip._internal.utils.hashes import Hashes CandidateLookup = Tuple[Optional["Candidate"], Optional[InstallRequirement]] CandidateVersion = Union[LegacyVersion, Version] def format_name(project: str, extras: FrozenSet[str]) -> str: if not extras: return project canonical_extras = sorted(canonicalize_name(e) for e in extras) return "{}[{}]".format(project, ",".join(canonical_extras)) class Constraint: def __init__( self, specifier: SpecifierSet, hashes: Hashes, links: FrozenSet[Link] ) -> None: self.specifier = specifier self.hashes = hashes self.links = links @classmethod def empty(cls) -> "Constraint": return Constraint(SpecifierSet(), Hashes(), frozenset()) @classmethod def from_ireq(cls, ireq: InstallRequirement) -> "Constraint": links = frozenset([ireq.link]) if ireq.link else frozenset() return Constraint(ireq.specifier, ireq.hashes(trust_internet=False), links) def __bool__(self) -> bool: return bool(self.specifier) or bool(self.hashes) or bool(self.links) def __and__(self, other: InstallRequirement) -> "Constraint": if not isinstance(other, InstallRequirement): return NotImplemented specifier = self.specifier & other.specifier hashes = self.hashes & other.hashes(trust_internet=False) links = self.links if other.link: links = links.union([other.link]) return Constraint(specifier, hashes, links) def is_satisfied_by(self, candidate: "Candidate") -> bool: # Reject if there are any mismatched URL constraints on this package. if self.links and not all(_match_link(link, candidate) for link in self.links): return False # We can safely always allow prereleases here since PackageFinder # already implements the prerelease logic, and would have filtered out # prerelease candidates if the user does not expect them. return self.specifier.contains(candidate.version, prereleases=True) class Requirement: @property def project_name(self) -> NormalizedName: """The "project name" of a requirement. This is different from ``name`` if this requirement contains extras, in which case ``name`` would contain the ``[...]`` part, while this refers to the name of the project. """ raise NotImplementedError("Subclass should override") @property def name(self) -> str: """The name identifying this requirement in the resolver. This is different from ``project_name`` if this requirement contains extras, where ``project_name`` would not contain the ``[...]`` part. """ raise NotImplementedError("Subclass should override") def is_satisfied_by(self, candidate: "Candidate") -> bool: return False def get_candidate_lookup(self) -> CandidateLookup: raise NotImplementedError("Subclass should override") def format_for_error(self) -> str: raise NotImplementedError("Subclass should override") def _match_link(link: Link, candidate: "Candidate") -> bool: if candidate.source_link: return links_equivalent(link, candidate.source_link) return False class Candidate: @property def project_name(self) -> NormalizedName: """The "project name" of the candidate. This is different from ``name`` if this candidate contains extras, in which case ``name`` would contain the ``[...]`` part, while this refers to the name of the project. """ raise NotImplementedError("Override in subclass") @property def name(self) -> str: """The name identifying this candidate in the resolver. This is different from ``project_name`` if this candidate contains extras, where ``project_name`` would not contain the ``[...]`` part. """ raise NotImplementedError("Override in subclass") @property def version(self) -> CandidateVersion: raise NotImplementedError("Override in subclass") @property def is_installed(self) -> bool: raise NotImplementedError("Override in subclass") @property def is_editable(self) -> bool: raise NotImplementedError("Override in subclass") @property def source_link(self) -> Optional[Link]: raise NotImplementedError("Override in subclass") def iter_dependencies(self, with_requires: bool) -> Iterable[Optional[Requirement]]: raise NotImplementedError("Override in subclass") def get_install_requirement(self) -> Optional[InstallRequirement]: raise NotImplementedError("Override in subclass") def format_for_error(self) -> str: raise NotImplementedError("Subclass should override") factory.py 0000644 00000067212 15030161315 0006570 0 ustar 00 import contextlib import functools import logging from typing import ( TYPE_CHECKING, Dict, FrozenSet, Iterable, Iterator, List, Mapping, NamedTuple, Optional, Sequence, Set, Tuple, TypeVar, cast, ) from pip._vendor.packaging.requirements import InvalidRequirement from pip._vendor.packaging.specifiers import SpecifierSet from pip._vendor.packaging.utils import NormalizedName, canonicalize_name from pip._vendor.resolvelib import ResolutionImpossible from pip._internal.cache import CacheEntry, WheelCache from pip._internal.exceptions import ( DistributionNotFound, InstallationError, InstallationSubprocessError, MetadataInconsistent, UnsupportedPythonVersion, UnsupportedWheel, ) from pip._internal.index.package_finder import PackageFinder from pip._internal.metadata import BaseDistribution, get_default_environment from pip._internal.models.link import Link from pip._internal.models.wheel import Wheel from pip._internal.operations.prepare import RequirementPreparer from pip._internal.req.constructors import install_req_from_link_and_ireq from pip._internal.req.req_install import ( InstallRequirement, check_invalid_constraint_type, ) from pip._internal.resolution.base import InstallRequirementProvider from pip._internal.utils.compatibility_tags import get_supported from pip._internal.utils.hashes import Hashes from pip._internal.utils.packaging import get_requirement from pip._internal.utils.virtualenv import running_under_virtualenv from .base import Candidate, CandidateVersion, Constraint, Requirement from .candidates import ( AlreadyInstalledCandidate, BaseCandidate, EditableCandidate, ExtrasCandidate, LinkCandidate, RequiresPythonCandidate, as_base_candidate, ) from .found_candidates import FoundCandidates, IndexCandidateInfo from .requirements import ( ExplicitRequirement, RequiresPythonRequirement, SpecifierRequirement, UnsatisfiableRequirement, ) if TYPE_CHECKING: from typing import Protocol class ConflictCause(Protocol): requirement: RequiresPythonRequirement parent: Candidate logger = logging.getLogger(__name__) C = TypeVar("C") Cache = Dict[Link, C] class CollectedRootRequirements(NamedTuple): requirements: List[Requirement] constraints: Dict[str, Constraint] user_requested: Dict[str, int] class Factory: def __init__( self, finder: PackageFinder, preparer: RequirementPreparer, make_install_req: InstallRequirementProvider, wheel_cache: Optional[WheelCache], use_user_site: bool, force_reinstall: bool, ignore_installed: bool, ignore_requires_python: bool, suppress_build_failures: bool, py_version_info: Optional[Tuple[int, ...]] = None, ) -> None: self._finder = finder self.preparer = preparer self._wheel_cache = wheel_cache self._python_candidate = RequiresPythonCandidate(py_version_info) self._make_install_req_from_spec = make_install_req self._use_user_site = use_user_site self._force_reinstall = force_reinstall self._ignore_requires_python = ignore_requires_python self._suppress_build_failures = suppress_build_failures self._build_failures: Cache[InstallationError] = {} self._link_candidate_cache: Cache[LinkCandidate] = {} self._editable_candidate_cache: Cache[EditableCandidate] = {} self._installed_candidate_cache: Dict[str, AlreadyInstalledCandidate] = {} self._extras_candidate_cache: Dict[ Tuple[int, FrozenSet[str]], ExtrasCandidate ] = {} if not ignore_installed: env = get_default_environment() self._installed_dists = { dist.canonical_name: dist for dist in env.iter_installed_distributions(local_only=False) } else: self._installed_dists = {} @property def force_reinstall(self) -> bool: return self._force_reinstall def _fail_if_link_is_unsupported_wheel(self, link: Link) -> None: if not link.is_wheel: return wheel = Wheel(link.filename) if wheel.supported(self._finder.target_python.get_tags()): return msg = f"{link.filename} is not a supported wheel on this platform." raise UnsupportedWheel(msg) def _make_extras_candidate( self, base: BaseCandidate, extras: FrozenSet[str] ) -> ExtrasCandidate: cache_key = (id(base), extras) try: candidate = self._extras_candidate_cache[cache_key] except KeyError: candidate = ExtrasCandidate(base, extras) self._extras_candidate_cache[cache_key] = candidate return candidate def _make_candidate_from_dist( self, dist: BaseDistribution, extras: FrozenSet[str], template: InstallRequirement, ) -> Candidate: try: base = self._installed_candidate_cache[dist.canonical_name] except KeyError: base = AlreadyInstalledCandidate(dist, template, factory=self) self._installed_candidate_cache[dist.canonical_name] = base if not extras: return base return self._make_extras_candidate(base, extras) def _make_candidate_from_link( self, link: Link, extras: FrozenSet[str], template: InstallRequirement, name: Optional[NormalizedName], version: Optional[CandidateVersion], ) -> Optional[Candidate]: # TODO: Check already installed candidate, and use it if the link and # editable flag match. if link in self._build_failures: # We already tried this candidate before, and it does not build. # Don't bother trying again. return None if template.editable: if link not in self._editable_candidate_cache: try: self._editable_candidate_cache[link] = EditableCandidate( link, template, factory=self, name=name, version=version, ) except MetadataInconsistent as e: logger.info( "Discarding [blue underline]%s[/]: [yellow]%s[reset]", link, e, extra={"markup": True}, ) self._build_failures[link] = e return None except InstallationSubprocessError as e: if not self._suppress_build_failures: raise logger.warning("Discarding %s due to build failure: %s", link, e) self._build_failures[link] = e return None base: BaseCandidate = self._editable_candidate_cache[link] else: if link not in self._link_candidate_cache: try: self._link_candidate_cache[link] = LinkCandidate( link, template, factory=self, name=name, version=version, ) except MetadataInconsistent as e: logger.info( "Discarding [blue underline]%s[/]: [yellow]%s[reset]", link, e, extra={"markup": True}, ) self._build_failures[link] = e return None except InstallationSubprocessError as e: if not self._suppress_build_failures: raise logger.warning("Discarding %s due to build failure: %s", link, e) self._build_failures[link] = e return None base = self._link_candidate_cache[link] if not extras: return base return self._make_extras_candidate(base, extras) def _iter_found_candidates( self, ireqs: Sequence[InstallRequirement], specifier: SpecifierSet, hashes: Hashes, prefers_installed: bool, incompatible_ids: Set[int], ) -> Iterable[Candidate]: if not ireqs: return () # The InstallRequirement implementation requires us to give it a # "template". Here we just choose the first requirement to represent # all of them. # Hopefully the Project model can correct this mismatch in the future. template = ireqs[0] assert template.req, "Candidates found on index must be PEP 508" name = canonicalize_name(template.req.name) extras: FrozenSet[str] = frozenset() for ireq in ireqs: assert ireq.req, "Candidates found on index must be PEP 508" specifier &= ireq.req.specifier hashes &= ireq.hashes(trust_internet=False) extras |= frozenset(ireq.extras) def _get_installed_candidate() -> Optional[Candidate]: """Get the candidate for the currently-installed version.""" # If --force-reinstall is set, we want the version from the index # instead, so we "pretend" there is nothing installed. if self._force_reinstall: return None try: installed_dist = self._installed_dists[name] except KeyError: return None # Don't use the installed distribution if its version does not fit # the current dependency graph. if not specifier.contains(installed_dist.version, prereleases=True): return None candidate = self._make_candidate_from_dist( dist=installed_dist, extras=extras, template=template, ) # The candidate is a known incompatibility. Don't use it. if id(candidate) in incompatible_ids: return None return candidate def iter_index_candidate_infos() -> Iterator[IndexCandidateInfo]: result = self._finder.find_best_candidate( project_name=name, specifier=specifier, hashes=hashes, ) icans = list(result.iter_applicable()) # PEP 592: Yanked releases are ignored unless the specifier # explicitly pins a version (via '==' or '===') that can be # solely satisfied by a yanked release. all_yanked = all(ican.link.is_yanked for ican in icans) def is_pinned(specifier: SpecifierSet) -> bool: for sp in specifier: if sp.operator == "===": return True if sp.operator != "==": continue if sp.version.endswith(".*"): continue return True return False pinned = is_pinned(specifier) # PackageFinder returns earlier versions first, so we reverse. for ican in reversed(icans): if not (all_yanked and pinned) and ican.link.is_yanked: continue func = functools.partial( self._make_candidate_from_link, link=ican.link, extras=extras, template=template, name=name, version=ican.version, ) yield ican.version, func return FoundCandidates( iter_index_candidate_infos, _get_installed_candidate(), prefers_installed, incompatible_ids, ) def _iter_explicit_candidates_from_base( self, base_requirements: Iterable[Requirement], extras: FrozenSet[str], ) -> Iterator[Candidate]: """Produce explicit candidates from the base given an extra-ed package. :param base_requirements: Requirements known to the resolver. The requirements are guaranteed to not have extras. :param extras: The extras to inject into the explicit requirements' candidates. """ for req in base_requirements: lookup_cand, _ = req.get_candidate_lookup() if lookup_cand is None: # Not explicit. continue # We've stripped extras from the identifier, and should always # get a BaseCandidate here, unless there's a bug elsewhere. base_cand = as_base_candidate(lookup_cand) assert base_cand is not None, "no extras here" yield self._make_extras_candidate(base_cand, extras) def _iter_candidates_from_constraints( self, identifier: str, constraint: Constraint, template: InstallRequirement, ) -> Iterator[Candidate]: """Produce explicit candidates from constraints. This creates "fake" InstallRequirement objects that are basically clones of what "should" be the template, but with original_link set to link. """ for link in constraint.links: self._fail_if_link_is_unsupported_wheel(link) candidate = self._make_candidate_from_link( link, extras=frozenset(), template=install_req_from_link_and_ireq(link, template), name=canonicalize_name(identifier), version=None, ) if candidate: yield candidate def find_candidates( self, identifier: str, requirements: Mapping[str, Iterable[Requirement]], incompatibilities: Mapping[str, Iterator[Candidate]], constraint: Constraint, prefers_installed: bool, ) -> Iterable[Candidate]: # Collect basic lookup information from the requirements. explicit_candidates: Set[Candidate] = set() ireqs: List[InstallRequirement] = [] for req in requirements[identifier]: cand, ireq = req.get_candidate_lookup() if cand is not None: explicit_candidates.add(cand) if ireq is not None: ireqs.append(ireq) # If the current identifier contains extras, add explicit candidates # from entries from extra-less identifier. with contextlib.suppress(InvalidRequirement): parsed_requirement = get_requirement(identifier) explicit_candidates.update( self._iter_explicit_candidates_from_base( requirements.get(parsed_requirement.name, ()), frozenset(parsed_requirement.extras), ), ) # Add explicit candidates from constraints. We only do this if there are # known ireqs, which represent requirements not already explicit. If # there are no ireqs, we're constraining already-explicit requirements, # which is handled later when we return the explicit candidates. if ireqs: try: explicit_candidates.update( self._iter_candidates_from_constraints( identifier, constraint, template=ireqs[0], ), ) except UnsupportedWheel: # If we're constrained to install a wheel incompatible with the # target architecture, no candidates will ever be valid. return () # Since we cache all the candidates, incompatibility identification # can be made quicker by comparing only the id() values. incompat_ids = {id(c) for c in incompatibilities.get(identifier, ())} # If none of the requirements want an explicit candidate, we can ask # the finder for candidates. if not explicit_candidates: return self._iter_found_candidates( ireqs, constraint.specifier, constraint.hashes, prefers_installed, incompat_ids, ) return ( c for c in explicit_candidates if id(c) not in incompat_ids and constraint.is_satisfied_by(c) and all(req.is_satisfied_by(c) for req in requirements[identifier]) ) def _make_requirement_from_install_req( self, ireq: InstallRequirement, requested_extras: Iterable[str] ) -> Optional[Requirement]: if not ireq.match_markers(requested_extras): logger.info( "Ignoring %s: markers '%s' don't match your environment", ireq.name, ireq.markers, ) return None if not ireq.link: return SpecifierRequirement(ireq) self._fail_if_link_is_unsupported_wheel(ireq.link) cand = self._make_candidate_from_link( ireq.link, extras=frozenset(ireq.extras), template=ireq, name=canonicalize_name(ireq.name) if ireq.name else None, version=None, ) if cand is None: # There's no way we can satisfy a URL requirement if the underlying # candidate fails to build. An unnamed URL must be user-supplied, so # we fail eagerly. If the URL is named, an unsatisfiable requirement # can make the resolver do the right thing, either backtrack (and # maybe find some other requirement that's buildable) or raise a # ResolutionImpossible eventually. if not ireq.name: raise self._build_failures[ireq.link] return UnsatisfiableRequirement(canonicalize_name(ireq.name)) return self.make_requirement_from_candidate(cand) def collect_root_requirements( self, root_ireqs: List[InstallRequirement] ) -> CollectedRootRequirements: collected = CollectedRootRequirements([], {}, {}) for i, ireq in enumerate(root_ireqs): if ireq.constraint: # Ensure we only accept valid constraints problem = check_invalid_constraint_type(ireq) if problem: raise InstallationError(problem) if not ireq.match_markers(): continue assert ireq.name, "Constraint must be named" name = canonicalize_name(ireq.name) if name in collected.constraints: collected.constraints[name] &= ireq else: collected.constraints[name] = Constraint.from_ireq(ireq) else: req = self._make_requirement_from_install_req( ireq, requested_extras=(), ) if req is None: continue if ireq.user_supplied and req.name not in collected.user_requested: collected.user_requested[req.name] = i collected.requirements.append(req) return collected def make_requirement_from_candidate( self, candidate: Candidate ) -> ExplicitRequirement: return ExplicitRequirement(candidate) def make_requirement_from_spec( self, specifier: str, comes_from: Optional[InstallRequirement], requested_extras: Iterable[str] = (), ) -> Optional[Requirement]: ireq = self._make_install_req_from_spec(specifier, comes_from) return self._make_requirement_from_install_req(ireq, requested_extras) def make_requires_python_requirement( self, specifier: SpecifierSet, ) -> Optional[Requirement]: if self._ignore_requires_python: return None # Don't bother creating a dependency for an empty Requires-Python. if not str(specifier): return None return RequiresPythonRequirement(specifier, self._python_candidate) def get_wheel_cache_entry( self, link: Link, name: Optional[str] ) -> Optional[CacheEntry]: """Look up the link in the wheel cache. If ``preparer.require_hashes`` is True, don't use the wheel cache, because cached wheels, always built locally, have different hashes than the files downloaded from the index server and thus throw false hash mismatches. Furthermore, cached wheels at present have nondeterministic contents due to file modification times. """ if self._wheel_cache is None or self.preparer.require_hashes: return None return self._wheel_cache.get_cache_entry( link=link, package_name=name, supported_tags=get_supported(), ) def get_dist_to_uninstall(self, candidate: Candidate) -> Optional[BaseDistribution]: # TODO: Are there more cases this needs to return True? Editable? dist = self._installed_dists.get(candidate.project_name) if dist is None: # Not installed, no uninstallation required. return None # We're installing into global site. The current installation must # be uninstalled, no matter it's in global or user site, because the # user site installation has precedence over global. if not self._use_user_site: return dist # We're installing into user site. Remove the user site installation. if dist.in_usersite: return dist # We're installing into user site, but the installed incompatible # package is in global site. We can't uninstall that, and would let # the new user installation to "shadow" it. But shadowing won't work # in virtual environments, so we error out. if running_under_virtualenv() and dist.in_site_packages: message = ( f"Will not install to the user site because it will lack " f"sys.path precedence to {dist.raw_name} in {dist.location}" ) raise InstallationError(message) return None def _report_requires_python_error( self, causes: Sequence["ConflictCause"] ) -> UnsupportedPythonVersion: assert causes, "Requires-Python error reported with no cause" version = self._python_candidate.version if len(causes) == 1: specifier = str(causes[0].requirement.specifier) message = ( f"Package {causes[0].parent.name!r} requires a different " f"Python: {version} not in {specifier!r}" ) return UnsupportedPythonVersion(message) message = f"Packages require a different Python. {version} not in:" for cause in causes: package = cause.parent.format_for_error() specifier = str(cause.requirement.specifier) message += f"\n{specifier!r} (required by {package})" return UnsupportedPythonVersion(message) def _report_single_requirement_conflict( self, req: Requirement, parent: Optional[Candidate] ) -> DistributionNotFound: if parent is None: req_disp = str(req) else: req_disp = f"{req} (from {parent.name})" cands = self._finder.find_all_candidates(req.project_name) versions = [str(v) for v in sorted({c.version for c in cands})] logger.critical( "Could not find a version that satisfies the requirement %s " "(from versions: %s)", req_disp, ", ".join(versions) or "none", ) if str(req) == "requirements.txt": logger.info( "HINT: You are attempting to install a package literally " 'named "requirements.txt" (which cannot exist). Consider ' "using the '-r' flag to install the packages listed in " "requirements.txt" ) return DistributionNotFound(f"No matching distribution found for {req}") def get_installation_error( self, e: "ResolutionImpossible[Requirement, Candidate]", constraints: Dict[str, Constraint], ) -> InstallationError: assert e.causes, "Installation error reported with no cause" # If one of the things we can't solve is "we need Python X.Y", # that is what we report. requires_python_causes = [ cause for cause in e.causes if isinstance(cause.requirement, RequiresPythonRequirement) and not cause.requirement.is_satisfied_by(self._python_candidate) ] if requires_python_causes: # The comprehension above makes sure all Requirement instances are # RequiresPythonRequirement, so let's cast for convenience. return self._report_requires_python_error( cast("Sequence[ConflictCause]", requires_python_causes), ) # Otherwise, we have a set of causes which can't all be satisfied # at once. # The simplest case is when we have *one* cause that can't be # satisfied. We just report that case. if len(e.causes) == 1: req, parent = e.causes[0] if req.name not in constraints: return self._report_single_requirement_conflict(req, parent) # OK, we now have a list of requirements that can't all be # satisfied at once. # A couple of formatting helpers def text_join(parts: List[str]) -> str: if len(parts) == 1: return parts[0] return ", ".join(parts[:-1]) + " and " + parts[-1] def describe_trigger(parent: Candidate) -> str: ireq = parent.get_install_requirement() if not ireq or not ireq.comes_from: return f"{parent.name}=={parent.version}" if isinstance(ireq.comes_from, InstallRequirement): return str(ireq.comes_from.name) return str(ireq.comes_from) triggers = set() for req, parent in e.causes: if parent is None: # This is a root requirement, so we can report it directly trigger = req.format_for_error() else: trigger = describe_trigger(parent) triggers.add(trigger) if triggers: info = text_join(sorted(triggers)) else: info = "the requested packages" msg = ( "Cannot install {} because these package versions " "have conflicting dependencies.".format(info) ) logger.critical(msg) msg = "\nThe conflict is caused by:" relevant_constraints = set() for req, parent in e.causes: if req.name in constraints: relevant_constraints.add(req.name) msg = msg + "\n " if parent: msg = msg + f"{parent.name} {parent.version} depends on " else: msg = msg + "The user requested " msg = msg + req.format_for_error() for key in relevant_constraints: spec = constraints[key].specifier msg += f"\n The user requested (constraint) {key}{spec}" msg = ( msg + "\n\n" + "To fix this you could try to:\n" + "1. loosen the range of package versions you've specified\n" + "2. remove package versions to allow pip attempt to solve " + "the dependency conflict\n" ) logger.info(msg) return DistributionNotFound( "ResolutionImpossible: for help visit " "https://pip.pypa.io/en/latest/topics/dependency-resolution/" "#dealing-with-dependency-conflicts" ) __pycache__/found_candidates.cpython-310.pyc 0000644 00000011337 15030161315 0014747 0 ustar 00 o �7]hI � @ s� d Z ddlZddlmZ ddlmZmZmZmZm Z m Z m Z ddl m Z ddlmZ e e eg e e f f Zer=ee ZneZdee d ee fd d �Zd edee d ee fd d�Zd edee d ee fdd�ZG dd� de�ZdS )a� Utilities to lazily create and visit candidates found. Creating and visiting a candidate is a *very* costly operation. It involves fetching, extracting, potentially building modules from source, and verifying distribution metadata. It is therefore crucial for performance to keep everything here lazy all the way down, so we only touch candidates that we absolutely need, and not "download the world" when we only need one version of something. � N)�Sequence)� TYPE_CHECKING�Any�Callable�Iterator�Optional�Set�Tuple)� _BaseVersion� )� Candidate�infos�returnc c sD � t � }| D ]\}}||v rq|� }|du rq|V |�|� qdS )z�Iterator for ``FoundCandidates``. This iterator is used when the package is not already installed. Candidates from index come later in their normal ordering. N)�set�add)r �versions_found�version�func� candidate� r �V/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/found_candidates.py� _iter_built% s � �r � installedc c sL � | V | j h}|D ]\}}||v rq |� }|du rq |V |�|� q dS )aK Iterator for ``FoundCandidates``. This iterator is used when the resolver prefers the already-installed candidate and NOT to upgrade. The installed candidate is therefore always yielded first, and candidates from index come later in their normal ordering, except skipped when the version is already installed. N)r r �r r r r r r r r r �_iter_built_with_prepended6 s � �r c c st � t � }|D ]'\}}||v rq| j|kr | V |�| j� |� }|du r%q|V |�|� q| j|vr8| V dS dS )a� Iterator for ``FoundCandidates``. This iterator is used when the resolver prefers to upgrade an already-installed package. Candidates from index are returned in their normal ordering, except replaced when the version is already installed. The implementation iterates through and yields other candidates, inserting the installed candidate exactly once before we start yielding older or equivalent candidates, or after all other candidates if they are all newer. N)r r r r r r r �_iter_built_with_insertedL s � �r c @ s� e Zd ZdZdeg ee f dee de de e fdd�Z de d e fd d �Zd ee fd d �Zd e fdd�Zejdd�d e fdd��ZdS )�FoundCandidatesac A lazy sequence to provide candidates to the resolver. The intended usage is to return this from `find_matches()` so the resolver can iterate through the sequence multiple times, but only access the index page when remote packages are actually needed. This improve performances when suitable candidates are already installed on disk. � get_infosr �prefers_installed�incompatible_idsc C s || _ || _|| _|| _d S �N)� _get_infos� _installed�_prefers_installed�_incompatible_ids)�selfr r r r r r r �__init__u s zFoundCandidates.__init__�indexr c C � t d���Nz don't do this��NotImplementedError)r% r' r r r � __getitem__� � zFoundCandidates.__getitem__c sJ � � � }� js t|�}n� jrt� j|�}nt� j|�}� fdd�|D �S )Nc 3 s" � | ] }t |�� jvr|V qd S r )�idr$ )�.0�c�r% r r � <genexpr>� s � z+FoundCandidates.__iter__.<locals>.<genexpr>)r! r" r r# r r )r% r �iteratorr r1 r �__iter__� s zFoundCandidates.__iter__c C r( r) r* r1 r r r �__len__� r- zFoundCandidates.__len__r )�maxsizec C s | j r| jrdS t| �S )NT)r# r" �anyr1 r r r �__bool__� s zFoundCandidates.__bool__N)�__name__� __module__� __qualname__�__doc__r r �IndexCandidateInfor r �boolr �intr& r r, r4 r5 � functools� lru_cacher8 r r r r r l s ��� � r )r< r@ �collections.abcr �typingr r r r r r r � pip._vendor.packaging.versionr �baser r= �SequenceCandidater r r r r r r r �<module> s4 $ �� ��� � __pycache__/candidates.cpython-310.pyc 0000644 00000043621 15030161315 0013555 0 ustar 00 o �7]h�G � @ s� d dl Z d dlZd dlmZmZmZmZmZmZm Z m Z d dl m Z m Z d dlmZ d dlmZmZmZ d dlmZ d dlmZmZ d dlmZ d d lm Z m Z d d l m Z d d l m!Z! d d l"m#Z#m$Z$m%Z%m&Z& erpd dl'm(Z( e �)e*�Z+e d Z,e e d�Z-de#dee, fdd�Z.dede de fdd�Z/dede de fdd�Z0dede de fd d �Z1G d d � d e#�Z2G d d!� d!e2�Z3G d"d#� d#e2�Z4G d$d%� d%e#�Z5G d&d'� d'e#�Z6G d(d)� d)e#�Z7dS )*� N)� TYPE_CHECKING�Any� FrozenSet�Iterable�Optional�Tuple�Union�cast)�NormalizedName�canonicalize_name)�Version)� HashError�InstallationSubprocessError�MetadataInconsistent)�BaseDistribution)�Link�links_equivalent)�Wheel)�install_req_from_editable�install_req_from_line)�InstallRequirement)�normalize_version_info� )� Candidate�CandidateVersion� Requirement� format_name)�Factory)�AlreadyInstalledCandidate�EditableCandidate� LinkCandidatez <Python from Requires-Python>� candidate�returnc C s t ttf}t| |�r | S dS )z%The runtime version of BaseCandidate.N)r r r � isinstance)r! �base_candidate_classes� r% �P/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/candidates.py�as_base_candidate( s � r' �link�templatec C sh |j rJ d��|jrt|j�}n| j}t||j|j|j|j|j t |j |j |j d�d�}|j|_| |_|S )Nztemplate is editable��install_options�global_options�hashes�� user_supplied� comes_from� use_pep517�isolated� constraint�options)�editable�req�str�urlr r/ r0 r1 r2 r3 �dictr+ r, � hash_options� original_linkr( )r( r) �line�ireqr% r% r& �make_install_req_from_link4 s( �� r> c C sD |j sJ d��t| j|j|j|j|j|j|jt |j |j |j d�d�S )Nztemplate not editabler* )r/ r0 r1 r2 r3 �permit_editable_wheelsr4 ) r5 r r8 r/ r0 r1 r2 r3 r? r9 r+ r, r: )r( r) r% r% r& � make_install_req_from_editableN s ��r@ �distc C sz |j r t|j �}n|jr| j� d|jj� �}n | j� d| j� �}t||j|j|j |j |j t |j |j|jd�d�}| |_|S )Nz @ z==r* r. )r6 r7 r( �canonical_namer8 �versionr r/ r0 r1 r2 r3 r9 r+ r, r: � satisfied_by)rA r) r< r= r% r% r& �_make_install_req_from_distb s( �� rE c @ sB e Zd ZU dZeed< dZ d-dedededd d e e d e e d dfd d�Z d e fdd�Zd e fdd�Zd efdd�Zded efdd�Zed e e fdd��Zed e fdd��Zed e fd d ��Zed e fd d ��Zd e fd d!�Zd efd"d#�Zded dfd$d%�Z d efd&d'�Z d(ed e e e fd)d*�Z d e e fd+d,�Z!dS ).�"_InstallRequirementBackedCandidatea� A candidate backed by an ``InstallRequirement``. This represents a package request with the target not being already in the environment, and needs to be fetched and installed. The backing ``InstallRequirement`` is responsible for most of the leg work; this class exposes appropriate information to the resolver. :param link: The link passed to the ``InstallRequirement``. The backing ``InstallRequirement`` will use this link to fetch the distribution. :param source_link: The link this candidate "originates" from. This is different from ``link`` when the link is found in the wheel cache. ``link`` would point to the wheel cache, while this points to the found remote link (e.g. from pypi.org). rA FNr( � source_linkr= �factoryr �namerC r" c C s2 || _ || _|| _|| _|| _|| _| �� | _d S �N)�_link� _source_link�_factory�_ireq�_name�_version�_preparerA )�selfr( rG r= rH rI rC r% r% r& �__init__� s z+_InstallRequirementBackedCandidate.__init__c C s | j � d| j� �S )N� �rI rC �rR r% r% r& �__str__� s z*_InstallRequirementBackedCandidate.__str__c C s dj | jjt| j�d�S )Nz{class_name}({link!r}))� class_namer( )�format� __class__�__name__r7 rK rV r% r% r& �__repr__� s �z+_InstallRequirementBackedCandidate.__repr__c C � t | j| jf�S rJ )�hashrZ rK rV r% r% r& �__hash__� � z+_InstallRequirementBackedCandidate.__hash__�otherc C s t || j�r t| j|j�S dS �NF)r# rZ r rK �rR ra r% r% r& �__eq__� s z)_InstallRequirementBackedCandidate.__eq__c C � | j S rJ )rL rV r% r% r& rG � � z._InstallRequirementBackedCandidate.source_linkc C s | j du r | jj| _ | j S )�:The normalised name of the project the candidate refers toN)rO rA rB rV r% r% r& � project_name� s z/_InstallRequirementBackedCandidate.project_namec C re rJ �rh rV r% r% r& rI � rf z'_InstallRequirementBackedCandidate.namec C s | j d u r | jj| _ | j S rJ )rP rA rC rV r% r% r& rC � s z*_InstallRequirementBackedCandidate.versionc C s& d� | j| j| jjr| jj�S | j�S )Nz{} {} (from {}))rY rI rC rK �is_file� file_pathrV r% r% r& �format_for_error� s ��z3_InstallRequirementBackedCandidate.format_for_errorc C s t d��)NzOverride in subclass)�NotImplementedErrorrV r% r% r& �_prepare_distribution� s z8_InstallRequirementBackedCandidate._prepare_distributionc C sd | j dur| j |jkrt| jd| j |j��| jdur.| j|jkr0t| jdt| j�t|j���dS dS )z:Check for consistency of project name and version of dist.NrI rC )rO rB r rN rP rC r7 )rR rA r% r% r& �_check_metadata_consistency� s ���z>_InstallRequirementBackedCandidate._check_metadata_consistencyc C s\ z| � � }W n ty } z| j|_� d }~w ty& } zd|_� d }~ww | �|� |S )NzSee above for output.)rn r rN r6 r �contextro )rR rA �e�excr% r% r& rQ � s ��� z+_InstallRequirementBackedCandidate._prepare� with_requiresc c sJ � |r| j �� nd}|D ] }| j�t|�| j�V q | j�| j j�V d S �Nr% )rA �iter_dependenciesrM �make_requirement_from_specr7 rN � make_requires_python_requirement�requires_python)rR rs �requires�rr% r% r& ru � s �z4_InstallRequirementBackedCandidate.iter_dependenciesc C re rJ )rN rV r% r% r& �get_install_requirement� s z:_InstallRequirementBackedCandidate.get_install_requirement�NN)"r[ � __module__� __qualname__�__doc__r �__annotations__� is_installedr r r r r rS r7 rW r\ �intr_ r �boolrd �propertyrG rh rI rC rl rn ro rQ r r ru r{ r% r% r% r& rF | sN ������� �rF c �V e Zd ZdZ ddededddee dee d df � fd d � Z d e fd d �Z � Z S )r FNr( r) rH r rI rC r" c s� |}|� ||�}|d urt�d|j� |j}t||�}|j|ks"J �|jjrY|jjsYt|jj�} t | j �} || ksCJ |�d| �d���|d urYt | j �} || ksYJ d� || |���|d uri|jri|j|ju rid|_t� j||||||d� d S )NzUsing cached wheel link: %sz != z for wheelz{!r} != {!r} for wheel {}T�r( rG r= rH rI rC )�get_wheel_cache_entry�logger�debugr( r> �is_wheelrj r �filenamer rI r rC rY � persistentr; � original_link_is_in_wheel_cache�superrS ) rR r( r) rH rI rC rG � cache_entryr= �wheel� wheel_name� wheel_version�rZ r% r& rS � s: �� �zLinkCandidate.__init__c C s | j j}|j| jdd�S )NT)�parallel_builds)rM �preparer�prepare_linked_requirementrN )rR r� r% r% r& rn ) s z#LinkCandidate._prepare_distributionr| � r[ r} r~ � is_editabler r r r r rS r rn � __classcell__r% r% r� r& r � s$ �������*r c r� )r TNr( r) rH r rI rC r" c s" t � j||t||�|||d� d S )Nr� )r� rS r@ )rR r( r) rH rI rC r� r% r& rS 1 s �zEditableCandidate.__init__c C s | j j�| j�S rJ )rM r� � prepare_editable_requirementrN rV r% r% r& rn B r` z'EditableCandidate._prepare_distributionr| r� r% r% r� r& r . s$ �������r c @ s� e Zd ZdZdZdededdddfdd �Zdefd d �Z defd d �Z de fdd�Z de defdd�Zedefdd��Zedefdd��Zedefdd��Zedefdd��Zdefdd �Zd edeee fd d �Zdee fd d!�Z dS )"r TNrA r) rH r r" c C s0 || _ t||�| _|| _d}|j�| j|� d S )Nzalready satisfied)rA rE rN rM r� � prepare_installed_requirement)rR rA r) rH � skip_reasonr% r% r& rS J s z"AlreadyInstalledCandidate.__init__c C s t | j�S rJ )r7 rA rV r% r% r& rW [ s z!AlreadyInstalledCandidate.__str__c C s dj | jj| jd�S )Nz {class_name}({distribution!r}))rX � distribution)rY rZ r[ rA rV r% r% r& r\ ^ s �z"AlreadyInstalledCandidate.__repr__c C s t | j| j| jf�S rJ )r^ rZ rI rC rV r% r% r& r_ d � z"AlreadyInstalledCandidate.__hash__ra c C �( t || j�r| j|jko| j|jkS dS rb )r# rZ rI rC rc r% r% r& rd g � z AlreadyInstalledCandidate.__eq__c C � | j jS rJ )rA rB rV r% r% r& rh l � z&AlreadyInstalledCandidate.project_namec C re rJ ri rV r% r% r& rI p rf z AlreadyInstalledCandidate.namec C r� rJ )rA rC rV r% r% r& rC t r� z!AlreadyInstalledCandidate.versionc C r� rJ )rA r5 rV r% r% r& r� x r� z%AlreadyInstalledCandidate.is_editablec C s | j � d| j� d�S )NrT z (Installed)rU rV r% r% r& rl | r� z*AlreadyInstalledCandidate.format_for_errorrs c c s4 � |sd S | j �� D ] }| j�t|�| j�V q d S rJ )rA ru rM rv r7 rN )rR rs rz r% r% r& ru s ��z+AlreadyInstalledCandidate.iter_dependenciesc C � d S rJ r% rV r% r% r& r{ � � z1AlreadyInstalledCandidate.get_install_requirement) r[ r} r~ r� rG r r rS r7 rW r\ r� r_ r r� rd r� r rh rI r rC r� rl r r r ru r{ r% r% r% r& r F s6 ��� �r c @ s e Zd ZdZdedee ddfdd�Zdefdd �Zdefd d �Z de fd d �Z de de fdd�Zedefdd��Zedefdd��Zedefdd��Zdefdd�Zede fdd��Zede fdd ��Zedee fd d ��Zd e deee fd d!�Z dee fd"d#�Z dS )$�ExtrasCandidatea� A candidate that has 'extras', indicating additional dependencies. Requirements can be for a project with dependencies, something like foo[extra]. The extras don't affect the project/version being installed directly, but indicate that we need additional dependencies. We model that by having an artificial ExtrasCandidate that wraps the "base" candidate. The ExtrasCandidate differs from the base in the following ways: 1. It has a unique name, of the form foo[extra]. This causes the resolver to treat it as a separate node in the dependency graph. 2. When we're getting the candidate's dependencies, a) We specify that we want the extra dependencies as well. b) We add a dependency on the base candidate. See below for why this is needed. 3. We return None for the underlying InstallRequirement, as the base candidate will provide it, and we don't want to end up with duplicates. The dependency on the base candidate is needed so that the resolver can't decide that it should recommend foo[extra1] version 1.0 and foo[extra2] version 2.0. Having those candidates depend on foo=1.0 and foo=2.0 respectively forces the resolver to recognise that this is a conflict. �base�extrasr" Nc C s || _ || _d S rJ )r� r� )rR r� r� r% r% r& rS � s zExtrasCandidate.__init__c C s, t | j��dd�\}}d�|d�| j�|�S )NrT r z {}[{}] {}�,)r7 r� �splitrY �joinr� )rR rI �restr% r% r& rW � s zExtrasCandidate.__str__c C s dj | jj| j| jd�S )Nz.{class_name}(base={base!r}, extras={extras!r}))rX r� r� )rY rZ r[ r� r� rV r% r% r& r\ � s �zExtrasCandidate.__repr__c C r] rJ )r^ r� r� rV r% r% r& r_ � r` zExtrasCandidate.__hash__ra c C r� rb )r# rZ r� r� rc r% r% r& rd � r� zExtrasCandidate.__eq__c C r� rJ )r� rh rV r% r% r& rh � r� z ExtrasCandidate.project_namec C s t | jj| j�S )rg )r r� rh r� rV r% r% r& rI � s zExtrasCandidate.namec C r� rJ )r� rC rV r% r% r& rC � r� zExtrasCandidate.versionc C s d� | j�� d�t| j���S )Nz{} [{}]z, )rY r� rl r� �sortedr� rV r% r% r& rl � s �z ExtrasCandidate.format_for_errorc C r� rJ )r� r� rV r% r% r& r� � r� z ExtrasCandidate.is_installedc C r� rJ )r� r� rV r% r% r& r� � r� zExtrasCandidate.is_editablec C r� rJ )r� rG rV r% r% r& rG � r� zExtrasCandidate.source_linkrs c c s� � | j j}|�| j �V |sd S | j�| j j�� �}| j�| j j�� �}t|�D ] }t � d| j j | j |� q(| j j� |�D ]}|�t|�| j j|�}|rO|V q=d S )Nz%%s %s does not provide the extra '%s')r� rM � make_requirement_from_candidater� � intersectionrA �iter_provided_extras� differencer� r� �warningrI rC ru rv r7 rN )rR rs rH � valid_extras�invalid_extras�extrarz � requirementr% r% r& ru � s, � ����z!ExtrasCandidate.iter_dependenciesc C r� rJ r% rV r% r% r& r{ � s z'ExtrasCandidate.get_install_requirement) r[ r} r~ r � BaseCandidater r7 rS rW r\ r� r_ r r� rd r� r rh rI r rC rl r� r� r r rG r r ru r r{ r% r% r% r& r� � s8 �� � r� c @ s� e Zd ZdZdZdeeedf ddfdd�Zde fdd �Z e de fd d ��Z e de fd d ��Ze defdd��Zde fdd�Zdedeee fdd�Zdee fdd�ZdS )�RequiresPythonCandidateFN�py_version_info.r" c C s> |d ur t |�}ntjd d� }td�dd� |D ���| _d S )N� �.c s s � | ]}t |�V qd S rJ )r7 )�.0�cr% r% r& � <genexpr> s � z3RequiresPythonCandidate.__init__.<locals>.<genexpr>)r �sys� version_infor r� rP )rR r� r� r% r% r& rS s z RequiresPythonCandidate.__init__c C � d| j � �S �NzPython �rP rV r% r% r& rW � z RequiresPythonCandidate.__str__c C � t S rJ ��REQUIRES_PYTHON_IDENTIFIERrV r% r% r& rh � z$RequiresPythonCandidate.project_namec C r� rJ r� rV r% r% r& rI r� z RequiresPythonCandidate.namec C re rJ r� rV r% r% r& rC rf z RequiresPythonCandidate.versionc C r� r� )rC rV r% r% r& rl r� z(RequiresPythonCandidate.format_for_errorrs c C s dS rt r% )rR rs r% r% r& ru r� z)RequiresPythonCandidate.iter_dependenciesc C r� rJ r% rV r% r% r& r{ " r� z/RequiresPythonCandidate.get_install_requirement)r[ r} r~ r� rG r r r� rS r7 rW r� r rh rI r rC rl r� r r ru r r{ r% r% r% r& r� � s r� )8�loggingr� �typingr r r r r r r r �pip._vendor.packaging.utilsr r � pip._vendor.packaging.versionr �pip._internal.exceptionsr r r �pip._internal.metadatar �pip._internal.models.linkr r �pip._internal.models.wheelr � pip._internal.req.constructorsr r � pip._internal.req.req_installr �pip._internal.utils.miscr r� r r r r rH r � getLoggerr[ r� r� r� r' r> r@ rE rF r r r r� r� r% r% r% r& �<module> sb ( � �� ��� ��� � 2Cu __pycache__/__init__.cpython-310.pyc 0000644 00000000253 15030161315 0013207 0 ustar 00 o �7]h � @ s d S )N� r r r �N/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/__init__.py�<module> s __pycache__/reporter.cpython-310.pyc 0000644 00000006104 15030161315 0013313 0 ustar 00 o �7]h� � @ sp d dl mZ d dlmZ d dlmZmZ d dlmZ ddl m Z m Z ee �Z G dd� de�ZG d d � d e�Zd S ) � )� defaultdict)� getLogger)�Any� DefaultDict)� BaseReporter� )� Candidate� Requirementc @ s( e Zd Zddd�Zdeddfdd�ZdS ) � PipReporter�returnNc C s t t�| _dddd�| _d S )Nz�pip is looking at multiple versions of {package_name} to determine which version is compatible with other requirements. This could take a while.z�This is taking longer than usual. You might need to provide the dependency resolver with stricter constraints to reduce runtime. See https://pip.pypa.io/warnings/backtracking for guidance. If you want to abort this run, press Ctrl + C.)r � � )r �int�backtracks_by_package�_messages_at_backtrack��self� r �N/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/reporter.py�__init__ s �zPipReporter.__init__� candidatec C sR | j |j d7 < | j |j }|| jvrd S | j| }t�d|j|jd�� d S )Nr zINFO: %s)� package_name)r �namer �logger�info�format)r r �count�messager r r � backtracking# s zPipReporter.backtracking�r N)�__name__� __module__� __qualname__r r r r r r r r s r c @ s� e Zd ZdZddd�Zdeddfdd�Zded eddfd d �Zd eddfd d �Z de de ddfdd�Z de ddfdd�Z de ddfdd�ZdS )�PipDebuggingReporterz9A reporter that does an info log for every event it sees.r Nc C s t �d� d S )NzReporter.starting()�r r r r r r �starting1 s z PipDebuggingReporter.starting�indexc C � t �d|� d S )NzReporter.starting_round(%r)r$ )r r& r r r �starting_round4 � z#PipDebuggingReporter.starting_round�statec C r' )Nz Reporter.ending_round(%r, state)r$ )r r& r* r r r � ending_round7 r) z!PipDebuggingReporter.ending_roundc C r' )NzReporter.ending(%r)r$ )r r* r r r �ending: r) zPipDebuggingReporter.ending� requirement�parentc C s t �d||� d S )Nz#Reporter.adding_requirement(%r, %r)r$ )r r- r. r r r �adding_requirement= s z'PipDebuggingReporter.adding_requirementr c C r' )NzReporter.backtracking(%r)r$ �r r r r r r @ r) z!PipDebuggingReporter.backtrackingc C r' )NzReporter.pinning(%r)r$ r0 r r r �pinningC r) z PipDebuggingReporter.pinningr )r r! r" �__doc__r% r r( r r+ r, r r r/ r r1 r r r r r# . s r# N)� collectionsr �loggingr �typingr r � pip._vendor.resolvelib.reportersr �baser r r r r r# r r r r �<module> s " __pycache__/provider.cpython-310.pyc 0000644 00000016771 15030161315 0013316 0 ustar 00 o �7]h�& � @ s� d dl Z d dlZd dlmZmZmZmZmZmZm Z m Z d dl m Z ddl mZmZmZ ddlmZ ddlmZ erTd dl mZ d d lmZ eeef Ze eeef Zne Ze d �Ze d �Z d eee f d edede ee f fdd�Z G dd� de�Z dS )� N)� TYPE_CHECKING�Dict�Iterable�Iterator�Mapping�Sequence�TypeVar�Union)�AbstractProvider� )� Candidate� Constraint� Requirement)�REQUIRES_PYTHON_IDENTIFIER)�Factory)� Preference)�RequirementInformation�D�V�mapping� identifier�default�returnc C s8 || v r| | S |� d�\}}}|r|| v r| | S |S )ai Get item from a package name lookup mapping with a resolver identifier. This extra logic is needed when the target mapping is keyed by package name, which cannot be directly looked up with an identifier (which may contain requested extras). Additional logic is added to also look up a value by "cleaning up" the extras from the identifier. �[)� partition)r r r �name� open_bracket�_� r �N/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/provider.py�_get_with_identifier5 s r c @ s" e Zd ZdZdedeeef dededeee f ddf d d �Z d e e e f defd d �Zdedeee f deeee f deeed f ded ddf dd�Zdedeeee f deeee f dee fdd�Zde d e defd d �Zd e dee fd d �Zededed defd!d"��ZdS )#� PipProvidera� Pip's provider implementation for resolvelib. :params constraints: A mapping of constraints specified by the user. Keys are canonicalized project names. :params ignore_dependencies: Whether the user specified ``--no-deps``. :params upgrade_strategy: The user-specified upgrade strategy. :params user_requested: A set of canonicalized package names that the user supplied for pip to install/upgrade. �factory� constraints�ignore_dependencies�upgrade_strategy�user_requestedr Nc C s2 || _ || _|| _|| _|| _t�dd� �| _d S )Nc S s t jS �N)�math�infr r r r �<lambda>f s z&PipProvider.__init__.<locals>.<lambda>)�_factory� _constraints�_ignore_dependencies�_upgrade_strategy�_user_requested� collections� defaultdict� _known_depths)�selfr" r# r$ r% r& r r r �__init__Y s zPipProvider.__init__�requirement_or_candidatec C s |j S r' )r )r3 r5 r r r �identifyh s zPipProvider.identifyr � resolutions� candidates� information�PreferenceInformation�backtrack_causesr c s dd� || D �}t |� \}}dd� dd� |D �D �} |du} tdd� | D ��} t| �} z� j| } W n" tyU tj} � fdd�|| D �}td d� |D ��d }Y nw d }|� j|< � j� |tj�} |t k}|d k}� � ||�}| || | | || | |f S ) a[ Produce a sort key for given requirement based on preference. The lower the return value is, the more preferred this group of arguments is. Currently pip considers the followings in order: * Prefer if any of the known requirements is "direct", e.g. points to an explicit URL. * If equal, prefer if any requirement is "pinned", i.e. contains operator ``===`` or ``==``. * If equal, calculate an approximate "depth" and resolve requirements closer to the user-specified requirements first. * Order user-specified requirements by the order they are specified. * If equal, prefers "non-free" requirements, i.e. contains at least one operator, such as ``>=`` or ``<``. * If equal, order alphabetically for consistency (helps debuggability). c s s � | ] \}}|� � V qd S r' )�get_candidate_lookup)�.0�rr r r r � <genexpr>� s � z-PipProvider.get_preference.<locals>.<genexpr>c S s g | ] }|D ]}|j �qqS r )�operator)r= � specifier_set� specifierr r r � <listcomp>� s ���z.PipProvider.get_preference.<locals>.<listcomp>c s s � | ]}|r|j V qd S r' )rB )r= �ireqr r r r? � s � Nc s s � | ] }|d d� dkV qd S )N� z==r )r= �opr r r r? � s � c 3 s, � | ]\}}|d ur� j |j ndV qd S )Ng )r2 r )r= r �parent�r3 r r r? � s � � �c s s � | ]}|V qd S r' r )r= �dr r r r? � s � g �?� setuptools) �zip�any�boolr/ �KeyErrorr( r) �minr2 �getr �is_backtrack_cause)r3 r r7 r8 r9 r; �lookups� candidate�ireqs� operators�direct�pinned�unfree�requested_order� parent_depths�inferred_depth�requires_python� delay_this�backtrack_causer rH r �get_preferencek sB � �� �zPipProvider.get_preference� requirements�incompatibilitiesc sF dt dtf� fdd� }t� j|t�� d�}� jj|||||� |d�S )Nr r c s4 � j dkrdS � j dkrt� j| dd�}|duS dS )a� Are upgrades allowed for this project? This checks the upgrade strategy, and whether the project was one that the user specified in the command line, in order to decide whether we should upgrade if there's a newer version available. (Note that we don't need access to the `--upgrade` flag, because an upgrade strategy of "to-satisfy-only" means that `--upgrade` was not specified). �eagerTzonly-if-neededN�r F)r. r r/ )r � user_orderrH r r �_eligible_for_upgrade� s �z7PipProvider.find_matches.<locals>._eligible_for_upgraderc )r r` � constraint�prefers_installedra )�strrM r r, r �emptyr+ �find_candidates)r3 r r` ra re rf r rH r � find_matches� s ��zPipProvider.find_matches� requirementrS c C s |� |�S r' )�is_satisfied_by)r3 rl rS r r r rm � s zPipProvider.is_satisfied_byc C s | j }dd� |�|�D �S )Nc S s g | ]}|d ur|�qS r' r )r= r> r r r rC � s z0PipProvider.get_dependencies.<locals>.<listcomp>)r- �iter_dependencies)r3 rS � with_requiresr r r �get_dependencies� s z PipProvider.get_dependenciesc C s8 |D ]}| |j jkr dS |jr| |jjkr dS qdS )NTF)rl r rG )r r; r^ r r r rQ � s �z PipProvider.is_backtrack_cause)�__name__� __module__� __qualname__�__doc__r r rh r rM �intr4 r r r r6 r r r r r_ rk rm rp � staticmethodrQ r r r r r! N s` � ��� � �� ���� �T��� �)���r! ) r0 r( �typingr r r r r r r r � pip._vendor.resolvelib.providersr �baser r r r8 r r" r r � pip._vendor.resolvelib.resolversr r: rh � _ProviderBaser r r r! r r r r �<module> s2 ( ��� � __pycache__/resolver.cpython-310.pyc 0000644 00000017602 15030161315 0013317 0 ustar 00 o �7]hG, � @ s� d dl Z d dlZd dlZd dlmZmZmZmZmZm Z m Z d dl m Z d dl mZmZ d dl mZ d dlmZ d dlmZ d dlmZ d d lmZ d d lmZ d d l m Z d d l m Z m Z d d l!m"Z" d dl#m$Z$m%Z% ddl&m'Z'm(Z( ddl)m*Z* er�d dl+m,Z- e-e(e'e.f Z,e�/e0�Z1G dd� de �Zddde2deee. e2f fdd�Z3de e.ef d eee. e2f de e2e.f fd d �Z4dS ) � N)� TYPE_CHECKING�Dict�List�Optional�Set�Tuple�cast��canonicalize_name)� BaseReporter�ResolutionImpossible)�Resolver)� DirectedGraph)� WheelCache)� PackageFinder)�RequirementPreparer)�InstallRequirement)�RequirementSet)� BaseResolver�InstallRequirementProvider)� PipProvider)�PipDebuggingReporter� PipReporter� )� Candidate� Requirement)�Factory)�Resultc s� e Zd Zh d�Z ddededee dede de d e d e d e d e d e dee e df f� fdd� Z dee de defdd�Zdedee fdd�Z� ZS )r > �only-if-needed�to-satisfy-only�eagerN�preparer�finder� wheel_cache�make_install_req� use_user_site�ignore_dependencies�ignore_installed�ignore_requires_python�force_reinstall�upgrade_strategy�suppress_build_failures�py_version_info.c sL t � �� | | jv s J �t|||||| ||| | d� | _|| _| | _d | _d S )N) r" r! r$ r# r% r) r' r( r+ r, )�super�__init__�_allowed_strategiesr �factoryr& r* �_result) �selfr! r" r# r$ r% r& r' r( r) r* r+ r, �� __class__� �N/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/resolver.pyr. & s" � zResolver.__init__� root_reqs�check_supported_wheels�returnc C s� | j �|�}t| j |j| j| j|jd�}dtjv r t � }nt � }t ||�}zd}|j |j |d� }| _W n tyN } z| j �td| �|j�} | | �d } ~ ww t|d�} |j�� D ]m} | �� } | d u rdqY| j �| �}|d u rrd| _n4| j jrzd| _n,|j| jkr�d| _n"| js�|jr�d| _n| j r�| j j r�| j j r�t � d | j!� qYd| _nqY| j }|r�|j"r�d j#| j!| j||j$p�d d �}t �%|� | �&| � qY| j'}| j j(�)|� | S ) N)r0 � constraintsr& r* �user_requested�PIP_RESOLVER_DEBUGi�� )� max_roundsz,ResolutionImpossible[Requirement, Candidate])r8 FTz�%s is already installed with the same version as the provided wheel. Use --force-reinstall to force an installation of the wheel.z�The candidate selected for download or install is a yanked version: {name!r} candidate (version {version} at {link}) Reason for being yanked: {reason}z <none given>)�name�version�link�reason)*r0 �collect_root_requirementsr r: r& r* r; �os�environr r � RLResolver�resolve� requirementsr1 r �get_installation_errorr r �mapping�values�get_install_requirement�get_dist_to_uninstall�should_reinstallr) r? � is_editable�editable� source_link�is_file�is_wheel�logger�infor> � is_yanked�format� yanked_reason�warning�add_named_requirement�all_requirementsr! � prepare_linked_requirements_more)r2 r7 r8 � collected�provider�reporter�resolver� try_to_avoid_resolution_too_deep�result�e�error�req_set� candidate�ireq�installed_distr@ �msg�reqsr5 r5 r6 rF H s� � ����� � � zResolver.resolverd c C sh | j dus J d��|jsg S | j j}t|t| j j�d d�}t|j�� tj t |d�dd�}dd � |D �S ) aZ Get 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() firstr )�expected_node_count)�weightsT)�key�reversec S s g | ]\}}|�qS r5 r5 )�.0�_rf r5 r5 r6 � <listcomp>� s z3Resolver.get_installation_order.<locals>.<listcomp>) r1 rG �graph�get_topological_weights�lenrI �sorted�items� functools�partial�_req_set_item_sorter)r2 rd rq rk � sorted_itemsr5 r5 r6 �get_installation_order� s � �z Resolver.get_installation_order)N)�__name__� __module__� __qualname__r/ r r r r r �bool�strr �intr. r r r rF rz � __classcell__r5 r5 r3 r6 r # sP �������� � � � � �"�� �^��r rq z DirectedGraph[Optional[str]]rj r9 c s� t � �i �dtt ddf� ���fdd� � t � }� D ]}|du r"q� �|�D ]} n|�|� q|s4nt� �d }|D ]}|�|< q<|D ]}� �|� qEq�d� �d dksZJ �t��|ksbJ ��S ) aR 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 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. �noder9 Nc sZ | �v rd S �� | � � �| �D ]}�|� q��| � ��| d�}t|t����| < d S )Nr )�add� iter_children�remove�get�maxrs )r� �child�last_known_parent_count�rq �path�visitrk r5 r6 r� � s z&get_topological_weights.<locals>.visitTr r )�setr r r� r� rs r� )rq rj �leavesrl �_child�weight�leafr5 r� r6 rr � s0 � �rr �itemrk c C s t | 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. r r )r� rk r> r5 r5 r6 rx s rx )5rv �loggingrC �typingr r r r r r r �pip._vendor.packaging.utilsr �pip._vendor.resolvelibr r r rE � pip._vendor.resolvelib.structsr �pip._internal.cacher �"pip._internal.index.package_finderr � pip._internal.operations.preparer � pip._internal.req.req_installr �pip._internal.req.req_setr � pip._internal.resolution.baser r �,pip._internal.resolution.resolvelib.providerr �,pip._internal.resolution.resolvelib.reporterr r �baser r r0 r � pip._vendor.resolvelib.resolversr �RLResultr � getLoggerr{ rS r� rr rx r5 r5 r5 r6 �<module> sL $ '�� �P �� � __pycache__/requirements.cpython-310.pyc 0000644 00000016405 15030161315 0014201 0 ustar 00 o �7]hO � @ s� d dl mZ d dlmZmZ d dlmZ ddlmZm Z m Z m Z G dd� de �Z G dd � d e �Z G d d � d e �ZG d d � d e �ZdS )� )� SpecifierSet)�NormalizedName�canonicalize_name)�InstallRequirement� )� Candidate�CandidateLookup� Requirement� format_namec @ s� e Zd Zdeddfdd�Zdefdd�Zdefdd �Zede fd d ��Z edefd d ��Z defdd�Z de fdd�Zdedefdd�ZdS )�ExplicitRequirement� candidate�returnNc C � || _ d S �N�r ��selfr � r �R/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/requirements.py�__init__ � z ExplicitRequirement.__init__c C s t | j�S r )�strr �r r r r �__str__ r zExplicitRequirement.__str__c C s dj | jj| jd�S )Nz{class_name}({candidate!r}))� class_namer )�format� __class__�__name__r r r r r �__repr__ s �z ExplicitRequirement.__repr__c C � | j jS r )r � project_namer r r r r � z ExplicitRequirement.project_namec C r r )r �namer r r r r" r! zExplicitRequirement.namec C s | j �� S r )r �format_for_errorr r r r r# r z$ExplicitRequirement.format_for_errorc C s | j d fS r r r r r r �get_candidate_lookup# r z(ExplicitRequirement.get_candidate_lookupc C s || j kS r r r r r r �is_satisfied_by& r z#ExplicitRequirement.is_satisfied_by)r � __module__� __qualname__r r r r r �propertyr r r" r# r r$ �boolr% r r r r r s r c @ s� e Zd Zdeddfdd�Zdefdd�Zdefdd �Zede fd d ��Z edefd d ��Z defdd�Z de fdd�Zdedefdd�ZdS )�SpecifierRequirement�ireqr Nc C s( |j d u s J d��|| _t|j�| _d S )Nz This is a link, not a specifier)�link�_ireq� frozenset�extras�_extras)r r+ r r r r + s z SpecifierRequirement.__init__c C s t | jj�S r )r r- �reqr r r r r 0 � z SpecifierRequirement.__str__c C s dj | jjt| jj�d�S )Nz {class_name}({requirement!r}))r � requirement)r r r r r- r1 r r r r r 3 s �z SpecifierRequirement.__repr__c C s | j jsJ d��t| j jj�S )N�'Specifier-backed ireq is always PEP 508)r- r1 r r" r r r r r 9 s z!SpecifierRequirement.project_namec C s t | j| j�S r )r r r0 r r r r r" > s zSpecifierRequirement.namec C sZ dd� t | ��d�D �}t|�dkrdS t|�dkr |d S d�|d d� �d |d S ) Nc S s g | ]}|� � �qS r )�strip)�.0�sr r r � <listcomp>H s z9SpecifierRequirement.format_for_error.<locals>.<listcomp>�,r � r z, ���z and )r �split�len�join)r �partsr r r r# B s z%SpecifierRequirement.format_for_errorc C s d | j fS r )r- r r r r r$ P r z)SpecifierRequirement.get_candidate_lookupr c C sN |j | j ksJ d|j � d| j � ���| jjsJ d��| jjj}|j|jdd�S )Nz6Internal issue: Candidate is not for this requirement z vs r4 T�� prereleases)r" r- r1 � specifier�contains�version)r r �specr r r r% S s ��� z$SpecifierRequirement.is_satisfied_by)r r& r' r r r r r r( r r r" r# r r$ r r) r% r r r r r* * s r* c @ s� e Zd ZdZdededdfdd�Zdefdd �Zdefd d �Z e de fd d ��Z e defdd��Z defdd�Zdefdd�Zdedefdd�ZdS )�RequiresPythonRequirementz4A requirement representing Requires-Python metadata.rB �matchr Nc C s || _ || _d S r )rB � _candidate)r rB rG r r r r c s z"RequiresPythonRequirement.__init__c C s d| j � �S )NzPython )rB r r r r r g r2 z!RequiresPythonRequirement.__str__c C � dj | jjt| j�d�S )Nz{class_name}({specifier!r}))r rB )r r r r rB r r r r r j � �z"RequiresPythonRequirement.__repr__c C r r )rH r r r r r r p � z&RequiresPythonRequirement.project_namec C r r )rH r" r r r r r" t rK z RequiresPythonRequirement.namec C � t | �S r �r r r r r r# x � z*RequiresPythonRequirement.format_for_errorc C s" | j j| jjdd�r| jd fS dS )NTr@ �NN)rB rC rH rD r r r r r$ { s z.RequiresPythonRequirement.get_candidate_lookupr c C s( |j | jj ks J d��| jj|jdd�S )NzNot Python candidateTr@ )r" rH rB rC rD r r r r r% � s z)RequiresPythonRequirement.is_satisfied_by)r r& r' �__doc__r r r r r r r( r r r" r# r r$ r) r% r r r r rF ` s rF c @ s� e Zd ZdZdeddfdd�Zdefdd�Zdefd d �Ze defd d ��Z e defd d��Z defdd�Z de fdd�Zdedefdd�ZdS )�UnsatisfiableRequirementz'A requirement that cannot be satisfied.r" r Nc C r r ��_name)r r" r r r r � r z!UnsatisfiableRequirement.__init__c C s | j � d�S )Nz (unavailable)rR r r r r r � r2 z UnsatisfiableRequirement.__str__c C rI )Nz{class_name}({name!r}))r r" )r r r r rS r r r r r � rJ z!UnsatisfiableRequirement.__repr__c C � | j S r rR r r r r r � � z%UnsatisfiableRequirement.project_namec C rT r rR r r r r r" � rU z UnsatisfiableRequirement.namec C rL r rM r r r r r# � rN z)UnsatisfiableRequirement.format_for_errorc C � dS )NrO r r r r r r$ � � z-UnsatisfiableRequirement.get_candidate_lookupr c C rV )NFr r r r r r% � rW z(UnsatisfiableRequirement.is_satisfied_by)r r& r' rP r r r r r r( r r" r# r r$ r r) r% r r r r rQ � s rQ N)� pip._vendor.packaging.specifiersr �pip._vendor.packaging.utilsr r � pip._internal.req.req_installr �baser r r r r r* rF rQ r r r r �<module> s !6( __pycache__/base.cpython-310.pyc 0000644 00000014416 15030161315 0012370 0 ustar 00 o �7]hd � @ s� d dl mZmZmZmZmZ d dlmZ d dlm Z m Z d dl m Z m Z d dlmZmZ d dlmZ d dlmZ eed ee f Zee e f Zd ed ee d efd d �ZG dd� d�ZG dd� d�Zdeddd efdd�Z G dd� d�Z dS )� )� FrozenSet�Iterable�Optional�Tuple�Union)� SpecifierSet)�NormalizedName�canonicalize_name)� LegacyVersion�Version)�Link�links_equivalent)�InstallRequirement)�Hashes� Candidate�project�extras�returnc C s, |s| S t dd� |D ��}d�| d�|��S )Nc s s � | ]}t |�V qd S �N)r )�.0�e� r �J/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/base.py� <genexpr> s � z format_name.<locals>.<genexpr>z{}[{}]�,)�sorted�format�join)r r �canonical_extrasr r r � format_name s r c @ s� e Zd Zdededee ddfdd�Zeddd ��Z ed e dd fd d ��Z de fd d�Z de dd fdd�Zddde fdd�ZdS )� Constraint� specifier�hashes�linksr Nc C s || _ || _|| _d S r )r! r" r# )�selfr! r" r# r r r �__init__ s zConstraint.__init__c C s t t� t� t� �S r )r r r � frozenset)�clsr r r �empty s zConstraint.empty�ireqc C s. |j r t|j g�nt� }t|j|jdd�|�S �NF)�trust_internet)�linkr& r r! r" )r' r) r# r r r � from_ireq" s zConstraint.from_ireqc C s t | j�pt | j�pt | j�S r )�boolr! r" r# �r$ r r r �__bool__' s zConstraint.__bool__�otherc C sR t |t�stS | j|j@ }| j|jdd�@ }| j}|jr#|�|jg�}t|||�S r* ) � isinstancer �NotImplementedr! r" r# r, �unionr )r$ r1 r! r" r# r r r �__and__* s zConstraint.__and__� candidater c s4 | j rt� fdd�| j D ��sdS | jj� jdd�S )Nc 3 s � | ]}t |� �V qd S r )� _match_link)r r, �r6 r r r 6 s � z-Constraint.is_satisfied_by.<locals>.<genexpr>FT)� prereleases)r# �allr! �contains�version�r$ r6 r r8 r �is_satisfied_by4 s zConstraint.is_satisfied_by)r r )�__name__� __module__� __qualname__r r r r r% � classmethodr( r r- r. r0 r5 r> r r r r r s" ��� � r c @ s^ e Zd Zedefdd��Zedefdd��Zdddefdd �Z de fd d �Z defd d �Z dS )� Requirementr c C � t d��)z�The "project name" of a requirement. This is different from ``name`` if this requirement contains extras, in which case ``name`` would contain the ``[...]`` part, while this refers to the name of the project. �Subclass should override��NotImplementedErrorr/ r r r � project_name? � zRequirement.project_namec C rD )z�The name identifying this requirement in the resolver. This is different from ``project_name`` if this requirement contains extras, where ``project_name`` would not contain the ``[...]`` part. rE rF r/ r r r �nameI � zRequirement.namer6 r c C s dS �NFr r= r r r r> R s zRequirement.is_satisfied_byc C rD �NrE rF r/ r r r �get_candidate_lookupU � z Requirement.get_candidate_lookupc C rD rM rF r/ r r r �format_for_errorX rO z Requirement.format_for_errorN) r? r@ rA �propertyr rH �strrJ r. r> �CandidateLookuprN rP r r r r rC > s rC r, r6 c C s |j r t| |j �S dS rL )� source_linkr )r, r6 r r r r7 \ s r7 c @ s� e Zd Zedefdd��Zedefdd��Zedefdd��Z ede fdd ��Z ede fd d ��Z ede e fd d ��Zde dee e fdd�Zde e fdd�Zdefdd�ZdS )r r c C rD )z�The "project name" of the candidate. This is different from ``name`` if this candidate contains extras, in which case ``name`` would contain the ``[...]`` part, while this refers to the name of the project. �Override in subclassrF r/ r r r rH c rI zCandidate.project_namec C rD )z�The name identifying this candidate in the resolver. This is different from ``project_name`` if this candidate contains extras, where ``project_name`` would not contain the ``[...]`` part. rU rF r/ r r r rJ m rK zCandidate.namec C rD �NrU rF r/ r r r r< v � zCandidate.versionc C rD rV rF r/ r r r � is_installedz rW zCandidate.is_installedc C rD rV rF r/ r r r � is_editable~ rW zCandidate.is_editablec C rD rV rF r/ r r r rT � rW zCandidate.source_link� with_requiresc C rD rV rF )r$ rZ r r r �iter_dependencies� rO zCandidate.iter_dependenciesc C rD rV rF r/ r r r �get_install_requirement� rO z!Candidate.get_install_requirementc C rD rM rF r/ r r r rP � rO zCandidate.format_for_errorN)r? r@ rA rQ r rH rR rJ �CandidateVersionr< r. rX rY r r rT r rC r[ r r\ rP r r r r r b s N) �typingr r r r r � pip._vendor.packaging.specifiersr �pip._vendor.packaging.utilsr r � pip._vendor.packaging.versionr r �pip._internal.models.linkr r � pip._internal.req.req_installr �pip._internal.utils.hashesr rS r] rR r r rC r. r7 r r r r r �<module> s ( __pycache__/factory.cpython-310.pyc 0000644 00000045353 15030161315 0013131 0 ustar 00 o �7]h�n � @ s d dl Z d dlZd dlZd dlmZmZmZmZmZm Z m Z m Z m Z m Z mZmZmZmZ d dlmZ d dlmZ d dlmZmZ d dlmZ d dlm Z m Z d dl m Z m Z m!Z!m"Z"m#Z#m$Z$ d d l%m&Z& d d l'm(Z(m)Z) d d l*m+Z+ d d l,m-Z- d d l.m/Z/ d dl0m1Z1 d dl2m3Z3m4Z4 d dl5m6Z6 d dl7m8Z8 d dl9m:Z: d dl;m<Z< d dl=m>Z> ddl?m@Z@mAZAmBZBmCZC ddlDmEZEmFZFmGZGmHZHmIZImJZJmKZK ddlLmMZMmNZN ddlOmPZPmQZQmRZRmSZS er�d dlmTZT G dd � d eT�ZUe�VeW�ZXed �ZYee+eYf ZZG d d � d e �Z[G d d!� d!�Z\dS )"� N)� TYPE_CHECKING�Dict� FrozenSet�Iterable�Iterator�List�Mapping� NamedTuple�Optional�Sequence�Set�Tuple�TypeVar�cast)�InvalidRequirement)� SpecifierSet)�NormalizedName�canonicalize_name)�ResolutionImpossible)� CacheEntry� WheelCache)�DistributionNotFound�InstallationError�InstallationSubprocessError�MetadataInconsistent�UnsupportedPythonVersion�UnsupportedWheel)� PackageFinder)�BaseDistribution�get_default_environment)�Link)�Wheel)�RequirementPreparer)� install_req_from_link_and_ireq)�InstallRequirement� check_invalid_constraint_type)�InstallRequirementProvider)� get_supported)�Hashes)�get_requirement)�running_under_virtualenv� )� Candidate�CandidateVersion� Constraint� Requirement)�AlreadyInstalledCandidate� BaseCandidate�EditableCandidate�ExtrasCandidate� LinkCandidate�RequiresPythonCandidate�as_base_candidate)�FoundCandidates�IndexCandidateInfo)�ExplicitRequirement�RequiresPythonRequirement�SpecifierRequirement�UnsatisfiableRequirement)�Protocolc @ s e Zd ZU eed< eed< dS )� ConflictCause� requirement�parentN)�__name__� __module__� __qualname__r: �__annotations__r, � rE rE �M/usr/lib/python3/dist-packages/pip/_internal/resolution/resolvelib/factory.pyr> H s r> �Cc @ s: e Zd ZU ee ed< eeef ed< eee f ed< dS )�CollectedRootRequirements� requirements� constraints�user_requestedN) rA rB rC r r/ rD r �strr. �intrE rE rE rF rH S s rH c @ s� e Zd Z dTdedededee dededed ed ed ee e d f d dfdd�Z e d efdd��Z ded dfdd�Zdedee d efdd�Zdedee ded efdd �Zdedee ded ee d ee d ee f d d �Zd!e e d"e d#e d$ed%e e d e e f d&d'�Z!d(e e" dee d e#e fd)d*�Z$d+ed,e%ded e#e fd-d.�Z&d+ed/e'ee e" f d0e'ee#e f d,e%d$ed e e f d1d2�Z(d3ed4e e d ee" fd5d6�Z)d7e*e d e+fd8d9�Z,d:ed e-fd;d<�Z. =dUd"ed>ee d4e e d ee" fd?d@�Z/d"e d ee" fdAdB�Z0ded ee d ee1 fdCdD�Z2d:ed ee fdEdF�Z3dGe dH d e4fdIdJ�Z5dKe"dLee d e6fdMdN�Z7dOdPdQe8ee%f d e9fdRdS�Z:dS )V�FactoryN�finder�preparer�make_install_req� wheel_cache� use_user_site�force_reinstall�ignore_installed�ignore_requires_python�suppress_build_failures�py_version_info.�returnc C s� || _ || _|| _t| �| _|| _|| _|| _|| _| | _ i | _ i | _ i | _ i | _ i | _|s?t� } dd� | jdd�D �| _d S i | _d S )Nc S s i | ]}|j |�qS rE )�canonical_name)�.0�distrE rE rF � <dictcomp>{ s ��z$Factory.__init__.<locals>.<dictcomp>F)� local_only)�_finderrP � _wheel_cacher5 �_python_candidate�_make_install_req_from_spec�_use_user_site�_force_reinstall�_ignore_requires_python�_suppress_build_failures�_build_failures�_link_candidate_cache�_editable_candidate_cache�_installed_candidate_cache�_extras_candidate_cacher � iter_installed_distributions�_installed_dists) �selfrO rP rQ rR rS rT rU rV rW rX �envrE rE rF �__init__Z s* � � zFactory.__init__c C s | j S �N)rd �rn rE rE rF rT � s zFactory.force_reinstall�linkc C s> |j sd S t|j�}|�| jj�� �rd S |j� d�}t|��)Nz+ is not a supported wheel on this platform.)�is_wheelr! �filename� supportedr_ � target_python�get_tagsr )rn rs �wheel�msgrE rE rF �"_fail_if_link_is_unsupported_wheel� s z*Factory._fail_if_link_is_unsupported_wheel�base�extrasc C sF t |�|f}z| j| }W |S ty" t||�}|| j|< Y |S w rq )�idrk �KeyErrorr3 )rn r| r} � cache_key� candidaterE rE rF �_make_extras_candidate� s � �z Factory._make_extras_candidater\ �templatec C sR z| j |j }W n ty t||| d�}|| j |j< Y nw |s#|S | �||�S )N)�factory)rj rZ r r0 r� )rn r\ r} r� r| rE rE rF �_make_candidate_from_dist� s � z!Factory._make_candidate_from_dist�name�versionc C s� || j v rd S |jri|| jvrczt||| ||d�| j|< W nE ty@ } ztjd||ddid� || j |< W Y d }~d S d }~w tyb } z| jsK� t� d||� || j |< W Y d }~d S d }~ww | j| }n^|| j vr�zt ||| ||d�| j |< W nE ty� } ztjd||ddid� || j |< W Y d }~d S d }~w ty� } z| js�� t� d||� || j |< W Y d }~d S d }~ww | j | }|s�|S | � ||�S )N)r� r� r� z3Discarding [blue underline]%s[/]: [yellow]%s[reset]�markupT)�extraz&Discarding %s due to build failure: %s) rg �editableri r2 r �logger�infor rf �warningrh r4 r� )rn rs r} r� r� r� �er| rE rE rF �_make_candidate_from_link� s| �� � �� �� � �� z!Factory._make_candidate_from_link�ireqs� specifier�hashes�prefers_installed�incompatible_idsc s� |sdS |d ��j sJ d��t�j j��t� � |D ] }|j s#J d���|j jM ��|jdd�M �� t|j�O � qdtt f� �����fdd� }dt t f� �����fd d � }t ||� |��S ) NrE r z)Candidates found on index must be PEP 508F)�trust_internetrY c sf �j rdS z�j� } W n ty Y dS w �j| jdd�s!dS �j| � �d�}t|��v r1dS |S )z6Get the candidate for the currently-installed version.NT)� prereleases)r\ r} r� )rd rm r �containsr� r� r~ )�installed_distr� )r} r� r� rn r� r� rE rF �_get_installed_candidate s" �� z@Factory._iter_found_candidates.<locals>._get_installed_candidatec 3 s� � �j j���d�} t| �� �}tdd� |D ��}dtdtfdd�}|��}t|�D ] }|r0|s5|jj r5q*t j �j |j� ��|j d�}|j |fV q*d S ) N)� project_namer� r� c s s � | ]}|j jV qd S rq )rs � is_yanked)r[ �icanrE rE rF � <genexpr>0 s � zUFactory._iter_found_candidates.<locals>.iter_index_candidate_infos.<locals>.<genexpr>r� rY c S s< | D ]}|j dkr dS |j dkrq|j�d�rq dS dS )Nz===T�==z.*F)�operatorr� �endswith)r� �sprE rE rF � is_pinned2 s zUFactory._iter_found_candidates.<locals>.iter_index_candidate_infos.<locals>.is_pinned)rs r} r� r� r� )r_ �find_best_candidate�list�iter_applicable�allr �bool�reversedrs r� � functools�partialr� r� )�result�icans� all_yankedr� �pinnedr� �func)r} r� r� rn r� r� rE rF �iter_index_candidate_infos% s. �� ��zBFactory._iter_found_candidates.<locals>.iter_index_candidate_infos) �reqr r� � frozensetr� r� r} r r, r r8 r7 ) rn r� r� r� r� r� �ireqr� r� rE )r} r� r� r� rn r� r� rF �_iter_found_candidates� s& (�z Factory._iter_found_candidates�base_requirementsc c sL � |D ] }|� � \}}|du rqt|�}|dus J d��| �||�V qdS )a8 Produce explicit candidates from the base given an extra-ed package. :param base_requirements: Requirements known to the resolver. The requirements are guaranteed to not have extras. :param extras: The extras to inject into the explicit requirements' candidates. Nzno extras here)�get_candidate_lookupr6 r� )rn r� r} r� � lookup_cand�_� base_candrE rE rF �#_iter_explicit_candidates_from_baseT s � �z+Factory._iter_explicit_candidates_from_base� identifier� constraintc c sF � |j D ] }| �|� | j|t� t||�t|�dd�}|r |V qdS )z�Produce explicit candidates from constraints. This creates "fake" InstallRequirement objects that are basically clones of what "should" be the template, but with original_link set to link. N�r} r� r� r� )�linksr{ r� r� r# r )rn r� r� r� rs r� rE rE rF �!_iter_candidates_from_constraintsj s � ���z)Factory._iter_candidates_from_constraintsrI �incompatibilitiesc s t � }g }�� D ]}|�� \} } | d ur|�| � | d ur#|�| � q t�t�� t��} |�| � �� | j d�t | j ��� W d � n1 sIw Y |rjz|�| j�� |d d�� W n tyi Y dS w dd� |� �d�D ��|s�| �|� j� j|��S � ���fdd�|D �S )NrE r )r� c S s h | ]}t |��qS rE )r~ �r[ �crE rE rF � <setcomp>� � z*Factory.find_candidates.<locals>.<setcomp>c 3 sD � | ] � t � ��vr��� �rt� fd d��� D ��r� V qdS )c 3 s � | ]}|� � �V qd S rq )�is_satisfied_by)r[ r� �r� rE rF r� � s � z4Factory.find_candidates.<locals>.<genexpr>.<genexpr>N)r~ r� r� )r[ �r� r� � incompat_idsrI r� rF r� � s � ����z*Factory.find_candidates.<locals>.<genexpr>)�setr� �add�append� contextlib�suppressr r) �updater� �getr� r� r} r� r r� r� r� ) rn r� rI r� r� r� �explicit_candidatesr� r� �candr� �parsed_requirementrE r� rF �find_candidates� sT � �� � �� ���zFactory.find_candidatesr� �requested_extrasc C s� |� |�st�d|j|j� d S |jst|�S | �|j� | j|jt |j �||jr.t |j�nd d d�}|d u rG|js@| j |j �t t |j��S | �|�S )Nz6Ignoring %s: markers '%s' don't match your environmentr� )� match_markersr� r� r� �markersrs r; r{ r� r� r} r rg r< � make_requirement_from_candidate)rn r� r� r� rE rE rF �"_make_requirement_from_install_req� s, � � z*Factory._make_requirement_from_install_req� root_ireqsc C s� t g i i �}t|�D ][\}}|jrDt|�}|rt|��|�� s q |js'J d��t|j�}||jv r;|j| |M < q t � |�|j|< q | j |dd�}|d u rPq |j r_|j|j vr_||j |j< |j�|� q |S )NzConstraint must be namedrE )r� )rH � enumerater� r% r r� r� r rJ r. � from_ireqr� � user_suppliedrK rI r� )rn r� � collected�ir� �problemr� r� rE rE rF �collect_root_requirements� s. � z!Factory.collect_root_requirementsr� c C s t |�S rq )r9 )rn r� rE rE rF r� s z'Factory.make_requirement_from_candidaterE � comes_fromc C s | � ||�}| �||�S rq )rb r� )rn r� r� r� r� rE rE rF �make_requirement_from_spec s z"Factory.make_requirement_from_specc C s" | j rd S t|�s d S t|| j�S rq )re rL r: ra )rn r� rE rE rF � make_requires_python_requirement s z(Factory.make_requires_python_requirementc C s* | j du s | jjr dS | j j||t� d�S )a� Look up the link in the wheel cache. If ``preparer.require_hashes`` is True, don't use the wheel cache, because cached wheels, always built locally, have different hashes than the files downloaded from the index server and thus throw false hash mismatches. Furthermore, cached wheels at present have nondeterministic contents due to file modification times. N)rs � package_name�supported_tags)r` rP �require_hashes�get_cache_entryr' )rn rs r� rE rE rF �get_wheel_cache_entry s �z Factory.get_wheel_cache_entryc C sZ | j �|j�}|d u r d S | js|S |jr|S t� r+|jr+d|j� d|j� �}t |��d S )NzNWill not install to the user site because it will lack sys.path precedence to z in ) rm r� r� rc � in_usersiter* �in_site_packages�raw_name�locationr )rn r� r\ �messagerE rE rF �get_dist_to_uninstall1 s ���z Factory.get_dist_to_uninstall�causesr> c C s� |sJ d��| j j}t|�dkr+t|d jj�}d|d jj�d|� d|��}t|�S d|� d�}|D ]}|j� � }t|jj�}|d |�d |� d �7 }q3t|�S ) Nz,Requires-Python error reported with no causer+ r zPackage z requires a different Python: z not in z%Packages require a different Python. z not in:� z (required by �)) ra r� �lenrL r? r� r@ r� r �format_for_error)rn r� r� r� r� �cause�packagerE rE rF � _report_requires_python_errorM s" ��� z%Factory._report_requires_python_errorr� r@ c C s� |d u r t |�}n |� d|j� d�}| j�|j�}dd� tdd� |D ��D �}t�d|d�|�p1d � t |�d kr>t� d � t d |� ��S ) Nz (from r� c S s g | ]}t |��qS rE )rL )r[ �vrE rE rF � <listcomp>l r� z?Factory._report_single_requirement_conflict.<locals>.<listcomp>c S s h | ]}|j �qS rE )r� r� rE rE rF r� l s z>Factory._report_single_requirement_conflict.<locals>.<setcomp>zNCould not find a version that satisfies the requirement %s (from versions: %s)�, �nonezrequirements.txtz�HINT: You are attempting to install a package literally named "requirements.txt" (which cannot exist). Consider using the '-r' flag to install the packages listed in requirements.txtz#No matching distribution found for ) rL r� r_ �find_all_candidatesr� �sortedr� �critical�joinr� r )rn r� r@ �req_disp�cands�versionsrE rE rF �#_report_single_requirement_conflictc s � �z+Factory._report_single_requirement_conflictr� z,ResolutionImpossible[Requirement, Candidate]rJ c s� |j sJ d��� fdd�|j D �}|r� �td|��S t|j �dkr4|j d \}}|j|vr4� �||�S dtt dtfd d �}d tdtfd d �}t � }|j D ]\}}|d u r[|� � } n||�} |� | � qN|rn|t |��} nd} d� | �} t�| � d} t � } |j D ],\}}|j|v r�| � |j� | d } |r�| |j� d|j� d� } n| d } | |� � } q�| D ]} || j}| d| � |� �7 } q�| d d d d d } t�| � td�S ) Nz)Installation error reported with no causec s* g | ]}t |jt�r|j�� j�s|�qS rE )� isinstancer? r: r� ra )r[ r� rr rE rF r� � s � ��z2Factory.get_installation_error.<locals>.<listcomp>zSequence[ConflictCause]r+ r �partsrY c S s2 t | �dkr | d S d�| d d� �d | d S )Nr+ r r� ���z and )r� r� )r rE rE rF � text_join� s z1Factory.get_installation_error.<locals>.text_joinr@ c S sF | � � }|r |js| j� d| j� �S t|jt�r t|jj�S t|j�S )Nr� )�get_install_requirementr� r� r� r r$ rL )r@ r� rE rE rF �describe_trigger� s z8Factory.get_installation_error.<locals>.describe_triggerzthe requested packageszOCannot install {} because these package versions have conflicting dependencies.z The conflict is caused by:z � z depends on zThe user requested z% The user requested (constraint) z z To fix this you could try to: z91. loosen the range of package versions you've specified z92. remove package versions to allow pip attempt to solve zthe dependency conflict z�ResolutionImpossible: for help visit https://pip.pypa.io/en/latest/topics/dependency-resolution/#dealing-with-dependency-conflicts)r� r� r r� r� r r rL r, r� r� r� r� �formatr� r� r� r� r� r )rn r� rJ �requires_python_causesr� r@ r r �triggers�triggerr� rz �relevant_constraints�key�specrE rr rF �get_installation_error~ sp �� � ������ �z Factory.get_installation_errorrq )rE );rA rB rC r r" r& r r r� r rM rp �propertyrT r r{ r1 r rL r3 r� r r$ r, r� r r- r� r r r( r r r� r/ r r� r. r� r r� r� r rH r� r9 r� r� r� r r� r� r r� r r r r r rE rE rE rF rN Y s< �������� � � � �( �� � ��� ������ �J����� �a�� ���� ������ �F�� � � � � � ���� � � � �� � � ��� �� ��rN )]r� r� �logging�typingr r r r r r r r r r r r r r �"pip._vendor.packaging.requirementsr � pip._vendor.packaging.specifiersr �pip._vendor.packaging.utilsr r �pip._vendor.resolvelibr �pip._internal.cacher r �pip._internal.exceptionsr r r r r r �"pip._internal.index.package_finderr �pip._internal.metadatar r �pip._internal.models.linkr �pip._internal.models.wheelr! � pip._internal.operations.preparer" � pip._internal.req.constructorsr# � pip._internal.req.req_installr$ r% � pip._internal.resolution.baser& �&pip._internal.utils.compatibility_tagsr' �pip._internal.utils.hashesr( � pip._internal.utils.packagingr) � pip._internal.utils.virtualenvr* r| r, r- r. r/ � candidatesr0 r1 r2 r3 r4 r5 r6 �found_candidatesr7 r8 rI r9 r: r; r< r= r> � getLoggerrA r� rG �CacherH rN rE rE rE rF �<module> sD @ $ resolver.py 0000644 00000026107 15030161315 0006760 0 ustar 00 import functools import logging import os from typing import TYPE_CHECKING, Dict, List, Optional, Set, Tuple, cast from pip._vendor.packaging.utils import canonicalize_name from pip._vendor.resolvelib import BaseReporter, ResolutionImpossible from pip._vendor.resolvelib import Resolver as RLResolver from pip._vendor.resolvelib.structs import DirectedGraph from pip._internal.cache import WheelCache from pip._internal.index.package_finder import PackageFinder from pip._internal.operations.prepare import RequirementPreparer from pip._internal.req.req_install import InstallRequirement from pip._internal.req.req_set import RequirementSet from pip._internal.resolution.base import BaseResolver, InstallRequirementProvider from pip._internal.resolution.resolvelib.provider import PipProvider from pip._internal.resolution.resolvelib.reporter import ( PipDebuggingReporter, PipReporter, ) from .base import Candidate, Requirement from .factory import Factory if TYPE_CHECKING: from pip._vendor.resolvelib.resolvers import Result as RLResult Result = RLResult[Requirement, Candidate, str] logger = logging.getLogger(__name__) class Resolver(BaseResolver): _allowed_strategies = {"eager", "only-if-needed", "to-satisfy-only"} def __init__( self, preparer: RequirementPreparer, finder: PackageFinder, wheel_cache: Optional[WheelCache], make_install_req: InstallRequirementProvider, use_user_site: bool, ignore_dependencies: bool, ignore_installed: bool, ignore_requires_python: bool, force_reinstall: bool, upgrade_strategy: str, suppress_build_failures: bool, py_version_info: Optional[Tuple[int, ...]] = None, ): super().__init__() assert upgrade_strategy in self._allowed_strategies self.factory = Factory( finder=finder, preparer=preparer, make_install_req=make_install_req, wheel_cache=wheel_cache, use_user_site=use_user_site, force_reinstall=force_reinstall, ignore_installed=ignore_installed, ignore_requires_python=ignore_requires_python, suppress_build_failures=suppress_build_failures, py_version_info=py_version_info, ) self.ignore_dependencies = ignore_dependencies self.upgrade_strategy = upgrade_strategy self._result: Optional[Result] = None def resolve( self, root_reqs: List[InstallRequirement], check_supported_wheels: bool ) -> RequirementSet: collected = self.factory.collect_root_requirements(root_reqs) provider = PipProvider( factory=self.factory, constraints=collected.constraints, ignore_dependencies=self.ignore_dependencies, upgrade_strategy=self.upgrade_strategy, user_requested=collected.user_requested, ) if "PIP_RESOLVER_DEBUG" in os.environ: reporter: BaseReporter = PipDebuggingReporter() else: reporter = PipReporter() resolver: RLResolver[Requirement, Candidate, str] = RLResolver( provider, reporter, ) try: try_to_avoid_resolution_too_deep = 2000000 result = self._result = resolver.resolve( collected.requirements, max_rounds=try_to_avoid_resolution_too_deep ) except ResolutionImpossible as e: error = self.factory.get_installation_error( cast("ResolutionImpossible[Requirement, Candidate]", e), collected.constraints, ) raise error from e req_set = RequirementSet(check_supported_wheels=check_supported_wheels) for candidate in result.mapping.values(): ireq = candidate.get_install_requirement() if ireq is None: continue # Check if there is already an installation under the same name, # and set a flag for later stages to uninstall it, if needed. installed_dist = self.factory.get_dist_to_uninstall(candidate) if installed_dist is None: # There is no existing installation -- nothing to uninstall. ireq.should_reinstall = False elif self.factory.force_reinstall: # The --force-reinstall flag is set -- reinstall. ireq.should_reinstall = True elif installed_dist.version != candidate.version: # The installation is different in version -- reinstall. ireq.should_reinstall = True elif candidate.is_editable or installed_dist.editable: # The incoming distribution is editable, or different in # editable-ness to installation -- reinstall. ireq.should_reinstall = True elif candidate.source_link and candidate.source_link.is_file: # The incoming distribution is under file:// if candidate.source_link.is_wheel: # is a local wheel -- do nothing. logger.info( "%s is already installed with the same version as the " "provided wheel. Use --force-reinstall to force an " "installation of the wheel.", ireq.name, ) continue # is a local sdist or path -- reinstall ireq.should_reinstall = True else: continue link = candidate.source_link if link and link.is_yanked: # The reason can contain non-ASCII characters, Unicode # is required for Python 2. msg = ( "The candidate selected for download or install is a " "yanked version: {name!r} candidate (version {version} " "at {link})\nReason for being yanked: {reason}" ).format( name=candidate.name, version=candidate.version, link=link, reason=link.yanked_reason or "<none given>", ) logger.warning(msg) req_set.add_named_requirement(ireq) reqs = req_set.all_requirements self.factory.preparer.prepare_linked_requirements_more(reqs) return req_set def get_installation_order( self, req_set: RequirementSet ) -> List[InstallRequirement]: """Get 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. """ assert self._result is not None, "must call resolve() first" if not req_set.requirements: # Nothing is left to install, so we do not need an order. return [] graph = self._result.graph weights = get_topological_weights( graph, expected_node_count=len(self._result.mapping) + 1, ) sorted_items = sorted( req_set.requirements.items(), key=functools.partial(_req_set_item_sorter, weights=weights), reverse=True, ) return [ireq for _, ireq in sorted_items] def get_topological_weights( graph: "DirectedGraph[Optional[str]]", expected_node_count: int ) -> Dict[Optional[str], int]: """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 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. """ path: Set[Optional[str]] = set() weights: Dict[Optional[str], int] = {} def visit(node: Optional[str]) -> None: if node in path: # We hit a cycle, so we'll break it here. return # Time to visit the children! path.add(node) for child in graph.iter_children(node): visit(child) path.remove(node) last_known_parent_count = weights.get(node, 0) weights[node] = max(last_known_parent_count, len(path)) # Simplify the graph, pruning leaves that have no dependencies. # This is needed for large graphs (say over 200 packages) because the # `visit` function is exponentially slower then, taking minutes. # See https://github.com/pypa/pip/issues/10557 # We will loop until we explicitly break the loop. while True: leaves = set() for key in graph: if key is None: continue for _child in graph.iter_children(key): # This means we have at least one child break else: # No child. leaves.add(key) if not leaves: # We are done simplifying. break # Calculate the weight for the leaves. weight = len(graph) - 1 for leaf in leaves: weights[leaf] = weight # Remove the leaves from the graph, making it simpler. for leaf in leaves: graph.remove(leaf) # Visit the remaining graph. # `None` is guaranteed to be the root node by resolvelib. visit(None) # Sanity checks assert weights[None] == 0 assert len(weights) == expected_node_count return weights def _req_set_item_sorter( item: Tuple[str, InstallRequirement], weights: Dict[Optional[str], int], ) -> Tuple[int, str]: """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. """ name = canonicalize_name(item[0]) return weights[name], name found_candidates.py 0000644 00000013111 15030161315 0010400 0 ustar 00 """Utilities to lazily create and visit candidates found. Creating and visiting a candidate is a *very* costly operation. It involves fetching, extracting, potentially building modules from source, and verifying distribution metadata. It is therefore crucial for performance to keep everything here lazy all the way down, so we only touch candidates that we absolutely need, and not "download the world" when we only need one version of something. """ import functools from collections.abc import Sequence from typing import TYPE_CHECKING, Any, Callable, Iterator, Optional, Set, Tuple from pip._vendor.packaging.version import _BaseVersion from .base import Candidate IndexCandidateInfo = Tuple[_BaseVersion, Callable[[], Optional[Candidate]]] if TYPE_CHECKING: SequenceCandidate = Sequence[Candidate] else: # For compatibility: Python before 3.9 does not support using [] on the # Sequence class. # # >>> from collections.abc import Sequence # >>> Sequence[str] # Traceback (most recent call last): # File "<stdin>", line 1, in <module> # TypeError: 'ABCMeta' object is not subscriptable # # TODO: Remove this block after dropping Python 3.8 support. SequenceCandidate = Sequence def _iter_built(infos: Iterator[IndexCandidateInfo]) -> Iterator[Candidate]: """Iterator for ``FoundCandidates``. This iterator is used when the package is not already installed. Candidates from index come later in their normal ordering. """ versions_found: Set[_BaseVersion] = set() for version, func in infos: if version in versions_found: continue candidate = func() if candidate is None: continue yield candidate versions_found.add(version) def _iter_built_with_prepended( installed: Candidate, infos: Iterator[IndexCandidateInfo] ) -> Iterator[Candidate]: """Iterator for ``FoundCandidates``. This iterator is used when the resolver prefers the already-installed candidate and NOT to upgrade. The installed candidate is therefore always yielded first, and candidates from index come later in their normal ordering, except skipped when the version is already installed. """ yield installed versions_found: Set[_BaseVersion] = {installed.version} for version, func in infos: if version in versions_found: continue candidate = func() if candidate is None: continue yield candidate versions_found.add(version) def _iter_built_with_inserted( installed: Candidate, infos: Iterator[IndexCandidateInfo] ) -> Iterator[Candidate]: """Iterator for ``FoundCandidates``. This iterator is used when the resolver prefers to upgrade an already-installed package. Candidates from index are returned in their normal ordering, except replaced when the version is already installed. The implementation iterates through and yields other candidates, inserting the installed candidate exactly once before we start yielding older or equivalent candidates, or after all other candidates if they are all newer. """ versions_found: Set[_BaseVersion] = set() for version, func in infos: if version in versions_found: continue # If the installed candidate is better, yield it first. if installed.version >= version: yield installed versions_found.add(installed.version) candidate = func() if candidate is None: continue yield candidate versions_found.add(version) # If the installed candidate is older than all other candidates. if installed.version not in versions_found: yield installed class FoundCandidates(SequenceCandidate): """A lazy sequence to provide candidates to the resolver. The intended usage is to return this from `find_matches()` so the resolver can iterate through the sequence multiple times, but only access the index page when remote packages are actually needed. This improve performances when suitable candidates are already installed on disk. """ def __init__( self, get_infos: Callable[[], Iterator[IndexCandidateInfo]], installed: Optional[Candidate], prefers_installed: bool, incompatible_ids: Set[int], ): self._get_infos = get_infos self._installed = installed self._prefers_installed = prefers_installed self._incompatible_ids = incompatible_ids def __getitem__(self, index: Any) -> Any: # Implemented to satisfy the ABC check. This is not needed by the # resolver, and should not be used by the provider either (for # performance reasons). raise NotImplementedError("don't do this") def __iter__(self) -> Iterator[Candidate]: infos = self._get_infos() if not self._installed: iterator = _iter_built(infos) elif self._prefers_installed: iterator = _iter_built_with_prepended(self._installed, infos) else: iterator = _iter_built_with_inserted(self._installed, infos) return (c for c in iterator if id(c) not in self._incompatible_ids) def __len__(self) -> int: # Implemented to satisfy the ABC check. This is not needed by the # resolver, and should not be used by the provider either (for # performance reasons). raise NotImplementedError("don't do this") @functools.lru_cache(maxsize=1) def __bool__(self) -> bool: if self._prefers_installed and self._installed: return True return any(self) candidates.py 0000644 00000043665 15030161315 0007226 0 ustar 00 import logging import sys from typing import TYPE_CHECKING, Any, FrozenSet, Iterable, Optional, Tuple, Union, cast from pip._vendor.packaging.utils import NormalizedName, canonicalize_name from pip._vendor.packaging.version import Version from pip._internal.exceptions import ( HashError, InstallationSubprocessError, MetadataInconsistent, ) from pip._internal.metadata import BaseDistribution from pip._internal.models.link import Link, links_equivalent from pip._internal.models.wheel import Wheel from pip._internal.req.constructors import ( install_req_from_editable, install_req_from_line, ) from pip._internal.req.req_install import InstallRequirement from pip._internal.utils.misc import normalize_version_info from .base import Candidate, CandidateVersion, Requirement, format_name if TYPE_CHECKING: from .factory import Factory logger = logging.getLogger(__name__) BaseCandidate = Union[ "AlreadyInstalledCandidate", "EditableCandidate", "LinkCandidate", ] # Avoid conflicting with the PyPI package "Python". REQUIRES_PYTHON_IDENTIFIER = cast(NormalizedName, "<Python from Requires-Python>") def as_base_candidate(candidate: Candidate) -> Optional[BaseCandidate]: """The runtime version of BaseCandidate.""" base_candidate_classes = ( AlreadyInstalledCandidate, EditableCandidate, LinkCandidate, ) if isinstance(candidate, base_candidate_classes): return candidate return None def make_install_req_from_link( link: Link, template: InstallRequirement ) -> InstallRequirement: assert not template.editable, "template is editable" if template.req: line = str(template.req) else: line = link.url ireq = install_req_from_line( line, user_supplied=template.user_supplied, comes_from=template.comes_from, use_pep517=template.use_pep517, isolated=template.isolated, constraint=template.constraint, options=dict( install_options=template.install_options, global_options=template.global_options, hashes=template.hash_options, ), ) ireq.original_link = template.original_link ireq.link = link return ireq def make_install_req_from_editable( link: Link, template: InstallRequirement ) -> InstallRequirement: assert template.editable, "template not editable" return install_req_from_editable( link.url, user_supplied=template.user_supplied, comes_from=template.comes_from, use_pep517=template.use_pep517, isolated=template.isolated, constraint=template.constraint, permit_editable_wheels=template.permit_editable_wheels, options=dict( install_options=template.install_options, global_options=template.global_options, hashes=template.hash_options, ), ) def _make_install_req_from_dist( dist: BaseDistribution, template: InstallRequirement ) -> InstallRequirement: if template.req: line = str(template.req) elif template.link: line = f"{dist.canonical_name} @ {template.link.url}" else: line = f"{dist.canonical_name}=={dist.version}" ireq = install_req_from_line( line, user_supplied=template.user_supplied, comes_from=template.comes_from, use_pep517=template.use_pep517, isolated=template.isolated, constraint=template.constraint, options=dict( install_options=template.install_options, global_options=template.global_options, hashes=template.hash_options, ), ) ireq.satisfied_by = dist return ireq class _InstallRequirementBackedCandidate(Candidate): """A candidate backed by an ``InstallRequirement``. This represents a package request with the target not being already in the environment, and needs to be fetched and installed. The backing ``InstallRequirement`` is responsible for most of the leg work; this class exposes appropriate information to the resolver. :param link: The link passed to the ``InstallRequirement``. The backing ``InstallRequirement`` will use this link to fetch the distribution. :param source_link: The link this candidate "originates" from. This is different from ``link`` when the link is found in the wheel cache. ``link`` would point to the wheel cache, while this points to the found remote link (e.g. from pypi.org). """ dist: BaseDistribution is_installed = False def __init__( self, link: Link, source_link: Link, ireq: InstallRequirement, factory: "Factory", name: Optional[NormalizedName] = None, version: Optional[CandidateVersion] = None, ) -> None: self._link = link self._source_link = source_link self._factory = factory self._ireq = ireq self._name = name self._version = version self.dist = self._prepare() def __str__(self) -> str: return f"{self.name} {self.version}" def __repr__(self) -> str: return "{class_name}({link!r})".format( class_name=self.__class__.__name__, link=str(self._link), ) def __hash__(self) -> int: return hash((self.__class__, self._link)) def __eq__(self, other: Any) -> bool: if isinstance(other, self.__class__): return links_equivalent(self._link, other._link) return False @property def source_link(self) -> Optional[Link]: return self._source_link @property def project_name(self) -> NormalizedName: """The normalised name of the project the candidate refers to""" if self._name is None: self._name = self.dist.canonical_name return self._name @property def name(self) -> str: return self.project_name @property def version(self) -> CandidateVersion: if self._version is None: self._version = self.dist.version return self._version def format_for_error(self) -> str: return "{} {} (from {})".format( self.name, self.version, self._link.file_path if self._link.is_file else self._link, ) def _prepare_distribution(self) -> BaseDistribution: raise NotImplementedError("Override in subclass") def _check_metadata_consistency(self, dist: BaseDistribution) -> None: """Check for consistency of project name and version of dist.""" if self._name is not None and self._name != dist.canonical_name: raise MetadataInconsistent( self._ireq, "name", self._name, dist.canonical_name, ) if self._version is not None and self._version != dist.version: raise MetadataInconsistent( self._ireq, "version", str(self._version), str(dist.version), ) def _prepare(self) -> BaseDistribution: try: dist = self._prepare_distribution() except HashError as e: # Provide HashError the underlying ireq that caused it. This # provides context for the resulting error message to show the # offending line to the user. e.req = self._ireq raise except InstallationSubprocessError as exc: # The output has been presented already, so don't duplicate it. exc.context = "See above for output." raise self._check_metadata_consistency(dist) return dist def iter_dependencies(self, with_requires: bool) -> Iterable[Optional[Requirement]]: requires = self.dist.iter_dependencies() if with_requires else () for r in requires: yield self._factory.make_requirement_from_spec(str(r), self._ireq) yield self._factory.make_requires_python_requirement(self.dist.requires_python) def get_install_requirement(self) -> Optional[InstallRequirement]: return self._ireq class LinkCandidate(_InstallRequirementBackedCandidate): is_editable = False def __init__( self, link: Link, template: InstallRequirement, factory: "Factory", name: Optional[NormalizedName] = None, version: Optional[CandidateVersion] = None, ) -> None: source_link = link cache_entry = factory.get_wheel_cache_entry(link, name) if cache_entry is not None: logger.debug("Using cached wheel link: %s", cache_entry.link) link = cache_entry.link ireq = make_install_req_from_link(link, template) assert ireq.link == link if ireq.link.is_wheel and not ireq.link.is_file: wheel = Wheel(ireq.link.filename) wheel_name = canonicalize_name(wheel.name) assert name == wheel_name, f"{name!r} != {wheel_name!r} for wheel" # Version may not be present for PEP 508 direct URLs if version is not None: wheel_version = Version(wheel.version) assert version == wheel_version, "{!r} != {!r} for wheel {}".format( version, wheel_version, name ) if ( cache_entry is not None and cache_entry.persistent and template.link is template.original_link ): ireq.original_link_is_in_wheel_cache = True super().__init__( link=link, source_link=source_link, ireq=ireq, factory=factory, name=name, version=version, ) def _prepare_distribution(self) -> BaseDistribution: preparer = self._factory.preparer return preparer.prepare_linked_requirement(self._ireq, parallel_builds=True) class EditableCandidate(_InstallRequirementBackedCandidate): is_editable = True def __init__( self, link: Link, template: InstallRequirement, factory: "Factory", name: Optional[NormalizedName] = None, version: Optional[CandidateVersion] = None, ) -> None: super().__init__( link=link, source_link=link, ireq=make_install_req_from_editable(link, template), factory=factory, name=name, version=version, ) def _prepare_distribution(self) -> BaseDistribution: return self._factory.preparer.prepare_editable_requirement(self._ireq) class AlreadyInstalledCandidate(Candidate): is_installed = True source_link = None def __init__( self, dist: BaseDistribution, template: InstallRequirement, factory: "Factory", ) -> None: self.dist = dist self._ireq = _make_install_req_from_dist(dist, template) self._factory = factory # This is just logging some messages, so we can do it eagerly. # The returned dist would be exactly the same as self.dist because we # set satisfied_by in _make_install_req_from_dist. # TODO: Supply reason based on force_reinstall and upgrade_strategy. skip_reason = "already satisfied" factory.preparer.prepare_installed_requirement(self._ireq, skip_reason) def __str__(self) -> str: return str(self.dist) def __repr__(self) -> str: return "{class_name}({distribution!r})".format( class_name=self.__class__.__name__, distribution=self.dist, ) def __hash__(self) -> int: return hash((self.__class__, self.name, self.version)) def __eq__(self, other: Any) -> bool: if isinstance(other, self.__class__): return self.name == other.name and self.version == other.version return False @property def project_name(self) -> NormalizedName: return self.dist.canonical_name @property def name(self) -> str: return self.project_name @property def version(self) -> CandidateVersion: return self.dist.version @property def is_editable(self) -> bool: return self.dist.editable def format_for_error(self) -> str: return f"{self.name} {self.version} (Installed)" def iter_dependencies(self, with_requires: bool) -> Iterable[Optional[Requirement]]: if not with_requires: return for r in self.dist.iter_dependencies(): yield self._factory.make_requirement_from_spec(str(r), self._ireq) def get_install_requirement(self) -> Optional[InstallRequirement]: return None class ExtrasCandidate(Candidate): """A candidate that has 'extras', indicating additional dependencies. Requirements can be for a project with dependencies, something like foo[extra]. The extras don't affect the project/version being installed directly, but indicate that we need additional dependencies. We model that by having an artificial ExtrasCandidate that wraps the "base" candidate. The ExtrasCandidate differs from the base in the following ways: 1. It has a unique name, of the form foo[extra]. This causes the resolver to treat it as a separate node in the dependency graph. 2. When we're getting the candidate's dependencies, a) We specify that we want the extra dependencies as well. b) We add a dependency on the base candidate. See below for why this is needed. 3. We return None for the underlying InstallRequirement, as the base candidate will provide it, and we don't want to end up with duplicates. The dependency on the base candidate is needed so that the resolver can't decide that it should recommend foo[extra1] version 1.0 and foo[extra2] version 2.0. Having those candidates depend on foo=1.0 and foo=2.0 respectively forces the resolver to recognise that this is a conflict. """ def __init__( self, base: BaseCandidate, extras: FrozenSet[str], ) -> None: self.base = base self.extras = extras def __str__(self) -> str: name, rest = str(self.base).split(" ", 1) return "{}[{}] {}".format(name, ",".join(self.extras), rest) def __repr__(self) -> str: return "{class_name}(base={base!r}, extras={extras!r})".format( class_name=self.__class__.__name__, base=self.base, extras=self.extras, ) def __hash__(self) -> int: return hash((self.base, self.extras)) def __eq__(self, other: Any) -> bool: if isinstance(other, self.__class__): return self.base == other.base and self.extras == other.extras return False @property def project_name(self) -> NormalizedName: return self.base.project_name @property def name(self) -> str: """The normalised name of the project the candidate refers to""" return format_name(self.base.project_name, self.extras) @property def version(self) -> CandidateVersion: return self.base.version def format_for_error(self) -> str: return "{} [{}]".format( self.base.format_for_error(), ", ".join(sorted(self.extras)) ) @property def is_installed(self) -> bool: return self.base.is_installed @property def is_editable(self) -> bool: return self.base.is_editable @property def source_link(self) -> Optional[Link]: return self.base.source_link def iter_dependencies(self, with_requires: bool) -> Iterable[Optional[Requirement]]: factory = self.base._factory # Add a dependency on the exact base # (See note 2b in the class docstring) yield factory.make_requirement_from_candidate(self.base) if not with_requires: return # The user may have specified extras that the candidate doesn't # support. We ignore any unsupported extras here. valid_extras = self.extras.intersection(self.base.dist.iter_provided_extras()) invalid_extras = self.extras.difference(self.base.dist.iter_provided_extras()) for extra in sorted(invalid_extras): logger.warning( "%s %s does not provide the extra '%s'", self.base.name, self.version, extra, ) for r in self.base.dist.iter_dependencies(valid_extras): requirement = factory.make_requirement_from_spec( str(r), self.base._ireq, valid_extras ) if requirement: yield requirement def get_install_requirement(self) -> Optional[InstallRequirement]: # We don't return anything here, because we always # depend on the base candidate, and we'll get the # install requirement from that. return None class RequiresPythonCandidate(Candidate): is_installed = False source_link = None def __init__(self, py_version_info: Optional[Tuple[int, ...]]) -> None: if py_version_info is not None: version_info = normalize_version_info(py_version_info) else: version_info = sys.version_info[:3] self._version = Version(".".join(str(c) for c in version_info)) # We don't need to implement __eq__() and __ne__() since there is always # only one RequiresPythonCandidate in a resolution, i.e. the host Python. # The built-in object.__eq__() and object.__ne__() do exactly what we want. def __str__(self) -> str: return f"Python {self._version}" @property def project_name(self) -> NormalizedName: return REQUIRES_PYTHON_IDENTIFIER @property def name(self) -> str: return REQUIRES_PYTHON_IDENTIFIER @property def version(self) -> CandidateVersion: return self._version def format_for_error(self) -> str: return f"Python {self.version}" def iter_dependencies(self, with_requires: bool) -> Iterable[Optional[Requirement]]: return () def get_install_requirement(self) -> Optional[InstallRequirement]: return None provider.py 0000644 00000023273 15030161315 0006752 0 ustar 00 import collections import math from typing import ( TYPE_CHECKING, Dict, Iterable, Iterator, Mapping, Sequence, TypeVar, Union, ) from pip._vendor.resolvelib.providers import AbstractProvider from .base import Candidate, Constraint, Requirement from .candidates import REQUIRES_PYTHON_IDENTIFIER from .factory import Factory if TYPE_CHECKING: from pip._vendor.resolvelib.providers import Preference from pip._vendor.resolvelib.resolvers import RequirementInformation PreferenceInformation = RequirementInformation[Requirement, Candidate] _ProviderBase = AbstractProvider[Requirement, Candidate, str] else: _ProviderBase = AbstractProvider # Notes on the relationship between the provider, the factory, and the # candidate and requirement classes. # # The provider is a direct implementation of the resolvelib class. Its role # is to deliver the API that resolvelib expects. # # Rather than work with completely abstract "requirement" and "candidate" # concepts as resolvelib does, pip has concrete classes implementing these two # ideas. The API of Requirement and Candidate objects are defined in the base # classes, but essentially map fairly directly to the equivalent provider # methods. In particular, `find_matches` and `is_satisfied_by` are # requirement methods, and `get_dependencies` is a candidate method. # # The factory is the interface to pip's internal mechanisms. It is stateless, # and is created by the resolver and held as a property of the provider. It is # responsible for creating Requirement and Candidate objects, and provides # services to those objects (access to pip's finder and preparer). D = TypeVar("D") V = TypeVar("V") def _get_with_identifier( mapping: Mapping[str, V], identifier: str, default: D, ) -> Union[D, V]: """Get item from a package name lookup mapping with a resolver identifier. This extra logic is needed when the target mapping is keyed by package name, which cannot be directly looked up with an identifier (which may contain requested extras). Additional logic is added to also look up a value by "cleaning up" the extras from the identifier. """ if identifier in mapping: return mapping[identifier] # HACK: Theoretically we should check whether this identifier is a valid # "NAME[EXTRAS]" format, and parse out the name part with packaging or # some regular expression. But since pip's resolver only spits out three # kinds of identifiers: normalized PEP 503 names, normalized names plus # extras, and Requires-Python, we can cheat a bit here. name, open_bracket, _ = identifier.partition("[") if open_bracket and name in mapping: return mapping[name] return default class PipProvider(_ProviderBase): """Pip's provider implementation for resolvelib. :params constraints: A mapping of constraints specified by the user. Keys are canonicalized project names. :params ignore_dependencies: Whether the user specified ``--no-deps``. :params upgrade_strategy: The user-specified upgrade strategy. :params user_requested: A set of canonicalized package names that the user supplied for pip to install/upgrade. """ def __init__( self, factory: Factory, constraints: Dict[str, Constraint], ignore_dependencies: bool, upgrade_strategy: str, user_requested: Dict[str, int], ) -> None: self._factory = factory self._constraints = constraints self._ignore_dependencies = ignore_dependencies self._upgrade_strategy = upgrade_strategy self._user_requested = user_requested self._known_depths: Dict[str, float] = collections.defaultdict(lambda: math.inf) def identify(self, requirement_or_candidate: Union[Requirement, Candidate]) -> str: return requirement_or_candidate.name def get_preference( # type: ignore self, identifier: str, resolutions: Mapping[str, Candidate], candidates: Mapping[str, Iterator[Candidate]], information: Mapping[str, Iterable["PreferenceInformation"]], backtrack_causes: Sequence["PreferenceInformation"], ) -> "Preference": """Produce a sort key for given requirement based on preference. The lower the return value is, the more preferred this group of arguments is. Currently pip considers the followings in order: * Prefer if any of the known requirements is "direct", e.g. points to an explicit URL. * If equal, prefer if any requirement is "pinned", i.e. contains operator ``===`` or ``==``. * If equal, calculate an approximate "depth" and resolve requirements closer to the user-specified requirements first. * Order user-specified requirements by the order they are specified. * If equal, prefers "non-free" requirements, i.e. contains at least one operator, such as ``>=`` or ``<``. * If equal, order alphabetically for consistency (helps debuggability). """ lookups = (r.get_candidate_lookup() for r, _ in information[identifier]) candidate, ireqs = zip(*lookups) operators = [ specifier.operator for specifier_set in (ireq.specifier for ireq in ireqs if ireq) for specifier in specifier_set ] direct = candidate is not None pinned = any(op[:2] == "==" for op in operators) unfree = bool(operators) try: requested_order: Union[int, float] = self._user_requested[identifier] except KeyError: requested_order = math.inf parent_depths = ( self._known_depths[parent.name] if parent is not None else 0.0 for _, parent in information[identifier] ) inferred_depth = min(d for d in parent_depths) + 1.0 else: inferred_depth = 1.0 self._known_depths[identifier] = inferred_depth requested_order = self._user_requested.get(identifier, math.inf) # Requires-Python has only one candidate and the check is basically # free, so we always do it first to avoid needless work if it fails. requires_python = identifier == REQUIRES_PYTHON_IDENTIFIER # HACK: Setuptools have a very long and solid backward compatibility # track record, and extremely few projects would request a narrow, # non-recent version range of it since that would break a lot things. # (Most projects specify it only to request for an installer feature, # which does not work, but that's another topic.) Intentionally # delaying Setuptools helps reduce branches the resolver has to check. # This serves as a temporary fix for issues like "apache-airflow[all]" # while we work on "proper" branch pruning techniques. delay_this = identifier == "setuptools" # Prefer the causes of backtracking on the assumption that the problem # resolving the dependency tree is related to the failures that caused # the backtracking backtrack_cause = self.is_backtrack_cause(identifier, backtrack_causes) return ( not requires_python, delay_this, not direct, not pinned, not backtrack_cause, inferred_depth, requested_order, not unfree, identifier, ) def find_matches( self, identifier: str, requirements: Mapping[str, Iterator[Requirement]], incompatibilities: Mapping[str, Iterator[Candidate]], ) -> Iterable[Candidate]: def _eligible_for_upgrade(identifier: str) -> bool: """Are upgrades allowed for this project? This checks the upgrade strategy, and whether the project was one that the user specified in the command line, in order to decide whether we should upgrade if there's a newer version available. (Note that we don't need access to the `--upgrade` flag, because an upgrade strategy of "to-satisfy-only" means that `--upgrade` was not specified). """ if self._upgrade_strategy == "eager": return True elif self._upgrade_strategy == "only-if-needed": user_order = _get_with_identifier( self._user_requested, identifier, default=None, ) return user_order is not None return False constraint = _get_with_identifier( self._constraints, identifier, default=Constraint.empty(), ) return self._factory.find_candidates( identifier=identifier, requirements=requirements, constraint=constraint, prefers_installed=(not _eligible_for_upgrade(identifier)), incompatibilities=incompatibilities, ) def is_satisfied_by(self, requirement: Requirement, candidate: Candidate) -> bool: return requirement.is_satisfied_by(candidate) def get_dependencies(self, candidate: Candidate) -> Sequence[Requirement]: with_requires = not self._ignore_dependencies return [r for r in candidate.iter_dependencies(with_requires) if r is not None] @staticmethod def is_backtrack_cause( identifier: str, backtrack_causes: Sequence["PreferenceInformation"] ) -> bool: for backtrack_cause in backtrack_causes: if identifier == backtrack_cause.requirement.name: return True if backtrack_cause.parent and identifier == backtrack_cause.parent.name: return True return False reporter.py 0000644 00000004736 15030161315 0006765 0 ustar 00 from collections import defaultdict from logging import getLogger from typing import Any, DefaultDict from pip._vendor.resolvelib.reporters import BaseReporter from .base import Candidate, Requirement logger = getLogger(__name__) class PipReporter(BaseReporter): def __init__(self) -> None: self.backtracks_by_package: DefaultDict[str, int] = defaultdict(int) self._messages_at_backtrack = { 1: ( "pip is looking at multiple versions of {package_name} to " "determine which version is compatible with other " "requirements. This could take a while." ), 8: ( "pip is looking at multiple versions of {package_name} to " "determine which version is compatible with other " "requirements. This could take a while." ), 13: ( "This is taking longer than usual. You might need to provide " "the dependency resolver with stricter constraints to reduce " "runtime. See https://pip.pypa.io/warnings/backtracking for " "guidance. If you want to abort this run, press Ctrl + C." ), } def backtracking(self, candidate: Candidate) -> None: self.backtracks_by_package[candidate.name] += 1 count = self.backtracks_by_package[candidate.name] if count not in self._messages_at_backtrack: return message = self._messages_at_backtrack[count] logger.info("INFO: %s", message.format(package_name=candidate.name)) class PipDebuggingReporter(BaseReporter): """A reporter that does an info log for every event it sees.""" def starting(self) -> None: logger.info("Reporter.starting()") def starting_round(self, index: int) -> None: logger.info("Reporter.starting_round(%r)", index) def ending_round(self, index: int, state: Any) -> None: logger.info("Reporter.ending_round(%r, state)", index) def ending(self, state: Any) -> None: logger.info("Reporter.ending(%r)", state) def adding_requirement(self, requirement: Requirement, parent: Candidate) -> None: logger.info("Reporter.adding_requirement(%r, %r)", requirement, parent) def backtracking(self, candidate: Candidate) -> None: logger.info("Reporter.backtracking(%r)", candidate) def pinning(self, candidate: Candidate) -> None: logger.info("Reporter.pinning(%r)", candidate) __init__.py 0000644 00000000000 15030161315 0006636 0 ustar 00
| ver. 1.4 |
Github
|
.
| PHP 8.2.28 | Generation time: 0.02 |
proxy
|
phpinfo
|
Settings