| 112 | d = deque([1, 2, 3]) |
| 113 | self.assertRaises(ArithmeticError, d.count, BadCompare()) |
| 114 | class MutatingCompare: |
| 115 | def __eq__(self, other): |
| 116 | self.d.pop() |
| 117 | return True |
| 118 | m = MutatingCompare() |
| 119 | d = deque([1, 2, 3, m, 4, 5]) |
| 120 | m.d = d |
no outgoing calls
searching dependent graphs…