-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhashtable.py
More file actions
65 lines (50 loc) · 1.43 KB
/
Copy pathhashtable.py
File metadata and controls
65 lines (50 loc) · 1.43 KB
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
class HashItem:
def __init__(self, key, value):
self.key = key
self.value = value
class HashTable:
def __init__(self):
self.size = 256
self.slots = [None for i in range(self.size)]
self.count = 0
def _hash(self, key):
mult = 1
hv = 0
for ch in key:
hv += mult * ord(ch)
mult += 1
return hv % self.size
def put(self, key, value):
item = HashItem(key, value)
h = self._hash(key)
while self.slots[h] is not None:
if self.slots[h].key is key:
break
h = (h + 1) % self.size
if self.slots[h] is None:
self.count += 1
self.slots[h] = item
def get(self, key):
h = self._hash(key)
while self.slots[h] is not None:
if self.slots[h].key in key:
return self.slots[h].value
h = (h +1) % self.size
return None
def __setitem__(self, key, value):
self.put(key, value)
def __getitem__(self, key):
return self.get(key)
def main():
ht = HashTable()
ht["good"] = "eggs"
ht["better"] = "ham"
ht["best"] = "spam"
ht["ad"] = "do not"
ht["ga"] = "collide"
for key in ("good", "better", "best", "worst", "ad", "ga"):
v = ht[key]
print (v)
print("The number of elements is: {}".format(ht.count))
if __name__ == "__main__":
main()