ant-design-vue
Version:
An enterprise-class UI design language and Vue-based implementation
124 lines (95 loc) • 4.13 kB
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(o); 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; }
import { getNodeChildren, convertTreeToEntities } from '../vc-tree/src/util';
import { getSlot } from '../_util/props-util';
var Record;
(function (Record) {
Record[Record["None"] = 0] = "None";
Record[Record["Start"] = 1] = "Start";
Record[Record["End"] = 2] = "End";
})(Record || (Record = {})); // TODO: Move this logic into `rc-tree`
function traverseNodesKey(rootChildren, callback) {
var nodeList = getNodeChildren(rootChildren) || [];
function processNode(node) {
var key = node.key;
var children = getSlot(node);
if (callback(key, node) !== false) {
traverseNodesKey(children, callback);
}
}
nodeList.forEach(processNode);
}
export function getFullKeyList(children) {
var _convertTreeToEntitie = convertTreeToEntities(children),
keyEntities = _convertTreeToEntitie.keyEntities;
return _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 = _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 replaceFields = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
var keys = [];
var _replaceFields$forEac = replaceFields(treeData || []).forEach(function (item) {
keys.push(item[key]);
if (item[children]) {
keys = [].concat(_toConsumableArray(keys), _toConsumableArray(getFullKeyListByTreeData(item[children], replaceFields)));
}
}),
_replaceFields$forEac2 = _replaceFields$forEac.key,
key = _replaceFields$forEac2 === void 0 ? 'key' : _replaceFields$forEac2,
_replaceFields$forEac3 = _replaceFields$forEac.children,
children = _replaceFields$forEac3 === void 0 ? 'children' : _replaceFields$forEac3;
return keys;
}