我在这样的列表中有一个层次结构。 真实的层次结构更复杂,可能存在无限的嵌套深度,而不仅仅是楼层的房间。
locations = [
{
"loc": "root",
"id": "floor_1",
"name": "floor_1 name"
},
{
"loc": "root",
"id": "floor_2",
"name": "floor_2 name"
},
{
"loc": "floor_1",
"id": "room_1-1",
"name": "room_1-1 name"
},
{
"loc": "floor_1",
"id": "room_1-2",
"name": "room_1-2 name"
},
{
"loc": "floor_2",
"id": "room_2-1",
"name": "room_2-1 name"
}
我需要将它转换为嵌套字典,如下所示:
{
'floor_1': {
'name': 'floor_1 name',
'room_1-1': {
'name': 'room_1-1 name',
},
'room_1-2': {
'name': 'room_1-2 name',
}
},
'floor_2': {
'name': 'floor_2 name',
'room_2-1': {
'name': 'room_2-1 name',
}
}
}
我无法弄清楚如何将'name'叶子和子树放入同一个dict中。我得到的最接近的是:
def build(loc):
children = filter(lambda l: l['loc'] == loc, locations)
return {
child['id']: {
'name': child['name'],
'xxx': build(child['id'])
}
for child in children
}
build('root')
显然会产生错误的输出:
{'floor_1': {'name': 'floor_1 name',
'xxx': {'room_1-1': {'name': 'room_1-1 name', 'xxx': {}},
...
我想我必须将理解改为这样的事情:
{ child['id']: build2(child['id']) for child in children }
然后我错过了叶子节点('name')
答案 0 :(得分:1)
希望这就是你想要的。
>>> layout = { i['id'] : {"name" : i['name']} for i in locations if 'floor' in i['id'] }
>>>
>>> for i in locations:
... if i['loc'] in layout:
... layout[i['loc']].update({i['id'] : { "name" : i['name']}})
...
>>> import json; print(json.dumps(layout, indent=2))
{
"floor_1": {
"room_1-2": {
"name": "room_1-2 name"
},
"name": "floor_1 name",
"room_1-1": {
"name": "room_1-1 name"
}
},
"floor_2": {
"room_2-1": {
"name": "room_2-1 name"
},
"name": "floor_2 name"
}
}
>>>
显示的顺序并不相同,但字段与示例中描述的完全相同。
答案 1 :(得分:1)
以下是我尝试重写您的build
函数:
def build(loc_key):
children = [(item['id'], item['name']) for item in locations if item['loc'] == loc_key]
data = {}
for key, name in children:
data[key] = {'name': name}
for item in locations:
if item['loc'] == key:
data[key].update(build(key))
return data
答案 2 :(得分:1)
不完全是你想要的,但更通用。希望对你有用。
import json
class TableDict(dict):
"""Table like data inside nested dictionary."""
def __init__(self, **kwargs):
super(TableDict, self).__init__({})
self.keyorder = kwargs['keyorder']
self.group_map = kwargs['group_map']
def import_dictlist(self, dlist):
"""Import iterable of dictionaries."""
for d in dlist:
ptr = None
for k in self.keyorder:
val = d.pop(k)
if ptr is None:
if val not in self:
self.update({val: {}})
ptr = self[val]
else:
if val not in ptr:
ptr.update({val: {}})
ptr = ptr[val]
self._get_dict_by_keys(ptr, d, k)
if bool(d) is True:
ptr.update({'values': d})
def _get_dict_by_keys(self, t_d, d, key):
"""Add group keys to nested dict."""
result = {}
if key in self.group_map:
for k in self.group_map[key]:
if k in d:
result.update({k: d.pop(k)})
if bool(result) is True:
#t_d.update({'values': result})
t_d.update(result)
if __name__ == '__main__':
locations = [{'id': 'floor_1', 'name': 'floor_1 name', 'loc': 'root'},
{'id': 'floor_2', 'name': 'floor_2 name', 'loc': 'root'},
{'id': 'room_1-1', 'name': 'room_1-1 name', 'loc': 'floor_1'},
{'id': 'room_1-2', 'name': 'room_1-2 name', 'loc': 'floor_1'},
{'id': 'room_2-1', 'name': 'room_2-1 name', 'loc': 'floor_2'}]
d = {'keyorder': ['loc', 'id'],
'group_map': {'id':['name']}}
td = TableDict(**d)
td.import_dictlist(locations)
print(json.dumps(td, indent =3))