Chore: Misc

data_structures/hash_table.py

@@ -31,6 +31,9 @@ class hash_table:
     def __len__(self):
         return self.size
 
+    def linear_probing(key):
+        return (key + 1) % self.size
+
     def insert(self, key):
         hash_index = self.hash(key)
         if self.keys[hash_index] is not None:
@@ -46,23 +49,34 @@ class hash_table:
             self.values[hash_index] += 1
 
     def search(self, key):
-        hash_index = self.hash(key)
-        # return the value if the key is found
-        if self.keys[hash_index] == key:
-            return self.values[hash_index]
+        # probe the table until the key is found
+        initial = self.hash(key)
+        while self.keys[initial] is not None:
+            if self.keys[initial] == key:
+                return self.values[initial]
+            initial = linear_probing(initial)
+            if initial > self.size:
+                return 0
 
-        return None
+        return 0
 
     def delete(self, key):
-        hash_index = self.hash(key)
-        # delete the key value pair if the key is found
-        if self.keys[hash_index] == key:
-            self.values[hash_index] = 0
-            self.keys[hash_index] = None
+        # check if key exists in table
+        if self.search(key) == 0:
+            return
+
+        # delete the key
+        initial = self.hash(key)
+        while self.keys[initial] is not None:
+            if self.keys[initial] == key:
+                self.keys[initial] = None
+                self.values[initial] = 0
+                return
+            initial = linear_probing(initial)
+            if initial > self.size:
+                return
 
     def handle_collision(self, hash_index, key):
-        def linear_probing(key):
-            return (key + 1) % self.size
 
         while self.keys[hash_index] is not None:
             hash_index = linear_probing(hash_index)