fabiocaccamo /
python-benedict
| Total Complexity | 4 |
| Total Lines | 18 |
| Duplicated Lines | 0 % |
| Changes | 0 | ||
| 1 | # -*- coding: utf-8 -*- |
||
| 2 | |||
| 3 | from benedict.utils import type_util |
||
| 4 | |||
| 5 | |||
| 6 | def _get_keylist(item, parent_keys): |
||
| 7 | l = [] |
||
| 8 | for key, value in item.items(): |
||
| 9 | keys = parent_keys + [key] |
||
| 10 | l += [keys] |
||
| 11 | if type_util.is_dict(value): |
||
| 12 | l += _get_keylist(value, keys) |
||
| 13 | return l |
||
| 14 | |||
| 15 | |||
| 16 | def keylists(d): |
||
| 17 | return _get_keylist(d, []) |
||
| 18 |
