-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathArray2Tree.js
146 lines (135 loc) · 2.79 KB
/
Array2Tree.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
export const treeTransform1 = (
data = [],
key = "id",
parentKey = "parendId",
rootPid = -1
) => {
const parents = data.filter(
item => item[parentKey] === rootPid || item[parentKey] === "undefined"
);
const children = data.filter(
item => item[parentKey] !== rootPid && item[parentKey] !== "undefined"
);
// eslint-disable-next-line
const translator = (parents, children) => {
parents.forEach(parent => {
children.forEach((current, index) => {
if (current[parentKey] !== parent[key]) {
return;
}
const temp = JSON.parse(JSON.stringify(children));
temp.splice(index, 1);
if (typeof parent.children !== "undefined") {
parent.children.push(current);
} else {
parent.children = [current];
}
return translator([current], temp);
});
});
};
translator(parents, children);
return parents;
};
export const treeDataTransform = (
data = [],
key = "id",
parentKey = "parentId",
rootPid = -1
) => {
const midObj = {};
const arr = [];
data.sort((a, b) => b[parentKey] - a[parentKey]);
// eslint-disable-next-line
const translator = data => {
if (!data || !data.length) {
return data;
}
data.forEach((item, index) => {
const nowPid = item[parentKey];
const nowId = item[key];
if (nowPid !== rootPid) {
translator(item);
delete data[index];
}
// 建立当前节点的父节点的children 数组
if (midObj[nowPid]) {
midObj[nowPid].push(item);
} else {
midObj[nowPid] = [];
midObj[nowPid].push(item);
}
// 将children 放入合适的位置
if (midObj[nowId]) {
item.children = midObj[nowId];
delete midObj[nowId];
if (item && data[index]) {
arr.push(item);
}
}
});
};
translator(data);
return arr;
};
export const SayHi = () => {
console.log("Hello ,I'm from npm package");
};
// const data = [
// {
// id: 0,
// parentId: -1,
// name: "菜单根"
// },
// {
// id: 1,
// parentId: 0,
// name: "test1"
// },
// {
// id: 2,
// parentId: 0,
// name: "test2"
// },
// {
// id: 5,
// parentId: 0,
// name: "test3"
// },
// {
// id: 6,
// parentId: 0,
// name: "test4"
// },
// {
// id: 7,
// parentId: 0,
// name: "test5"
// },
// {
// id: 3,
// parentId: 2,
// name: "test6"
// },
// {
// id: 4,
// parentId: 2,
// name: "test7"
// },
// {
// id: 10,
// parentId: 2,
// name: "test8"
// },
// {
// id: 8,
// parentId: 7,
// name: "test9"
// },
// {
// id: 9,
// parentId: 8,
// name: "test10"
// }
// ];
// const arr = treeDataTransform(data);