Fix some ARG002 per file ignores

Author: MaximSmolskiy

audio_filters/show_response.py

@@ -8,7 +8,7 @@
 
 
 class FilterType(Protocol):
-    def process(self, sample: float) -> float:
+    def process(self, sample: float) -> float:  # noqa: ARG002
         """
         Calculate y[n]
 

data_structures/hashing/hash_table.py

@@ -173,7 +173,7 @@ def _set_value(self, key, data):
         self.values[key] = data
         self._keys[key] = data
 
-    def _collision_resolution(self, key, data=None):
+    def _collision_resolution(self, key):
         """
         This method is a type of open addressing which is used for handling collision.
 
@@ -266,7 +266,7 @@ def insert_data(self, data):
             pass
 
         else:
-            collision_resolution = self._collision_resolution(key, data)
+            collision_resolution = self._collision_resolution(key)
             if collision_resolution is not None:
                 self._set_value(collision_resolution, data)
             else:

data_structures/hashing/quadratic_probing.py

@@ -11,7 +11,7 @@ class QuadraticProbing(HashTable):
     def __init__(self, *args, **kwargs):
         super().__init__(*args, **kwargs)
 
-    def _collision_resolution(self, key, data=None):
+    def _collision_resolution(self, key):
         """
         Quadratic probing is an open addressing scheme used for resolving
         collisions in hash table.

pyproject.toml

@@ -76,11 +76,8 @@ max-complexity = 17  # default: 10
 
 [tool.ruff.lint.per-file-ignores]
 "arithmetic_analysis/newton_raphson.py" = ["PGH001"]
-"audio_filters/show_response.py" = ["ARG002"]
 "data_structures/binary_tree/binary_search_tree_recursive.py" = ["BLE001"]
 "data_structures/binary_tree/treap.py" = ["SIM114"]
-"data_structures/hashing/hash_table.py" = ["ARG002"]
-"data_structures/hashing/quadratic_probing.py" = ["ARG002"]
 "data_structures/hashing/tests/test_hash_map.py" = ["BLE001"]
 "data_structures/heap/max_heap.py" = ["SIM114"]
 "graphs/minimum_spanning_tree_prims.py" = ["SIM114"]