ruff rules RET for return statements (#15301)

* updating DIRECTORY.md

* ruff rules RET for return statements

---------

Co-authored-by: cclauss <cclauss@users.noreply.github.com>

Author: cclauss

.pre-commit-config.yaml

@@ -34,13 +34,13 @@ repos:
       - id: pyproject-fmt
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.16.6
+    rev: v0.16.7
     hooks:
       - id: ruff-check
       - id: ruff-format
 
   - repo: https://github.com/rvben/rumdl-pre-commit
-    rev: v0.2.69
+    rev: v0.2.73
     hooks:
       - id: rumdl-fmt
       - id: rumdl
@@ -55,7 +55,7 @@ repos:
         pass_filenames: false
 
   - repo: https://github.com/astral-sh/uv-pre-commit
-    rev: 0.12.11
+    rev: 0.12.13
     hooks:
       - id: uv-lock
 

DIRECTORY.md

@@ -1372,6 +1372,7 @@
 ## [Sorts](sorts)
   * [Adaptive Merge Sort](sorts/adaptive_merge_sort.py)
   * [Bead Sort](sorts/bead_sort.py)
+  * [Benchmark Sorts](sorts/benchmark_sorts.py)
   * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
   * [Bitonic Sort](sorts/bitonic_sort.py)
   * [Bogo Sort](sorts/bogo_sort.py)

bit_manipulation/binary_count_setbits.py

@@ -30,7 +30,7 @@ def binary_count_setbits(a: int) -> int:
     """
     if a < 0:
         raise ValueError("Input value must be a positive integer")
-    elif isinstance(a, float):
+    if isinstance(a, float):
         raise TypeError("Input value must be a 'int' type")
     return bin(a).count("1")
 

bit_manipulation/binary_count_trailing_zeros.py

@@ -33,7 +33,7 @@ def binary_count_trailing_zeros(a: int) -> int:
     """
     if a < 0:
         raise ValueError("Input value must be a positive integer")
-    elif isinstance(a, float):
+    if isinstance(a, float):
         raise TypeError("Input value must be a 'int' type")
     return 0 if (a == 0) else int(log2(a & -a))
 

ciphers/enigma_machine2.py

@@ -134,10 +134,10 @@ def _plugboard(pbstring: str) -> dict[str, str]:
     if not isinstance(pbstring, str):
         msg = f"Plugboard setting isn't type string ({type(pbstring)})"
         raise TypeError(msg)
-    elif len(pbstring) % 2 != 0:
+    if len(pbstring) % 2 != 0:
         msg = f"Odd number of symbols ({len(pbstring)})"
         raise Exception(msg)
-    elif pbstring == "":
+    if pbstring == "":
         return {}
 
     pbstring.replace(" ", "")
@@ -148,11 +148,10 @@ def _plugboard(pbstring: str) -> dict[str, str]:
         if i not in abc:
             msg = f"'{i}' not in list of symbols"
             raise Exception(msg)
-        elif i in tmppbl:
+        if i in tmppbl:
             msg = f"Duplicate symbol ({i})"
             raise Exception(msg)
-        else:
-            tmppbl.add(i)
+        tmppbl.add(i)
     del tmppbl
 
     # Created the dictionary

data_structures/binary_tree/binary_search_tree.py

@@ -183,8 +183,7 @@ def __insert(self, value) -> None:
                     if parent_node.left is None:
                         parent_node.left = new_node  # We insert the new node in a leaf
                         break
-                    else:
-                        parent_node = parent_node.left
+                    parent_node = parent_node.left
                 elif parent_node.right is None:
                     parent_node.right = new_node
                     break
@@ -224,12 +223,11 @@ def search(self, value) -> Node | None:
 
         if self.empty():
             raise IndexError("Warning: Tree is empty! please use another.")
-        else:
-            node = self.root
-            # use lazy evaluation here to avoid NoneType Attribute error
-            while node is not None and node.value is not value:
-                node = node.left if value < node.value else node.right
-            return node
+        node = self.root
+        # use lazy evaluation here to avoid NoneType Attribute error
+        while node is not None and node.value is not value:
+            node = node.left if value < node.value else node.right
+        return node
 
     def get_max(self, node: Node | None = None) -> Node | None:
         """

data_structures/binary_tree/binary_search_tree_recursive.py

@@ -105,7 +105,7 @@ def _search(self, node: Node | None, label: int) -> Node:
         if node is None:
             msg = f"Node with label {label} does not exist"
             raise ValueError(msg)
-        elif label < node.label:
+        if label < node.label:
             node = self._search(node.left, label)
         elif label > node.label:
             node = self._search(node.right, label)

data_structures/hashing/double_hash.py

@@ -74,8 +74,7 @@ def _collision_resolution(self, key, data=None):
             )
             if new_key is None:
                 break
-            else:
-                i += 1
+            i += 1
 
         return new_key
 

data_structures/linked_list/doubly_linked_list_two.py

@@ -35,10 +35,9 @@ def __iter__(self):
     def __next__(self):
         if not self.current:
             raise StopIteration
-        else:
-            value = self.current.data
-            self.current = self.current.next
-            return value
+        value = self.current.data
+        self.current = self.current.next
+        return value
 
 
 @dataclass

data_structures/queues/priority_queue_using_list.py

@@ -165,10 +165,9 @@ def dequeue(self) -> int:
         """
         if not self.queue:
             raise UnderFlowError("The queue is empty")
-        else:
-            data = min(self.queue)
-            self.queue.remove(data)
-            return data
+        data = min(self.queue)
+        self.queue.remove(data)
+        return data
 
     def __str__(self) -> str:
         """