Enable ruff RUF100 rule (TheAlgorithms#11337)

Author: MaximSmolskiy

audio_filters/butterworth_filter.py

@@ -13,7 +13,7 @@
 def make_lowpass(
     frequency: int,
     samplerate: int,
-    q_factor: float = 1 / sqrt(2),  # noqa: B008
+    q_factor: float = 1 / sqrt(2),
 ) -> IIRFilter:
     """
     Creates a low-pass filter
@@ -43,7 +43,7 @@ def make_lowpass(
 def make_highpass(
     frequency: int,
     samplerate: int,
-    q_factor: float = 1 / sqrt(2),  # noqa: B008
+    q_factor: float = 1 / sqrt(2),
 ) -> IIRFilter:
     """
     Creates a high-pass filter
@@ -73,7 +73,7 @@ def make_highpass(
 def make_bandpass(
     frequency: int,
     samplerate: int,
-    q_factor: float = 1 / sqrt(2),  # noqa: B008
+    q_factor: float = 1 / sqrt(2),
 ) -> IIRFilter:
     """
     Creates a band-pass filter
@@ -104,7 +104,7 @@ def make_bandpass(
 def make_allpass(
     frequency: int,
     samplerate: int,
-    q_factor: float = 1 / sqrt(2),  # noqa: B008
+    q_factor: float = 1 / sqrt(2),
 ) -> IIRFilter:
     """
     Creates an all-pass filter
@@ -132,7 +132,7 @@ def make_peak(
     frequency: int,
     samplerate: int,
     gain_db: float,
-    q_factor: float = 1 / sqrt(2),  # noqa: B008
+    q_factor: float = 1 / sqrt(2),
 ) -> IIRFilter:
     """
     Creates a peak filter
@@ -164,7 +164,7 @@ def make_lowshelf(
     frequency: int,
     samplerate: int,
     gain_db: float,
-    q_factor: float = 1 / sqrt(2),  # noqa: B008
+    q_factor: float = 1 / sqrt(2),
 ) -> IIRFilter:
     """
     Creates a low-shelf filter
@@ -201,7 +201,7 @@ def make_highshelf(
     frequency: int,
     samplerate: int,
     gain_db: float,
-    q_factor: float = 1 / sqrt(2),  # noqa: B008
+    q_factor: float = 1 / sqrt(2),
 ) -> IIRFilter:
     """
     Creates a high-shelf filter

data_structures/binary_tree/basic_binary_tree.py

@@ -85,7 +85,7 @@ def depth(self) -> int:
         """
         return self._depth(self.root)
 
-    def _depth(self, node: Node | None) -> int:  # noqa: UP007
+    def _depth(self, node: Node | None) -> int:
         if not node:
             return 0
         return 1 + max(self._depth(node.left), self._depth(node.right))

data_structures/binary_tree/non_recursive_segment_tree.py

@@ -87,7 +87,7 @@ def update(self, p: int, v: T) -> None:
             p = p // 2
             self.st[p] = self.fn(self.st[p * 2], self.st[p * 2 + 1])
 
-    def query(self, l: int, r: int) -> T | None:  # noqa: E741
+    def query(self, l: int, r: int) -> T | None:
         """
         Get range query value in log(N) time
         :param l: left element index

data_structures/binary_tree/red_black_tree.py

@@ -152,7 +152,7 @@ def _insert_repair(self) -> None:
                     self.grandparent.color = 1
                     self.grandparent._insert_repair()
 
-    def remove(self, label: int) -> RedBlackTree:  # noqa: PLR0912
+    def remove(self, label: int) -> RedBlackTree:
         """Remove label from this tree."""
         if self.label == label:
             if self.left and self.right:

data_structures/binary_tree/segment_tree.py

@@ -35,7 +35,7 @@ def right(self, idx):
         """
         return idx * 2 + 1
 
-    def build(self, idx, l, r):  # noqa: E741
+    def build(self, idx, l, r):
         if l == r:
             self.st[idx] = self.A[l]
         else:
@@ -56,7 +56,7 @@ def update(self, a, b, val):
         """
         return self.update_recursive(1, 0, self.N - 1, a - 1, b - 1, val)
 
-    def update_recursive(self, idx, l, r, a, b, val):  # noqa: E741
+    def update_recursive(self, idx, l, r, a, b, val):
         """
         update(1, 1, N, a, b, v) for update val v to [a,b]
         """
@@ -83,7 +83,7 @@ def query(self, a, b):
         """
         return self.query_recursive(1, 0, self.N - 1, a - 1, b - 1)
 
-    def query_recursive(self, idx, l, r, a, b):  # noqa: E741
+    def query_recursive(self, idx, l, r, a, b):
         """
         query(1, 1, N, a, b) for query max of [a,b]
         """

data_structures/heap/min_heap.py

@@ -66,7 +66,7 @@ def build_heap(self, array):
     # this is min-heapify method
     def sift_down(self, idx, array):
         while True:
-            l = self.get_left_child_idx(idx)  # noqa: E741
+            l = self.get_left_child_idx(idx)
             r = self.get_right_child_idx(idx)
 
             smallest = idx

dynamic_programming/longest_common_subsequence.py

@@ -38,7 +38,7 @@ def longest_common_subsequence(x: str, y: str):
     n = len(y)
 
     # declaring the array for storing the dp values
-    l = [[0] * (n + 1) for _ in range(m + 1)]  # noqa: E741
+    l = [[0] * (n + 1) for _ in range(m + 1)]
 
     for i in range(1, m + 1):
         for j in range(1, n + 1):

dynamic_programming/longest_increasing_subsequence_o_nlogn.py

@@ -7,13 +7,13 @@
 from __future__ import annotations
 
 
-def ceil_index(v, l, r, key):  # noqa: E741
+def ceil_index(v, l, r, key):
     while r - l > 1:
         m = (l + r) // 2
         if v[m] >= key:
             r = m
         else:
-            l = m  # noqa: E741
+            l = m
     return r
 
 

graphs/articulation_points.py

@@ -1,5 +1,5 @@
 # Finding Articulation Points in Undirected Graph
-def compute_ap(l):  # noqa: E741
+def compute_ap(l):
     n = len(l)
     out_edge_count = 0
     low = [0] * n

graphs/dinic.py

@@ -37,7 +37,7 @@ def depth_first_search(self, vertex, sink, flow):
     # Here we calculate the flow that reaches the sink
     def max_flow(self, source, sink):
         flow, self.q[0] = 0, source
-        for l in range(31):  # noqa: E741  l = 30 maybe faster for random data
+        for l in range(31):  # l = 30 maybe faster for random data
             while True:
                 self.lvl, self.ptr = [0] * len(self.q), [0] * len(self.q)
                 qi, qe, self.lvl[source] = 0, 1, 1