Add ruff as linter + Remove support for Python 3.8 and 3.9 (#402)

* feat: nested_key_dict to tree to support child_key=None

* feat: tree to nested_key_dict to support child_key=None

* feat: add ruff

* feat: add ruff

* docs: update CHANGELOG

* feat: add exclusions

* Remove support for 3.8, 3.9

* Remove support for 3.8, 3.9

* Update CHANGELOG.md

* Upgrade version

* Upgrade version

Author: kayjan

.github/workflows/pytest.yml

@@ -12,7 +12,7 @@ jobs:
     runs-on: ubuntu-latest
     strategy:
       matrix:
-        python-version: ["3.8", "3.9", "3.10", "3.11", "3.12", "3.13"]
+        python-version: ["3.10", "3.11", "3.12", "3.13"]
       fail-fast: false
     steps:
       - uses: actions/checkout@v3

CHANGELOG.md

@@ -5,8 +5,12 @@ The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
 ## [Unreleased]
+
+## [0.31.0] - 2025-09-11
 ### Changed:
+- General: Remove support for Python 3.8, 3.9.
 - Docs: Enhanced docs.
+- Docs: Add ruff.
 
 ## [0.30.1] - 2025-09-10
 ### Added:
@@ -815,7 +819,8 @@ ignore null attribute columns.
 - Utility Iterator: Tree traversal methods.
 - Workflow To Do App: Tree use case with to-do list implementation.
 
-[Unreleased]: https://github.com/kayjan/bigtree/compare/0.30.1...HEAD
+[Unreleased]: https://github.com/kayjan/bigtree/compare/0.31.0...HEAD
+[0.31.0]: https://github.com/kayjan/bigtree/compare/0.30.1...0.31.0
 [0.30.1]: https://github.com/kayjan/bigtree/compare/0.30.0...0.30.1
 [0.30.0]: https://github.com/kayjan/bigtree/compare/0.29.2...0.30.0
 [0.29.2]: https://github.com/kayjan/bigtree/compare/0.29.1...0.29.2

bigtree/__init__.py

@@ -1,4 +1,4 @@
-__version__ = "0.30.1"
+__version__ = "0.31.0"
 
 from bigtree.binarytree.construct import list_to_binarytree
 from bigtree.dag.construct import dataframe_to_dag, dict_to_dag, list_to_dag

bigtree/node/basenode.py

@@ -239,7 +239,7 @@ def parent(self: T, new_parent: T) -> None:
             self.__parent = current_parent
             if current_child_idx is not None:
                 current_parent.__children.insert(current_child_idx, self)
-            raise exceptions.TreeError(exc_info)
+            raise exceptions.TreeError(exc_info) from None
 
     def __pre_assign_parent(self, new_parent: T) -> None:
         """Custom method to check before attaching parent. Can be overridden with `_BaseNode__pre_assign_parent()`.
@@ -386,7 +386,7 @@ def children(self: T, new_children: List[T] | Tuple[T] | Set[T]) -> None:
             self.__children = current_children
             for child in current_children:
                 child.__parent = self
-            raise exceptions.TreeError(exc_info)
+            raise exceptions.TreeError(exc_info) from None
 
     @children.deleter
     def children(self) -> None:

bigtree/node/binarynode.py

@@ -212,7 +212,7 @@ def parent(self: T, new_parent: Optional[T]) -> None:
             self.__parent = current_parent
             if current_child_idx is not None:
                 current_parent.__children[current_child_idx] = self
-            raise exceptions.TreeError(exc_info)
+            raise exceptions.TreeError(exc_info) from None
 
     def __pre_assign_parent(self: T, new_parent: Optional[T]) -> None:
         """Custom method to check before attaching parent. Can be overridden with `_BinaryNode__pre_assign_parent()`.
@@ -345,7 +345,7 @@ def children(self: T, _new_children: List[Optional[T]]) -> None:
             for child in current_children:
                 if child:
                     child.__parent = self
-            raise exceptions.TreeError(exc_info)
+            raise exceptions.TreeError(exc_info) from None
 
     @children.deleter
     def children(self) -> None:

bigtree/node/dagnode.py

@@ -234,7 +234,7 @@ def parents(self: T, new_parents: List[T]) -> None:
                 if new_parent not in current_parents:
                     self.__parents.remove(new_parent)
                     new_parent.__children.remove(self)
-            raise exceptions.TreeError(exc_info)
+            raise exceptions.TreeError(exc_info) from None
 
     def __pre_assign_parents(self: T, new_parents: List[T]) -> None:
         """Custom method to check before attaching parent. Can be overridden with `_DAGNode__pre_assign_parent()`.
@@ -332,7 +332,7 @@ def children(self: T, new_children: Iterable[T]) -> None:
                 if new_child not in current_children:
                     new_child.__parents.remove(self)
                     self.__children.remove(new_child)
-            raise exceptions.TreeError(exc_info)
+            raise exceptions.TreeError(exc_info) from None
 
     @children.deleter
     def children(self) -> None:

bigtree/tree/export/_stdout.py

@@ -14,6 +14,8 @@
 
 T = TypeVar("T", bound=node.Node)
 
+default_vstyle = BaseVPrintStyle.from_style("const")
+
 
 def calculate_stem_pos(length: int) -> int:
     """Calculate stem position based on length.
@@ -33,9 +35,7 @@ def format_node(
     _node: T,
     alias: str = "node_name",
     intermediate_node_name: bool = True,
-    style: Union[BaseHPrintStyle, BaseVPrintStyle] = BaseVPrintStyle.from_style(
-        "const"
-    ),
+    style: Union[BaseHPrintStyle, BaseVPrintStyle] = default_vstyle,
     border_style: Optional[BorderStyle] = None,
     min_width: int = 0,
     add_buffer: bool = True,

bigtree/tree/export/_yield_tree.py

@@ -255,7 +255,7 @@ def recursive(
 
         result_children, result_idx = [], []
         cumulative_height = 0
-        for idx, child in enumerate(children):
+        for child in children:
             result_child, result_branch_idx = self.recursive(child, _cur_depth + 1)
             result_idx.append(cumulative_height + result_branch_idx)
             cumulative_height += len(result_child)
@@ -296,7 +296,7 @@ def recursive(
             line_prefix = space * (first + 1)
             line = space * first + style_class.FIRST_CHILD
             line_suffix = space * first + style_class.BRANCH
-            for idx, (bef, aft) in enumerate(zip(result_idx, result_idx[1:])):
+            for bef, aft in zip(result_idx, result_idx[1:], strict=False):
                 line_prefix += space * (aft - bef)
                 line += (
                     style_class.STEM * (aft - bef - 1) + style_class.SUBSEQUENT_CHILD
@@ -402,7 +402,7 @@ def recursive(self, _node: Union[T, node.Node]) -> Tuple[List[str], int]:
 
         result_children, result_idx = [], []
         cumulative_width = 0
-        for idx, child in enumerate(children):
+        for child in children:
             result_child, result_branch_idx = self.recursive(child)
             result_idx.append(cumulative_width + result_branch_idx)
             cumulative_width += len(result_child[0]) + self.spacing
@@ -424,7 +424,7 @@ def recursive(self, _node: Union[T, node.Node]) -> Tuple[List[str], int]:
             line = space * first + style_class.BRANCH + space * (total - first - 1)
         else:
             line = space * first + style_class.FIRST_CHILD
-            for idx, (bef, aft) in enumerate(zip(result_idx, result_idx[1:])):
+            for bef, aft in zip(result_idx, result_idx[1:], strict=False):
                 line += style_class.STEM * (aft - bef - 1)
                 line += style_class.SUBSEQUENT_CHILD
             line = line[:-1] + style_class.LAST_CHILD

bigtree/tree/export/images.py

@@ -175,7 +175,11 @@ def tree_to_dot(
 
         name_dict: Dict[str, List[str]] = collections.defaultdict(list)
 
-        def _recursive_append(parent_name: Optional[str], child_node: T) -> None:
+        def _recursive_append(
+            parent_name: Optional[str],
+            child_node: T,
+            _name_dict: Dict[str, List[str]] = name_dict,
+        ) -> None:
             """Recursively iterate through node and its children to export to dot by creating node and edges.
 
             Args:
@@ -197,10 +201,10 @@ def _recursive_append(parent_name: Optional[str], child_node: T) -> None:
                     _edge_style.update(edge_attr(child_node))  # type: ignore
 
             child_label = child_node.node_name
-            if child_node.path_name not in name_dict[child_label]:  # pragma: no cover
-                name_dict[child_label].append(child_node.path_name)
+            if child_node.path_name not in _name_dict[child_label]:  # pragma: no cover
+                _name_dict[child_label].append(child_node.path_name)
             child_name = child_label + str(
-                name_dict[child_label].index(child_node.path_name)
+                _name_dict[child_label].index(child_node.path_name)
             )
             pydot_child_node = pydot.Node(
                 name=child_name, label=child_label, **_node_style
@@ -227,10 +231,10 @@ def _load_font(
         font_family = urlopen(dejavusans_url)
     try:
         font = ImageFont.truetype(font_family, font_size)
-    except OSError:
+    except OSError as err:
         raise ValueError(
             f"Font file {font_family} is not found, set `font_family` parameter to point to a valid .ttf file."
-        )
+        ) from err
     return font
 
 
@@ -349,7 +353,7 @@ def get_node_text(_node: T, _node_content: str) -> str:
         norm = Normalize(vmin=min(cmap_range), vmax=max(cmap_range))
         cmap_range_list = [norm(c) for c in cmap_range]
         cmap_colour_list = rect_fill(cmap_range_list)  # type: ignore
-        cmap_dict = dict(zip(cmap_range_list, cmap_colour_list))
+        cmap_dict = dict(zip(cmap_range_list, cmap_colour_list, strict=True))
 
     # Get x, y, coordinates and height, width of diagram
     from bigtree.utils.plot import reingold_tilford

bigtree/tree/helper.py

@@ -634,7 +634,7 @@ def get_tree_diff(
 
     # Check tree structure difference
     data_diff = data_diff_all.dropna(subset=[suffix_col])
-    path_to_suffix = dict(zip(data_diff[path_col], data_diff[suffix_col]))
+    path_to_suffix = dict(zip(data_diff[path_col], data_diff[suffix_col], strict=True))
 
     # Check tree attribute difference
     path_attr_diff: Dict[str, Dict[str, Any]] = {}