-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHash.py
More file actions
66 lines (55 loc) · 2.1 KB
/
Hash.py
File metadata and controls
66 lines (55 loc) · 2.1 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
66
#! /usr/bin/env python3
class hash_table():
def __init__(self):
self.size = 11
self.slots = [None] * self.size
self.data = [None] * self.size
def put(self, key, data):
hashvalue = self.hash_func(key,self.size)
if self.slots[hashvalue] == None:
self.slots[hashvalue] = key
self.data[hashvalue] = data
else:
if self.slots[hashvalue] == key:
self.data[hashvalue] = data
else:
nexthashvalue = self.next_hash_func(hashvalue, self.size)
found = False
stop = False
while self.slots[nexthashvalue] != None and not found and not stop:
if self.slots[nexthashvalue] == key:
found = True
elif hashvalue == nexthashvalue:
stop = True
else:
nexthashvalue = self.next_hash_func(nexthashvalue, self.size)
if not stop:
self.slots[nexthashvalue] = key
self.data[nexthashvalue] = data
else:
raise ValueError
def hash_func(self, key, size):
return key % size
def next_hash_value(self, key, size):
return (key + 1) % size
def get(self, key):
hashvalue = self.hash_func(key, self.size)
if self.slots[hashvalue] == key:
return self.data[hashvalue]
else:
nexthashvalue = self.next_hash_value(hashvalue, self.size)
found = False
stop = False
while self.slots[nexthashvalue] != key and not stop:
if nexthashvalue == hashvalue:
stop = True
else:
nexthashvalue = self.next_hash_value(nexthashvalue, self.size)
if not stop:
return self.data[nexthashvalue]
else:
return None
def __getitem__(self,key):
return self.get(key)
def __setitem__(self,key,data):
self.put(key,data)