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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
/* eslint no-loop-func: 0*/
/* eslint no-console:0 */
export function generateData() {
var x = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 3;
var y = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;
var z = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
var gData = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
// x:每一级下的节点总数。y:每级节点里有y个节点、存在子节点。z:树的level层级数(0表示一级)
function _loop(_level, _preKey, _tns) {
var preKey = _preKey || '0';
var tns = _tns || gData;
var children = [];
for (var i = 0; i < x; i++) {
var key = preKey + '-' + i;
tns.push({ title: key + '-label', key: key + '-key' });
if (i < y) {
children.push(key);
}
}
if (_level < 0) {
return tns;
}
var __level = _level - 1;
children.forEach(function (key, index) {
tns[index].children = [];
return _loop(__level, key, tns[index].children);
});
}
_loop(z);
return gData;
}
export function calcTotal() {
var x = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 3;
var y = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;
var z = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
/* eslint no-param-reassign:0*/
var rec = function rec(n) {
return n >= 0 ? x * Math.pow(y, n--) + rec(n) : 0;
};
return rec(z + 1);
}
console.log('总节点数(单个tree):', calcTotal());
// 性能测试:总节点数超过 2000(z要小)明显感觉慢。z 变大时,递归多,会卡死。
export var gData = generateData();
function isPositionPrefix(smallPos, bigPos) {
if (bigPos.length < smallPos.length) {
return false;
}
// attention: "0-0-1" "0-0-10"
if (bigPos.length > smallPos.length && bigPos.charAt(smallPos.length) !== '-') {
return false;
}
return bigPos.substr(0, smallPos.length) === smallPos;
}
// console.log(isPositionPrefix("0-1", "0-10-1"));
// arr.length === 628, use time: ~20ms
export function filterParentPosition(arr) {
var levelObj = {};
arr.forEach(function (item) {
var posLen = item.split('-').length;
if (!levelObj[posLen]) {
levelObj[posLen] = [];
}
levelObj[posLen].push(item);
});
var levelArr = Object.keys(levelObj).sort();
var _loop2 = function _loop2(i) {
if (levelArr[i + 1]) {
levelObj[levelArr[i]].forEach(function (ii) {
var _loop3 = function _loop3(j) {
levelObj[levelArr[j]].forEach(function (_i, index) {
if (isPositionPrefix(ii, _i)) {
levelObj[levelArr[j]][index] = null;
}
});
levelObj[levelArr[j]] = levelObj[levelArr[j]].filter(function (p) {
return p;
});
};
for (var j = i + 1; j < levelArr.length; j++) {
_loop3(j);
}
});
}
};
for (var i = 0; i < levelArr.length; i++) {
_loop2(i);
}
var nArr = [];
levelArr.forEach(function (i) {
nArr = nArr.concat(levelObj[i]);
});
return nArr;
}
// console.log(filterParentPosition(
// ['0-2', '0-3-3', '0-10', '0-10-0', '0-0-1', '0-0', '0-1-1', '0-1']
// ));
function loopData(data, callback) {
var loop = function loop(d) {
var level = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
d.forEach(function (item, index) {
var pos = level + '-' + index;
if (item.children) {
loop(item.children, pos);
}
callback(item, index, pos);
});
};
loop(data);
}
function spl(str) {
return str.split('-');
}
function splitLen(str) {
return str.split('-').length;
}
export function getFilterExpandedKeys(data, expandedKeys) {
var expandedPosArr = [];
loopData(data, function (item, index, pos) {
if (expandedKeys.indexOf(item.key) > -1) {
expandedPosArr.push(pos);
}
});
var filterExpandedKeys = [];
loopData(data, function (item, index, pos) {
expandedPosArr.forEach(function (p) {
if ((splitLen(pos) < splitLen(p) && p.indexOf(pos) === 0 || pos === p) && filterExpandedKeys.indexOf(item.key) === -1) {
filterExpandedKeys.push(item.key);
}
});
});
return filterExpandedKeys;
}
function isSibling(pos, pos1) {
pos.pop();
pos1.pop();
return pos.join(',') === pos1.join(',');
}
export function getRadioSelectKeys(data, selectedKeys, key) {
var res = [];
var pkObjArr = [];
var selPkObjArr = [];
loopData(data, function (item, index, pos) {
if (selectedKeys.indexOf(item.key) > -1) {
pkObjArr.push([pos, item.key]);
}
if (key && key === item.key) {
selPkObjArr.push(pos, item.key);
}
});
var lenObj = {};
var getPosKey = function getPosKey(pos, k) {
var posLen = splitLen(pos);
if (!lenObj[posLen]) {
lenObj[posLen] = [[pos, k]];
} else {
lenObj[posLen].forEach(function (pkArr, i) {
if (isSibling(spl(pkArr[0]), spl(pos))) {
// 后来覆盖前者
lenObj[posLen][i] = [pos, k];
} else if (spl(pkArr[0]) !== spl(pos)) {
lenObj[posLen].push([pos, k]);
}
});
}
};
pkObjArr.forEach(function (pk) {
getPosKey(pk[0], pk[1]);
});
if (key) {
getPosKey(selPkObjArr[0], selPkObjArr[1]);
}
Object.keys(lenObj).forEach(function (item) {
lenObj[item].forEach(function (i) {
if (res.indexOf(i[1]) === -1) {
res.push(i[1]);
}
});
});
return res;
}