fabiocaccamo /
python-benedict
| Total Complexity | 4 |
| Total Lines | 9 |
| Duplicated Lines | 0 % |
| Changes | 0 | ||
| 1 | def swap(d, key1, key2): |
||
| 2 | if key1 == key2: |
||
| 3 | return |
||
| 4 | val1 = d[key1] |
||
| 5 | val1 = val1.copy() if isinstance(val1, dict) else val1 |
||
| 6 | val2 = d[key2] |
||
| 7 | val2 = val2.copy() if isinstance(val2, dict) else val2 |
||
| 8 | d[key1], d[key2] = val2, val1 |
||
| 9 |
