@oceanbase/ui
Version:
The UI library based on OceanBase Design
111 lines (107 loc) • 6.83 kB
JavaScript
function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == _typeof(i) ? i : String(i); }
function _toPrimitive(t, r) { if ("object" != _typeof(t) || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != _typeof(i)) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
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 _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
function _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableRest(); }
function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure 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 _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; }
function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
import { omit } from 'lodash';
var generateKey = function generateKey(values) {
return "".concat(values.join('$$'));
};
var splitKey = function splitKey(value) {
// todo 考虑格式错误的情况
var _ref = value.split('$$'),
_ref2 = _toArray(_ref),
values = _ref2.slice(0);
return {
values: values
};
};
/** 根据 key 判断节点是否为叶子节点 */
export var isLeaf = function isLeaf(node) {
return !(node !== null && node !== void 0 && node.children);
};
/** 将传入格式的 node 处理为组件内需要的内容 */
export var nodes2treeNodes = function nodes2treeNodes(nodes, parentKey) {
if (!nodes) return undefined;
return nodes.map(function (node) {
var _ref3, _node$value, _node$originTitle;
var values = [];
if (parentKey) {
values = _toConsumableArray(splitKey(parentKey).values);
}
var key = generateKey([].concat(_toConsumableArray(values), [(_ref3 = (_node$value = node.value) !== null && _node$value !== void 0 ? _node$value : node.originTitle) !== null && _ref3 !== void 0 ? _ref3 : node.title]));
var next = _objectSpread(_objectSpread({}, node), {}, {
key: key,
// 补齐 originTitle
originTitle: (_node$originTitle = node.originTitle) !== null && _node$originTitle !== void 0 ? _node$originTitle : node.title,
children: nodes2treeNodes(node.children, key)
});
return next;
});
};
export var treeNode2node = function treeNode2node(treeNode) {
return omit(treeNode, 'key');
};
export var deepFilter = function deepFilter(treeNodes, cb) {
var filtered = treeNodes.map(function (treeNode) {
var _treeNode$children;
var next = _objectSpread({}, treeNode);
// 若过滤通过，无需再关注子节点，直接全部显示
if (cb(treeNode)) {
return next;
}
// 若过滤不通过，并且有子节点，递归对子节点做过滤操作
if ((_treeNode$children = treeNode.children) !== null && _treeNode$children !== void 0 && _treeNode$children.length) {
next.children = deepFilter(treeNode.children, cb);
}
return next;
});
return filtered.filter(function (treeNode) {
var _treeNode$children2;
return (treeNode === null || treeNode === void 0 || (_treeNode$children2 = treeNode.children) === null || _treeNode$children2 === void 0 ? void 0 : _treeNode$children2.length) || cb(treeNode);
});
};
/** 根据 node key 取得 node 节点 */
export var findFromTree = function findFromTree(key, treeNodes) {
var _splitKey = splitKey(key),
values = _splitKey.values;
var node;
var i = 0;
var _loop = function _loop() {
var value = values[i];
if (!node) {
node = treeNodes.find(function (e) {
return e.value === value;
});
} else {
var _node$children;
node = (_node$children = node.children) === null || _node$children === void 0 ? void 0 : _node$children.find(function (e) {
return e.value === value;
});
}
};
for (; i < values.length; i += 1) {
_loop();
}
return node;
};
/** 获取所有的选项
* 如果有子项，则获取子项，否则取本级
*/
export var getAllOptions = function getAllOptions(treeNodes) {
var allOptions = treeNodes.map(function (node) {
var _node$children2;
return (node === null || node === void 0 || (_node$children2 = node.children) === null || _node$children2 === void 0 ? void 0 : _node$children2.length) > 0 ? getAllOptions(node === null || node === void 0 ? void 0 : node.children) : node;
});
return allOptions.flat();
};