angular - 需要一个支持具有给定对象数组的 Prime NG 树表的 Json 对象

Question

我有一个对象数组，其中包含父子关系数据，我想将其转换为主要的 Ng 树表可支持的数据格式。

我有如下的 JSOn 数组：

[
    {
        "bizUnitID": 1,
        "bizUnitName": "SYSTEM",
        "description": "",
        "bizUnitParent": 0
    },
    {
        "bizUnitID": 6,
        "bizUnitName ": "Child BU",
        "description": " Child  BU",
        "bizUnitParent": 1
    },
    {
        "bizUnitID": 15,
        "bizUnitName": "Child1_BU",
        "description": " Child1_BU",
        "bizUnitParent": 6
    },
    {
        "bizUnitID": 16,
        "bizUnitName": " Child2_BU ",
        "description": " Child2_BU ",
        "bizUnitParent": 6
    }
]

我的预期如下：

[
    {
        "data": [
            {
                "data": {
                    "BizUnitId": "1",
                    "BizUnitName": "System",
                    "Description": "System"
               "bizUnitParent": 0
                },
                "children": [
                    {
                        "data": {
                            "bizUnitID": 6,
                            "bizUnitName ": "Child BU",
                            "description": " Child  BU",
                            "bizUnitParent": 1
                        },
                        "children": [
                            {
                                "data": {
                                    "bizUnitID": 16,
                                    "bizUnitName": " Child1_BU ",
                                    "description": " Child1_BU ",
                                    "bizUnitParent": 6
                                }
                            },
                            {
                                "data": {
                                    "bizUnitID": 15,
                                    "bizUnitName": "Child2_BU",
                                    "description": " Child2_BU",
                                    "bizUnitParent": 6
                                }
                            }
                        ]
                    }
                ]
            }
        ]
    }
]

为了获得这种结构，我尝试了以下问题中的某个人建议的解决方案。下面的代码将数据绑定到 Tree Table 父级和子级，而不是 Childs 的子级。

以下代码所需的任何更改。请建议。

// find leaf who does not have child using recursive


function findLeaf(data, curIndex, parIndex) {
    const childId = data[curIndex].dataId;
    for(let i = 0; i < data.length; i++) {
        if(data[i].parentId == childId) {
            return findLeaf(data, i, curIndex);
        }
    }
    return [curIndex, parIndex];
}

// check if array contains child 
// and returns child index and parent index
function getChildIndex(data) {
    for(let i = 0; i < data.length; i++) {
        if(data[i].parentId != null) {
            for(let j = 0; j < data.length; j++) {
                if(data[j].dataId == data[i].parentId) 
                    return [i, j];
            }
        }
    }
    return [-1];
}

function normalize(data) {
    // get child and start from it
    let childIndex = getChildIndex(data);
    while(childIndex[0] !== -1) {
        // check if dataId and parentId are same
        // if it's same, set parentId to null
        // to remove infinite recursive call
        if(childIndex[0] == childIndex[1]) {
            data[childIndex[0]].parentId = null;
            childIndex = getChildIndex(data);
            continue;
        }
        // get leaf index and its parent index
        const [cIndex, pIndex] = findLeaf(data, childIndex[0], childIndex[1]);
        // correcting data structure before inserting child to parent
        if(data[pIndex].children == undefined)
            data[pIndex].children = [];
        delete data[cIndex].parentId;
        delete data[cIndex].dataId;
        if(data[cIndex].children != undefined) {
            cchildren = data[cIndex].children;
            delete data[cIndex].children;
            data[cIndex] = { data: data[cIndex], children: cchildren };
        }
        // insert children to parent
        data[pIndex].children.push({ data: data[cIndex] });
        // reconfiguring data by removing inserted child
        data = [...data.slice(0, cIndex), ...data.slice(cIndex+1)];
        // check if there is child left, to loop again
        childIndex = getChildIndex(data);
    }
    // there is no child, it's time to normalize parent structure.
    for(let i = 0; i < data.length; i++) {
        delete data[i].dataId;
        delete data[i].parentId;
        //const children = data[i].children;
        //delete data[i].children;
        //data[i] = children ? { data: data[i], children: children } : { data: data[i] }
    }

    return data;
}

console.log(normalize(data));