Add base vars and sudo check

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/LICENSE

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/f3/88/fd/38cad13112c1dc0f669bbe80e7f84541edbafb72f3030d2ca7642c3c9d

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/__init__.py

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/ba/85/b4/7605820f00295f9f6645f7e83c84a46461a4fd467522dfcf638a3f3da1

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/__init__.pyi

@@ -0,0 +1,15 @@
+__version__: str
+
+from .providers import (
+    AbstractResolver as AbstractResolver,
+    AbstractProvider as AbstractProvider,
+)
+from .reporters import BaseReporter as BaseReporter
+from .resolvers import (
+    InconsistentCandidate as InconsistentCandidate,
+    RequirementsConflicted as RequirementsConflicted,
+    Resolver as Resolver,
+    ResolutionError as ResolutionError,
+    ResolutionImpossible as ResolutionImpossible,
+    ResolutionTooDeep as ResolutionTooDeep,
+)

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/compat/__init__.py

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/e3/b0/c4/4298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/compat/collections_abc.py

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/bb/2f/31/519f8d0c4c3dd7ab6e8145e6f0783008688c3b47fe45c767a647d77ceb

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/providers.py

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/6d/fc/c5/0d977b52a924012ee550cfc77986c0f87ce329f0e595efe99ffefdbe2a

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/providers.pyi

@@ -0,0 +1,44 @@
+from typing import (
+    Any,
+    Collection,
+    Generic,
+    Iterable,
+    Iterator,
+    Mapping,
+    Optional,
+    Protocol,
+    Union,
+)
+
+from .reporters import BaseReporter
+from .resolvers import RequirementInformation
+from .structs import KT, RT, CT, Matches
+
+class Preference(Protocol):
+    def __lt__(self, __other: Any) -> bool: ...
+
+class AbstractProvider(Generic[RT, CT, KT]):
+    def identify(self, requirement_or_candidate: Union[RT, CT]) -> KT: ...
+    def get_preference(
+        self,
+        identifier: KT,
+        resolutions: Mapping[KT, CT],
+        candidates: Mapping[KT, Iterator[CT]],
+        information: Mapping[KT, Iterator[RequirementInformation[RT, CT]]],
+    ) -> Preference: ...
+    def find_matches(
+        self,
+        identifier: KT,
+        requirements: Mapping[KT, Iterator[RT]],
+        incompatibilities: Mapping[KT, Iterator[CT]],
+    ) -> Matches: ...
+    def is_satisfied_by(self, requirement: RT, candidate: CT) -> bool: ...
+    def get_dependencies(self, candidate: CT) -> Iterable[RT]: ...
+
+class AbstractResolver(Generic[RT, CT, KT]):
+    base_exception = Exception
+    provider: AbstractProvider[RT, CT, KT]
+    reporter: BaseReporter
+    def __init__(
+        self, provider: AbstractProvider[RT, CT, KT], reporter: BaseReporter
+    ): ...

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/py.typed

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/e3/b0/c4/4298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/reporters.py

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/85/0b/ef/5eeb8404ec8458ef0a0df2ec58a5635f9e5414c014c0ed1864c369cc0c

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/reporters.pyi

@@ -0,0 +1,10 @@
+from typing import Any
+
+class BaseReporter:
+    def starting(self) -> Any: ...
+    def starting_round(self, index: int) -> Any: ...
+    def ending_round(self, index: int, state: Any) -> Any: ...
+    def ending(self, state: Any) -> Any: ...
+    def adding_requirement(self, requirement: Any, parent: Any) -> Any: ...
+    def backtracking(self, candidate: Any) -> Any: ...
+    def pinning(self, candidate: Any) -> Any: ...

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/resolvers.py

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/c1/3f/37/3c78815910a494bfa72c9d7ef2c936077c81234e91b1ed47d7572b3ac2

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/resolvers.pyi

