| 95 | d4 = {'d': 4} |
| 96 | |
| 97 | class CustomSet(set): |
| 98 | def intersection(self, other): |
| 99 | return CustomSet(super().intersection(other)) |
| 100 | |
| 101 | self.assertEqual(d1.keys() & d1.keys(), {'a', 'b'}) |
| 102 | self.assertEqual(d1.keys() & d2.keys(), {'b'}) |
no outgoing calls
searching dependent graphs…