fabiocaccamo /
python-benedict
| Total Complexity | 3 |
| Total Lines | 6 |
| Duplicated Lines | 0 % |
| Changes | 0 | ||
| 1 | def find(d, keys, default=None): |
||
| 2 | for key in keys: |
||
| 3 | if key in d: |
||
| 4 | return d.get(key, default) |
||
| 5 | return default |
||
| 6 |
