树形数据转换

/** * 树形数据转换 * @param {*} data * @param {*} id * @param {*} pid */
 export function treeDataTranslate (data, id = 'id', pid = 'parentId',order,istyyw,caseId) {
    
  let res = []
  let temp = {
    }
  for (let i = 0; i < data.length; i++) {
    
    temp[data[i][id]] = data[i]
    if(istyyw&&caseId){
    
      if(data[i].pid==(caseId+"1")){
    
        temp[data[i][id]]['_level'] = 1;
      }
    }
  }
  for (let k = 0; k < data.length; k++) {
    
    if (temp[data[k][pid]] && data[k][id] !== data[k][pid]) {
    
      if (!temp[data[k][pid]]['children']) {
    
        temp[data[k][pid]]['children'] = []
      }
      if (!temp[data[k][pid]]['_level']) {
    
        temp[data[k][pid]]['_level'] = 1
      }
      data[k]['_level'] = temp[data[k][pid]]._level + 1
      if(istyyw){
    
          data[k]['catalogLevel'] = data[k]['_level'];
      }
      temp[data[k][pid]]['children'].push(data[k])
    } else {
    
      data[k]['_level'] = 1;
      if(istyyw){
    
          data[k]['catalogLevel'] = 1;
      }
      res.push(data[k])
    }
  }
  function orderFunc(a,b){
    
      if(!a[order])a[order] = 0;
      if(!b[order])b[order] = 0;
      return a[order] - b[order];
  }
  function sortDataHandle(arr){
    
    arr = arr.sort(orderFunc);
    for(var i = 0;i<arr.length;i++){
    
      if(arr[i].children&&arr[i].children.length){
    
        arr[i].children = sortDataHandle(arr[i].children);
      }
    }
    return arr;
  }
  if(order)res = sortDataHandle(res);
  // console.log(res);
  return res
}