@@ -0,0 +1,73 @@
+from typing import (
+    Collection,
+    Generic,
+    Iterable,
+    Iterator,
+    List,
+    Mapping,
+    Optional,
+)
+
+from .providers import AbstractProvider, AbstractResolver
+from .structs import (
+    CT,
+    KT,
+    RT,
+    DirectedGraph,
+    IterableView,
+)
+
+# This should be a NamedTuple, but Python 3.6 has a bug that prevents it.
+# https://stackoverflow.com/a/50531189/1376863
+class RequirementInformation(tuple, Generic[RT, CT]):
+    requirement: RT
+    parent: Optional[CT]
+
+class Criterion(Generic[RT, CT, KT]):
+    candidates: IterableView[CT]
+    information: Collection[RequirementInformation[RT, CT]]
+    incompatibilities: List[CT]
+    @classmethod
+    def from_requirement(
+        cls,
+        provider: AbstractProvider[RT, CT, KT],
+        requirement: RT,
+        parent: Optional[CT],
+    ) -> Criterion[RT, CT, KT]: ...
+    def iter_requirement(self) -> Iterator[RT]: ...
+    def iter_parent(self) -> Iterator[Optional[CT]]: ...
+    def merged_with(
+        self,
+        provider: AbstractProvider[RT, CT, KT],
+        requirement: RT,
+        parent: Optional[CT],
+    ) -> Criterion[RT, CT, KT]: ...
+    def excluded_of(self, candidates: List[CT]) -> Criterion[RT, CT, KT]: ...
+
+class ResolverException(Exception): ...
+
+class RequirementsConflicted(ResolverException, Generic[RT, CT, KT]):
+    criterion: Criterion[RT, CT, KT]
+
+class ResolutionError(ResolverException): ...
+
+class InconsistentCandidate(ResolverException, Generic[RT, CT, KT]):
+    candidate: CT
+    criterion: Criterion[RT, CT, KT]
+
+class ResolutionImpossible(ResolutionError, Generic[RT, CT]):
+    causes: List[RequirementInformation[RT, CT]]
+
+class ResolutionTooDeep(ResolutionError):
+    round_count: int
+
+class Result(Generic[RT, CT, KT]):
+    mapping: Mapping[KT, CT]
+    graph: DirectedGraph[Optional[KT]]
+    criteria: Mapping[KT, Criterion[RT, CT, KT]]
+
+class Resolver(AbstractResolver, Generic[RT, CT, KT]):
+    base_exception = ResolverException
+    def resolve(
+        self, requirements: Iterable[RT], max_rounds: int = 100
+    ) -> Result[RT, CT, KT]: ...

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/structs.py

@@ -0,0 +1 @@
+/home/runner/.cache/pip/pool/21/52/18/a1feac03f378644884d42d548734d7e3de5bac2367c82760aba098ab6f

venv/lib/python3.8/site-packages/pip/_vendor/resolvelib/structs.pyi

@@ -0,0 +1,35 @@
+from abc import ABCMeta
+from typing import (
+    Callable,
+    Container,
+    Generic,
+    Iterable,
+    Iterator,
+    Tuple,
+    TypeVar,
+    Union,
+)
+
+KT = TypeVar("KT")
+RT = TypeVar("RT")
+CT = TypeVar("CT")
+_T = TypeVar("_T")
+Matches = Union[Iterable[CT], Callable[[], Iterator[CT]]]
+
+class IterableView(Container[CT], Iterable[CT], metaclass=ABCMeta):
+    pass
+
+class DirectedGraph(Generic[KT]):
+    def __iter__(self) -> Iterator[KT]: ...
+    def __len__(self) -> int: ...
+    def __contains__(self, key: KT) -> bool: ...
+    def copy(self) -> "DirectedGraph[KT]": ...
+    def add(self, key: KT) -> None: ...
+    def remove(self, key: KT) -> None: ...
+    def connected(self, f: KT, t: KT) -> bool: ...
+    def connect(self, f: KT, t: KT) -> None: ...
+    def iter_edges(self) -> Iterable[Tuple[KT, KT]]: ...
+    def iter_children(self, key: KT) -> Iterable[KT]: ...
+    def iter_parents(self, key: KT) -> Iterable[KT]: ...
+
+def build_iter_view(matches: Matches) -> IterableView[CT]: ...