As keys are hashed- there is no semantic meaning to the existence or lack of a dot from a string key, and an attempt to access root["a"]["c"]
would result in a TypeError
exception as mentioned before.
You could, however, re-structure the dictionary to have the nested structure you're looking for.
The code would look roughly like that:
root = {
"a": 0.7615894039735099,
"a.b": 0.7152317880794702,
"a.c": 0.026490066225165563,
"a.b.d": 0.0001,
"f": 0.002,
"f.g": 0.00003,
"h.p.q": 0.0004
}
result = {}
for key, value in root.items():
if not isinstance(key, str):
result[key] = value
is_nested = "." in key
nesting_clash = any([k.startswith(key) for k in root if k != key])
if nesting_clash:
print(f"key {key} has nesting clash ; replacing with {key}._v")
# continue # fixed after comment
key = f"{key}._v"
is_nested = True
if not is_nested:
result[key] = value
key_parts = key.split(".")
tmp = result
for idx, key_part in enumerate(key_parts):
default_value = {} if idx < len(key_parts) - 1 else value
tmp[key_part] = tmp.get(key_part, default_value)
tmp = tmp[key_part]
Note: you'd have to either discard keys that clash (e.g. "a"
and "a.b"
) or to create a default behavior for them. In my example I decided to discard them.
EDIT: I've replaced the skip with a key replacement of ._v . this way you can keep all values and reconstruct the original dictionary/JSON by using the following function:
def unnest_dict(d, sep="."):
result = {}
for key, val in d.items():
if not isinstance(val, dict):
result[key] = val
continue
if "_v" in val:
result[key] = val.pop("_v")
unnested_val = unnest_dict(val, sep)
for k, v in unnested_val.items():
result[sep.join([key, k])] = v
return result