122 lines
3.0 KiB
Java
122 lines
3.0 KiB
Java
![]() |
'use strict';
|
|||
|
|
|||
|
Object.defineProperty(exports, "__esModule", {
|
|||
|
value: true
|
|||
|
});
|
|||
|
|
|||
|
var _toConsumableArray2 = require('babel-runtime/helpers/toConsumableArray');
|
|||
|
|
|||
|
var _toConsumableArray3 = _interopRequireDefault(_toConsumableArray2);
|
|||
|
|
|||
|
exports.getFullKeyList = getFullKeyList;
|
|||
|
exports.calcRangeKeys = calcRangeKeys;
|
|||
|
exports.convertDirectoryKeysToNodes = convertDirectoryKeysToNodes;
|
|||
|
exports.getFullKeyListByTreeData = getFullKeyListByTreeData;
|
|||
|
|
|||
|
var _util = require('../vc-tree/src/util');
|
|||
|
|
|||
|
var _propsUtil = require('../_util/props-util');
|
|||
|
|
|||
|
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { 'default': obj }; }
|
|||
|
|
|||
|
var Record = {
|
|||
|
None: 'node',
|
|||
|
Start: 'start',
|
|||
|
End: 'end'
|
|||
|
};
|
|||
|
|
|||
|
// TODO: Move this logic into `rc-tree`
|
|||
|
function traverseNodesKey(rootChildren, callback) {
|
|||
|
var nodeList = (0, _util.getNodeChildren)(rootChildren) || [];
|
|||
|
|
|||
|
function processNode(node) {
|
|||
|
var key = node.key;
|
|||
|
|
|||
|
var children = (0, _propsUtil.getSlots)(node)['default'];
|
|||
|
if (callback(key, node) !== false) {
|
|||
|
traverseNodesKey(typeof children === 'function' ? children() : children, callback);
|
|||
|
}
|
|||
|
}
|
|||
|
|
|||
|
nodeList.forEach(processNode);
|
|||
|
}
|
|||
|
|
|||
|
function getFullKeyList(children) {
|
|||
|
var _convertTreeToEntitie = (0, _util.convertTreeToEntities)(children),
|
|||
|
keyEntities = _convertTreeToEntitie.keyEntities;
|
|||
|
|
|||
|
return [].concat((0, _toConsumableArray3['default'])(keyEntities.keys()));
|
|||
|
}
|
|||
|
|
|||
|
/** 计算选中范围,只考虑expanded情况以优化性能 */
|
|||
|
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;
|
|||
|
}
|
|||
|
|
|||
|
function convertDirectoryKeysToNodes(rootChildren, keys) {
|
|||
|
var restKeys = [].concat((0, _toConsumableArray3['default'])(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;
|
|||
|
}
|
|||
|
|
|||
|
function getFullKeyListByTreeData(treeData) {
|
|||
|
var keys = [];
|
|||
|
|
|||
|
(treeData || []).forEach(function (item) {
|
|||
|
keys.push(item.key);
|
|||
|
if (item.children) {
|
|||
|
keys = [].concat((0, _toConsumableArray3['default'])(keys), (0, _toConsumableArray3['default'])(getFullKeyListByTreeData(item.children)));
|
|||
|
}
|
|||
|
});
|
|||
|
return keys;
|
|||
|
}
|