Fix typos found by codespell (#202)

Author: DimitriPapadopoulos

src/resolvelib/providers.py

@@ -103,7 +103,7 @@ def find_matches(
         :param requirements: A mapping of requirements that all returned
             candidates must satisfy. Each key is an identifier, and the value
             an iterator of requirements for that dependency.
-        :param incompatibilities: A mapping of known incompatibile candidates of
+        :param incompatibilities: A mapping of known incompatible candidates of
             each dependency. Each key is an identifier, and the value an
             iterator of incompatibilities known to the resolver. All
             incompatibilities *must* be excluded from the return value.
@@ -180,7 +180,7 @@ def narrow_requirement_selection(
         Must return a non-empty subset of `identifiers`, with the default
         implementation being to return `identifiers` unchanged. Those `identifiers`
         will then be passed to the sort key `get_preference` to pick the most
-        prefered requirement to attempt to pin, unless `narrow_requirement_selection`
+        preferred requirement to attempt to pin, unless `narrow_requirement_selection`
         returns only 1 requirement, in which case that will be used without
         calling the sort key `get_preference`.
 

src/resolvelib/resolvers/abstract.py

@@ -36,7 +36,7 @@ def resolve(self, requirements: Iterable[RT], **kwargs: Any) -> Result[RT, CT, K
         """Take a collection of constraints, spit out the resolution result.
 
         This returns a representation of the final resolution state, with one
-        guarenteed attribute ``mapping`` that contains resolved candidates as
+        guaranteed attribute ``mapping`` that contains resolved candidates as
         values. The keys are their respective identifiers.
 
         :param requirements: A collection of constraints.

src/resolvelib/resolvers/resolution.py

@@ -410,10 +410,10 @@ def _backjump(self, causes: list[RequirementInformation[RT, CT]]) -> bool:
         return False
 
     def _extract_causes(
-        self, criteron: list[Criterion[RT, CT]]
+        self, criteria: list[Criterion[RT, CT]]
     ) -> list[RequirementInformation[RT, CT]]:
-        """Extract causes from list of criterion and deduplicate"""
-        return list({id(i): i for c in criteron for i in c.information}.values())
+        """Extract causes from list of criteria and deduplicate"""
+        return list({id(i): i for c in criteria for i in c.information}.values())
 
     def resolve(self, requirements: Iterable[RT], max_rounds: int) -> State[RT, CT, KT]:
         if self._states:

tests/functional/python/test_resolvers_python.py

@@ -235,7 +235,7 @@ def test_resolver(provider, reporter):
 
             unexpected_versions = set(versions).intersection(visited_versions[name])
             assert not unexpected_versions, (
-                f"Unexpcted versions visited {name}: {', '.join(unexpected_versions)}"
+                f"Unexpected versions visited {name}: {', '.join(unexpected_versions)}"
             )
 
 
@@ -270,5 +270,5 @@ def test_no_optimistic_backtracking_resolver(provider, reporter, monkeypatch):
 
             unexpected_versions = set(versions).intersection(visited_versions[name])
             assert not unexpected_versions, (
-                f"Unexpcted versions visited {name}: {', '.join(unexpected_versions)}"
+                f"Unexpected versions visited {name}: {', '.join(unexpected_versions)}"
             )

tests/functional/swift-package-manager/test_resolvers_swift.py

@@ -26,7 +26,7 @@ def _parse_version(s):
 
 
 def _is_version_allowed(version, ranges):
-    """Check version compatibility with Sematic Versioning."""
+    """Check version compatibility with Semantic Versioning."""
     for r in ranges:
         r = _parse_version(r)
         if r[0] != version[0]: