fabiocaccamo /
python-benedict
| Total Complexity | 3 |
| Total Lines | 10 |
| Duplicated Lines | 0 % |
| Changes | 0 | ||
| 1 | def unique(d): |
||
| 2 | values = [] |
||
| 3 | keys = list(d.keys()) |
||
| 4 | for key in keys: |
||
| 5 | value = d.get(key, None) |
||
| 6 | if value in values: |
||
| 7 | d.pop(key, None) |
||
| 8 | continue |
||
| 9 | values.append(value) |
||
| 10 |
