benedict.utils.keypath_util.follow_keys() - Code Metrics - Inspection of "Updated README." - fabiocaccamo/python-benedict - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( 3136b5...f980db )

by Fabio

created 2019-10-04 13:55 UTC

benedict.utils.keypath_util.follow_keys() A

↳ Parent: benedict.utils.keypath_util

Complexity

Conditions

Size

Total Lines	15
Code Lines	15

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
eloc	15
dl	0
loc	15
rs	9.65
c	0
b	0
f	0
cc	3
nop	2

# -*- 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]


1			# -- coding: utf-8 --
2
3			from six import string_types
4
5
6			def all_keys(d):
7			keys = []
8			for key, value in d.items():
9			if key not in keys:
10			keys.append(key)
11			if isinstance(value, dict):
12			keys += all_keys(value)
13			return keys
14
15
16			def check_keys(keys, separator):
17			if not separator:
18			return
19			for key in keys:
20			if key and isinstance(key, string_types) and separator in key:
21			raise ValueError(
22			'keys should not contain keypath separator '
23			'\'{}\'.'.format(separator))
24
25
26			def follow_keys(d, keys):
27			item_keys = keys[:-1]
28			item_key = keys[-1]
29			item_parent = d
30			i = 0
31			j = len(item_keys)
32			while i < j:
33			key = item_keys[i]
34			try:
35			item_parent = item_parent[key]
36			except KeyError:
37			item_parent = None
38			break
39			i += 1
40			return (item_parent, item_key, )
41
42
43			def join_keys(keys, separator):
44			return separator.join(keys)
45
46
47			def split_keys(key, separator):
48			if not separator:
49			return [key]
50			elif isinstance(key, string_types):
51			keypath = key
52			if separator in keypath:
53			keys = list(keypath.split(separator))
54			return keys
55			else:
56			return [key]
57			elif isinstance(key, (list, tuple, )):
58			keys = []
59			for key_item in key:
60			keys += split_keys(key_item, separator)
61			return keys
62			else:
63			return [key]
64

fabiocaccamo / python-benedict

Push — master ( 3136b5...f980db )

benedict.utils.keypath_util.follow_keys() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like