def extend(vHashMap, vValue):
newHM = MyHashMap(vHashMap.length, vHashMap.to_list())
ncount = 0
for i in newHM.flag:
if (i == 1):
ncount += 1
if (ncount == vHashMap.length):
return
newHM.insert(vValue)
return newHM
def mconcat(a, b):
if a != None and b != None:
newHM = MyHashMap(a.length + b.length)
for i in range(a.length):
if (a.flag[i] == 1):
newHM.insert(a.items[i])
for i in range(b.length):
if (b.flag[i] == 1):
newHM.insert(b.items[i])
return newHM
elif a:
# return MyHashMap(a.length,a.to_list())
return a
elif b:
# return MyHashMap(b.length,b.to_list())
return b
else:
return MyHashMap(vItem=[])
def test_insert(self):
lst = MyHashMap(vItem=[])
lst.insert(2)
self.assertEqual(lst.to_list().sort(), [2].sort())
lst.insert(55)
self.assertEqual(lst.to_list().sort(), [2, 55].sort())
