benedict.core.keylists

Complexity

Total Complexity

9

Size/Duplication

Total Lines	33
Duplicated Lines	0 %

Importance

Changes

0

4 Functions

Rating	Name	Duplication	Size	Complexity
A	keylists()	0	2	1
A	_get_keylist_for_dict()	0	7	2
A	_get_keylist_for_list()	0	8	2
A	_get_keylist_for_value()	0	6	4

from benedict.utils import type_util


def _get_keylist_for_dict(d, parent_keys, indexes):
    keylist = []
    for key, value in d.items():
        keys = parent_keys + [key]
        keylist += [keys]
        keylist += _get_keylist_for_value(value, keys, indexes)
    return keylist


def _get_keylist_for_list(ls, parent_keys, indexes):
    keylist = []
    for key, value in enumerate(ls):
        keys = list(parent_keys)
        keys[-1] += f"[{key}]"
        keylist += [keys]
        keylist += _get_keylist_for_value(value, keys, indexes)
    return keylist


def _get_keylist_for_value(value, parent_keys, indexes):
    if type_util.is_dict(value):
        return _get_keylist_for_dict(value, parent_keys, indexes)
    elif type_util.is_list(value) and indexes:
        return _get_keylist_for_list(value, parent_keys, indexes)
    return []


def keylists(d, indexes=False):
    return _get_keylist_for_value(d, [], indexes)