vue-antd-ui
Version:
An enterprise-class UI design language and Vue-based implementation
154 lines (143 loc) • 4.44 kB
JavaScript
/* eslint no-loop-func: 0, no-console: 0 */
export function generateData() {
var x = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 3;
var y = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;
var z = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
var gData = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : [];
// x:每一级下的节点总数。y:每级节点里有y个节点、存在子节点。z:树的level层级数(0表示一级)
function _loop(_level, _preKey, _tns) {
var preKey = _preKey || '0';
var tns = _tns || gData;
var children = [];
for (var i = 0; i < x; i++) {
var key = preKey + '-' + i;
tns.push({
label: key + '-label',
value: key + '-value',
key: key,
disabled: key === '0-0-0-1' || false
});
if (i < y) {
children.push(key);
}
}
if (_level < 0) {
return tns;
}
var __level = _level - 1;
children.forEach(function (key, index) {
tns[index].children = [];
return _loop(__level, key, tns[index].children);
});
}
_loop(z);
return gData;
}
export function calcTotal() {
var x = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : 3;
var y = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;
var z = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
/* eslint no-param-reassign:0*/
var rec = function rec(n) {
return n >= 0 ? x * Math.pow(y, n--) + rec(n) : 0;
};
return rec(z + 1);
}
console.log('总节点数(单个tree):', calcTotal());
export var gData = generateData();
export function generateTreeNodes(treeNode) {
var arr = [];
var key = treeNode.eventKey;
for (var i = 0; i < 3; i++) {
arr.push({ label: key + '-' + i + '-label', value: key + '-' + i + '-value', key: key + '-' + i });
}
return arr;
}
function setLeaf(treeData, curKey, level) {
var loopLeaf = function loopLeaf(data, lev) {
var l = lev - 1;
data.forEach(function (item) {
if (item.key.length > curKey.length ? item.key.indexOf(curKey) !== 0 : curKey.indexOf(item.key) !== 0) {
return;
}
if (item.children) {
loopLeaf(item.children, l);
} else if (l < 1) {
item.isLeaf = true;
}
});
};
loopLeaf(treeData, level + 1);
}
export function getNewTreeData(treeData, curKey, child, level) {
var loop = function loop(data) {
if (level < 1 || curKey.length - 3 > level * 2) return;
data.forEach(function (item) {
if (curKey.indexOf(item.key) === 0) {
if (item.children) {
loop(item.children);
} else {
item.children = child;
}
}
});
};
loop(treeData);
setLeaf(treeData, curKey, level);
}
function loopData(data, callback) {
var loop = function loop(d) {
var level = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
d.forEach(function (item, index) {
var pos = level + '-' + index;
if (item.children) {
loop(item.children, pos);
}
callback(item, index, pos);
});
};
loop(data);
}
function isPositionPrefix(smallPos, bigPos) {
if (bigPos.length < smallPos.length) {
return false;
}
// attention: "0-0-1" "0-0-10"
if (bigPos.length > smallPos.length && bigPos.charAt(smallPos.length) !== '-') {
return false;
}
return bigPos.substr(0, smallPos.length) === smallPos;
}
// console.log(isPositionPrefix("0-1", "0-10-1"));
export function getFilterValue(val, sVal, delVal) {
var allPos = [];
var delPos = [];
loopData(gData, function (item, index, pos) {
if (sVal.indexOf(item.value) > -1) {
allPos.push(pos);
}
if (delVal.indexOf(item.value) > -1) {
delPos.push(pos);
}
});
var newPos = [];
delPos.forEach(function (item) {
allPos.forEach(function (i) {
if (isPositionPrefix(item, i) || isPositionPrefix(i, item)) {
// 过滤掉 父级节点 和 所有子节点。
// 因为 node节点 不选时,其 父级节点 和 所有子节点 都不选。
return;
}
newPos.push(i);
});
});
var newVal = [];
if (newPos.length) {
loopData(gData, function (item, index, pos) {
if (newPos.indexOf(pos) > -1) {
newVal.push(item.value);
}
});
}
return newVal;
}