-
Notifications
You must be signed in to change notification settings - Fork 0
/
hashtable.py
63 lines (53 loc) · 1.8 KB
/
hashtable.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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
class HashTable:
def __init__(self, size=9973):
self.size = size
self.array = [[] for i in range(self.size)]
self.itemlst = []
def __hashed(self, key):
hash = ''
for i in str(key):
hash += str(ord(i) - 22)
return int(hash) % self.size
def __setitem__(self, key, value):
flag = True
for i in self.array[self.__hashed(key)]:
if i[0] == key:
x = i[1]
i[1] = value
flag = False
self.itemlst.remove((key, x))
self.itemlst.append((key, value))
if flag == True:
self.array[self.__hashed(key)].append([key, value])
self.itemlst.append((key, value))
def __getitem__(self, key):
return self.get(key)
def __delitem__(self, key):
return self.pop(key)
def get(self, key):
for i in self.array[self.__hashed(key)]:
if i[0] == key:
return i[1]
raise KeyError(key)
def pop(self, key):
for i in self.array[self.__hashed(key)]:
if i[0] == key:
self.itemlst.remove((key, self.get(key)))
self.array[self.__hashed(key)].remove(i)
return
raise KeyError(key)
def clear(self):
self.array = [[] for i in range(self.size)]
self.itemlst = []
def items(self):
return f"hashtable_items({self.itemlst})"
def keys(self):
keylst = []
for i in self.itemlst:
keylst.append(i[0])
return f"hashtable_keys({keylst})"
def values(self):
valuelst = []
for i in self.itemlst:
valuelst.append(i[1])
return f"hashtable_values({valuelst})"