80 lines
2.1 KiB
JavaScript
80 lines
2.1 KiB
JavaScript
"use strict";
|
||
|
||
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault").default;
|
||
Object.defineProperty(exports, "__esModule", {
|
||
value: true
|
||
});
|
||
exports.calcRangeKeys = calcRangeKeys;
|
||
exports.convertDirectoryKeysToNodes = convertDirectoryKeysToNodes;
|
||
var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
|
||
var Record;
|
||
(function (Record) {
|
||
Record[Record["None"] = 0] = "None";
|
||
Record[Record["Start"] = 1] = "Start";
|
||
Record[Record["End"] = 2] = "End";
|
||
})(Record || (Record = {}));
|
||
function traverseNodesKey(treeData, callback) {
|
||
function processNode(dataNode) {
|
||
const {
|
||
key,
|
||
children
|
||
} = dataNode;
|
||
if (callback(key, dataNode) !== false) {
|
||
traverseNodesKey(children || [], callback);
|
||
}
|
||
}
|
||
treeData.forEach(processNode);
|
||
}
|
||
/** 计算选中范围，只考虑expanded情况以优化性能 */
|
||
function calcRangeKeys(_ref) {
|
||
let {
|
||
treeData,
|
||
expandedKeys,
|
||
startKey,
|
||
endKey
|
||
} = _ref;
|
||
const keys = [];
|
||
let record = Record.None;
|
||
if (startKey && startKey === endKey) {
|
||
return [startKey];
|
||
}
|
||
if (!startKey || !endKey) {
|
||
return [];
|
||
}
|
||
function matchKey(key) {
|
||
return key === startKey || key === endKey;
|
||
}
|
||
traverseNodesKey(treeData, 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);
|
||
}
|
||
return expandedKeys.includes(key);
|
||
});
|
||
return keys;
|
||
}
|
||
function convertDirectoryKeysToNodes(treeData, keys) {
|
||
const restKeys = (0, _toConsumableArray2.default)(keys);
|
||
const nodes = [];
|
||
traverseNodesKey(treeData, (key, node) => {
|
||
const index = restKeys.indexOf(key);
|
||
if (index !== -1) {
|
||
nodes.push(node);
|
||
restKeys.splice(index, 1);
|
||
}
|
||
return !!restKeys.length;
|
||
});
|
||
return nodes;
|
||
} |