-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathhash_chapter2_impl_test.py
More file actions
143 lines (108 loc) · 4.96 KB
/
Copy pathhash_chapter2_impl_test.py
File metadata and controls
143 lines (108 loc) · 4.96 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
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
import unittest
from hash_chapter2_impl import create_new, has_key, insert, remove, resize, DUMMY
from common import generate_random_string
class MyHashTest(unittest.TestCase):
def test_handcrafted(self):
expected_len = 6
hashes, keys = create_new([42, 43, 12])
self.assertEqual(len(hashes), expected_len)
self.assertEqual(len(keys), expected_len)
insert(hashes, keys, 42)
self.assertEqual(hashes[42 % expected_len], 42)
self.assertEqual(keys[42 % expected_len], 42)
self.assertEqual(hashes[43 % expected_len], 43)
self.assertEqual(keys[43 % expected_len], 43)
self.assertEqual(hashes[42 % expected_len], 42)
self.assertEqual(keys[42 % expected_len], 42)
self.assertEqual(hashes[12 % expected_len], 42)
self.assertEqual(keys[12 % expected_len], 42)
self.assertEqual(hashes[12 % expected_len + 1], 43)
self.assertEqual(keys[12 % expected_len + 1], 43)
self.assertEqual(hashes[12 % expected_len + 2], 12)
self.assertEqual(keys[12 % expected_len + 2], 12)
self.assertTrue(has_key(hashes, keys, 42))
self.assertTrue(has_key(hashes, keys, 43))
self.assertTrue(has_key(hashes, keys, 12))
self.assertFalse(has_key(hashes, keys, 45))
# table: [42, 43, 12, None, None, None]
insert(hashes, keys, "") # hash("") == 0
self.assertEqual(hashes[3], 0)
self.assertEqual(keys[3], "")
self.assertTrue(has_key(hashes, keys, ""))
self.assertTrue(has_key(hashes, keys, 42))
insert(hashes, keys, "aba") # hash("aba") % 6 == 5
self.assertEqual(hashes[5], hash("aba"))
self.assertEqual(keys[5], "aba")
self.assertTrue(has_key(hashes, keys, 12))
remove(hashes, keys, 12)
self.assertFalse(has_key(hashes, keys, 12))
self.assertEqual(hashes[12 % expected_len], 42)
self.assertEqual(keys[12 % expected_len], 42)
self.assertEqual(keys[12 % expected_len + 2], DUMMY)
with self.assertRaises(KeyError):
remove(hashes, keys, 12)
with self.assertRaises(KeyError):
remove(hashes, keys, 45)
self.assertFalse(has_key(hashes, keys, 12))
self.assertFalse(has_key(hashes, keys, 45))
self.assertTrue(has_key(hashes, keys, 42))
self.assertTrue(has_key(hashes, keys, 43))
self.assertTrue(has_key(hashes, keys, ""))
self.assertTrue(has_key(hashes, keys, "aba"))
insert(hashes, keys, "abg")
self.assertTrue(has_key(hashes, keys, "abg"))
self.assertEqual(hashes[4], hash("abg"))
self.assertEqual(keys[4], "abg")
hashes, keys = resize(hashes, keys)
self.assertTrue(has_key(hashes, keys, 42))
self.assertTrue(has_key(hashes, keys, 43))
self.assertTrue(has_key(hashes, keys, ""))
self.assertTrue(has_key(hashes, keys, "aba"))
self.assertTrue(has_key(hashes, keys, "abg"))
self.assertFalse(has_key(hashes, keys, 12))
self.assertFalse(has_key(hashes, keys, 45))
self.assertEqual(hashes[6], 42)
self.assertEqual(keys[6], 42)
self.assertEqual(hashes[7], 43)
self.assertEqual(keys[7], 43)
self.assertEqual(hashes[0], 0)
self.assertEqual(keys[0], "")
for h in hashes:
self.assertTrue(h != 12)
self.assertEqual(hashes[5], hash("aba"))
self.assertEqual(keys[5], "aba")
self.assertEqual(hashes[11], hash("abg"))
self.assertEqual(keys[11], "abg")
def test_all(self):
n = 10
initial_keys = [generate_random_string() for _ in range(n)]
more_keys = [generate_random_string() for _ in range(n // 3)]
myhashes, mykeys = create_new(initial_keys)
for key in more_keys:
insert(myhashes, mykeys, key)
insert(myhashes, mykeys, key)
existing_keys = initial_keys + more_keys
for key in existing_keys:
self.assertTrue(has_key(myhashes, mykeys, key))
myhashes, mykeys = resize(myhashes, mykeys)
for key in existing_keys:
self.assertTrue(has_key(myhashes, mykeys, key))
missing_keys = [generate_random_string() for _ in range(3 * n)]
for key in set(missing_keys) - set(existing_keys):
self.assertFalse(has_key(myhashes, mykeys, key))
with self.assertRaises(KeyError):
remove(myhashes, mykeys, key)
for key in existing_keys:
self.assertTrue(has_key(myhashes, mykeys, key))
remove(myhashes, mykeys, key)
self.assertFalse(has_key(myhashes, mykeys, key))
for key in more_keys:
self.assertFalse(has_key(myhashes, mykeys, key))
insert(myhashes, mykeys, key)
self.assertTrue(has_key(myhashes, mykeys, key))
remove(myhashes, mykeys, key)
self.assertFalse(has_key(myhashes, mykeys, key))
def main():
unittest.main()
if __name__ == "__main__":
main()