benedict.utils.keypath_util

Complexity

Total Complexity

20

Size/Duplication

Total Lines	64
Duplicated Lines	0 %

Importance

Changes

0

5 Functions

Rating	Name	Duplication	Size	Complexity
A	all_keys()	0	8	4
B	check_keys()	0	8	6
A	join_keys()	0	2	1
B	split_keys()	0	17	6
A	follow_keys()	0	15	3

# -*- coding: utf-8 -*-

from six import string_types


def all_keys(d):
    keys = []
    for key, value in d.items():
        if key not in keys:
            keys.append(key)
        if isinstance(value, dict):
            keys += all_keys(value)
    return keys


def check_keys(keys, separator):
    if not separator:
        return
    for key in keys:
        if key and isinstance(key, string_types) and separator in key:
            raise ValueError(
                'keys should not contain keypath separator '
                '\'{}\'.'.format(separator))


def follow_keys(d, keys):
    item_keys = keys[:-1]
    item_key = keys[-1]
    item_parent = d
    i = 0
    j = len(item_keys)
    while i < j:
        key = item_keys[i]
        try:
            item_parent = item_parent[key]
        except KeyError:
            item_parent = None
            break
        i += 1
    return (item_parent, item_key, )


def join_keys(keys, separator):
    return separator.join(keys)


def split_keys(key, separator):
    if not separator:
        return [key]
    elif isinstance(key, string_types):
        keypath = key
        if separator in keypath:
            keys = list(keypath.split(separator))
            return keys
        else:
            return [key]
    elif isinstance(key, (list, tuple, )):
        keys = []
        for key_item in key:
            keys += split_keys(key_item, separator)
        return keys
    else:
        return [key]