searchNode(oldArr) {
oldArr.forEach((element) => {
let parentId = element.ParentId;
if (parentId !== "") {
oldArr.forEach((ele) => {
if (ele.id == parentId) {
//当内层循环的ID== 外层循环的parendId时,(说明有children),需要往该内层id里建个children并push对应的数组;
if (!ele.children) {
ele.children = [];
}
ele.children.push(element);
}
});
}
});
//console.log("oldArr=",oldArr); //此时的数组是在原基础上补充了children;
oldArr = oldArr.filter((ele) => ele.ParentId === null || ele.ParentId === ""); //这一步是过滤,按树展开,将多余的数组剔除;
console.log("oldArr=",oldArr);
//this.treeAlias = oldArr;
this.IndicatorOptions = oldArr
//console.log(this.treeAlias)
return oldArr;
},