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