树形数据处理

最新推荐文章于 2023-12-14 16:41:42 发布

liko0403

最新推荐文章于 2023-12-14 16:41:42 发布

阅读量101

点赞数

分类专栏： work 文章标签：前端 javascript

本文链接：https://blog.csdn.net/weixin_42533892/article/details/128221340

版权

work 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

const demo = [
    {
        "id": 1,
        "resourceCodeId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
        "resourceName": "账户管理",
        "parentId": null,
        "path": "/accountManagement",
        "icon": "el-icon-s-tools"
    },
    {
        "id": 2,
        "resourceCodeId": "a800c24f-91c2-4ebe-93c4-58bd4597172",
        "resourceName": "管理",
        "parentId": null,
        "path": "/accountManagement",
        "icon": "el-icon-s-tools"
    },
    {
        "id": 3003,
        "resourceCodeId": "e57d1f74-e1e3-4fbd-8fc4-7d57e2d2c097",
        "resourceName": "角色管理",
        "parentId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
        "path": "/accountManagement/role",
        "icon": ""
    },
    {
        "id": 5,
        "resourceCodeId": "412a3255-347a-46d3-aa61-506b92f5d35e",
        "resourceName": "员工管理",
        "parentId": "a800c24f-91c2-4ebe-93c4-58bd4597172b",
        "path": "/accountManagement/staff",
        "icon": ""
    },
]

    getTree = (data, rootValue) => {
        let result = []
        data.forEach(item => {
            if (item.parentId === rootValue) {
                const chirdren = this.getTree(data, item.resourceCodeId)
                item.children = chirdren
                result.push(item)
            }
        });
        return result
    }