@@ 8-25 (lines=18) @@ | ||
5 | ||
6 | class QueueUnitTest(unittest.TestCase): |
|
7 | ||
8 | def test_queue(self): |
|
9 | queue = Queue() |
|
10 | queue.enqueue(100) |
|
11 | queue.enqueue(200) |
|
12 | for i in range(20): |
|
13 | queue.enqueue(i) |
|
14 | ||
15 | self.assertEqual(queue.size(), 22) |
|
16 | self.assertFalse(queue.is_empty()) |
|
17 | ||
18 | self.assertEqual(queue.dequeue(), 100) |
|
19 | self.assertEqual(queue.dequeue(), 200) |
|
20 | ||
21 | for i in range(20): |
|
22 | self.assertEqual(queue.dequeue(), i) |
|
23 | ||
24 | self.assertEqual(queue.size(), 0) |
|
25 | self.assertTrue(queue.is_empty()) |
|
26 | ||
27 | ||
28 | if __name__ == '__main__': |
@@ 24-39 (lines=16) @@ | ||
21 | self.assertEqual(pq.del_min(), 200) |
|
22 | self.assertTrue(pq.is_empty()) |
|
23 | ||
24 | def test_max_pq(self): |
|
25 | pq = MinPQ(compare=lambda x, y: y - x) |
|
26 | pq.enqueue(100) |
|
27 | pq.enqueue(200) |
|
28 | for i in range(20): |
|
29 | pq.enqueue(19 - i) |
|
30 | ||
31 | self.assertEqual(pq.size(), 22) |
|
32 | self.assertFalse(pq.is_empty()) |
|
33 | ||
34 | self.assertEqual(pq.del_min(), 200) |
|
35 | self.assertEqual(pq.del_min(), 100) |
|
36 | for i in range(20): |
|
37 | self.assertEqual(pq.del_min(), 19 - i) |
|
38 | ||
39 | self.assertTrue(pq.is_empty()) |
|
40 | ||
41 | ||
42 | if __name__ == '__main__': |
|
@@ 8-22 (lines=15) @@ | ||
5 | ||
6 | class MinPQUnitTest(unittest.TestCase): |
|
7 | ||
8 | def test_pq(self): |
|
9 | pq = MinPQ() |
|
10 | pq.enqueue(100) |
|
11 | pq.enqueue(200) |
|
12 | for i in range(20): |
|
13 | pq.enqueue(19 - i) |
|
14 | ||
15 | self.assertEqual(pq.size(), 22) |
|
16 | self.assertFalse(pq.is_empty()) |
|
17 | ||
18 | for i in range(20): |
|
19 | self.assertEqual(pq.del_min(), i) |
|
20 | self.assertEqual(pq.del_min(), 100) |
|
21 | self.assertEqual(pq.del_min(), 200) |
|
22 | self.assertTrue(pq.is_empty()) |
|
23 | ||
24 | def test_max_pq(self): |
|
25 | pq = MinPQ(compare=lambda x, y: y - x) |