-
-
Notifications
You must be signed in to change notification settings - Fork 3.8k
/
Copy pathutil.js
428 lines (353 loc) · 10.3 KB
/
util.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
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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
/* eslint no-loop-func: 0*/
import warning from 'warning';
import TreeNode from './TreeNode';
import { getOptionProps, getSlot } from '../../_util/props-util';
const DRAG_SIDE_RANGE = 0.25;
const DRAG_MIN_GAP = 2;
let onlyTreeNodeWarned = false;
export function warnOnlyTreeNode() {
if (onlyTreeNodeWarned) return;
onlyTreeNodeWarned = true;
warning(false, 'Tree only accept TreeNode as children.');
}
export function arrDel(list, value) {
const clone = list.slice();
const index = clone.indexOf(value);
if (index >= 0) {
clone.splice(index, 1);
}
return clone;
}
export function arrAdd(list, value) {
const clone = list.slice();
if (clone.indexOf(value) === -1) {
clone.push(value);
}
return clone;
}
export function posToArr(pos) {
return pos.split('-');
}
export function getPosition(level, index) {
return `${level}-${index}`;
}
export function isTreeNode(node) {
return node.type && node.type.isTreeNode;
}
export function getNodeChildren(children = []) {
return children.filter(isTreeNode);
}
export function isCheckDisabled(node) {
const { disabled, disableCheckbox, checkable } = getOptionProps(node) || {};
return !!(disabled || disableCheckbox) || checkable === false;
}
export function traverseTreeNodes(treeNodes, callback) {
function processNode(node, index, parent) {
const children = node ? getSlot(node) : treeNodes;
const pos = node ? getPosition(parent.pos, index) : 0;
const disabled = node ? node.props.disabled : false
// Filter children
const childList = getNodeChildren(children);
// Process node if is not root
if (node) {
let key = node.key;
if (!key && (key === undefined || key === null)) {
key = pos;
}
const data = {
node,
index,
pos,
key,
disabled,
parentPos: parent.node ? parent.pos : null,
};
callback(data);
}
// Process children node
childList.forEach((subNode, subIndex) => {
processNode(subNode, subIndex, { node, pos });
});
}
processNode(null);
}
/**
* Use `rc-util` `toArray` to get the children list which keeps the key.
* And return single node if children is only one(This can avoid `key` missing check).
*/
export function mapChildren(children = [], func) {
const list = children.map(func);
if (list.length === 1) {
return list[0];
}
return list;
}
export function getDragNodesKeys(treeNodes, node) {
const { eventKey, pos } = getOptionProps(node);
const dragNodesKeys = [];
traverseTreeNodes(treeNodes, ({ key }) => {
dragNodesKeys.push(key);
});
dragNodesKeys.push(eventKey || pos);
return dragNodesKeys;
}
export function calcDropPosition(event, treeNode) {
const { clientY } = event;
const { top, bottom, height } = treeNode.selectHandle.getBoundingClientRect();
const des = Math.max(height * DRAG_SIDE_RANGE, DRAG_MIN_GAP);
if (clientY <= top + des) {
return -1;
}
if (clientY >= bottom - des) {
return 1;
}
return 0;
}
/**
* Return selectedKeys according with multiple prop
* @param selectedKeys
* @param props
* @returns [string]
*/
export function calcSelectedKeys(selectedKeys, props) {
if (!selectedKeys) {
return undefined;
}
const { multiple } = props;
if (multiple) {
return selectedKeys.slice();
}
if (selectedKeys.length) {
return [selectedKeys[0]];
}
return selectedKeys;
}
/**
* Since React internal will convert key to string,
* we need do this to avoid `checkStrictly` use number match
*/
// function keyListToString (keyList) {
// if (!keyList) return keyList
// return keyList.map(key => String(key))
// }
const internalProcessProps = (props = {}) => {
return {
...props,
class: props.class || props.className,
style: props.style,
key: props.key,
};
};
export function convertDataToTree(treeData, processor) {
if (!treeData) return [];
const { processProps = internalProcessProps } = processor || {};
const list = Array.isArray(treeData) ? treeData : [treeData];
return list.map(({ children, ...props }) => {
const childrenNodes = convertDataToTree(children, processor);
return <TreeNode {...processProps(props)}>{childrenNodes}</TreeNode>;
});
}
// TODO: ========================= NEW LOGIC =========================
/**
* Calculate treeNodes entities. `processTreeEntity` is used for `rc-tree-select`
* @param treeNodes
* @param processTreeEntity User can customize the entity
*/
export function convertTreeToEntities(
treeNodes,
{ initWrapper, processEntity, onProcessFinished } = {},
) {
const posEntities = new Map();
const keyEntities = new Map();
let wrapper = {
posEntities,
keyEntities,
};
if (initWrapper) {
wrapper = initWrapper(wrapper) || wrapper;
}
traverseTreeNodes(treeNodes, item => {
const { node, index, pos, key, parentPos, disabled } = item;
const entity = { node, index, key, pos, disabled };
posEntities.set(pos, entity);
keyEntities.set(key, entity);
// Fill children
entity.parent = posEntities.get(parentPos);
if (entity.parent) {
entity.parent.children = entity.parent.children || [];
entity.parent.children.push(entity);
}
if (processEntity) {
processEntity(entity, wrapper);
}
});
if (onProcessFinished) {
onProcessFinished(wrapper);
}
return wrapper;
}
/**
* Parse `checkedKeys` to { checkedKeys, halfCheckedKeys } style
*/
export function parseCheckedKeys(keys) {
if (!keys) {
return null;
}
// Convert keys to object format
let keyProps;
if (Array.isArray(keys)) {
// [Legacy] Follow the api doc
keyProps = {
checkedKeys: keys,
halfCheckedKeys: undefined,
};
} else if (typeof keys === 'object') {
keyProps = {
checkedKeys: keys.checked || undefined,
halfCheckedKeys: keys.halfChecked || undefined,
};
} else {
warning(false, '`checkedKeys` is not an array or an object');
return null;
}
// keyProps.checkedKeys = keyListToString(keyProps.checkedKeys)
// keyProps.halfCheckedKeys = keyListToString(keyProps.halfCheckedKeys)
return keyProps;
}
/**
* Conduct check state by the keyList. It will conduct up & from the provided key.
* If the conduct path reach the disabled or already checked / unchecked node will stop conduct.
* @param keyList list of keys
* @param isCheck is check the node or not
* @param keyEntities parsed by `convertTreeToEntities` function in Tree
* @param checkStatus Can pass current checked status for process (usually for uncheck operation)
* @returns {{checkedKeys: [], halfCheckedKeys: []}}
*/
export function conductCheck(keyList, isCheck, keyEntities, checkStatus = {}) {
const checkedKeys = new Map();
const halfCheckedKeys = new Map(); // Record the key has some child checked (include child half checked)
(checkStatus.checkedKeys || []).forEach(key => {
checkedKeys.set(key, true);
});
(checkStatus.halfCheckedKeys || []).forEach(key => {
halfCheckedKeys.set(key, true);
});
// Conduct up
function conductUp(key) {
if (checkedKeys.get(key) === isCheck) return;
const entity = keyEntities.get(key);
if (!entity) return;
const { children, parent, node } = entity;
if (isCheckDisabled(node)) return;
// Check child node checked status
let everyChildChecked = true;
let someChildChecked = false; // Child checked or half checked
(children || [])
.filter(child => !isCheckDisabled(child.node))
.forEach(({ key: childKey }) => {
const childChecked = checkedKeys.get(childKey);
const childHalfChecked = halfCheckedKeys.get(childKey);
if (childChecked || childHalfChecked) someChildChecked = true;
if (!childChecked) everyChildChecked = false;
});
// Update checked status
if (isCheck) {
checkedKeys.set(key, everyChildChecked);
} else {
checkedKeys.set(key, false);
}
halfCheckedKeys.set(key, someChildChecked);
if (parent) {
conductUp(parent.key);
}
}
// Conduct down
function conductDown(key) {
if (checkedKeys.get(key) === isCheck) return;
const entity = keyEntities.get(key);
if (!entity) return;
const { children, node } = entity;
if (isCheckDisabled(node)) return;
checkedKeys.set(key, isCheck);
(children || []).forEach(child => {
conductDown(child.key);
});
}
function conduct(key) {
const entity = keyEntities.get(key);
if (!entity) {
warning(false, `'${key}' does not exist in the tree.`);
return;
}
const { children, parent, node } = entity;
checkedKeys.set(key, isCheck);
if (isCheckDisabled(node)) return;
// Conduct down
(children || [])
.filter(child => !isCheckDisabled(child.node))
.forEach(child => {
conductDown(child.key);
});
// Conduct up
if (parent) {
conductUp(parent.key);
}
}
(keyList || []).forEach(key => {
conduct(key);
});
const checkedKeyList = [];
const halfCheckedKeyList = [];
// Fill checked list
for (const [key, value] of checkedKeys) {
if (value) {
checkedKeyList.push(key);
}
}
// Fill half checked list
for (const [key, value] of halfCheckedKeys) {
if (!checkedKeys.get(key) && value) {
halfCheckedKeyList.push(key);
}
}
return {
checkedKeys: checkedKeyList,
halfCheckedKeys: halfCheckedKeyList,
};
}
/**
* If user use `autoExpandParent` we should get the list of parent node
* @param keyList
* @param keyEntities
*/
export function conductExpandParent(keyList, keyEntities) {
const expandedKeys = new Map();
function conductUp(key) {
if (expandedKeys.get(key)) return;
const entity = keyEntities.get(key);
if (!entity) return;
expandedKeys.set(key, true);
const { parent, node } = entity;
const props = getOptionProps(node);
if (props && props.disabled) return;
if (parent) {
conductUp(parent.key);
}
}
(keyList || []).forEach(key => {
conductUp(key);
});
return [...expandedKeys.keys()];
}
/**
* Returns only the data- and aria- key/value pairs
* @param {object} props
*/
export function getDataAndAria(props) {
return Object.keys(props).reduce((prev, key) => {
if (key.substr(0, 5) === 'data-' || key.substr(0, 5) === 'aria-') {
prev[key] = props[key];
}
return prev;
}, {});
}