-
Notifications
You must be signed in to change notification settings - Fork 0
/
hash_table.py
49 lines (38 loc) · 1.5 KB
/
hash_table.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
# HashTable: An unordered key-value data structure providing O(1) store, retrieve
# search and delete operations.
# Your implementation should pass the tests in test_hash_table.py.
# YOUR NAME
class HashTable:
def __init__(self, size=10):
self.size = size
self.data = [ [] for i in range(self.size)]
self.keys = [ [] for i in range(self.size)]
# def keys(self):
# self.keys = [ [] for i in range (self.size)]
def hash(self, key):
size = (self.size)
return hash(key) % size
def __setitem__(self, key, value):
key_hash = self.hash(key)
key_value = [key, value]
if self.data[key_hash] is not None:
for k in self.data[key_hash]:
if k[0] == key:
k[1] = value
return True
self.data[key_hash].append(key_value)
else:
self.data[key_hash].append([key, value])
def __getitem__(self, key):
index = self.hash(key)
for k in self.data[index]: #looping through all keys
if k[0] == key: #if k equals key we are looking for, the key sent into the method
return k[1]
def delete(self, key):
key_hash = self.hash(key)
for i in range (0, len(self.data[key_hash])):
if self.data[key_hash][i][0] == key:
self.data[key_hash].pop(i)
def clear(self):
for i in range (0, len(self.data)):
self.data = [ [] for i in range(self.size)]