Implement-hash-tables/hash tables.py at master · ShayanChk/Implement-hash-tables · GitHub

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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
class ChainingHash:


	class Record:
		def __init__(self, key = None, value=None):
			self.key = key
			self.value = value


	def __init__(self, cap=32):
		self.map = [[] for i in range(cap)]
		self.cap = cap

	def insert(self,key, value):

		if (self.search(key)!=None):
			return False

		if(len(self) == self.cap):
			new_map = [[] for i in range(self.cap*2)]
			for i in range(self.cap):
				new_map[i]=self.map[i]
			self.map = new_map
			self.cap *= 2

		x = hash(key)
		idx = x % self.cap
		self.map[idx].append(self.Record(key,value))
		return True

	def modify(self, key, value):

		x = hash(key)
		idx = x % self.cap
		i=0
		while i < len(self.map[idx]):
			if self.map[idx][i].key == key:
				self.map[idx][i].value = value
				return True
			i+=1

		return False

	def remove(self, key):
		if (self.search(key)==None):
			return False

		c = self.cap

		while c > 0 :
			x = hash(key)
			idx = x % c
			i=0
			while i < len(self.map[idx]):
				if self.map[idx][i].key == key:
					del self.map[idx][i]
					return True
				i+=1
			c = c//2

		return False

	def search(self, key):
		c = self.cap
		while c > 0 :
			x = hash(key)
			idx = x % c
			for i in self.map[idx]:
				if i.key == key:
					return i.value
			c = c//2

		return None


	def capacity(self):
		return self.cap

	def __len__(self):
		i =0
		count = 0
		while(i < len(self.map)):
			if(self.map[i]!=[]):
				count+= len(self.map[i])
			i+=1
		return count


class LinearProbingHash:
	class Record:
		def __init__(self, key, value):
			self.key = key
			self.value = value


	def __init__(self, cap=32):
		self.map = [None for i in range(cap)]
		self.cap = cap


	def insert(self, key, value):
		if (self.search(key)!=None):
			return False

		x = hash(key)
		i = x % self.cap
		while i < self.cap*2:
			if self.map[i%self.cap ] == None:
				self.map[i%self.cap ] = self.Record(key,value)
				break
			i+=1


		if(len(self) >= self.cap*0.7):
			new_map = [None for i in range(self.cap*2)]
			for i in range(self.cap):
				new_map[i]=self.map[i]
			self.map = new_map
			self.cap *= 2

		return True

	def modify(self, key, value):
		x = hash(key)
		i = x % self.cap

		while i < self.cap*2:
			if self.map[i%self.cap] != None and self.map[i%self.cap].key == key:
				self.map[i%self.cap].value = value
				return True
			i+=1
		return False


	def remove(self, key):
		x = hash(key)
		i = x % self.cap

		while i < self.cap*2:
			if self.map[i%self.cap] != None and self.map[i%self.cap].key == key:
				self.map[i%self.cap] = None
				return True
			i+=1

		return False

	def search(self, key):
		x = hash(key)
		i = x % self.cap

		while i < self.cap*2:
			if self.map[i%self.cap] != None and self.map[i%self.cap].key == key:
				return self.map[i%self.cap].value
			i+=1

		return None

	def capacity(self):
		return self.cap

	def __len__(self):
		i =0
		count = 0
		while(i < len(self.map)):
			if(self.map[i]!=None):
				count+=1
			i+=1
		return count