More ruff rules ANN for type annotations (#15443)

Author: cclauss

data_structures/binary_tree/serialize_deserialize_binary_tree.py

@@ -19,7 +19,7 @@ class TreeNode:
     left: TreeNode | None = None
     right: TreeNode | None = None
 
-    def __post_init__(self):
+    def __post_init__(self) -> None:
         if not isinstance(self.value, int):
             raise TypeError("Value must be an integer.")
 

data_structures/heap/min_heap.py

@@ -10,7 +10,7 @@ def __init__(self, name, val) -> None:
     def __str__(self) -> str:
         return f"{self.__class__.__name__}({self.name}, {self.val})"
 
-    def __lt__(self, other):
+    def __lt__(self, other) -> bool:
         return self.val < other.val
 
 

data_structures/linked_list/has_loop.py

@@ -1,5 +1,6 @@
 from __future__ import annotations
 
+from collections.abc import Iterator
 from typing import Any
 
 
@@ -12,7 +13,7 @@ def __init__(self, data: Any) -> None:
         self.data: Any = data
         self.next_node: Node | None = None
 
-    def __iter__(self):
+    def __iter__(self) -> Iterator[Any]:
         node = self
         visited = set()
         while node:

divide_and_conquer/convex_hull.py

@@ -48,30 +48,30 @@ class Point:
     def __init__(self, x, y) -> None:
         self.x, self.y = float(x), float(y)
 
-    def __eq__(self, other):
+    def __eq__(self, other) -> bool:
         return self.x == other.x and self.y == other.y
 
-    def __ne__(self, other):
+    def __ne__(self, other) -> bool:
         return not self == other
 
-    def __gt__(self, other):
+    def __gt__(self, other) -> bool:
         if self.x > other.x:
             return True
         elif self.x == other.x:
             return self.y > other.y
         return False
 
-    def __lt__(self, other):
+    def __lt__(self, other) -> bool:
         return not self > other
 
-    def __ge__(self, other):
+    def __ge__(self, other) -> bool:
         if self.x > other.x:
             return True
         elif self.x == other.x:
             return self.y >= other.y
         return False
 
-    def __le__(self, other):
+    def __le__(self, other) -> bool:
         if self.x < other.x:
             return True
         elif self.x == other.x:
@@ -81,7 +81,7 @@ def __le__(self, other):
     def __repr__(self) -> str:
         return f"({self.x}, {self.y})"
 
-    def __hash__(self):
+    def __hash__(self) -> int:
         return hash(self.x)
 
 

graphs/frequent_pattern_graph_miner.py

@@ -8,6 +8,7 @@
 
 URL: https://www.researchgate.net/publication/235255851
 """
+# ruff: noqa: Q000
 
 # fmt: off
 edge_array = [

graphs/minimum_spanning_tree_boruvka.py

@@ -82,7 +82,7 @@ def get_vertices(self):
         return self.adjacency.keys()
 
     @staticmethod
-    def build(vertices=None, edges=None):
+    def build(vertices=None, edges=None) -> "Graph":
         """
         Builds a graph from the given set of vertices and edges
 
@@ -91,7 +91,7 @@ def build(vertices=None, edges=None):
         if vertices is None:
             vertices = []
         if edges is None:
-            edge = []
+            edges = []
         for vertex in vertices:
             g.add_vertex(vertex)
         for edge in edges:
@@ -147,7 +147,7 @@ def union(self, item1, item2):
             return None
 
     @staticmethod
-    def boruvka_mst(graph):
+    def boruvka_mst(graph) -> "Graph":
         """
         Implementation of Boruvka's algorithm
         >>> g = Graph()

graphs/prim.py

@@ -27,7 +27,7 @@ def __init__(self, id_) -> None:
         self.neighbors = []
         self.edges = {}  # {vertex:distance}
 
-    def __lt__(self, other):
+    def __lt__(self, other) -> bool:
         """Comparison rule to < operator."""
         return self.key < other.key
 

hashes/sha1.py

@@ -50,7 +50,7 @@ def __init__(self, data) -> None:
         self.h = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]
 
     @staticmethod
-    def rotate(n, b):
+    def rotate(n, b) -> int:
         """
         Static method to be used inside other methods. Left rotates n by b.
         >>> SHA1Hash('').rotate(12,2)

machine_learning/astar.py

@@ -36,7 +36,7 @@ def __init__(self) -> None:
     wrong results.
     """
 
-    def __eq__(self, cell):
+    def __eq__(self, cell) -> bool:
         return self.position == cell.position
 
     def showcell(self) -> None:

machine_learning/decision_tree.py

@@ -156,7 +156,7 @@ class TestDecisionTree:
     """Decision Tres test class"""
 
     @staticmethod
-    def helper_mean_squared_error_test(labels, prediction):
+    def helper_mean_squared_error_test(labels, prediction) -> float:
         """
         helper_mean_squared_error_test:
         @param labels: a one dimensional numpy array