jlengrand/Coding4Interviews
1
0
Fork 0
mirror of https://github.com/jlengrand/Coding4Interviews.git synced 2026-03-10 08:11:24 +00:00
Code Issues Packages Projects Releases Wiki Activity

find_next_idx behaviour checked. Seems to work as expected

Browse Source
This commit is contained in:
Julien Lengrand-Lambert
2013-11-24 17:01:12 +01:00
parent 70d268983b
commit ee382ac0a8
1 changed files with 25 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
02_hash_maps/hm_test.py
View File

@@ -12,15 +12,37 @@ import unittest
class test_hash_map_neighbour_collision(unittest.TestCase):
def test_add(self):
def test__find_free_idx(self):
hm = HMNeighbourCollision()
hm.add("One", "Ibiza")
key = "One"
value = "Ibiza"
my_key = hm._hash(key)
idx = hm._find_free_idx(my_key)
self.assertEqual(my_key, idx)
hm.add(key, value)
self.assertEqual(hm.size(), 1)
hm.add("One", "Ibiza2")
# We move one up
idx = hm._find_free_idx(my_key)
self.assertEqual(my_key - 1, idx)
hm.add(key, "Ibiza2")
self.assertEqual(hm.size(), 2)
# We move one down
idx = hm._find_free_idx(my_key)
self.assertEqual(my_key + 1, idx)
hm.add(key, "Ibiza3")
self.assertEqual(hm.size(), 3)
# We move two up
idx = hm._find_free_idx(my_key)
self.assertEqual(my_key - 2, idx)
class test_hash_map_table_collision(unittest.TestCase):
def test_add(self):