MCPcopy Index your code
hub / github.com/OmkarPathak/pygorithm / test_heap

Method test_heap

tests/test_data_structure.py:323–352  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

321
322class TestHeap(unittest.TestCase):
323 def test_heap(self):
324 myHeap = heap.Heap()
325 myHeap.insert(6)
326 myHeap.insert(3)
327 myHeap.insert(5)
328 myHeap.insert(12)
329 myHeap.insert(1)
330
331 expectedResult = [1, 3, 5, 12, 6]
332 self.assertEqual(myHeap.queue, expectedResult)
333
334 self.assertEqual(myHeap.pop(), 1)
335 expectedResult = [3, 5, 12, 6]
336 self.assertEqual(myHeap.queue, expectedResult)
337
338 self.assertEqual(myHeap.pop(), 3)
339 expectedResult = [5, 12, 6]
340 self.assertEqual(myHeap.queue, expectedResult)
341
342 self.assertEqual(myHeap.pop(), 5)
343 expectedResult = [6, 12]
344 self.assertEqual(myHeap.queue, expectedResult)
345
346 self.assertEqual(myHeap.pop(), 6)
347 expectedResult = [12]
348 self.assertEqual(myHeap.queue, expectedResult)
349
350 self.assertEqual(myHeap.pop(), 12)
351 expectedResult = []
352 self.assertEqual(myHeap.queue, expectedResult)
353
354
355class TestTrie(unittest.TestCase):

Callers

nothing calls this directly

Calls 2

insertMethod · 0.95
popMethod · 0.95

Tested by

no test coverage detected