tree字典递归查找name
isEmpty (obj) {
if (obj === 0) return true;
if (Array.isArray(obj)) return !(obj.length > 0);
return (obj === null || obj === undefined || obj === '' || obj === NaN);
},
byIdGetLabelFormat(arr,id) {
return this.byIdGetLabel(
arr,
Number(id)
);
},
byIdGetLabel(arr, id) {
for (let i = 0; i < arr.length; i++) {
let currentObj = arr[i];
if (currentObj.id === id) {
return currentObj;
} else {
if (!this.isEmpty(currentObj.children)) {
let res = this.byIdGetLabel(currentObj.children, id);
if (res) return res;
}
}
}
},