Total Complexity | 7 |
Total Lines | 34 |
Duplicated Lines | 91.18 % |
Changes | 1 | ||
Bugs | 0 | Features | 0 |
Duplicate code is one of the most pungent code smells. A rule that is often used is to re-structure code once it is duplicated in three or more places.
Common duplication problems, and corresponding solutions are:
1 | import unittest |
||
6 | class MinPQUnitTest(unittest.TestCase): |
||
7 | |||
8 | View Code Duplication | 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 | View Code Duplication | 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 | |||
43 | unittest.main() |