95 lines
2.9 KiB
JavaScript
95 lines
2.9 KiB
JavaScript
function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
|
||
|
||
function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
|
||
|
||
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(n); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
|
||
|
||
function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && Symbol.iterator in Object(iter)) return Array.from(iter); }
|
||
|
||
function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
|
||
|
||
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
|
||
|
||
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) {
|
||
var key = dataNode.key,
|
||
children = dataNode.children;
|
||
|
||
if (callback(key, dataNode) !== false) {
|
||
traverseNodesKey(children || [], callback);
|
||
}
|
||
}
|
||
|
||
treeData.forEach(processNode);
|
||
}
|
||
/** 计算选中范围，只考虑expanded情况以优化性能 */
|
||
|
||
|
||
export function calcRangeKeys(treeData, 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(treeData, 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(treeData, keys) {
|
||
var restKeys = _toConsumableArray(keys);
|
||
|
||
var nodes = [];
|
||
traverseNodesKey(treeData, function (key, node) {
|
||
var index = restKeys.indexOf(key);
|
||
|
||
if (index !== -1) {
|
||
nodes.push(node);
|
||
restKeys.splice(index, 1);
|
||
}
|
||
|
||
return !!restKeys.length;
|
||
});
|
||
return nodes;
|
||
} |