fix: binary search first occurrence and resolve global ruff linting errors

Author: tusharynayaka

data_structures/hashing/hash_table_with_linked_list.py

@@ -8,7 +8,7 @@ def __init__(self, *args, **kwargs):
         super().__init__(*args, **kwargs)
 
     def _set_value(self, key, data):
-        self.values[key] = deque([]) if self.values[key] is None else self.values[key]
+        self.values[key] = deque() if self.values[key] is None else self.values[key]
         self.values[key].appendleft(data)
         self._keys[key] = self.values[key]
 

machine_learning/linear_discriminant_analysis.py

@@ -252,7 +252,7 @@ def accuracy(actual_y: list, predicted_y: list) -> float:
 num = TypeVar("num")
 
 
-def valid_input(
+def valid_input[num](
     input_type: Callable[[object], num],  # Usually float or int
     input_msg: str,
     err_msg: str,

searches/jump_search.py

@@ -20,7 +20,7 @@ def __lt__(self, other: Any, /) -> bool: ...
 T = TypeVar("T", bound=Comparable)
 
 
-def jump_search(arr: Sequence[T], item: T) -> int:
+def jump_search[T](arr: Sequence[T], item: T) -> int:
     """
     Python implementation of the jump search algorithm.
     Return the index if the `item` is found, otherwise return -1.