Python - 生成 parent/child 字典结构

Python - generating parent/child dict structure

我有方法:

@staticmethod
def get_blocks():
    """Public method that can be extended to add new blocks.

    First item is the most parent. Last item is the most child.
        Returns:
            blocks (list)
    """
    return ['header', 'body', 'footer']

如文档字符串所述,此方法可以扩展到 return 特定顺序的任何类型的块。

所以我想做一个映射来指示哪个块是 parent/child 彼此(只关心 "nearest" parent/child)。

def _get_blocks_mapping(blocks):
    mp = {'parent': {}, 'child': {}}
    if not blocks:
        return mp
    mp['parent'][blocks[0]] = None
    mp['child'][blocks[-1]] = None
    blocks_len = len(blocks)
    if blocks_len > 1:
        mp['parent'][blocks[-1]] = blocks[-2]
        for i in range(1, len(blocks)-1):
            mp['parent'][blocks[i]] = blocks[i-1]
            mp['child'][blocks[i]] = blocks[i+1]
    return mp

所以如果我们有像 get_blocks 方法中那样的三个块,结果是这样的:

{
        'parent': {
            'header': None,
            'body': 'header',
            'footer': 'body',
        },
        'child': {
            'header': 'body',
            'body': 'footer',
            'footer': None
        }
    }

很好用,但对我来说有点老套。那么也许有人可以建议一种更好的方法来创建这样的映射? (或者也许有一些创建 parent/child 映射的常用方法?使用与我打算使用的结构不同的结构?)

您想成对循环遍历列表,从而获得自然的父子关系:

mp = {'parent': {}, 'child': {}}
if blocks:
    mp['parent'][blocks[0]] = mp['child'][blocks[-1]] = None
    for parent, child in zip(blocks, blocks[1:]):
        mp['parent'][child] = parent
        mp['child'][parent] = child

zip() 这里将每个块与列表中的下一个块配对。

演示:

>>> blocks = ['header', 'body', 'footer']
>>> mp = {'parent': {}, 'child': {}}
>>> if blocks:
...     mp['parent'][blocks[0]] = mp['child'][blocks[-1]] = None
...     for parent, child in zip(blocks, blocks[1:]):
...         mp['parent'][child] = parent
...         mp['child'][parent] = child
...
>>> from pprint import pprint
>>> pprint(mp)
{'child': {'body': 'footer', 'footer': None, 'header': 'body'},
 'parent': {'body': 'header', 'footer': 'body', 'header': None}}