pytestarch 2.0.2__tar.gz → 3.0.0__tar.gz

{pytestarch-2.0.2 → pytestarch-3.0.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: pytestarch
-Version: 2.0.2
+Version: 3.0.0
 Summary: Test framework for software architecture based on imports between modules
 Home-page: https://github.com/zyskarch/pytestarch
 License: Apache-2.0
@@ -9,29 +9,23 @@ Author: zyskarch
 Author-email: zyskarch@gmail.com
 Maintainer: zyskarch
 Maintainer-email: zyskarch@gmail.com
-Requires-Python: >=3.8,<4.0
+Requires-Python: >=3.9,<4.0
 Classifier: Intended Audience :: Developers
 Classifier: License :: OSI Approved :: Apache Software License
 Classifier: Operating System :: OS Independent
 Classifier: Programming Language :: Python :: 3
-Classifier: Programming Language :: Python :: 3.8
 Classifier: Programming Language :: Python :: 3.9
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
-Classifier: Programming Language :: Python :: 3.8
 Classifier: Programming Language :: Python :: 3.9
 Classifier: Topic :: Software Development :: Testing
 Classifier: Topic :: Software Development :: Testing :: Unit
 Provides-Extra: visualization
-Requires-Dist: griffe (==0.26.0)
-Requires-Dist: matplotlib (>=3.5.3,<4.0.0) ; extra == "visualization"
-Requires-Dist: mkdocs-autorefs (==0.4.1)
-Requires-Dist: mkdocs-material-extensions (==1.3.1)
-Requires-Dist: mkdocstrings (==0.21.2)
-Requires-Dist: networkx (>=3.0,<4.0)
+Requires-Dist: matplotlib (>=3.9,<4.0) ; extra == "visualization"
+Requires-Dist: networkx (>=3.2,<4.0)
 Project-URL: Bug Tracker, https://github.com/zyskarch/pytestarch/issues
 Project-URL: Documentation, https://zyskarch.github.io/pytestarch/
 Project-URL: Repository, https://github.com/zyskarch/pytestarch

{pytestarch-2.0.2 → pytestarch-3.0.0}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "PyTestArch"
-version = "2.0.2"
+version = "3.0.0"
 description = "Test framework for software architecture based on imports between modules"
 authors = ["zyskarch <zyskarch@gmail.com>"]
 maintainers = ["zyskarch <zyskarch@gmail.com>"]
@@ -15,7 +15,6 @@ classifiers = [
     "Programming Language :: Python :: 3.11",
     "Programming Language :: Python :: 3.10",
     "Programming Language :: Python :: 3.9",
-    "Programming Language :: Python :: 3.8",
     "License :: OSI Approved :: Apache Software License",
     "Operating System :: OS Independent",
     "Intended Audience :: Developers",
@@ -27,26 +26,26 @@ classifiers = [
 "Bug Tracker" = "https://github.com/zyskarch/pytestarch/issues"
 
 [tool.poetry.dependencies]
-python = "^3.8"
-networkx = "^3.0"
-matplotlib = { version = "^3.5.3", optional = true }
-mkdocs-autorefs = "0.4.1"
-mkdocs-material-extensions = "1.3.1"
-mkdocstrings = "0.21.2"
-griffe = "0.26.0"
+python = "^3.9"
+networkx = "^3.2"
+matplotlib = { version = "^3.9", optional = true }
 
 [tool.poetry.extras]
 visualization = ["matplotlib"]
 
 [tool.poetry.dev-dependencies]
-mkdocs = "1.4.2"
-mkdocstrings-python = "0.9.0"
-mkdocs-material = "9.1.6"
-nox = "2022.8.7"
-pre-commit = "2.20.0"
-pytest = "^7.1.2"
-coverage = "^7.0.5"
-mike = "1.1.2"
+mkdocs = "1.6.0"
+mkdocstrings-python = "1.10.3"
+mkdocs-material = "9.5.25"
+mkdocs-autorefs = "1.0.1"
+mkdocs-material-extensions = "1.3.1"
+mkdocstrings = "0.25.1"
+griffe = "0.45.2"
+nox = "2024.4.15"
+pre-commit = "3.7.1"
+pytest = "^8.2.1"
+coverage = "^7.5.2"
+mike = "2.1.1"
 
 [build-system]
 requires = ["poetry-core>=1.0.0"]

{pytestarch-2.0.2 → pytestarch-3.0.0}/setup.py

@@ -21,18 +21,14 @@ package_data = \
 {'': ['*']}
 
 install_requires = \
-['griffe==0.26.0',
- 'mkdocs-autorefs==0.4.1',
- 'mkdocs-material-extensions==1.3.1',
- 'mkdocstrings==0.21.2',
- 'networkx>=3.0,<4.0']
+['networkx>=3.2,<4.0']
 
 extras_require = \
-{'visualization': ['matplotlib>=3.5.3,<4.0.0']}
+{'visualization': ['matplotlib>=3.9,<4.0']}
 
 setup_kwargs = {
     'name': 'pytestarch',
-    'version': '2.0.2',
+    'version': '3.0.0',
     'description': 'Test framework for software architecture based on imports between modules',
     'long_description': '# Welcome to PyTestArch\n\nPyTestArch is an open source library that allows users to define architectural rules and test their code against them. It is \ngenerally inspired by [ArchUnit](https://www.archunit.org/).\n\n## Installation Guide\nPyTestArch is available via [PyPI](https://pypi.org/project/pytestarch/) and can be installed e.g. via pip: `pip install pytestarch`. To also install the\noptional dependency matplotlib, which is required to draw the created dependency graphs, install `pytestarch[visualization]`\n\n## Usage Guide\nThree steps are required to test an architectural rule:\n\n1) Create an evaluable representation of the source code you want to test\n\n```\nfrom pytestarch import get_evaluable_architecture\n\nevaluable = get_evaluable_architecture("/home/dummy/project", "/home/dummy/project/src")\n```\nThis will scan all python files under /home/dummy/project/src for imports and build an internal representation that can\nlater be queried. The first parameter /home/dummy/project helps PyTestArch to differentiate between internal and external \ndependencies. This evaluable can be used for multiple architectural rule checks; if you are using [pytest](https://docs.pytest.org/en/7.1.x/),\nyou could use a fixture for this evaluable object.\n\n2) Define an architectural rule\n```\nfrom pytestarch import Rule\n\nrule = (\n    Rule() \n    .modules_that() \n    .are_named("project.src.moduleB") \n    .should_not() \n    .be_imported_by_modules_that() \n    .are_sub_modules_of("project.src.moduleA") \n)\n```\n\nThis rule represents the architectural requirements that a module named "project.src.moduleB" should not be imported by any module\nthat is a submodule of "project.src.moduleA", excluding "project.src.moduleA" itself.\n\n3) Evaluate your code against this rule\n\n```\nrule.assert_applies(evaluable)\n```\nThat\'s it!\n',
     'author': 'zyskarch',
@@ -45,7 +41,7 @@ setup_kwargs = {
     'package_data': package_data,
     'install_requires': install_requires,
     'extras_require': extras_require,
-    'python_requires': '>=3.8,<4.0',
+    'python_requires': '>=3.9,<4.0',
 }
 
 

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/diagram_extension/dependency_to_rule_converter.py

@@ -1,7 +1,5 @@
 from __future__ import annotations
 
-from typing import List, Set
-
 from pytestarch import Rule
 from pytestarch.diagram_extension.parsed_dependencies import ParsedDependencies
 from pytestarch.query_language.base_language import RuleApplier
@@ -11,7 +9,7 @@ class DependencyToRuleConverter:
     def __init__(self, should_only_rule: bool) -> None:
         self._should_only_rule = should_only_rule
 
-    def convert(self, dependencies: ParsedDependencies) -> List[RuleApplier]:
+    def convert(self, dependencies: ParsedDependencies) -> list[RuleApplier]:
         """Converts a parsed dependency object to a list of RuleAppliers.
         All explicit dependencies in the given object are converted to should (only) rules.
         All missing, but possible dependencies between the given modules are converted to 'should not' rules.
@@ -27,13 +25,13 @@ class DependencyToRuleConverter:
 
     def _convert_should_rules(
         self, dependencies: ParsedDependencies
-    ) -> List[RuleApplier]:
+    ) -> list[RuleApplier]:
         return [
             self._generate_rule(importer, importees)
             for importer, importees in dependencies.dependencies.items()
         ]
 
-    def _generate_rule(self, importer: str, importees: Set[str]) -> RuleApplier:
+    def _generate_rule(self, importer: str, importees: set[str]) -> RuleApplier:
         rule_subject = Rule().modules_that().are_named(importer)
 
         if self._should_only_rule:
@@ -46,7 +44,7 @@ class DependencyToRuleConverter:
     @classmethod
     def _convert_should_not_rules(
         cls, parsed_dependencies: ParsedDependencies
-    ) -> List[RuleApplier]:
+    ) -> list[RuleApplier]:
         # sorting in this method is necessary to generate a reliable order of returned rules
         # this helps with testing and overall consistency
         rules = []

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/diagram_extension/diagram_parser.py

@@ -5,7 +5,6 @@ from abc import ABC, abstractmethod
 from collections import defaultdict
 from dataclasses import dataclass
 from pathlib import Path
-from typing import Dict, Optional, Set, Tuple
 
 from pytestarch.diagram_extension.exceptions import PumlParsingError
 from pytestarch.diagram_extension.parsed_dependencies import ParsedDependencies
@@ -20,7 +19,7 @@ class DiagramParser(ABC):
 @dataclass(frozen=True)
 class Module:
     name: str
-    alias: Optional[str] = None
+    alias: str | None = None
 
 
 PUML_START_MARKER = "@startuml"
@@ -101,7 +100,7 @@ class PumlParser(DiagramParser):
     @classmethod
     def _retrieve_modules_declared_outside_dependencies(
         cls, content: str
-    ) -> Set[Module]:
+    ) -> set[Module]:
         module_group_1 = "m1"
         module_group_2 = "m2"
         alias_group = "alias"
@@ -135,7 +134,7 @@ class PumlParser(DiagramParser):
     def _retrieve_dependencies_and_inline_modules(
         cls,
         content: str,
-    ) -> Dict[str, Set[str]]:
+    ) -> dict[str, set[str]]:
         dependor_group_1 = "dependor1"
         dependor_group_2 = "dependor2"
 
@@ -168,9 +167,9 @@ class PumlParser(DiagramParser):
 
     def _unify(
         self,
-        modules: Set[Module],
-        dependencies: Dict[str, Set[str]],
-    ) -> Tuple[Set[str], Dict[str, Set[str]]]:
+        modules: set[Module],
+        dependencies: dict[str, set[str]],
+    ) -> tuple[set[str], dict[str, set[str]]]:
         unified_dependencies = {}
 
         all_aliases = self._get_modules_by_alias(modules)
@@ -190,9 +189,9 @@ class PumlParser(DiagramParser):
     @classmethod
     def _get_unified_modules(
         cls,
-        modules: Set[Module],
-        unified_dependencies: Dict[str, Set[str]],
-    ) -> Set[str]:
+        modules: set[Module],
+        unified_dependencies: dict[str, set[str]],
+    ) -> set[str]:
         all_modules = {m.name for m in modules}
 
         all_modules.update(set(unified_dependencies.keys()))
@@ -203,11 +202,11 @@ class PumlParser(DiagramParser):
         return all_modules
 
     @classmethod
-    def _get_modules_by_alias(cls, modules: Set[Module]) -> Dict[str, str]:
+    def _get_modules_by_alias(cls, modules: set[Module]) -> dict[str, str]:
         return {
             module.alias: module.name for module in modules if module.alias is not None
         }
 
     @classmethod
-    def _unify_module(cls, module: str, all_aliases: Dict[str, str]) -> str:
+    def _unify_module(cls, module: str, all_aliases: dict[str, str]) -> str:
         return all_aliases.get(module, module)

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/diagram_extension/diagram_rule.py

@@ -1,7 +1,6 @@
 from __future__ import annotations
 
 from pathlib import Path
-from typing import List, Optional
 
 from pytestarch import EvaluableArchitecture
 from pytestarch.diagram_extension.dependency_to_rule_converter import (
@@ -21,7 +20,7 @@ from pytestarch.query_language.multiple_rule_applier import MultipleRuleApplier
 class ModulePrefixer:
     @classmethod
     def prefix(
-        cls, parsed_dependencies: ParsedDependencies, prefix: Optional[str]
+        cls, parsed_dependencies: ParsedDependencies, prefix: str | None
     ) -> ParsedDependencies:
         modules = parsed_dependencies.all_modules
         dependencies = parsed_dependencies.dependencies
@@ -37,7 +36,7 @@ class ModulePrefixer:
         )
 
     @classmethod
-    def _add_prefix_to_module(cls, module_name: str, prefix: Optional[str]) -> str:
+    def _add_prefix_to_module(cls, module_name: str, prefix: str | None) -> str:
         if prefix is None:
             return module_name
 
@@ -59,8 +58,8 @@ class DiagramRule(FileRule, BaseModuleSpecifier, RuleApplier):
              should_only_rule: if True, edges between components will be converted into 'should only import' rules.
              If False, 'should import' rules will be generated instead.
         """
-        self._file_path: Optional[Path] = None
-        self._name_relative_to_root: Optional[str] = None
+        self._file_path: Path | None = None
+        self._name_relative_to_root: str | None = None
         self._should_only_rule = should_only_rule
 
     def from_file(self, file_path: Path) -> BaseModuleSpecifier:
@@ -94,11 +93,11 @@ class DiagramRule(FileRule, BaseModuleSpecifier, RuleApplier):
     ) -> ParsedDependencies:
         return ModulePrefixer.prefix(parsed_dependencies, self._name_relative_to_root)
 
-    def _convert_to_rules(self, dependencies: ParsedDependencies) -> List[RuleApplier]:
+    def _convert_to_rules(self, dependencies: ParsedDependencies) -> list[RuleApplier]:
         return DependencyToRuleConverter(self._should_only_rule).convert(dependencies)
 
     @classmethod
     def _apply_rules(
-        cls, rule_appliers: List[RuleApplier], evaluable: EvaluableArchitecture
+        cls, rule_appliers: list[RuleApplier], evaluable: EvaluableArchitecture
     ) -> None:
         MultipleRuleApplier(rule_appliers).assert_applies(evaluable)

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/diagram_extension/parsed_dependencies.py

@@ -1,10 +1,9 @@
 from __future__ import annotations
 
 from dataclasses import dataclass
-from typing import Dict, Set
 
 
 @dataclass(frozen=True)
 class ParsedDependencies:
-    all_modules: Set[str]
-    dependencies: Dict[str, Set[str]]
+    all_modules: set[str]
+    dependencies: dict[str, set[str]]

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/eval_structure/breadth_first_searches.py

@@ -1,7 +1,5 @@
 from __future__ import annotations
 
-from typing import List, Set
-
 from pytestarch.eval_structure.evaluable_architecture import Dependency, ModuleFilter
 from pytestarch.eval_structure.evaluable_structures import AbstractGraph, AbstractNode
 from pytestarch.eval_structure.utils import get_node, get_parent_nodes, to_modules
@@ -9,7 +7,7 @@ from pytestarch.eval_structure.utils import get_node, get_parent_nodes, to_modul
 
 def get_dependency_between_modules(
     graph: AbstractGraph, dependent: ModuleFilter, dependent_upon: ModuleFilter
-) -> List[Dependency]:
+) -> list[Dependency]:
     dependent_node = get_node(dependent)
     dependent_upon_nodes = get_all_submodules_of(graph, dependent_upon)
 
@@ -44,8 +42,8 @@ def get_dependency_between_modules(
 
 
 def any_dependency_to_module_other_than(  # noqa: C901
-    graph: AbstractGraph, dependent: ModuleFilter, dependent_upons: Set[ModuleFilter]
-) -> List[Dependency]:
+    graph: AbstractGraph, dependent: ModuleFilter, dependent_upons: set[ModuleFilter]
+) -> list[Dependency]:
     # nodes to exclude are nodes that once reached will not have their submodules analysed next
     nodes_to_exclude = set()
     for dependent_upon in dependent_upons:
@@ -109,8 +107,8 @@ def any_dependency_to_module_other_than(  # noqa: C901
 
 
 def any_other_dependency_to_module_than(  # noqa: C901
-    graph: AbstractGraph, dependents: Set[ModuleFilter], dependent_upon: ModuleFilter
-) -> List[Dependency]:
+    graph: AbstractGraph, dependents: set[ModuleFilter], dependent_upon: ModuleFilter
+) -> list[Dependency]:
     # submodules of the dependent upon module do not count as an import that is not the dependent upon module
     # submodules of and including the dependent do not count as allowed imports
 
@@ -177,7 +175,7 @@ def any_other_dependency_to_module_than(  # noqa: C901
 
 def get_all_submodules_of(
     graph: AbstractGraph, module: ModuleFilter
-) -> Set[AbstractNode]:
+) -> set[AbstractNode]:
     """Returns all submodules of a given module.
 
     Args:

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/eval_structure/evaluable_architecture.py

@@ -4,19 +4,9 @@ from __future__ import annotations
 
 from abc import ABC, abstractmethod
 from bisect import bisect
+from collections.abc import Iterable, Mapping, Sequence
 from dataclasses import dataclass
-from typing import (
-    Any,
-    Dict,
-    Iterable,
-    List,
-    Mapping,
-    Optional,
-    Protocol,
-    Sequence,
-    Tuple,
-    Union,
-)
+from typing import Any, Protocol
 
 from pytestarch.eval_structure.exceptions import LayerMismatch
 
@@ -28,11 +18,11 @@ class LayerMapping:
     def __init__(
         self,
         layer_mapping_for_module_filters: Mapping[
-            Layer, Union[Sequence[ModuleFilter], Sequence[Module]]
+            Layer, Sequence[ModuleFilter] | Sequence[Module]
         ],
     ) -> None:
         self._layer_mapping_for_module_filters = layer_mapping_for_module_filters
-        self._module_filter_mapping: Mapping[Union[ModuleFilter, Module], Layer] = {
+        self._module_filter_mapping: Mapping[ModuleFilter | Module, Layer] = {
             module: layer
             for layer, modules in layer_mapping_for_module_filters.items()
             for module in modules
@@ -54,7 +44,7 @@ class LayerMapping:
             if key.identifier == module.identifier
         ][0]
 
-    def _get_layer_or_none(self, module_name: str) -> Optional[Layer]:
+    def _get_layer_or_none(self, module_name: str) -> Layer | None:
         layers = [
             self._module_filter_mapping[key]
             for key in self._module_filter_mapping
@@ -66,7 +56,7 @@ class LayerMapping:
 
         return None
 
-    def get_layer_for_module_name(self, module_name: str) -> Optional[Layer]:
+    def get_layer_for_module_name(self, module_name: str) -> Layer | None:
         """Attempts to find the layer the given module belongs to. If the module does not appear in the
         layer definition itself, it is checked whether the module is a submodule of one of the modules in the layer
         definition. If so, the layer of the parent module is returned. Otherwise, None is returned.
@@ -219,14 +209,14 @@ class ModuleGroup(Module):
         return False
 
 
-Dependency = Tuple[Module, Module]
+Dependency = tuple[Module, Module]
 # key: user-requested dependency
 # values: list of exact modules that show this dependency
-ExplicitlyRequestedDependenciesByBaseModules = Dict[Dependency, List[Dependency]]
+ExplicitlyRequestedDependenciesByBaseModules = dict[Dependency, list[Dependency]]
 # key: module that either has dependencies or that others are dependent on that were not explicitly requested
 # via the rule the user has specified
 # value: importer and importee that were not found
-NotExplicitlyRequestedDependenciesByBaseModule = Dict[Module, List[Dependency]]
+NotExplicitlyRequestedDependenciesByBaseModule = dict[Module, list[Dependency]]
 
 
 class EvaluableArchitecture(Protocol):
@@ -311,6 +301,6 @@ class EvaluableArchitecture(Protocol):
         raise NotImplementedError()
 
     @property
-    def modules(self) -> List[str]:
+    def modules(self) -> list[str]:
         """Return names of all modules that are present in this architecture."""
         raise NotImplementedError()

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/eval_structure/evaluable_graph.py

@@ -4,8 +4,9 @@ and edges to its subclasses in a template pattern.
 
 from __future__ import annotations
 
+from collections.abc import Iterable, Sequence
 from itertools import product
-from typing import Any, Iterable, List, Sequence
+from typing import Any
 
 from pytestarch.eval_structure.breadth_first_searches import (
     any_dependency_to_module_other_than,
@@ -91,5 +92,5 @@ class EvaluableArchitectureGraph(EvaluableArchitecture):
         self._graph.draw(**kwargs)  # type: ignore
 
     @property
-    def modules(self) -> List[str]:
+    def modules(self) -> list[str]:
         return self._graph.nodes

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/eval_structure/evaluable_structures.py

@@ -1,14 +1,13 @@
 from __future__ import annotations
 
 from abc import ABC, abstractmethod
-from typing import List
 
 AbstractNode = str
 
 
 class AbstractGraph(ABC):
     @abstractmethod
-    def direct_successor_nodes(self, node: AbstractNode) -> List[AbstractNode]:
+    def direct_successor_nodes(self, node: AbstractNode) -> list[AbstractNode]:
         raise NotImplementedError()
 
     @abstractmethod
@@ -18,10 +17,10 @@ class AbstractGraph(ABC):
         raise NotImplementedError()
 
     @abstractmethod
-    def direct_predecessor_nodes(self, node: AbstractNode) -> List[AbstractNode]:
+    def direct_predecessor_nodes(self, node: AbstractNode) -> list[AbstractNode]:
         raise NotImplementedError()
 
     @property
     @abstractmethod
-    def nodes(self) -> List[AbstractNode]:
+    def nodes(self) -> list[AbstractNode]:
         raise NotImplementedError()

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/eval_structure/module_name_converter.py

@@ -2,7 +2,8 @@ from __future__ import annotations
 
 import re
 from collections import defaultdict
-from typing import Dict, List, Sequence, Tuple, cast
+from collections.abc import Sequence
+from typing import cast
 
 from pytestarch import EvaluableArchitecture
 from pytestarch.eval_structure.breadth_first_searches import get_all_submodules_of
@@ -22,7 +23,7 @@ class ModuleNameConverter:
     @classmethod
     def convert(
         cls, modules: Sequence[ModuleFilter], arch: EvaluableArchitecture
-    ) -> Tuple[Sequence[ModuleFilter], Dict[str, List[Module]]]:
+    ) -> tuple[Sequence[ModuleFilter], dict[str, list[Module]]]:
         """Converts each regex pattern that serves to identify module names into actual modules that match this pattern.
 
         Args:
@@ -88,8 +89,8 @@ class ModuleNameConverter:
     @classmethod
     def _split_modules_by_presence_of_regex_pattern(
         cls, modules: Sequence[ModuleFilter]
-    ) -> Tuple[List[ModuleNameRegexFilter], Sequence[ModuleFilter]]:
-        modules_with_regex_name_pattern: List[ModuleNameRegexFilter] = []
+    ) -> tuple[list[ModuleNameRegexFilter], Sequence[ModuleFilter]]:
+        modules_with_regex_name_pattern: list[ModuleNameRegexFilter] = []
         other_modules = []
 
         for module in modules:

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/eval_structure/networkxgraph.py

@@ -3,7 +3,8 @@
 from __future__ import annotations
 
 import re
-from typing import Any, Dict, List, Optional, Sequence, Tuple
+from collections.abc import Sequence
+from typing import Any
 
 import networkx as nx
 from networkx import draw_networkx, has_path, spring_layout
@@ -33,9 +34,9 @@ class NetworkxGraph(AbstractGraph):
 
     def __init__(
         self,
-        all_modules: List[Node],
+        all_modules: list[Node],
         imports: Sequence[Import],
-        level_limit: Optional[int] = None,
+        level_limit: int | None = None,
     ) -> None:
         """
         Args:
@@ -85,7 +86,7 @@ class NetworkxGraph(AbstractGraph):
 
     def _add_edges_within_module_hierarchy(
         self,
-        parent_modules: List[Node],
+        parent_modules: list[Node],
         child: Node,
     ) -> None:
         """Create edges between a node and its parent recursively until the parent-less parent is reached.
@@ -163,14 +164,14 @@ class NetworkxGraph(AbstractGraph):
         return self._graph.number_of_nodes()
 
     @property
-    def nodes(self) -> List[Node]:
+    def nodes(self) -> list[Node]:
         return list(self._graph.nodes)
 
     @property
-    def edges(self) -> List[Tuple[Node, Node]]:
+    def edges(self) -> list[tuple[Node, Node]]:
         return list(self._graph.edges)
 
-    def direct_predecessor_nodes(self, node: Node) -> List[Node]:
+    def direct_predecessor_nodes(self, node: Node) -> list[Node]:
         """Returns all nodes that have a directed edge towards the given node.
 
         Args:
@@ -181,7 +182,7 @@ class NetworkxGraph(AbstractGraph):
         """
         return sorted(self._graph.predecessors(node))
 
-    def direct_successor_nodes(self, node: Node) -> List[Node]:
+    def direct_successor_nodes(self, node: Node) -> list[Node]:
         """Returns all nodes that the given node has a directed edge towards.
 
         Args:
@@ -245,8 +246,8 @@ class NetworkxGraph(AbstractGraph):
 
         draw_networkx(self._graph, **kwargs)
 
-    def _create_plot_labels_with_alias(self, aliases: Dict[str, str]) -> Dict[str, str]:
-        module_names: List[str] = list(self._graph.nodes)
+    def _create_plot_labels_with_alias(self, aliases: dict[str, str]) -> dict[str, str]:
+        module_names: list[str] = list(self._graph.nodes)
         self._assert_aliased_modules_exist(aliases, module_names)
 
         # longest name first so aliases for submodule take priority over aliases  for
@@ -265,8 +266,8 @@ class NetworkxGraph(AbstractGraph):
 
     def _assert_aliased_modules_exist(
         self,
-        aliases: Dict[str, str],
-        module_names: List[str],
+        aliases: dict[str, str],
+        module_names: list[str],
     ) -> None:
         for module in aliases:
             if module not in module_names:
@@ -278,8 +279,8 @@ class NetworkxGraph(AbstractGraph):
     def _create_label(
         self,
         module_name: str,
-        sorted_aliased_modules: List[str],
-        aliases: Dict[str, str],
+        sorted_aliased_modules: list[str],
+        aliases: dict[str, str],
     ) -> str:
         try:
             most_specific_aliased_module = next(

{pytestarch-2.0.2 → pytestarch-3.0.0}/src/pytestarch/eval_structure/types.py

@@ -1,7 +1,6 @@
 from __future__ import annotations
 
 from abc import ABC, abstractmethod
-from typing import List
 
 
 class Import(ABC):
@@ -18,7 +17,7 @@ class Import(ABC):
         """
         return self._importer
 
-    def importer_parent_modules(self) -> List[str]:
+    def importer_parent_modules(self) -> list[str]:
         """Returns names of all parent modules of the importing module.
 
         Returns:
@@ -36,7 +35,7 @@ class Import(ABC):
         raise NotImplementedError()
 
     @abstractmethod
-    def importee_parent_modules(self) -> List[str]:
+    def importee_parent_modules(self) -> list[str]:
         """Returns names of all parent modules of the imported module.
 
         Returns:
@@ -51,7 +50,7 @@ class Import(ABC):
         return f"{prefix}.{value}"
 
 
-def get_parent_modules(module: str) -> List[str]:
+def get_parent_modules(module: str) -> list[str]:
     """Calculates all parent modules of a given module.
 
     Example: source root is a
@@ -66,7 +65,7 @@ def get_parent_modules(module: str) -> List[str]:
     """
     parent_modules = []
 
-    parent: List[str] = []
+    parent: list[str] = []
 
     for char in module:
         if char == ".":