UNPKG

vantui-edit

Version:

一套适用于Taro3及React的vantui组件库

97 lines (77 loc) 3.14 kB
import _classCallCheck from "@babel/runtime/helpers/classCallCheck"; import _createClass from "@babel/runtime/helpers/createClass"; import _defineProperty from "@babel/runtime/helpers/defineProperty"; function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; } function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; } import { formatTree, eachTree } from './helper'; var Tree = /*#__PURE__*/function () { function Tree(nodes, config) { var _this = this; _classCallCheck(this, Tree); _defineProperty(this, "isLeaf", function (node, lazy) { var leaf = node.leaf, children = node.children; var hasChildren = Array.isArray(children) && Boolean(children.length); return leaf || !hasChildren && !lazy; }); _defineProperty(this, "hasChildren", function (node, lazy) { var isLeaf = _this.isLeaf(node, lazy); if (isLeaf) { return false; } var children = node.children; return Array.isArray(children) && Boolean(children.length); }); this.config = _objectSpread({ value: 'value', text: 'text', children: 'children' }, config || {}); this.nodes = formatTree(nodes, null, this.config); } _createClass(Tree, [{ key: "updateChildren", value: function updateChildren(nodes, parent) { if (!parent) { this.nodes = formatTree(nodes, null, this.config); } else { parent.children = formatTree(nodes, parent, this.config); } } // for test }, { key: "getNodeByValue", value: function getNodeByValue(value) { var foundNode; eachTree(this.nodes, function (node) { if (node.value === value) { foundNode = node; return true; } return null; }); return foundNode; } }, { key: "getPathNodesByValue", value: function getPathNodesByValue(value) { if (!value.length) { return []; } var pathNodes = []; var currentNodes = this.nodes; while (currentNodes && currentNodes.length) { var foundNode = currentNodes.find(function (node) { return node.value === value[node.level]; }); if (!foundNode) { break; } pathNodes.push(foundNode); currentNodes = foundNode.children; } return pathNodes; } }]); return Tree; }(); export default Tree;