| 1421 | self.assertEqual(pairs, list(dict(d).items())) |
| 1422 | |
| 1423 | class CustomReversedDict(dict): |
| 1424 | def keys(self): |
| 1425 | return reversed(list(dict.keys(self))) |
| 1426 | |
| 1427 | __iter__ = keys |
| 1428 | |
| 1429 | def items(self): |
| 1430 | return reversed(dict.items(self)) |
| 1431 | |
| 1432 | d = CustomReversedDict(pairs) |
| 1433 | self.assertEqual(pairs[::-1], list(dict(d).items())) |
no outgoing calls
searching dependent graphs…