(self)
| 395 | self.assertEqual(list(d), l) |
| 396 | |
| 397 | def test_delitem(self): |
| 398 | n = 500 # O(n**2) test, don't make this too big |
| 399 | d = deque(range(n)) |
| 400 | self.assertRaises(IndexError, d.__delitem__, -n-1) |
| 401 | self.assertRaises(IndexError, d.__delitem__, n) |
| 402 | for i in range(n): |
| 403 | self.assertEqual(len(d), n-i) |
| 404 | j = random.randrange(-len(d), len(d)) |
| 405 | val = d[j] |
| 406 | self.assertIn(val, d) |
| 407 | del d[j] |
| 408 | self.assertNotIn(val, d) |
| 409 | self.assertEqual(len(d), 0) |
| 410 | |
| 411 | def test_reverse(self): |
| 412 | n = 500 # O(n**2) test, don't make this too big |
nothing calls this directly
no test coverage detected