NuclearDispersionSystem/ant-design-vue-jeecg/node_modules/ant-design-vue/es/tree/util.js
2023-09-14 14:47:11 +08:00

105 lines
2.5 KiB
Java
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

import _toConsumableArray from 'babel-runtime/helpers/toConsumableArray';
import { getNodeChildren, convertTreeToEntities } from '../vc-tree/src/util';
import { getSlots } from '../_util/props-util';
var Record = {
None: 'node',
Start: 'start',
End: 'end'
};
// TODO: Move this logic into `rc-tree`
function traverseNodesKey(rootChildren, callback) {
var nodeList = getNodeChildren(rootChildren) || [];
function processNode(node) {
var key = node.key;
var children = getSlots(node)['default'];
if (callback(key, node) !== false) {
traverseNodesKey(typeof children === 'function' ? children() : children, callback);
}
}
nodeList.forEach(processNode);
}
export function getFullKeyList(children) {
var _convertTreeToEntitie = convertTreeToEntities(children),
keyEntities = _convertTreeToEntitie.keyEntities;
return [].concat(_toConsumableArray(keyEntities.keys()));
}
/** 计算选中范围只考虑expanded情况以优化性能 */
export function calcRangeKeys(rootChildren, expandedKeys, startKey, endKey) {
var keys = [];
var record = Record.None;
if (startKey && startKey === endKey) {
return [startKey];
}
if (!startKey || !endKey) {
return [];
}
function matchKey(key) {
return key === startKey || key === endKey;
}
traverseNodesKey(rootChildren, function (key) {
if (record === Record.End) {
return false;
}
if (matchKey(key)) {
// Match test
keys.push(key);
if (record === Record.None) {
record = Record.Start;
} else if (record === Record.Start) {
record = Record.End;
return false;
}
} else if (record === Record.Start) {
// Append selection
keys.push(key);
}
if (expandedKeys.indexOf(key) === -1) {
return false;
}
return true;
});
return keys;
}
export function convertDirectoryKeysToNodes(rootChildren, keys) {
var restKeys = [].concat(_toConsumableArray(keys));
var nodes = [];
traverseNodesKey(rootChildren, function (key, node) {
var index = restKeys.indexOf(key);
if (index !== -1) {
nodes.push(node);
restKeys.splice(index, 1);
}
return !!restKeys.length;
});
return nodes;
}
export function getFullKeyListByTreeData(treeData) {
var keys = [];
(treeData || []).forEach(function (item) {
keys.push(item.key);
if (item.children) {
keys = [].concat(_toConsumableArray(keys), _toConsumableArray(getFullKeyListByTreeData(item.children)));
}
});
return keys;
}