JavaScript树数据处理

看到别人项目中的树数据处理写的很好很厉害，🆗，盗用借鉴：

//数据树处理
export function treeData (source, id, parentId, children) {
  let cloneData = JSON.parse(JSON.stringify(source))
  return cloneData.filter(father => {
    let branchArr = cloneData.filter(child => father[id] == child[parentId]);
    branchArr.length > 0 ? father[children] = branchArr : ''
    return father[parentId] == 0        // 如果第一层不是parentId=0，请自行修改
  })
}
/* [
            {id:1,parentId:0,name:"一级菜单A",rank:1},
            {id:2,parentId:0,name:"一级菜单B",rank:1},
            {id:3,parentId:0,name:"一级菜单C",rank:1},
            {id:4,parentId:1,name:"二级菜单A-A",rank:2},
            {id:5,parentId:1,name:"二级菜单A-B",rank:2},
            {id:6,parentId:2,name:"二级菜单B-A",rank:2},
            {id:7,parentId:4,name:"三级菜单A-A-A",rank:3},
            {id:8,parentId:7,name:"四级菜单A-A-A-A",rank:4},
            {id:9,parentId:8,name:"五级菜单A-A-A-A-A",rank:5},
            {id:10,parentId:9,name:"六级菜单A-A-A-A-A-A",rank:6},
            {id:11,parentId:10,name:"七级菜单A-A-A-A-A-A-A",rank:7},
            {id:12,parentId:11,name:"八级菜单A-A-A-A-A-A-A-A",rank:8},
            {id:13,parentId:12,name:"九级菜单A-A-A-A-A-A-A-A-A",rank:9},
            {id:14,parentId:13,name:"十级菜单A-A-A-A-A-A-A-A-A-A",rank:10},
          ] */
// 调用时，字段名以字符串的形式传参，如treeData(source, 'id', 'parentId', 'children')

时隔好久，补充下东西。如果需要排序如何弄？

treeDataBySort(source, id, parentId, children, order) {
  var compare = function (prop) {
    return function (obj1, obj2) {
      var val1 = obj1[prop];
      var val2 = obj2[prop];
      return val1 - val2 //升序
      // if (val1 < val2) {
      //   console.log('val1,val2 :>> ', val1,val2);
      //   return -1;//表示第一个参数应该排在第二个参数的前面
      // } else if (val1 > val2) {
      //   return 1;//表示第一个参数应该排在第二个参数的后面
      // } else {
      //   return 0;
      // }
    }
  }
  let cloneData = JSON.parse(JSON.stringify(source))
  return cloneData.filter(father => {
    let branchArr = cloneData.filter(child => father[id] == child[parentId]).sort(compare(order));
    branchArr.length > 0 ? father[children] = branchArr : ''
    return father[parentId] == 0 // 如果第一层不是parentId=0，请自行修改
  }).sort(compare(order));
}

其中order就是你需要排序的根据字段。一般来说，数字。