| Total Complexity | 3 |
| Total Lines | 20 |
| Duplicated Lines | 90 % |
| 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 QueueUnitTest(unittest.TestCase): |
||
| 7 | |||
| 8 | View Code Duplication | 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 | |||
| 30 |