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
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
/**
* @desc 克隆
* @param obj 克隆源
*/
export const deepClone = (obj) => {
let newObj = Array.isArray(obj) ? [] : {};
if (obj && typeof obj === "object") {
for (let key in obj) {
if (obj.hasOwnProperty(key)) {
newObj[key] =
obj && typeof obj[key] === "object"
? deepClone(obj[key])
: obj[key];
}
}
}
return newObj;
}
/**
* @desc 建立树型
* @param data 数据源
* @param parentId 根节点
* @param id id 匹配项
* @param pid parentId匹配项
*/
export const toTreeData = (data, parentId, id, pid) => {
// 建立个树形结构,需要定义个最顶层的父节点,pId是-1
let parent = [];
for (let i = 0; i < data.length; i++) {
if (data[i][pid] != parentId) {
} else {
let obj = {};
for (let key in data[i]) {
obj[key] = data[i][key]
}
obj['children'] = [];
parent.push(obj);
}
}
fnChildren(parent);
function fnChildren(parent) {
if (data.length !== 0) {
for (let i = 0; i < parent.length; i++) {
for (let j = 0; j < data.length; j++) {
if (parent[i].id == data[j][pid]) {
let obj = {};
for (let k in data[j]) {
obj[k] = data[j][k]
}
obj["children"] = [];
parent[i].children.push(obj);
}
}
fnChildren(parent[i].children);
}
}
}
return deleteEmptyChildren(parent);
}
export const deleteEmptyChildren = (arr) => {
if (arr.length) {
for (let i in arr) {
if (arr[i].children.length) {
deleteEmptyChildren(arr[i].children)
} else {
delete arr[i].children;
}
}
}
return arr
}
export const parentTreeNode = (treeList, parentKEY, id) => {
let temp = []
let searchFn = function (treeList, id) {
for (let i = 0; i < treeList.length; i++) {
let item = treeList[i]
if (item.id === id) {
temp.push(item)
searchFn(treeList, item[parentKEY])
break
} else {
if (item.children) {
searchFn(item.children, id)
}
}
}
}
searchFn(treeList, id)
return temp
}
export const childrenTreeNode = (treeList, parentKEY, id) => {
let temp = [{ id: id }];
let searchFn = function (treeList, id) {
for (let i = 0; i < treeList.length; i++) {
let item = treeList[i];
if (item[parentKEY] === id) {
temp.push(item);
searchFn(treeList, item.id);
// break;
} else {
if (item.children) {
searchFn(item.children, id);
}
}
// console.log("run");
}
};
searchFn(treeList, id);
return temp;
}
export const getItemData = (list, key, value) => {
for (let i = 0; i < list.length; i++) {
let item = list[i];
if (item[key] === value) {
return item;
} else {
if (item.children && item.children.length > 0) {
let res = getItemData(item.children, key, value);
if (res) {
return res;
}
}
}
}
}
/**
* @desc 叶子节点查询根节点
* @param tree 数据源
* @param parentId 根节点
* @param config id children 匹配项
*/
export const getTreeIds = (tree, nodeId, config) => {
const { children = 'children', id = 'id' } = config || {}
const toFlatArray = (tree, parentId) => {
return tree.reduce((t, _) => {
const child = _[children]
return [
...t,
parentId ? { ..._, parentId } : _,
...(child && child.length ? toFlatArray(child, _[id]) : [])]
}, [])
}
const getIds = flatArray => {
let ids = [nodeId]
let child = flatArray.find(_ => _[id] === nodeId)
while (child && child.parentId) {
ids = [child.parentId, ...ids]
child = flatArray.find(_ => _[id] === child.parentId)
}
return ids
}
return getIds(toFlatArray(tree))
}