tdesign-react 0.18.1 → 0.18.2

package/{es/_chunks/dep-776ae9a7.js → esm/_chunks/dep-9ad4f4b7.js}

@@ -1,10 +1,10 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
 
-import './dep-9052d175.js';
+import './dep-cb80da27.js';
 
 /**
  * Checks if `value` is classified as an `Array` object.
@@ -33,4 +33,4 @@ var isArray = Array.isArray;
 var isArray_1 = isArray;
 
 export { isArray_1 as i };
-//# sourceMappingURL=dep-776ae9a7.js.map
+//# sourceMappingURL=dep-9ad4f4b7.js.map

package/{es/_chunks/dep-776ae9a7.js.map → esm/_chunks/dep-9ad4f4b7.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-776ae9a7.js","sources":["../../node_modules/lodash/isArray.js"],"sourcesContent":["/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n"],"names":["isArray","Array","isArray_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBA,IAAIA,OAAO,GAAGC,KAAK,CAACD,OAApB;IAEAE,SAAc,GAAGF;;;;"}
+{"version":3,"file":"dep-9ad4f4b7.js","sources":["../../node_modules/lodash/isArray.js"],"sourcesContent":["/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n"],"names":["isArray","Array","isArray_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuBA,IAAIA,OAAO,GAAGC,KAAK,CAACD,OAApB;IAEAE,SAAc,GAAGF;;;;"}

package/{es/_chunks/dep-bf9ecece.js → esm/_chunks/dep-9bab9f6f.js}

@@ -1,11 +1,11 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
 
-import './dep-9052d175.js';
-import { t as toNumber_1 } from './dep-eb51ffd0.js';
+import './dep-cb80da27.js';
+import { t as toNumber_1 } from './dep-ee3e1923.js';
 
 var toNumber = toNumber_1;
 /** Used as references for various `Number` constants. */
@@ -90,4 +90,4 @@ function toInteger(value) {
 var toInteger_1 = toInteger;
 
 export { toInteger_1 as a, toFinite_1 as t };
-//# sourceMappingURL=dep-bf9ecece.js.map
+//# sourceMappingURL=dep-9bab9f6f.js.map

package/esm/_chunks/{dep-bf9ecece.js.map → dep-9bab9f6f.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-bf9ecece.js","sources":["../../node_modules/lodash/toFinite.js","../../node_modules/lodash/toInteger.js"],"sourcesContent":["var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n"],"names":["toNumber","require$$0","INFINITY","MAX_INTEGER","toFinite","value","sign","toFinite_1","toInteger","result","remainder","toInteger_1"],"mappings":";;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,UAAf;AAEA;;AACA,IAAIC,QAAQ,GAAG,IAAI,CAAnB;AAAA,IACIC,WAAW,GAAG,uBADlB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBC,KAAlB,EAAyB;AACvB,MAAI,CAACA,KAAL,EAAY;AACV,WAAOA,KAAK,KAAK,CAAV,GAAcA,KAAd,GAAsB,CAA7B;AACD;;AACDA,EAAAA,KAAK,GAAGL,QAAQ,CAACK,KAAD,CAAhB;;AACA,MAAIA,KAAK,KAAKH,QAAV,IAAsBG,KAAK,KAAK,CAACH,QAArC,EAA+C;AAC7C,QAAII,IAAI,GAAID,KAAK,GAAG,CAAR,GAAY,CAAC,CAAb,GAAiB,CAA7B;AACA,WAAOC,IAAI,GAAGH,WAAd;AACD;;AACD,SAAOE,KAAK,KAAKA,KAAV,GAAkBA,KAAlB,GAA0B,CAAjC;AACD;;IAEDE,UAAc,GAAGH;;ACzCjB,IAAIA,QAAQ,GAAGH,UAAf;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASO,SAAT,CAAmBH,KAAnB,EAA0B;AACxB,MAAII,MAAM,GAAGL,QAAQ,CAACC,KAAD,CAArB;AAAA,MACIK,SAAS,GAAGD,MAAM,GAAG,CADzB;AAGA,SAAOA,MAAM,KAAKA,MAAX,GAAqBC,SAAS,GAAGD,MAAM,GAAGC,SAAZ,GAAwBD,MAAtD,GAAgE,CAAvE;AACD;;IAEDE,WAAc,GAAGH;;;;"}
+{"version":3,"file":"dep-9bab9f6f.js","sources":["../../node_modules/lodash/toFinite.js","../../node_modules/lodash/toInteger.js"],"sourcesContent":["var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n"],"names":["toNumber","require$$0","INFINITY","MAX_INTEGER","toFinite","value","sign","toFinite_1","toInteger","result","remainder","toInteger_1"],"mappings":";;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,UAAf;AAEA;;AACA,IAAIC,QAAQ,GAAG,IAAI,CAAnB;AAAA,IACIC,WAAW,GAAG,uBADlB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBC,KAAlB,EAAyB;AACvB,MAAI,CAACA,KAAL,EAAY;AACV,WAAOA,KAAK,KAAK,CAAV,GAAcA,KAAd,GAAsB,CAA7B;AACD;;AACDA,EAAAA,KAAK,GAAGL,QAAQ,CAACK,KAAD,CAAhB;;AACA,MAAIA,KAAK,KAAKH,QAAV,IAAsBG,KAAK,KAAK,CAACH,QAArC,EAA+C;AAC7C,QAAII,IAAI,GAAID,KAAK,GAAG,CAAR,GAAY,CAAC,CAAb,GAAiB,CAA7B;AACA,WAAOC,IAAI,GAAGH,WAAd;AACD;;AACD,SAAOE,KAAK,KAAKA,KAAV,GAAkBA,KAAlB,GAA0B,CAAjC;AACD;;IAEDE,UAAc,GAAGH;;ACzCjB,IAAIA,QAAQ,GAAGH,UAAf;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASO,SAAT,CAAmBH,KAAnB,EAA0B;AACxB,MAAII,MAAM,GAAGL,QAAQ,CAACC,KAAD,CAArB;AAAA,MACIK,SAAS,GAAGD,MAAM,GAAG,CADzB;AAGA,SAAOA,MAAM,KAAKA,MAAX,GAAqBC,SAAS,GAAGD,MAAM,GAAGC,SAAZ,GAAwBD,MAAtD,GAAgE,CAAvE;AACD;;IAEDE,WAAc,GAAGH;;;;"}

package/{es/_chunks/dep-420a010b.js → esm/_chunks/dep-9c56e17c.js}

@@ -1,16 +1,16 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
 
-import { _ as _asyncToGenerator, r as regenerator } from './dep-0e364f89.js';
-import { _ as _toConsumableArray } from './dep-222f3011.js';
-import { _ as _defineProperty } from './dep-b05711f1.js';
-import './dep-9052d175.js';
-import { t as toString_1 } from './dep-f18dfb6c.js';
-import { g as get_1 } from './dep-2fdea8b5.js';
-import { d as createNodeModel, u as updateNodeModel } from './dep-4758c2cb.js';
+import { _ as _asyncToGenerator, r as regenerator } from './dep-11b4e1d1.js';
+import { _ as _toConsumableArray } from './dep-2eeaa58b.js';
+import { _ as _defineProperty } from './dep-efe7433b.js';
+import './dep-cb80da27.js';
+import { t as toString_1 } from './dep-43869d17.js';
+import { g as get_1 } from './dep-b6158110.js';
+import { d as createNodeModel, u as updateNodeModel } from './dep-4e5953fc.js';
 
 function _classCallCheck(instance, Constructor) {
   if (!(instance instanceof Constructor)) {
@@ -948,4 +948,4 @@ var TreeNode = /*#__PURE__*/function () {
 }();
 
 export { TreeNode as T, _classCallCheck as _, _createClass as a };
-//# sourceMappingURL=dep-420a010b.js.map
+//# sourceMappingURL=dep-9c56e17c.js.map

package/{es/_chunks/dep-420a010b.js.map → esm/_chunks/dep-9c56e17c.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-420a010b.js","sources":["../../node_modules/@babel/runtime/helpers/esm/classCallCheck.js","../../node_modules/@babel/runtime/helpers/esm/createClass.js","../../node_modules/lodash/uniqueId.js","../../src/_common/js/tree/tree-node.ts"],"sourcesContent":["export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}","function _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, descriptor.key, descriptor);\n  }\n}\n\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}","var toString = require('./toString');\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return toString(prefix) + id;\n}\n\nmodule.exports = uniqueId;\n","import uniqueId from 'lodash/uniqueId';\nimport get from 'lodash/get';\nimport { TreeStore } from './tree-store';\nimport {\n  TreeNodeValue,\n  TreeNodeState,\n  TypeIdMap,\n  TypeTreeItem,\n  TypeSettingOptions,\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n} from './types';\nimport {\n  createNodeModel,\n  updateNodeModel,\n} from './tree-node-model';\n\nconst { hasOwnProperty } = Object.prototype;\n\nconst defaultStatus = {\n  expandMutex: false,\n  activable: false,\n  checkable: false,\n  disabled: false,\n  draggable: false,\n  loading: false,\n};\n\n// vm 开头为视图属性，不可以外部设置\n// 用于触发视图更新\nexport class TreeNode {\n  // 节点隶属的树实例\n  public tree: TreeStore;\n\n  // 节点 id ，唯一标志\n  public value: string;\n\n  // 节点文本\n  public label: string;\n\n  // 节点数据\n  public data: TypeTreeNodeData;\n\n  // 父节点\n  public parent: TreeNode;\n\n  // 子节点列表\n  public children: TreeNode[] | boolean;\n\n  // 暴露的 treeNodeModel，这个对象的属性和 api 提供给用户使用\n  public model: TypeTreeNodeModel;\n\n  // 是否为叶节点\n  public vmIsLeaf: boolean;\n\n  // 是否为子节点中的第一个\n  public vmIsFirst: boolean;\n\n  // 是否为子节点中的最后\n  public vmIsLast: boolean;\n\n  // 节点是否是经过过滤剩下的\n  public vmIsRest: boolean;\n\n  // 节点是否展示为锁定状态\n  public vmIsLocked: boolean;\n\n  // 节点在视图上实际的展开状态\n  public expanded: boolean;\n\n  // 展开时是否收起同级节点，对子节点生效\n  public expandMutex: boolean;\n\n  // 节点在视图上实际的激活状态\n  public actived: boolean;\n\n  // 是否可激活\n  public activable: boolean;\n\n  // 是否可选中\n  public checkable: boolean;\n\n  // 是否可选中的视图呈现\n  public vmCheckable: boolean;\n\n  // 节点在视图上实际的选中态\n  public checked: boolean;\n\n  // 节点实际是否为半选状态\n  public indeterminate: boolean;\n\n  // 节点是否已禁用\n  public disabled: boolean;\n\n  // 节点是否可拖动\n  public draggable: boolean;\n\n  // 节点是否可视\n  public visible: boolean;\n\n  // 节点在树中的层级\n  public level: number;\n\n  // 节点是否正在加载数据\n  public loading: boolean;\n\n  public constructor(\n    tree: TreeStore,\n    data?: TypeTreeNodeData,\n    parent?: TreeNode,\n  ) {\n    this.data = data;\n    this.tree = tree;\n\n    const config = tree.config || {};\n    const prefix = config.prefix || 't';\n    const keys = get(tree, 'config.keys') || {};\n    const propChildren = keys.children || 'children';\n    const propLabel = keys.label || 'label';\n    const propValue = keys.value || 'value';\n\n    this.model = null;\n    this.children = null;\n    this.vmCheckable = false;\n    this.vmIsLeaf = false;\n    this.vmIsFirst = false;\n    this.vmIsLast = false;\n    this.vmIsRest = true;\n    this.vmIsLocked = false;\n\n    const spec = {\n      ...defaultStatus,\n      actived: false,\n      expanded: false,\n      checked: false,\n      ...data,\n    };\n    const children = spec[propChildren];\n\n    this.set(spec);\n    this.label = spec[propLabel] || '';\n    this.value = spec[propValue] || uniqueId(prefix);\n    this.tree.nodeMap.set(this.value, this);\n\n    if (parent && parent instanceof TreeNode) {\n      this.parent = parent;\n    } else {\n      this.parent = null;\n    }\n\n    // 子节点为 true 的状态逻辑需要放到状态计算之前\n    // 初始化加载逻辑需要依据这个来进行\n    if (children === true) {\n      this.children = children;\n    }\n\n    // 初始化状态计算\n    this.level = 0;\n    this.visible = true;\n\n    this.actived = spec.actived;\n    this.initActived();\n\n    this.expanded = spec.expanded;\n    this.initExpanded();\n\n    this.checked = spec.checked;\n    this.initChecked();\n\n    this.update();\n    tree.reflow(this);\n\n    // 这里的子节点加载逻辑不能放到状态计算之前\n    // 因为子节点状态计算依赖父节点状态\n    if (Array.isArray(children)) {\n      this.append(children);\n    } else if (children === true && !config.lazy) {\n      this.loadChildren();\n    }\n\n    // checked 状态依赖于子节点状态\n    // 因此初始化状态放到子节点插入之后\n    this.checked = false;\n    this.indeterminate = false;\n    this.updateChecked();\n  }\n\n  /* ------ 状态初始化 ------ */\n\n  // 初始化选中态\n  public initChecked() {\n    const { tree, value, parent } = this;\n    const { checkStrictly } = tree.config;\n    let { checked } = this;\n    checked = parent?.isChecked();\n    if (checked && !checkStrictly) {\n      tree.checkedMap.set(value, true);\n    }\n    this.checked = checked;\n  }\n\n  // 初始化节点展开状态\n  public initExpanded(): void {\n    const { tree } = this;\n    let { expanded } = this;\n    const { config } = tree;\n    if (\n      typeof config.expandLevel === 'number'\n      && this.getLevel() < config.expandLevel\n    ) {\n      tree.expandedMap.set(this.value, true);\n      expanded = true;\n    }\n    if (config.expandAll) {\n      expanded = true;\n    }\n    if (this.children === true && config.lazy) {\n      expanded = false;\n    }\n    if (expanded) {\n      tree.expandedMap.set(this.value, true);\n    } else {\n      tree.expandedMap.delete(this.value);\n    }\n    this.expanded = expanded;\n  }\n\n  // 初始化高亮状态\n  public initActived(): void {\n    const { tree, actived } = this;\n    if (actived) {\n      tree.activedMap.set(this.value, true);\n    }\n  }\n\n  /* ------ 节点操作 ------ */\n\n  // 追加数据\n  public append(data: TypeTreeNodeData | TypeTreeNodeData[]): void {\n    const list = [];\n    if (!Array.isArray(data)) {\n      list.push(data);\n    } else {\n      list.push(...data);\n    }\n    if (list.length <= 0) {\n      return;\n    }\n    if (!Array.isArray(this.children)) {\n      this.children = [];\n    }\n    const { children, tree } = this;\n    list.forEach((item) => {\n      let node = null;\n      if (item instanceof TreeNode) {\n        node = item;\n        node.appendTo(this.tree, this);\n      } else {\n        node = new TreeNode(this.tree, item, this);\n        children.push(node);\n      }\n    });\n    tree.reflow(this);\n    this.updateRelated();\n  }\n\n  // 将当前节点追加到某个父节点的子节点列表中\n  public appendTo(\n    tree: TreeStore,\n    parent?: TreeNode,\n    index?: number,\n  ): void {\n    const parentNode = parent;\n    if (!parentNode) return;\n\n    const targetParents = parentNode.getParents();\n    const includeCurrent = targetParents.some((node) => node.value === this.value);\n    if (includeCurrent) {\n      // 不能将父节点插入到子节点\n      return;\n    }\n\n    if (Array.isArray(parentNode.children)) {\n      let targetIndex = 0;\n      if (typeof index === 'number') {\n        targetIndex = index;\n      }\n      const targetPosNode = parentNode.children[targetIndex];\n      if (targetPosNode.value === this.value) {\n        // 无需将节点插入到原位置\n        return;\n      }\n    }\n\n    this.remove();\n    this.parent = parentNode;\n\n    let siblings = null;\n    if (parentNode instanceof TreeNode) {\n      if (!Array.isArray(parentNode.children)) {\n        parentNode.children = [];\n      }\n      siblings = parent.children;\n    } else {\n      siblings = tree.children;\n    }\n    if (Array.isArray(siblings)) {\n      if (typeof index === 'number') {\n        siblings.splice(index, 0, this);\n      } else {\n        siblings.push(this);\n      }\n    }\n\n    // 插入节点应当继承展开状态\n    // 但建议不要继承选中状态和高亮状态\n    const nodes = this.walk();\n    nodes.forEach((item) => {\n      const node = item;\n      node.tree = tree;\n      tree.nodeMap.set(node.value, node);\n      if (node.expanded) {\n        tree.expandedMap.set(node.value, true);\n      }\n    });\n\n    const updateNodes = parentNode.walk();\n    updateNodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n\n    tree.reflow();\n  }\n\n  // 插入一个同级节点数据\n  public insert(\n    item: TypeTreeItem,\n    index?: number,\n  ): void {\n    const { tree, parent } = this;\n    const siblings = this.getSiblings();\n    let node = null;\n    if (item instanceof TreeNode) {\n      node = item;\n      node.appendTo(tree, parent, index);\n    } else if (item) {\n      node = new TreeNode(tree, item, parent);\n      if (typeof index === 'number') {\n        siblings.splice(index, 0, node);\n      }\n      siblings.forEach((sibling) => {\n        sibling.update();\n      });\n    }\n    tree.reflow();\n  }\n\n  // 在当前节点之前插入节点\n  public insertBefore(newData: TypeTreeItem): void {\n    const index = this.getIndex();\n    this.insert(newData, index);\n  }\n\n  // 在当前节点之后插入节点\n  public insertAfter(newData: TypeTreeItem): void {\n    const index = this.getIndex();\n    this.insert(newData, index + 1);\n  }\n\n  // 从一个树移除本节点\n  public remove(): void {\n    const { tree } = this;\n\n    const nodes = this.walk();\n    const siblings = this.getSiblings();\n    const index = this.getIndex();\n    // 从父节点的子节点列表中移除自己\n    // 但不要将自己的父节点移除，避免渲染与判断失败\n    if (Array.isArray(siblings)) {\n      siblings.splice(index, 1);\n    }\n    // 清理与树的关系，但不清理自身状态\n    nodes.forEach((node) => {\n      node.clean();\n    });\n    // 同级节点的连线状态会受到影响\n    siblings.forEach((node) => {\n      node.update();\n    });\n    // 父节点选中态会受到影响\n    this.updateParents();\n    tree.reflow();\n  }\n\n  // 清除本节点与一个树的关系\n  public clean(): void {\n    const { tree, value } = this;\n    tree.activedMap.delete(value);\n    tree.checkedMap.delete(value);\n    tree.expandedMap.delete(value);\n    tree.nodeMap.delete(value);\n  }\n\n  // 异步加载子节点数据\n  public async loadChildren(): Promise<void> {\n    const config = get(this, 'tree.config') || {};\n    if (this.children === true && !this.loading) {\n      if (typeof config.load === 'function') {\n        this.loading = true;\n        this.update();\n        let list = [];\n        list = await config.load(this);\n        this.tree.emit('load', {\n          node: this,\n          data: list,\n        });\n        this.loading = false;\n        if (Array.isArray(list) && list.length > 0) {\n          this.append(list);\n        } else {\n          this.children = false;\n        }\n        this.update();\n      }\n    }\n  }\n\n  // 设置状态\n  public set(item: TreeNodeState): void {\n    const { tree } = this;\n    const keys = Object.keys(item);\n    keys.forEach((key) => {\n      if (hasOwnProperty.call(defaultStatus, key) || key === 'label') {\n        this[key] = item[key];\n      }\n    });\n    tree.updated(this);\n  }\n\n  /* ------ 节点获取 ------- */\n\n  // 获取单个父节点\n  public getParent(): TreeNode {\n    return this.parent;\n  }\n\n  // 获取所有父节点\n  public getParents(): TreeNode[] {\n    const parents = [];\n    let node = this.parent;\n    while (node) {\n      parents.push(node);\n      node = node.parent;\n    }\n    return parents;\n  }\n\n  // 获取兄弟节点，包含自己在内\n  public getSiblings(): TreeNode[] {\n    const { parent, tree } = this;\n    let list: TreeNode[] = [];\n    if (parent) {\n      if (Array.isArray(parent.children)) {\n        list = parent.children;\n      }\n    } else if (tree) {\n      list = tree.children;\n    }\n    return list;\n  }\n\n  // 获取根节点\n  public getRoot(): TreeNode {\n    const parents = this.getParents();\n    return parents[parents.length - 1] || null;\n  }\n\n  // 获取节点在父节点的子节点列表中的位置\n  // 如果没有父节点，则获取节点在根节点列表的位置\n  public getIndex(): number {\n    const list = this.getSiblings();\n    return list.indexOf(this);\n  }\n\n  // 返回路径节点\n  public getPath(): TreeNode[] {\n    const nodes = this.getParents();\n    nodes.unshift(this);\n    return nodes.reverse();\n  }\n\n  // 获取节点所在层级\n  public getLevel(): number {\n    const parents = this.getParents();\n    return parents.length;\n  }\n\n  /* ------ 节点状态判断 ------ */\n\n  // 判断节点是否被过滤\n  public isRest(): boolean {\n    const {\n      config,\n      filterMap,\n    } = this.tree;\n\n    let rest = true;\n    if (typeof config.filter === 'function') {\n      const nodeModel = this.getModel();\n      rest = config.filter(nodeModel);\n    }\n\n    if (rest) {\n      filterMap.set(this.value, true);\n    } else if (filterMap.get(this.value)) {\n      filterMap.delete(this.value);\n    }\n\n    return rest;\n  }\n\n  // 判断节点是否可视\n  public isVisible(): boolean {\n    const {\n      nodeMap,\n    } = this.tree;\n\n    let visible = true;\n\n    // 锁定状态，直接呈现\n    if (this.vmIsLocked) {\n      return true;\n    }\n\n    // 在当前树上，未被移除\n    if (nodeMap.get(this.value)) {\n      // 节点未被过滤\n      const filterVisible = this.isRest();\n\n      // 所有父节点展开\n      let expandVisible = true;\n      const parents = this.getParents();\n      if (parents.length > 0) {\n        expandVisible = parents.every((node: TreeNode) => node.isExpanded());\n      }\n\n      // 节点为未被过滤节点的父节点\n      visible = expandVisible && filterVisible;\n    } else {\n      visible = false;\n    }\n    return visible;\n  }\n\n  // 判断节点是否被禁用\n  public isDisabled() {\n    if (this.vmIsLocked) return true;\n    const treeDisabled = get(this, 'tree.config.disabled');\n    return !!(treeDisabled || this.disabled);\n  }\n\n  // 判断节点是否支持互斥展开\n  public isExpandMutex() {\n    return !!(get(this, 'tree.config.expandMutex') || this.expandMutex);\n  }\n\n  // 节点可高亮\n  public isActivable() {\n    return !!(get(this, 'tree.config.activable') || this.activable);\n  }\n\n  // 是否可选\n  public isCheckable() {\n    return !!(get(this, 'tree.config.checkable') || this.checkable);\n  }\n\n  // 检查节点是否被激活\n  public isActived(map?: Map<string, boolean>): boolean {\n    const { tree, value } = this;\n    const activedMap = map || tree.activedMap;\n    return !!(tree.nodeMap.get(value) && activedMap.get(value));\n  }\n\n  // 检查节点是否已展开\n  public isExpanded(map?: Map<string, boolean>): boolean {\n    const { tree, value, vmIsLocked } = this;\n    if (vmIsLocked) return true;\n    const expandedMap = map || tree.expandedMap;\n    return !!(tree.nodeMap.get(value) && expandedMap.get(value));\n  }\n\n  // 计算属性，判断节点是否被选中\n  // map: 预期选中项map，用于计算节点在预期环境中的选中态\n  public isChecked(map?: TypeIdMap): boolean {\n    const { children, tree } = this;\n    const { checkStrictly } = tree.config;\n    let checked = false;\n    const checkedMap = map || tree.checkedMap;\n    if (tree.nodeMap.get(this.value)) {\n      if (checkedMap.get(this.value)) {\n        // 如果在 checked 节点列表中，则直接为 true\n        checked = true;\n      } else if (\n        Array.isArray(children)\n        && children.length > 0\n        && !checkStrictly\n      ) {\n        // 如果是父节点，需检查所有子节点状态\n        checked = children.every((node) => {\n          const childIsChecked = node.isChecked(checkedMap);\n          return childIsChecked;\n        });\n      } else if (!checkStrictly) {\n        // 从父节点状态推断子节点状态\n        // 这里再调用 isChecked 会导致死循环\n        const parents = this.getParents();\n        checked = parents.some((node) => checkedMap.get(node.value));\n      }\n    }\n    return !!checked;\n  }\n\n  // 是否为半选状态\n  public isIndeterminate(): boolean {\n    const { children, tree } = this;\n    const { checkStrictly } = tree.config;\n    if (checkStrictly) {\n      return false;\n    }\n    let indeterminate = false;\n    if (Array.isArray(children)) {\n      // 叶节点不存在半选状态\n      let childChecked: null | boolean = null;\n      indeterminate = children.some((node: TreeNode) => {\n        if (node.isIndeterminate()) {\n          // 子节点有任意一个半选，则其为半选状态\n          return true;\n        }\n        if (childChecked === null) {\n          childChecked = node.isChecked();\n        }\n        if (childChecked !== node.isChecked()) {\n          // 子节点选中状态不一致，则其为半选状态\n          return true;\n        }\n        return false;\n      });\n    }\n    return indeterminate;\n  }\n\n  public isFirst(): boolean {\n    const siblings = this.getSiblings();\n    return siblings[0] === this;\n  }\n\n  public isLast(): boolean {\n    const siblings = this.getSiblings();\n    return siblings[siblings.length - 1] === this;\n  }\n\n  // 是叶节点\n  public isLeaf(): boolean {\n    let isLeaf = false;\n    if (Array.isArray(this.children)) {\n      isLeaf = this.children.length <= 0;\n    } else {\n      isLeaf = !this.children;\n    }\n    return isLeaf;\n  }\n\n  /* ------ 节点状态切换 ------ */\n\n  // 锁定节点\n  // 搜索过滤节点时，路径节点需要固定呈现，视其为锁定态\n  public lock(lockState: boolean): void {\n    this.vmIsLocked = lockState;\n    this.expanded = this.isExpanded();\n    this.visible = this.isVisible();\n  }\n\n  // 节点展开关闭后需要调用的状态检查函数\n  public afterExpanded(): void {\n    this.update();\n    // 节点展开时检查延迟加载的数据\n    if (this.expanded && this.children === true) {\n      this.loadChildren();\n    }\n  }\n\n  // 展开或者关闭节点\n  public toggleExpanded(): TreeNodeValue[] {\n    return this.setExpanded(!this.isExpanded());\n  }\n\n  // 设置节点展开状态\n  public setExpanded(expanded: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const options = {\n      directly: false,\n      ...opts,\n    };\n\n    let map = tree.expandedMap;\n    if (!options.directly) {\n      map = new Map(tree.expandedMap);\n    }\n\n    // 手风琴效果，先折叠同级节点\n    if (expanded) {\n      const shouldExpandNodes = [];\n      shouldExpandNodes.push(this);\n      if (get(tree, 'config.expandParent')) {\n        this.getParents().forEach((node) => {\n          shouldExpandNodes.push(node);\n        });\n      }\n      shouldExpandNodes.forEach((node) => {\n        let isExpandMutex = false;\n        if (node.parent) {\n          isExpandMutex = node.parent.isExpandMutex();\n        } else {\n          isExpandMutex = tree?.config?.expandMutex;\n        }\n        if (isExpandMutex) {\n          const siblings = node.getSiblings();\n          siblings.forEach((snode) => {\n            map.delete(snode.value);\n          });\n        }\n        map.set(node.value, true);\n      });\n    } else {\n      map.delete(this.value);\n    }\n\n    if (options.directly) {\n      this.afterExpanded();\n      this.update();\n      this.updateChildren();\n    }\n\n    return tree.getExpanded(map);\n  }\n\n  // 切换节点激活态\n  public toggleActived(): TreeNodeValue[] {\n    return this.setActived(!this.isActived());\n  }\n\n  // 设置节点激活态\n  public setActived(actived: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const options = {\n      directly: false,\n      ...opts,\n    };\n    const config = tree.config || {};\n    let map = tree.activedMap;\n    if (!options.directly) {\n      map = new Map(tree.activedMap);\n    }\n    if (this.isActivable()) {\n      if (actived) {\n        if (!config.activeMultiple) {\n          map.clear();\n        }\n        map.set(this.value, true);\n      } else {\n        map.delete(this.value);\n      }\n    }\n    if (options.directly) {\n      this.update();\n    }\n    return tree.getActived(map);\n  }\n\n  // 切换选中态\n  public toggleChecked(): TreeNodeValue[] {\n    return this.setChecked(!this.isChecked());\n  }\n\n  // 更新单个节点的选中态\n  // 返回树选中列表\n  public setChecked(checked: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const config = tree.config || {};\n    const options = {\n      directly: false,\n      ...opts,\n    };\n    let map = tree.checkedMap;\n    if (!options.directly) {\n      map = new Map(tree.checkedMap);\n    }\n    if (this.isCheckable() && checked !== this.isChecked()) {\n      if (config.checkStrictly) {\n        if (checked) {\n          map.set(this.value, true);\n        } else {\n          map.delete(this.value);\n        }\n      } else {\n        const children = this.walk();\n        // 子节点的预期选中态与当前节点同步\n        children.forEach((node) => {\n          if (checked) {\n            map.set(node.value, true);\n          } else {\n            map.delete(node.value);\n          }\n        });\n        // 消除全部父节点的预期选中态\n        // 父节点的预期选中态将通过计算得出\n        const parents = this.getParents();\n        parents.forEach((node) => {\n          map.delete(node.value);\n        });\n      }\n    }\n    if (options.directly) {\n      if (config.checkStrictly) {\n        this.updateChecked();\n      } else {\n        const relatedNodes = tree.getRelatedNodes([this.value]);\n        relatedNodes.forEach((node) => {\n          node.updateChecked();\n        });\n      }\n    }\n    return tree.getChecked(map);\n  }\n\n  /* ------ 节点状态更新 ------ */\n\n  // 更新节点状态\n  public update(): void {\n    this.level = this.getLevel();\n    this.actived = this.isActived();\n    this.expanded = this.isExpanded();\n    this.vmCheckable = this.isCheckable();\n    this.visible = this.isVisible();\n    this.vmIsRest = this.isRest();\n    this.vmIsFirst = this.isFirst();\n    this.vmIsLast = this.isLast();\n    this.vmIsLeaf = this.isLeaf();\n    this.tree.updated(this);\n  }\n\n  // 更新选中态属性值\n  public updateChecked(): void {\n    const { tree } = this;\n    this.vmCheckable = this.isCheckable();\n    if (this.vmCheckable) {\n      this.checked = this.isChecked();\n      if (this.checked) {\n        tree.checkedMap.set(this.value, true);\n      }\n      this.indeterminate = this.isIndeterminate();\n      tree.updated(this);\n    }\n  }\n\n  // 更新所有子节点状态\n  // 注意:不包含自己\n  public updateChildren(): void {\n    const { children } = this;\n    if (Array.isArray(children)) {\n      children.forEach((node) => {\n        node.update();\n        node.updateChecked();\n        node.updateChildren();\n      });\n    }\n  }\n\n  // 父节点状态更新\n  // 注意:不包含自己\n  public updateParents(): void {\n    const { parent } = this;\n    if (parent) {\n      parent.update();\n      parent.updateChecked();\n      parent.updateParents();\n    }\n  }\n\n  // 更新上下游相关节点\n  public updateRelated() {\n    const { tree } = this;\n    const relatedNodes = tree.getRelatedNodes([this.value]);\n    relatedNodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n    tree.reflow();\n  }\n\n  /* ------ 节点遍历 ------ */\n\n  // 获取包含自己在内所有的子节点\n  public walk(): TreeNode[] {\n    const { children } = this;\n    let list: TreeNode[] = [];\n    list.push(this);\n    if (Array.isArray(children) && children.length > 0) {\n      children.forEach((node) => {\n        list = list.concat(node.walk());\n      });\n    }\n    return list;\n  }\n\n  // TreeNode 对象 => TypeTreeNodeModel 对象\n  // 用于 treeNode 对外暴露的 api\n  // 经过封装的对象，减少了对外暴露的 api，利于代码重构\n  public getModel(): TypeTreeNodeModel {\n    let { model } = this;\n    if (!model) {\n      model = createNodeModel(this);\n      this.model = model;\n    }\n    updateNodeModel(model, this);\n    return model;\n  }\n}\n\nexport default TreeNode;\n"],"names":["_classCallCheck","instance","Constructor","TypeError","_defineProperties","target","props","i","length","descriptor","enumerable","configurable","writable","Object","defineProperty","key","_createClass","protoProps","staticProps","prototype","toString","require$$0","idCounter","uniqueId","prefix","id","uniqueId_1","hasOwnProperty","defaultStatus","expandMutex","activable","checkable","disabled","draggable","loading","tree","data","parent","config","keys","get","propChildren","children","propLabel","label","propValue","value","model","vmCheckable","vmIsLeaf","vmIsFirst","vmIsLast","vmIsRest","vmIsLocked","spec","actived","expanded","checked","set","nodeMap","TreeNode","level","visible","initActived","initExpanded","initChecked","update","reflow","Array","isArray","append","lazy","loadChildren","indeterminate","updateChecked","checkStrictly","isChecked","checkedMap","expandLevel","getLevel","expandedMap","expandAll","activedMap","list","push","forEach","item","node","appendTo","updateRelated","index","parentNode","targetParents","getParents","includeCurrent","some","targetIndex","targetPosNode","remove","siblings","splice","nodes","walk","updateNodes","getSiblings","sibling","newData","getIndex","insert","clean","updateParents","load","emit","call","updated","parents","indexOf","unshift","reverse","filterMap","rest","filter","nodeModel","getModel","filterVisible","isRest","expandVisible","every","isExpanded","treeDisabled","map","childIsChecked","childChecked","isIndeterminate","isLeaf","lockState","isVisible","setExpanded","opts","options","directly","Map","shouldExpandNodes","isExpandMutex","snode","afterExpanded","updateChildren","getExpanded","setActived","isActived","isActivable","activeMultiple","clear","getActived","setChecked","isCheckable","relatedNodes","getRelatedNodes","getChecked","isFirst","isLast","concat","createNodeModel"],"mappings":";;;;;;;;;;;;;;AAAe,SAASA,eAAT,CAAyBC,QAAzB,EAAmCC,WAAnC,EAAgD;AAC7D,MAAI,EAAED,QAAQ,YAAYC,WAAtB,CAAJ,EAAwC;AACtC,UAAM,IAAIC,SAAJ,CAAc,mCAAd,CAAN;AACD;AACF;;ACJD,SAASC,iBAAT,CAA2BC,MAA3B,EAAmCC,KAAnC,EAA0C;AACxC,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGD,KAAK,CAACE,MAA1B,EAAkCD,CAAC,EAAnC,EAAuC;AACrC,QAAIE,UAAU,GAAGH,KAAK,CAACC,CAAD,CAAtB;AACAE,IAAAA,UAAU,CAACC,UAAX,GAAwBD,UAAU,CAACC,UAAX,IAAyB,KAAjD;AACAD,IAAAA,UAAU,CAACE,YAAX,GAA0B,IAA1B;AACA,QAAI,WAAWF,UAAf,EAA2BA,UAAU,CAACG,QAAX,GAAsB,IAAtB;AAC3BC,IAAAA,MAAM,CAACC,cAAP,CAAsBT,MAAtB,EAA8BI,UAAU,CAACM,GAAzC,EAA8CN,UAA9C;AACD;AACF;;AAEc,SAASO,YAAT,CAAsBd,WAAtB,EAAmCe,UAAnC,EAA+CC,WAA/C,EAA4D;AACzE,MAAID,UAAJ,EAAgBb,iBAAiB,CAACF,WAAW,CAACiB,SAAb,EAAwBF,UAAxB,CAAjB;AAChB,MAAIC,WAAJ,EAAiBd,iBAAiB,CAACF,WAAD,EAAcgB,WAAd,CAAjB;AACjB,SAAOhB,WAAP;AACD;;ACdD,IAAIkB,QAAQ,GAAGC,UAAf;AAEA;;AACA,IAAIC,SAAS,GAAG,CAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,MAAlB,EAA0B;AACxB,MAAIC,EAAE,GAAG,EAAEH,SAAX;AACA,SAAOF,QAAQ,CAACI,MAAD,CAAR,GAAmBC,EAA1B;AACD;;IAEDC,UAAc,GAAGH;;;;;ACVjB,IAAQI,cAAR,GAA2Bd,OAAOM,SAAlC,CAAQQ,cAAR;AAEA,IAAMC,gBAAgB;AACpBC,EAAAA,aAAa,KADO;AAEpBC,EAAAA,WAAW,KAFS;AAGpBC,EAAAA,WAAW,KAHS;AAIpBC,EAAAA,UAAU,KAJU;AAKpBC,EAAAA,WAAW,KALS;AAMpBC,EAAAA,SAAS;AANW,CAAtB;YAWO;AA4EE,oBACLC,IADK,EAELC,IAFK,EAGLC,MAHK,EAIL;AAAA;;SACKD,OAAOA;SACPD,OAAOA;QAENG,SAASH,KAAKG,MAAL,IAAe;QACxBd,SAASc,OAAOd,MAAP,IAAiB;QAC1Be,OAAOC,MAAIL,MAAM,cAAV,IAA4B;QACnCM,eAAeF,KAAKG,QAAL,IAAiB;QAChCC,YAAYJ,KAAKK,KAAL,IAAc;QAC1BC,YAAYN,KAAKO,KAAL,IAAc;SAE3BC,QAAQ;SACRL,WAAW;SACXM,cAAc;SACdC,WAAW;SACXC,YAAY;SACZC,WAAW;SACXC,WAAW;SACXC,aAAa;;QAEZC,uCACD1B;AACH2B,MAAAA,SAAS;AACTC,MAAAA,UAAU;AACVC,MAAAA,SAAS;OACNrB;;QAECM,WAAWY,KAAKb;SAEjBiB,IAAIJ;SACJV,QAAQU,KAAKX,UAAL,IAAmB;SAC3BG,QAAQQ,KAAKT,UAAL,IAAmBtB,WAASC;SACpCW,KAAKwB,QAAQD,IAAI,KAAKZ,OAAO;;QAE9BT,UAAUA,kBAAkBuB,UAAU;WACnCvB,SAASA;WACT;WACAA,SAAS;;;QAKZK,aAAa,MAAM;WAChBA,WAAWA;;;SAIbmB,QAAQ;SACRC,UAAU;SAEVP,UAAUD,KAAKC;SACfQ;SAEAP,WAAWF,KAAKE;SAChBQ;SAEAP,UAAUH,KAAKG;SACfQ;SAEAC;SACAC,OAAO;;QAIRC,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;WACtB4B,OAAO5B;eACHA,aAAa,IAAb,IAAqB,CAACJ,OAAOiC,MAAM;WACvCC;;;SAKFf,UAAU;SACVgB,gBAAgB;SAChBC;;;AA1JF;AAAA;AAAA,WAgKE,uBAAc;UACXvC,OAAwB,KAAxBA;UAAMW,QAAkB,KAAlBA;UAAOT,SAAW,KAAXA;UACbsC,gBAAkBxC,KAAKG,OAAvBqC;UACFlB,UAAY,KAAZA;gBACIpB,mBAAAA,6BAAAA,OAAQuC,SAAR;;UACNnB,WAAW,CAACkB,eAAe;aACxBE,WAAWnB,IAAIZ,OAAO;;;WAExBW,UAAUA;;AAxKZ;AAAA;AAAA,WA4KE,wBAAqB;UAClBtB,OAAS,KAATA;UACFqB,WAAa,KAAbA;UACElB,SAAWH,KAAXG;;UAEN,OAAOA,OAAOwC,WAAd,KAA8B,QAA9B,IACG,KAAKC,QAAL,KAAkBzC,OAAOwC,aAC5B;aACKE,YAAYtB,IAAI,KAAKZ,OAAO;mBACtB;;;UAETR,OAAO2C,WAAW;mBACT;;;UAET,KAAKvC,QAAL,KAAkB,IAAlB,IAA0BJ,OAAOiC,MAAM;mBAC9B;;;UAETf,UAAU;aACPwB,YAAYtB,IAAI,KAAKZ,OAAO;aAC5B;aACAkC,sBAAmB,KAAKlC;;;WAE1BU,WAAWA;;AAlMb;AAAA;AAAA,WAsME,uBAAoB;UACjBrB,OAAkB,KAAlBA;UAAMoB,UAAY,KAAZA;;UACVA,SAAS;aACN2B,WAAWxB,IAAI,KAAKZ,OAAO;;;AAzM/B;AAAA;AAAA,WAgNE,gBAAOV,IAAP,EAA0D;AAAA;;UACzD+C,OAAO;;UACT,CAACf,MAAMC,OAAN,CAAcjC,IAAd,GAAqB;aACnBgD,KAAKhD;aACL;aACAgD,oCAAQhD;;;UAEX+C,KAAK3E,MAAL,IAAe,GAAG;;;;UAGlB,CAAC4D,MAAMC,OAAN,CAAc,KAAK3B,QAAnB,GAA8B;aAC5BA,WAAW;;;UAEVA,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;WACbkD,QAAQ,UAACC,IAAD,EAAU;YACjBC,OAAO;;YACPD,gBAAgB1B,UAAU;iBACrB0B;eACFE,SAAS,MAAKrD,MAAM;eACpB;iBACE,IAAIyB,QAAJ,CAAa,MAAKzB,IAAlB,EAAwBmD,IAAxB,EAA8B,KAA9B;mBACEF,KAAKG;;;WAGbpB,OAAO;WACPsB;;AAzOF;AAAA;AAAA,WA6OE,kBACLtD,IADK,EAELE,MAFK,EAGLqD,KAHK,EAIC;AAAA;;UACAC,aAAatD;UACf,CAACsD;UAECC,gBAAgBD,WAAWE,UAAX;UAChBC,iBAAiBF,cAAcG,IAAd,CAAmB,UAACR,IAAD;AAAA,eAAUA,KAAKzC,KAAL,KAAe,OAAKA,KAA9B;AAAA,OAAnB;;UACnBgD,gBAAgB;;;;UAKhB1B,MAAMC,OAAN,CAAcsB,WAAWjD,QAAzB,GAAoC;YAClCsD,cAAc;;YACd,OAAON,KAAP,KAAiB,UAAU;wBACfA;;;YAEVO,gBAAgBN,WAAWjD,QAAX,CAAoBsD,WAApB;;YAClBC,cAAcnD,KAAd,KAAwB,KAAKA,OAAO;;;;;WAMrCoD;WACA7D,SAASsD;UAEVQ,WAAW;;UACXR,sBAAsB/B,UAAU;YAC9B,CAACQ,MAAMC,OAAN,CAAcsB,WAAWjD,QAAzB,GAAoC;qBAC5BA,WAAW;;;mBAEbL,OAAOK;aACb;mBACMP,KAAKO;;;UAEd0B,MAAMC,OAAN,CAAc8B,QAAd,GAAyB;YACvB,OAAOT,KAAP,KAAiB,UAAU;mBACpBU,OAAOV,OAAO,GAAG;eACrB;mBACIN,KAAK;;;;UAMZiB,QAAQ,KAAKC,IAAL;YACRjB,QAAQ,UAACC,IAAD,EAAU;YAChBC,OAAOD;aACRnD,OAAOA;aACPwB,QAAQD,IAAI6B,KAAKzC,OAAOyC;;YACzBA,KAAK/B,UAAU;eACZwB,YAAYtB,IAAI6B,KAAKzC,OAAO;;;UAI/ByD,cAAcZ,WAAWW,IAAX;kBACRjB,QAAQ,UAACE,IAAD,EAAU;aACvBrB;aACAQ;;WAGFP;;AA9SF;AAAA;AAAA,WAkTE,gBACLmB,IADK,EAELI,KAFK,EAGC;UACEvD,OAAiB,KAAjBA;UAAME,SAAW,KAAXA;UACR8D,WAAW,KAAKK,WAAL;UACbjB,OAAO;;UACPD,gBAAgB1B,UAAU;eACrB0B;aACFE,SAASrD,MAAME,QAAQqD;iBACnBJ,MAAM;eACR,IAAI1B,QAAJ,CAAazB,IAAb,EAAmBmD,IAAnB,EAAyBjD,MAAzB;;YACH,OAAOqD,KAAP,KAAiB,UAAU;mBACpBU,OAAOV,OAAO,GAAGH;;;iBAEnBF,QAAQ,UAACoB,OAAD,EAAa;kBACpBvC;;;;WAGPC;;AArUF;AAAA;AAAA,WAyUE,sBAAauC,OAAb,EAA0C;UACzChB,QAAQ,KAAKiB,QAAL;WACTC,OAAOF,SAAShB;;AA3UlB;AAAA;AAAA,WA+UE,qBAAYgB,OAAZ,EAAyC;UACxChB,QAAQ,KAAKiB,QAAL;WACTC,OAAOF,SAAShB,QAAQ;;AAjV1B;AAAA;AAAA,WAqVE,kBAAe;UACZvD,OAAS,KAATA;UAEFkE,QAAQ,KAAKC,IAAL;UACRH,WAAW,KAAKK,WAAL;UACXd,QAAQ,KAAKiB,QAAL;;UAGVvC,MAAMC,OAAN,CAAc8B,QAAd,GAAyB;iBAClBC,OAAOV,OAAO;;;YAGnBL,QAAQ,UAACE,IAAD,EAAU;aACjBsB;;eAGExB,QAAQ,UAACE,IAAD,EAAU;aACpBrB;;WAGF4C;WACA3C;;AA1WF;AAAA;AAAA,WA8WE,iBAAc;UACXhC,OAAgB,KAAhBA;UAAMW,QAAU,KAAVA;WACToC,qBAAkBpC;WAClB+B,qBAAkB/B;WAClBkC,sBAAmBlC;WACnBa,kBAAeb;;AAnXjB;AAAA;AAAA;AAAA;;;;;;AAwXGR,gBAAAA,SAASE,MAAI,MAAM,cAAV,IAA4B;;sBACvC,KAAKE,QAAL,KAAkB,IAAlB,IAA0B,CAAC,KAAKR;;;;;sBAC9B,OAAOI,OAAOyE,IAAd,KAAuB;;;;;qBACpB7E,UAAU;qBACVgC;AACDiB,gBAAAA,OAAO;;uBACE7C,OAAOyE,IAAP,CAAY,IAAZ;;;;qBACR5E,KAAK6E,KAAK,QAAQ;AACrBzB,kBAAAA,MAAM,IADe;AAErBnD,kBAAAA,MAAM+C;AAFe;qBAIlBjD,UAAU;;oBACXkC,MAAMC,OAAN,CAAcc,IAAd,KAAuBA,KAAK3E,MAAL,GAAc,GAAG;uBACrC8D,OAAOa;uBACP;uBACAzC,WAAW;;;qBAEbwB;;;;;;;;OAzYN;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA,WA+YE,aAAIoB,IAAJ,EAA+B;AAAA;;UAC5BnD,OAAS,KAATA;UACFI,OAAO1B,OAAO0B,IAAP,CAAY+C,IAAZ;WACRD,QAAQ,UAACtE,GAAD,EAAS;YAChBY,eAAesF,IAAf,CAAoBrF,aAApB,EAAmCb,GAAnC,KAA2CA,QAAQ,SAAS;iBACzDA,OAAOuE,KAAKvE;;;WAGhBmG,QAAQ;;AAvZV;AAAA;AAAA,WA6ZE,qBAAsB;aACpB,KAAK7E;;AA9ZT;AAAA;AAAA,WAkaE,sBAAyB;UACxB8E,UAAU;UACZ5B,OAAO,KAAKlD;;aACTkD,MAAM;gBACHH,KAAKG;eACNA,KAAKlD;;;aAEP8E;;AAzaJ;AAAA;AAAA,WA6aE,uBAA0B;UACvB9E,SAAiB,KAAjBA;UAAQF,OAAS,KAATA;UACZgD,OAAmB;;UACnB9C,QAAQ;YACN+B,MAAMC,OAAN,CAAchC,OAAOK,QAArB,GAAgC;iBAC3BL,OAAOK;;iBAEPP,MAAM;eACRA,KAAKO;;;aAEPyC;;AAvbJ;AAAA;AAAA,WA2bE,mBAAoB;UACnBgC,UAAU,KAAKtB,UAAL;aACTsB,QAAQA,QAAQ3G,MAAR,GAAiB,EAAzB,IAA+B;;AA7bnC;AAAA;AAAA,WAkcE,oBAAmB;UAClB2E,OAAO,KAAKqB,WAAL;aACNrB,KAAKiC,OAAL,CAAa,IAAb;;AApcJ;AAAA;AAAA,WAwcE,mBAAsB;UACrBf,QAAQ,KAAKR,UAAL;YACRwB,QAAQ;aACPhB,MAAMiB,OAAN;;AA3cJ;AAAA;AAAA,WA+cE,oBAAmB;UAClBH,UAAU,KAAKtB,UAAL;aACTsB,QAAQ3G;;AAjdZ;AAAA;AAAA,WAudE,kBAAkB;uBAInB,KAAK2B;UAFPG,oBAAAA;UACAiF,uBAAAA;UAGEC,OAAO;;UACP,OAAOlF,OAAOmF,MAAd,KAAyB,YAAY;YACjCC,YAAY,KAAKC,QAAL;eACXrF,OAAOmF,MAAP,CAAcC,SAAd;;;UAGLF,MAAM;kBACE9D,IAAI,KAAKZ,OAAO;iBACjByE,UAAU/E,GAAV,CAAc,KAAKM,KAAnB,GAA2B;4BACnB,KAAKA;;;aAGjB0E;;AAzeJ;AAAA;AAAA,WA6eE,qBAAqB;UAExB7D,UACE,KAAKxB,KADPwB;UAGEG,UAAU;;UAGV,KAAKT,YAAY;eACZ;;;UAILM,QAAQnB,GAAR,CAAY,KAAKM,KAAjB,GAAyB;YAErB8E,gBAAgB,KAAKC,MAAL;YAGlBC,gBAAgB;YACdX,UAAU,KAAKtB,UAAL;;YACZsB,QAAQ3G,MAAR,GAAiB,GAAG;0BACN2G,QAAQY,KAAR,CAAc,UAACxC,IAAD;AAAA,mBAAoBA,KAAKyC,UAAL,EAApB;AAAA,WAAd;;;kBAIRF,iBAAiBF;aACtB;kBACK;;;aAEL9D;;AA1gBJ;AAAA;AAAA,WA8gBE,sBAAa;UACd,KAAKT,mBAAmB;UACtB4E,eAAezF,MAAI,MAAM;aACxB,CAAC,kBAAkB,KAAKR,QAAvB;;AAjhBL;AAAA;AAAA,WAqhBE,yBAAgB;aACd,CAAC,QAAM,MAAM,8BAA8B,KAAKH,WAA/C;;AAthBL;AAAA;AAAA,WA0hBE,uBAAc;aACZ,CAAC,QAAM,MAAM,4BAA4B,KAAKC,SAA7C;;AA3hBL;AAAA;AAAA,WA+hBE,uBAAc;aACZ,CAAC,QAAM,MAAM,4BAA4B,KAAKC,SAA7C;;AAhiBL;AAAA;AAAA,WAoiBE,mBAAUmG,GAAV,EAA+C;UAC5C/F,OAAgB,KAAhBA;UAAMW,QAAU,KAAVA;UACRoC,aAAagD,OAAO/F,KAAK+C;aACxB,CAAC,OAAOvB,QAAQnB,IAAIM,UAAUoC,WAAW1C,GAAX,CAAeM,KAAf,CAA7B;;AAviBL;AAAA;AAAA,WA2iBE,oBAAWoF,GAAX,EAAgD;UAC7C/F,OAA4B,KAA5BA;UAAMW,QAAsB,KAAtBA;UAAOO,aAAe,KAAfA;UACjBA,mBAAmB;UACjB2B,cAAckD,OAAO/F,KAAK6C;aACzB,CAAC,OAAOrB,QAAQnB,IAAIM,UAAUkC,YAAYxC,GAAZ,CAAgBM,KAAhB,CAA7B;;AA/iBL;AAAA;AAAA,WAojBE,mBAAUoF,GAAV,EAAoC;UACjCxF,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;UACVwC,gBAAkBxC,KAAKG,OAAvBqC;UACJlB,UAAU;UACRoB,aAAaqD,OAAO/F,KAAK0C;;UAC3B1C,KAAKwB,OAAL,CAAanB,GAAb,CAAiB,KAAKM,KAAtB,GAA8B;YAC5B+B,WAAWrC,GAAX,CAAe,KAAKM,KAApB,GAA4B;oBAEpB;mBAEVsB,MAAMC,OAAN,CAAc3B,QAAd,KACGA,SAASlC,MAAT,GAAkB,CADrB,IAEG,CAACmE,eACJ;oBAEUjC,SAASqF,KAAT,CAAe,UAACxC,IAAD,EAAU;gBAC3B4C,iBAAiB5C,KAAKX,SAAL,CAAeC,UAAf;mBAChBsD;WAFC;mBAID,CAACxD,eAAe;cAGnBwC,UAAU,KAAKtB,UAAL;oBACNsB,QAAQpB,IAAR,CAAa,UAACR,IAAD;AAAA,mBAAUV,WAAWrC,GAAX,CAAe+C,KAAKzC,KAApB,CAAV;AAAA,WAAb;;;;aAGP,CAAC,CAACW;;AA9kBN;AAAA;AAAA,WAklBE,2BAA2B;UACxBf,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;UACVwC,gBAAkBxC,KAAKG,OAAvBqC;;UACJA,eAAe;eACV;;;UAELF,gBAAgB;;UAChBL,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;YAEvB0F,eAA+B;wBACnB1F,SAASqD,IAAT,CAAc,UAACR,IAAD,EAAoB;cAC5CA,KAAK8C,eAAL,IAAwB;mBAEnB;;;cAELD,iBAAiB,MAAM;2BACV7C,KAAKX,SAAL;;;cAEbwD,iBAAiB7C,KAAKX,SAAL,IAAkB;mBAE9B;;;iBAEF;SAZO;;;aAeXH;;AA3mBJ;AAAA;AAAA,WA8mBE,mBAAmB;UAClB0B,WAAW,KAAKK,WAAL;aACVL,SAAS,EAAT,KAAgB;;AAhnBpB;AAAA;AAAA,WAmnBE,kBAAkB;UACjBA,WAAW,KAAKK,WAAL;aACVL,SAASA,SAAS3F,MAAT,GAAkB,EAA3B,KAAkC;;AArnBtC;AAAA;AAAA,WAynBE,kBAAkB;UACnB8H,SAAS;;UACTlE,MAAMC,OAAN,CAAc,KAAK3B,QAAnB,GAA8B;iBACvB,KAAKA,QAAL,CAAclC,MAAd,IAAwB;aAC5B;iBACI,CAAC,KAAKkC;;;aAEV4F;;AAhoBJ;AAAA;AAAA,WAuoBE,cAAKC,SAAL,EAA+B;WAC/BlF,aAAakF;WACb/E,WAAW,KAAKwE,UAAL;WACXlE,UAAU,KAAK0E,SAAL;;AA1oBZ;AAAA;AAAA,WA8oBE,yBAAsB;WACtBtE;;UAED,KAAKV,QAAL,IAAiB,KAAKd,QAAL,KAAkB,MAAM;aACtC8B;;;AAlpBJ;AAAA;AAAA,WAupBE,0BAAkC;aAChC,KAAKiE,WAAL,CAAiB,CAAC,KAAKT,UAAL,EAAlB;;AAxpBJ;AAAA;AAAA,WA4pBE,qBAAYxE,QAAZ,EAA+BkF,IAA/B,EAA2E;UACxEvG,OAAS,KAATA;;UACFwG;AACJC,QAAAA,UAAU;SACPF;;UAGDR,MAAM/F,KAAK6C;;UACX,CAAC2D,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK6C,WAAb;;;UAIJxB,UAAU;YACNsF,oBAAoB;0BACR1D,KAAK;;YACnB5C,MAAIL,MAAM,wBAAwB;eAC/B0D,aAAaR,QAAQ,UAACE,IAAD,EAAU;8BAChBH,KAAKG;;;;0BAGTF,QAAQ,UAACE,IAAD,EAAU;cAC9BwD,gBAAgB;;cAChBxD,KAAKlD,QAAQ;4BACCkD,KAAKlD,MAAL,CAAY0G,aAAZ;iBACX;AAAA;;4BACW5G,iBAAAA,2CAAAA,KAAMG,uDAAN,aAAcT;;;cAE5BkH,eAAe;gBACX5C,WAAWZ,KAAKiB,WAAL;qBACRnB,QAAQ,UAAC2D,KAAD,EAAW;4BACfA,MAAMlG;;;;cAGjBY,IAAI6B,KAAKzC,OAAO;;aAEjB;sBACM,KAAKA;;;UAGd6F,QAAQC,UAAU;aACfK;aACA/E;aACAgF;;;aAGA/G,KAAKgH,WAAL,CAAiBjB,GAAjB;;AA1sBJ;AAAA;AAAA,WA8sBE,yBAAiC;aAC/B,KAAKkB,UAAL,CAAgB,CAAC,KAAKC,SAAL,EAAjB;;AA/sBJ;AAAA;AAAA,WAmtBE,oBAAW9F,OAAX,EAA6BmF,IAA7B,EAAyE;UACtEvG,OAAS,KAATA;;UACFwG;AACJC,QAAAA,UAAU;SACPF;;UAECpG,SAASH,KAAKG,MAAL,IAAe;UAC1B4F,MAAM/F,KAAK+C;;UACX,CAACyD,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK+C,UAAb;;;UAEJ,KAAKoE,WAAL,IAAoB;YAClB/F,SAAS;cACP,CAACjB,OAAOiH,gBAAgB;gBACtBC;;;cAEF9F,IAAI,KAAKZ,OAAO;eACf;wBACM,KAAKA;;;;UAGhB6F,QAAQC,UAAU;aACf1E;;;aAEA/B,KAAKsH,UAAL,CAAgBvB,GAAhB;;AA3uBJ;AAAA;AAAA,WA+uBE,yBAAiC;aAC/B,KAAKwB,UAAL,CAAgB,CAAC,KAAK9E,SAAL,EAAjB;;AAhvBJ;AAAA;AAAA,WAqvBE,oBAAWnB,OAAX,EAA6BiF,IAA7B,EAAyE;UACtEvG,OAAS,KAATA;UACFG,SAASH,KAAKG,MAAL,IAAe;;UACxBqG;AACJC,QAAAA,UAAU;SACPF;;UAEDR,MAAM/F,KAAK0C;;UACX,CAAC8D,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK0C,UAAb;;;UAEJ,KAAK8E,WAAL,MAAsBlG,YAAY,KAAKmB,SAAL,IAAkB;YAClDtC,OAAOqC,eAAe;cACpBlB,SAAS;gBACPC,IAAI,KAAKZ,OAAO;iBACf;0BACM,KAAKA;;eAEb;cACCJ,WAAW,KAAK4D,IAAL;mBAERjB,QAAQ,UAACE,IAAD,EAAU;gBACrB9B,SAAS;kBACPC,IAAI6B,KAAKzC,OAAO;mBACf;4BACMyC,KAAKzC;;;cAKdqE,UAAU,KAAKtB,UAAL;kBACRR,QAAQ,UAACE,IAAD,EAAU;0BACbA,KAAKzC;;;;;UAIlB6F,QAAQC,UAAU;YAChBtG,OAAOqC,eAAe;eACnBD;eACA;cACCkF,eAAezH,KAAK0H,eAAL,CAAqB,CAAC,KAAK/G,KAAN,CAArB;uBACRuC,QAAQ,UAACE,IAAD,EAAU;iBACxBb;;;;;aAIJvC,KAAK2H,UAAL,CAAgB5B,GAAhB;;AAnyBJ;AAAA;AAAA,WAyyBE,kBAAe;WACfrE,QAAQ,KAAKkB,QAAL;WACRxB,UAAU,KAAK8F,SAAL;WACV7F,WAAW,KAAKwE,UAAL;WACXhF,cAAc,KAAK2G,WAAL;WACd7F,UAAU,KAAK0E,SAAL;WACVpF,WAAW,KAAKyE,MAAL;WACX3E,YAAY,KAAK6G,OAAL;WACZ5G,WAAW,KAAK6G,MAAL;WACX/G,WAAW,KAAKqF,MAAL;WACXnG,KAAK+E,QAAQ;;AAnzBf;AAAA;AAAA,WAuzBE,yBAAsB;UACnB/E,OAAS,KAATA;WACHa,cAAc,KAAK2G,WAAL;;UACf,KAAK3G,aAAa;aACfS,UAAU,KAAKmB,SAAL;;YACX,KAAKnB,SAAS;eACXoB,WAAWnB,IAAI,KAAKZ,OAAO;;;aAE7B2B,gBAAgB,KAAK4D,eAAL;aAChBnB,QAAQ;;;AAh0BZ;AAAA;AAAA,WAs0BE,0BAAuB;UACpBxE,WAAa,KAAbA;;UACJ0B,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;iBAClB2C,QAAQ,UAACE,IAAD,EAAU;eACpBrB;eACAQ;eACAwE;;;;AA50BN;AAAA;AAAA,WAm1BE,yBAAsB;UACnB7G,SAAW,KAAXA;;UACJA,QAAQ;eACH6B;eACAQ;eACAoC;;;AAx1BN;AAAA;AAAA,WA61BE,yBAAgB;UACb3E,OAAS,KAATA;UACFyH,eAAezH,KAAK0H,eAAL,CAAqB,CAAC,KAAK/G,KAAN,CAArB;mBACRuC,QAAQ,UAACE,IAAD,EAAU;aACxBrB;aACAQ;;WAEFP;;AAp2BF;AAAA;AAAA,WA02BE,gBAAmB;UAChBzB,WAAa,KAAbA;UACJyC,OAAmB;WAClBC,KAAK;;UACNhB,MAAMC,OAAN,CAAc3B,QAAd,KAA2BA,SAASlC,MAAT,GAAkB,GAAG;iBACzC6E,QAAQ,UAACE,IAAD,EAAU;iBAClBJ,KAAK8E,MAAL,CAAY1E,KAAKe,IAAL,EAAZ;;;;aAGJnB;;AAn3BJ;AAAA;AAAA,WAy3BE,oBAA8B;UAC7BpC,QAAU,KAAVA;;UACF,CAACA,OAAO;gBACFmH,gBAAgB;aACnBnH,QAAQA;;;sBAECA,OAAO;aAChBA;;AAh4BJ;;AAAA;AAAA;;;;"}
+{"version":3,"file":"dep-9c56e17c.js","sources":["../../node_modules/@babel/runtime/helpers/esm/classCallCheck.js","../../node_modules/@babel/runtime/helpers/esm/createClass.js","../../node_modules/lodash/uniqueId.js","../../src/_common/js/tree/tree-node.ts"],"sourcesContent":["export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}","function _defineProperties(target, props) {\n  for (var i = 0; i < props.length; i++) {\n    var descriptor = props[i];\n    descriptor.enumerable = descriptor.enumerable || false;\n    descriptor.configurable = true;\n    if (\"value\" in descriptor) descriptor.writable = true;\n    Object.defineProperty(target, descriptor.key, descriptor);\n  }\n}\n\nexport default function _createClass(Constructor, protoProps, staticProps) {\n  if (protoProps) _defineProperties(Constructor.prototype, protoProps);\n  if (staticProps) _defineProperties(Constructor, staticProps);\n  return Constructor;\n}","var toString = require('./toString');\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return toString(prefix) + id;\n}\n\nmodule.exports = uniqueId;\n","import uniqueId from 'lodash/uniqueId';\nimport get from 'lodash/get';\nimport { TreeStore } from './tree-store';\nimport {\n  TreeNodeValue,\n  TreeNodeState,\n  TypeIdMap,\n  TypeTreeItem,\n  TypeSettingOptions,\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n} from './types';\nimport {\n  createNodeModel,\n  updateNodeModel,\n} from './tree-node-model';\n\nconst { hasOwnProperty } = Object.prototype;\n\nconst defaultStatus = {\n  expandMutex: false,\n  activable: false,\n  checkable: false,\n  disabled: false,\n  draggable: false,\n  loading: false,\n};\n\n// vm 开头为视图属性，不可以外部设置\n// 用于触发视图更新\nexport class TreeNode {\n  // 节点隶属的树实例\n  public tree: TreeStore;\n\n  // 节点 id ，唯一标志\n  public value: string;\n\n  // 节点文本\n  public label: string;\n\n  // 节点数据\n  public data: TypeTreeNodeData;\n\n  // 父节点\n  public parent: TreeNode;\n\n  // 子节点列表\n  public children: TreeNode[] | boolean;\n\n  // 暴露的 treeNodeModel，这个对象的属性和 api 提供给用户使用\n  public model: TypeTreeNodeModel;\n\n  // 是否为叶节点\n  public vmIsLeaf: boolean;\n\n  // 是否为子节点中的第一个\n  public vmIsFirst: boolean;\n\n  // 是否为子节点中的最后\n  public vmIsLast: boolean;\n\n  // 节点是否是经过过滤剩下的\n  public vmIsRest: boolean;\n\n  // 节点是否展示为锁定状态\n  public vmIsLocked: boolean;\n\n  // 节点在视图上实际的展开状态\n  public expanded: boolean;\n\n  // 展开时是否收起同级节点，对子节点生效\n  public expandMutex: boolean;\n\n  // 节点在视图上实际的激活状态\n  public actived: boolean;\n\n  // 是否可激活\n  public activable: boolean;\n\n  // 是否可选中\n  public checkable: boolean;\n\n  // 是否可选中的视图呈现\n  public vmCheckable: boolean;\n\n  // 节点在视图上实际的选中态\n  public checked: boolean;\n\n  // 节点实际是否为半选状态\n  public indeterminate: boolean;\n\n  // 节点是否已禁用\n  public disabled: boolean;\n\n  // 节点是否可拖动\n  public draggable: boolean;\n\n  // 节点是否可视\n  public visible: boolean;\n\n  // 节点在树中的层级\n  public level: number;\n\n  // 节点是否正在加载数据\n  public loading: boolean;\n\n  public constructor(\n    tree: TreeStore,\n    data?: TypeTreeNodeData,\n    parent?: TreeNode,\n  ) {\n    this.data = data;\n    this.tree = tree;\n\n    const config = tree.config || {};\n    const prefix = config.prefix || 't';\n    const keys = get(tree, 'config.keys') || {};\n    const propChildren = keys.children || 'children';\n    const propLabel = keys.label || 'label';\n    const propValue = keys.value || 'value';\n\n    this.model = null;\n    this.children = null;\n    this.vmCheckable = false;\n    this.vmIsLeaf = false;\n    this.vmIsFirst = false;\n    this.vmIsLast = false;\n    this.vmIsRest = true;\n    this.vmIsLocked = false;\n\n    const spec = {\n      ...defaultStatus,\n      actived: false,\n      expanded: false,\n      checked: false,\n      ...data,\n    };\n    const children = spec[propChildren];\n\n    this.set(spec);\n    this.label = spec[propLabel] || '';\n    this.value = spec[propValue] || uniqueId(prefix);\n    this.tree.nodeMap.set(this.value, this);\n\n    if (parent && parent instanceof TreeNode) {\n      this.parent = parent;\n    } else {\n      this.parent = null;\n    }\n\n    // 子节点为 true 的状态逻辑需要放到状态计算之前\n    // 初始化加载逻辑需要依据这个来进行\n    if (children === true) {\n      this.children = children;\n    }\n\n    // 初始化状态计算\n    this.level = 0;\n    this.visible = true;\n\n    this.actived = spec.actived;\n    this.initActived();\n\n    this.expanded = spec.expanded;\n    this.initExpanded();\n\n    this.checked = spec.checked;\n    this.initChecked();\n\n    this.update();\n    tree.reflow(this);\n\n    // 这里的子节点加载逻辑不能放到状态计算之前\n    // 因为子节点状态计算依赖父节点状态\n    if (Array.isArray(children)) {\n      this.append(children);\n    } else if (children === true && !config.lazy) {\n      this.loadChildren();\n    }\n\n    // checked 状态依赖于子节点状态\n    // 因此初始化状态放到子节点插入之后\n    this.checked = false;\n    this.indeterminate = false;\n    this.updateChecked();\n  }\n\n  /* ------ 状态初始化 ------ */\n\n  // 初始化选中态\n  public initChecked() {\n    const { tree, value, parent } = this;\n    const { checkStrictly } = tree.config;\n    let { checked } = this;\n    checked = parent?.isChecked();\n    if (checked && !checkStrictly) {\n      tree.checkedMap.set(value, true);\n    }\n    this.checked = checked;\n  }\n\n  // 初始化节点展开状态\n  public initExpanded(): void {\n    const { tree } = this;\n    let { expanded } = this;\n    const { config } = tree;\n    if (\n      typeof config.expandLevel === 'number'\n      && this.getLevel() < config.expandLevel\n    ) {\n      tree.expandedMap.set(this.value, true);\n      expanded = true;\n    }\n    if (config.expandAll) {\n      expanded = true;\n    }\n    if (this.children === true && config.lazy) {\n      expanded = false;\n    }\n    if (expanded) {\n      tree.expandedMap.set(this.value, true);\n    } else {\n      tree.expandedMap.delete(this.value);\n    }\n    this.expanded = expanded;\n  }\n\n  // 初始化高亮状态\n  public initActived(): void {\n    const { tree, actived } = this;\n    if (actived) {\n      tree.activedMap.set(this.value, true);\n    }\n  }\n\n  /* ------ 节点操作 ------ */\n\n  // 追加数据\n  public append(data: TypeTreeNodeData | TypeTreeNodeData[]): void {\n    const list = [];\n    if (!Array.isArray(data)) {\n      list.push(data);\n    } else {\n      list.push(...data);\n    }\n    if (list.length <= 0) {\n      return;\n    }\n    if (!Array.isArray(this.children)) {\n      this.children = [];\n    }\n    const { children, tree } = this;\n    list.forEach((item) => {\n      let node = null;\n      if (item instanceof TreeNode) {\n        node = item;\n        node.appendTo(this.tree, this);\n      } else {\n        node = new TreeNode(this.tree, item, this);\n        children.push(node);\n      }\n    });\n    tree.reflow(this);\n    this.updateRelated();\n  }\n\n  // 将当前节点追加到某个父节点的子节点列表中\n  public appendTo(\n    tree: TreeStore,\n    parent?: TreeNode,\n    index?: number,\n  ): void {\n    const parentNode = parent;\n    if (!parentNode) return;\n\n    const targetParents = parentNode.getParents();\n    const includeCurrent = targetParents.some((node) => node.value === this.value);\n    if (includeCurrent) {\n      // 不能将父节点插入到子节点\n      return;\n    }\n\n    if (Array.isArray(parentNode.children)) {\n      let targetIndex = 0;\n      if (typeof index === 'number') {\n        targetIndex = index;\n      }\n      const targetPosNode = parentNode.children[targetIndex];\n      if (targetPosNode.value === this.value) {\n        // 无需将节点插入到原位置\n        return;\n      }\n    }\n\n    this.remove();\n    this.parent = parentNode;\n\n    let siblings = null;\n    if (parentNode instanceof TreeNode) {\n      if (!Array.isArray(parentNode.children)) {\n        parentNode.children = [];\n      }\n      siblings = parent.children;\n    } else {\n      siblings = tree.children;\n    }\n    if (Array.isArray(siblings)) {\n      if (typeof index === 'number') {\n        siblings.splice(index, 0, this);\n      } else {\n        siblings.push(this);\n      }\n    }\n\n    // 插入节点应当继承展开状态\n    // 但建议不要继承选中状态和高亮状态\n    const nodes = this.walk();\n    nodes.forEach((item) => {\n      const node = item;\n      node.tree = tree;\n      tree.nodeMap.set(node.value, node);\n      if (node.expanded) {\n        tree.expandedMap.set(node.value, true);\n      }\n    });\n\n    const updateNodes = parentNode.walk();\n    updateNodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n\n    tree.reflow();\n  }\n\n  // 插入一个同级节点数据\n  public insert(\n    item: TypeTreeItem,\n    index?: number,\n  ): void {\n    const { tree, parent } = this;\n    const siblings = this.getSiblings();\n    let node = null;\n    if (item instanceof TreeNode) {\n      node = item;\n      node.appendTo(tree, parent, index);\n    } else if (item) {\n      node = new TreeNode(tree, item, parent);\n      if (typeof index === 'number') {\n        siblings.splice(index, 0, node);\n      }\n      siblings.forEach((sibling) => {\n        sibling.update();\n      });\n    }\n    tree.reflow();\n  }\n\n  // 在当前节点之前插入节点\n  public insertBefore(newData: TypeTreeItem): void {\n    const index = this.getIndex();\n    this.insert(newData, index);\n  }\n\n  // 在当前节点之后插入节点\n  public insertAfter(newData: TypeTreeItem): void {\n    const index = this.getIndex();\n    this.insert(newData, index + 1);\n  }\n\n  // 从一个树移除本节点\n  public remove(): void {\n    const { tree } = this;\n\n    const nodes = this.walk();\n    const siblings = this.getSiblings();\n    const index = this.getIndex();\n    // 从父节点的子节点列表中移除自己\n    // 但不要将自己的父节点移除，避免渲染与判断失败\n    if (Array.isArray(siblings)) {\n      siblings.splice(index, 1);\n    }\n    // 清理与树的关系，但不清理自身状态\n    nodes.forEach((node) => {\n      node.clean();\n    });\n    // 同级节点的连线状态会受到影响\n    siblings.forEach((node) => {\n      node.update();\n    });\n    // 父节点选中态会受到影响\n    this.updateParents();\n    tree.reflow();\n  }\n\n  // 清除本节点与一个树的关系\n  public clean(): void {\n    const { tree, value } = this;\n    tree.activedMap.delete(value);\n    tree.checkedMap.delete(value);\n    tree.expandedMap.delete(value);\n    tree.nodeMap.delete(value);\n  }\n\n  // 异步加载子节点数据\n  public async loadChildren(): Promise<void> {\n    const config = get(this, 'tree.config') || {};\n    if (this.children === true && !this.loading) {\n      if (typeof config.load === 'function') {\n        this.loading = true;\n        this.update();\n        let list = [];\n        list = await config.load(this);\n        this.tree.emit('load', {\n          node: this,\n          data: list,\n        });\n        this.loading = false;\n        if (Array.isArray(list) && list.length > 0) {\n          this.append(list);\n        } else {\n          this.children = false;\n        }\n        this.update();\n      }\n    }\n  }\n\n  // 设置状态\n  public set(item: TreeNodeState): void {\n    const { tree } = this;\n    const keys = Object.keys(item);\n    keys.forEach((key) => {\n      if (hasOwnProperty.call(defaultStatus, key) || key === 'label') {\n        this[key] = item[key];\n      }\n    });\n    tree.updated(this);\n  }\n\n  /* ------ 节点获取 ------- */\n\n  // 获取单个父节点\n  public getParent(): TreeNode {\n    return this.parent;\n  }\n\n  // 获取所有父节点\n  public getParents(): TreeNode[] {\n    const parents = [];\n    let node = this.parent;\n    while (node) {\n      parents.push(node);\n      node = node.parent;\n    }\n    return parents;\n  }\n\n  // 获取兄弟节点，包含自己在内\n  public getSiblings(): TreeNode[] {\n    const { parent, tree } = this;\n    let list: TreeNode[] = [];\n    if (parent) {\n      if (Array.isArray(parent.children)) {\n        list = parent.children;\n      }\n    } else if (tree) {\n      list = tree.children;\n    }\n    return list;\n  }\n\n  // 获取根节点\n  public getRoot(): TreeNode {\n    const parents = this.getParents();\n    return parents[parents.length - 1] || null;\n  }\n\n  // 获取节点在父节点的子节点列表中的位置\n  // 如果没有父节点，则获取节点在根节点列表的位置\n  public getIndex(): number {\n    const list = this.getSiblings();\n    return list.indexOf(this);\n  }\n\n  // 返回路径节点\n  public getPath(): TreeNode[] {\n    const nodes = this.getParents();\n    nodes.unshift(this);\n    return nodes.reverse();\n  }\n\n  // 获取节点所在层级\n  public getLevel(): number {\n    const parents = this.getParents();\n    return parents.length;\n  }\n\n  /* ------ 节点状态判断 ------ */\n\n  // 判断节点是否被过滤\n  public isRest(): boolean {\n    const {\n      config,\n      filterMap,\n    } = this.tree;\n\n    let rest = true;\n    if (typeof config.filter === 'function') {\n      const nodeModel = this.getModel();\n      rest = config.filter(nodeModel);\n    }\n\n    if (rest) {\n      filterMap.set(this.value, true);\n    } else if (filterMap.get(this.value)) {\n      filterMap.delete(this.value);\n    }\n\n    return rest;\n  }\n\n  // 判断节点是否可视\n  public isVisible(): boolean {\n    const {\n      nodeMap,\n    } = this.tree;\n\n    let visible = true;\n\n    // 锁定状态，直接呈现\n    if (this.vmIsLocked) {\n      return true;\n    }\n\n    // 在当前树上，未被移除\n    if (nodeMap.get(this.value)) {\n      // 节点未被过滤\n      const filterVisible = this.isRest();\n\n      // 所有父节点展开\n      let expandVisible = true;\n      const parents = this.getParents();\n      if (parents.length > 0) {\n        expandVisible = parents.every((node: TreeNode) => node.isExpanded());\n      }\n\n      // 节点为未被过滤节点的父节点\n      visible = expandVisible && filterVisible;\n    } else {\n      visible = false;\n    }\n    return visible;\n  }\n\n  // 判断节点是否被禁用\n  public isDisabled() {\n    if (this.vmIsLocked) return true;\n    const treeDisabled = get(this, 'tree.config.disabled');\n    return !!(treeDisabled || this.disabled);\n  }\n\n  // 判断节点是否支持互斥展开\n  public isExpandMutex() {\n    return !!(get(this, 'tree.config.expandMutex') || this.expandMutex);\n  }\n\n  // 节点可高亮\n  public isActivable() {\n    return !!(get(this, 'tree.config.activable') || this.activable);\n  }\n\n  // 是否可选\n  public isCheckable() {\n    return !!(get(this, 'tree.config.checkable') || this.checkable);\n  }\n\n  // 检查节点是否被激活\n  public isActived(map?: Map<string, boolean>): boolean {\n    const { tree, value } = this;\n    const activedMap = map || tree.activedMap;\n    return !!(tree.nodeMap.get(value) && activedMap.get(value));\n  }\n\n  // 检查节点是否已展开\n  public isExpanded(map?: Map<string, boolean>): boolean {\n    const { tree, value, vmIsLocked } = this;\n    if (vmIsLocked) return true;\n    const expandedMap = map || tree.expandedMap;\n    return !!(tree.nodeMap.get(value) && expandedMap.get(value));\n  }\n\n  // 计算属性，判断节点是否被选中\n  // map: 预期选中项map，用于计算节点在预期环境中的选中态\n  public isChecked(map?: TypeIdMap): boolean {\n    const { children, tree } = this;\n    const { checkStrictly } = tree.config;\n    let checked = false;\n    const checkedMap = map || tree.checkedMap;\n    if (tree.nodeMap.get(this.value)) {\n      if (checkedMap.get(this.value)) {\n        // 如果在 checked 节点列表中，则直接为 true\n        checked = true;\n      } else if (\n        Array.isArray(children)\n        && children.length > 0\n        && !checkStrictly\n      ) {\n        // 如果是父节点，需检查所有子节点状态\n        checked = children.every((node) => {\n          const childIsChecked = node.isChecked(checkedMap);\n          return childIsChecked;\n        });\n      } else if (!checkStrictly) {\n        // 从父节点状态推断子节点状态\n        // 这里再调用 isChecked 会导致死循环\n        const parents = this.getParents();\n        checked = parents.some((node) => checkedMap.get(node.value));\n      }\n    }\n    return !!checked;\n  }\n\n  // 是否为半选状态\n  public isIndeterminate(): boolean {\n    const { children, tree } = this;\n    const { checkStrictly } = tree.config;\n    if (checkStrictly) {\n      return false;\n    }\n    let indeterminate = false;\n    if (Array.isArray(children)) {\n      // 叶节点不存在半选状态\n      let childChecked: null | boolean = null;\n      indeterminate = children.some((node: TreeNode) => {\n        if (node.isIndeterminate()) {\n          // 子节点有任意一个半选，则其为半选状态\n          return true;\n        }\n        if (childChecked === null) {\n          childChecked = node.isChecked();\n        }\n        if (childChecked !== node.isChecked()) {\n          // 子节点选中状态不一致，则其为半选状态\n          return true;\n        }\n        return false;\n      });\n    }\n    return indeterminate;\n  }\n\n  public isFirst(): boolean {\n    const siblings = this.getSiblings();\n    return siblings[0] === this;\n  }\n\n  public isLast(): boolean {\n    const siblings = this.getSiblings();\n    return siblings[siblings.length - 1] === this;\n  }\n\n  // 是叶节点\n  public isLeaf(): boolean {\n    let isLeaf = false;\n    if (Array.isArray(this.children)) {\n      isLeaf = this.children.length <= 0;\n    } else {\n      isLeaf = !this.children;\n    }\n    return isLeaf;\n  }\n\n  /* ------ 节点状态切换 ------ */\n\n  // 锁定节点\n  // 搜索过滤节点时，路径节点需要固定呈现，视其为锁定态\n  public lock(lockState: boolean): void {\n    this.vmIsLocked = lockState;\n    this.expanded = this.isExpanded();\n    this.visible = this.isVisible();\n  }\n\n  // 节点展开关闭后需要调用的状态检查函数\n  public afterExpanded(): void {\n    this.update();\n    // 节点展开时检查延迟加载的数据\n    if (this.expanded && this.children === true) {\n      this.loadChildren();\n    }\n  }\n\n  // 展开或者关闭节点\n  public toggleExpanded(): TreeNodeValue[] {\n    return this.setExpanded(!this.isExpanded());\n  }\n\n  // 设置节点展开状态\n  public setExpanded(expanded: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const options = {\n      directly: false,\n      ...opts,\n    };\n\n    let map = tree.expandedMap;\n    if (!options.directly) {\n      map = new Map(tree.expandedMap);\n    }\n\n    // 手风琴效果，先折叠同级节点\n    if (expanded) {\n      const shouldExpandNodes = [];\n      shouldExpandNodes.push(this);\n      if (get(tree, 'config.expandParent')) {\n        this.getParents().forEach((node) => {\n          shouldExpandNodes.push(node);\n        });\n      }\n      shouldExpandNodes.forEach((node) => {\n        let isExpandMutex = false;\n        if (node.parent) {\n          isExpandMutex = node.parent.isExpandMutex();\n        } else {\n          isExpandMutex = tree?.config?.expandMutex;\n        }\n        if (isExpandMutex) {\n          const siblings = node.getSiblings();\n          siblings.forEach((snode) => {\n            map.delete(snode.value);\n          });\n        }\n        map.set(node.value, true);\n      });\n    } else {\n      map.delete(this.value);\n    }\n\n    if (options.directly) {\n      this.afterExpanded();\n      this.update();\n      this.updateChildren();\n    }\n\n    return tree.getExpanded(map);\n  }\n\n  // 切换节点激活态\n  public toggleActived(): TreeNodeValue[] {\n    return this.setActived(!this.isActived());\n  }\n\n  // 设置节点激活态\n  public setActived(actived: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const options = {\n      directly: false,\n      ...opts,\n    };\n    const config = tree.config || {};\n    let map = tree.activedMap;\n    if (!options.directly) {\n      map = new Map(tree.activedMap);\n    }\n    if (this.isActivable()) {\n      if (actived) {\n        if (!config.activeMultiple) {\n          map.clear();\n        }\n        map.set(this.value, true);\n      } else {\n        map.delete(this.value);\n      }\n    }\n    if (options.directly) {\n      this.update();\n    }\n    return tree.getActived(map);\n  }\n\n  // 切换选中态\n  public toggleChecked(): TreeNodeValue[] {\n    return this.setChecked(!this.isChecked());\n  }\n\n  // 更新单个节点的选中态\n  // 返回树选中列表\n  public setChecked(checked: boolean, opts?: TypeSettingOptions): TreeNodeValue[] {\n    const { tree } = this;\n    const config = tree.config || {};\n    const options = {\n      directly: false,\n      ...opts,\n    };\n    let map = tree.checkedMap;\n    if (!options.directly) {\n      map = new Map(tree.checkedMap);\n    }\n    if (this.isCheckable() && checked !== this.isChecked()) {\n      if (config.checkStrictly) {\n        if (checked) {\n          map.set(this.value, true);\n        } else {\n          map.delete(this.value);\n        }\n      } else {\n        const children = this.walk();\n        // 子节点的预期选中态与当前节点同步\n        children.forEach((node) => {\n          if (checked) {\n            map.set(node.value, true);\n          } else {\n            map.delete(node.value);\n          }\n        });\n        // 消除全部父节点的预期选中态\n        // 父节点的预期选中态将通过计算得出\n        const parents = this.getParents();\n        parents.forEach((node) => {\n          map.delete(node.value);\n        });\n      }\n    }\n    if (options.directly) {\n      if (config.checkStrictly) {\n        this.updateChecked();\n      } else {\n        const relatedNodes = tree.getRelatedNodes([this.value]);\n        relatedNodes.forEach((node) => {\n          node.updateChecked();\n        });\n      }\n    }\n    return tree.getChecked(map);\n  }\n\n  /* ------ 节点状态更新 ------ */\n\n  // 更新节点状态\n  public update(): void {\n    this.level = this.getLevel();\n    this.actived = this.isActived();\n    this.expanded = this.isExpanded();\n    this.vmCheckable = this.isCheckable();\n    this.visible = this.isVisible();\n    this.vmIsRest = this.isRest();\n    this.vmIsFirst = this.isFirst();\n    this.vmIsLast = this.isLast();\n    this.vmIsLeaf = this.isLeaf();\n    this.tree.updated(this);\n  }\n\n  // 更新选中态属性值\n  public updateChecked(): void {\n    const { tree } = this;\n    this.vmCheckable = this.isCheckable();\n    if (this.vmCheckable) {\n      this.checked = this.isChecked();\n      if (this.checked) {\n        tree.checkedMap.set(this.value, true);\n      }\n      this.indeterminate = this.isIndeterminate();\n      tree.updated(this);\n    }\n  }\n\n  // 更新所有子节点状态\n  // 注意:不包含自己\n  public updateChildren(): void {\n    const { children } = this;\n    if (Array.isArray(children)) {\n      children.forEach((node) => {\n        node.update();\n        node.updateChecked();\n        node.updateChildren();\n      });\n    }\n  }\n\n  // 父节点状态更新\n  // 注意:不包含自己\n  public updateParents(): void {\n    const { parent } = this;\n    if (parent) {\n      parent.update();\n      parent.updateChecked();\n      parent.updateParents();\n    }\n  }\n\n  // 更新上下游相关节点\n  public updateRelated() {\n    const { tree } = this;\n    const relatedNodes = tree.getRelatedNodes([this.value]);\n    relatedNodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n    tree.reflow();\n  }\n\n  /* ------ 节点遍历 ------ */\n\n  // 获取包含自己在内所有的子节点\n  public walk(): TreeNode[] {\n    const { children } = this;\n    let list: TreeNode[] = [];\n    list.push(this);\n    if (Array.isArray(children) && children.length > 0) {\n      children.forEach((node) => {\n        list = list.concat(node.walk());\n      });\n    }\n    return list;\n  }\n\n  // TreeNode 对象 => TypeTreeNodeModel 对象\n  // 用于 treeNode 对外暴露的 api\n  // 经过封装的对象，减少了对外暴露的 api，利于代码重构\n  public getModel(): TypeTreeNodeModel {\n    let { model } = this;\n    if (!model) {\n      model = createNodeModel(this);\n      this.model = model;\n    }\n    updateNodeModel(model, this);\n    return model;\n  }\n}\n\nexport default TreeNode;\n"],"names":["_classCallCheck","instance","Constructor","TypeError","_defineProperties","target","props","i","length","descriptor","enumerable","configurable","writable","Object","defineProperty","key","_createClass","protoProps","staticProps","prototype","toString","require$$0","idCounter","uniqueId","prefix","id","uniqueId_1","hasOwnProperty","defaultStatus","expandMutex","activable","checkable","disabled","draggable","loading","tree","data","parent","config","keys","get","propChildren","children","propLabel","label","propValue","value","model","vmCheckable","vmIsLeaf","vmIsFirst","vmIsLast","vmIsRest","vmIsLocked","spec","actived","expanded","checked","set","nodeMap","TreeNode","level","visible","initActived","initExpanded","initChecked","update","reflow","Array","isArray","append","lazy","loadChildren","indeterminate","updateChecked","checkStrictly","isChecked","checkedMap","expandLevel","getLevel","expandedMap","expandAll","activedMap","list","push","forEach","item","node","appendTo","updateRelated","index","parentNode","targetParents","getParents","includeCurrent","some","targetIndex","targetPosNode","remove","siblings","splice","nodes","walk","updateNodes","getSiblings","sibling","newData","getIndex","insert","clean","updateParents","load","emit","call","updated","parents","indexOf","unshift","reverse","filterMap","rest","filter","nodeModel","getModel","filterVisible","isRest","expandVisible","every","isExpanded","treeDisabled","map","childIsChecked","childChecked","isIndeterminate","isLeaf","lockState","isVisible","setExpanded","opts","options","directly","Map","shouldExpandNodes","isExpandMutex","snode","afterExpanded","updateChildren","getExpanded","setActived","isActived","isActivable","activeMultiple","clear","getActived","setChecked","isCheckable","relatedNodes","getRelatedNodes","getChecked","isFirst","isLast","concat","createNodeModel"],"mappings":";;;;;;;;;;;;;;AAAe,SAASA,eAAT,CAAyBC,QAAzB,EAAmCC,WAAnC,EAAgD;AAC7D,MAAI,EAAED,QAAQ,YAAYC,WAAtB,CAAJ,EAAwC;AACtC,UAAM,IAAIC,SAAJ,CAAc,mCAAd,CAAN;AACD;AACF;;ACJD,SAASC,iBAAT,CAA2BC,MAA3B,EAAmCC,KAAnC,EAA0C;AACxC,OAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGD,KAAK,CAACE,MAA1B,EAAkCD,CAAC,EAAnC,EAAuC;AACrC,QAAIE,UAAU,GAAGH,KAAK,CAACC,CAAD,CAAtB;AACAE,IAAAA,UAAU,CAACC,UAAX,GAAwBD,UAAU,CAACC,UAAX,IAAyB,KAAjD;AACAD,IAAAA,UAAU,CAACE,YAAX,GAA0B,IAA1B;AACA,QAAI,WAAWF,UAAf,EAA2BA,UAAU,CAACG,QAAX,GAAsB,IAAtB;AAC3BC,IAAAA,MAAM,CAACC,cAAP,CAAsBT,MAAtB,EAA8BI,UAAU,CAACM,GAAzC,EAA8CN,UAA9C;AACD;AACF;;AAEc,SAASO,YAAT,CAAsBd,WAAtB,EAAmCe,UAAnC,EAA+CC,WAA/C,EAA4D;AACzE,MAAID,UAAJ,EAAgBb,iBAAiB,CAACF,WAAW,CAACiB,SAAb,EAAwBF,UAAxB,CAAjB;AAChB,MAAIC,WAAJ,EAAiBd,iBAAiB,CAACF,WAAD,EAAcgB,WAAd,CAAjB;AACjB,SAAOhB,WAAP;AACD;;ACdD,IAAIkB,QAAQ,GAAGC,UAAf;AAEA;;AACA,IAAIC,SAAS,GAAG,CAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,MAAlB,EAA0B;AACxB,MAAIC,EAAE,GAAG,EAAEH,SAAX;AACA,SAAOF,QAAQ,CAACI,MAAD,CAAR,GAAmBC,EAA1B;AACD;;IAEDC,UAAc,GAAGH;;;;;ACVjB,IAAQI,cAAR,GAA2Bd,OAAOM,SAAlC,CAAQQ,cAAR;AAEA,IAAMC,gBAAgB;AACpBC,EAAAA,aAAa,KADO;AAEpBC,EAAAA,WAAW,KAFS;AAGpBC,EAAAA,WAAW,KAHS;AAIpBC,EAAAA,UAAU,KAJU;AAKpBC,EAAAA,WAAW,KALS;AAMpBC,EAAAA,SAAS;AANW,CAAtB;YAWO;AA4EE,oBACLC,IADK,EAELC,IAFK,EAGLC,MAHK,EAIL;AAAA;;SACKD,OAAOA;SACPD,OAAOA;QAENG,SAASH,KAAKG,MAAL,IAAe;QACxBd,SAASc,OAAOd,MAAP,IAAiB;QAC1Be,OAAOC,MAAIL,MAAM,cAAV,IAA4B;QACnCM,eAAeF,KAAKG,QAAL,IAAiB;QAChCC,YAAYJ,KAAKK,KAAL,IAAc;QAC1BC,YAAYN,KAAKO,KAAL,IAAc;SAE3BC,QAAQ;SACRL,WAAW;SACXM,cAAc;SACdC,WAAW;SACXC,YAAY;SACZC,WAAW;SACXC,WAAW;SACXC,aAAa;;QAEZC,uCACD1B;AACH2B,MAAAA,SAAS;AACTC,MAAAA,UAAU;AACVC,MAAAA,SAAS;OACNrB;;QAECM,WAAWY,KAAKb;SAEjBiB,IAAIJ;SACJV,QAAQU,KAAKX,UAAL,IAAmB;SAC3BG,QAAQQ,KAAKT,UAAL,IAAmBtB,WAASC;SACpCW,KAAKwB,QAAQD,IAAI,KAAKZ,OAAO;;QAE9BT,UAAUA,kBAAkBuB,UAAU;WACnCvB,SAASA;WACT;WACAA,SAAS;;;QAKZK,aAAa,MAAM;WAChBA,WAAWA;;;SAIbmB,QAAQ;SACRC,UAAU;SAEVP,UAAUD,KAAKC;SACfQ;SAEAP,WAAWF,KAAKE;SAChBQ;SAEAP,UAAUH,KAAKG;SACfQ;SAEAC;SACAC,OAAO;;QAIRC,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;WACtB4B,OAAO5B;eACHA,aAAa,IAAb,IAAqB,CAACJ,OAAOiC,MAAM;WACvCC;;;SAKFf,UAAU;SACVgB,gBAAgB;SAChBC;;;AA1JF;AAAA;AAAA,WAgKE,uBAAc;UACXvC,OAAwB,KAAxBA;UAAMW,QAAkB,KAAlBA;UAAOT,SAAW,KAAXA;UACbsC,gBAAkBxC,KAAKG,OAAvBqC;UACFlB,UAAY,KAAZA;gBACIpB,mBAAAA,6BAAAA,OAAQuC,SAAR;;UACNnB,WAAW,CAACkB,eAAe;aACxBE,WAAWnB,IAAIZ,OAAO;;;WAExBW,UAAUA;;AAxKZ;AAAA;AAAA,WA4KE,wBAAqB;UAClBtB,OAAS,KAATA;UACFqB,WAAa,KAAbA;UACElB,SAAWH,KAAXG;;UAEN,OAAOA,OAAOwC,WAAd,KAA8B,QAA9B,IACG,KAAKC,QAAL,KAAkBzC,OAAOwC,aAC5B;aACKE,YAAYtB,IAAI,KAAKZ,OAAO;mBACtB;;;UAETR,OAAO2C,WAAW;mBACT;;;UAET,KAAKvC,QAAL,KAAkB,IAAlB,IAA0BJ,OAAOiC,MAAM;mBAC9B;;;UAETf,UAAU;aACPwB,YAAYtB,IAAI,KAAKZ,OAAO;aAC5B;aACAkC,sBAAmB,KAAKlC;;;WAE1BU,WAAWA;;AAlMb;AAAA;AAAA,WAsME,uBAAoB;UACjBrB,OAAkB,KAAlBA;UAAMoB,UAAY,KAAZA;;UACVA,SAAS;aACN2B,WAAWxB,IAAI,KAAKZ,OAAO;;;AAzM/B;AAAA;AAAA,WAgNE,gBAAOV,IAAP,EAA0D;AAAA;;UACzD+C,OAAO;;UACT,CAACf,MAAMC,OAAN,CAAcjC,IAAd,GAAqB;aACnBgD,KAAKhD;aACL;aACAgD,oCAAQhD;;;UAEX+C,KAAK3E,MAAL,IAAe,GAAG;;;;UAGlB,CAAC4D,MAAMC,OAAN,CAAc,KAAK3B,QAAnB,GAA8B;aAC5BA,WAAW;;;UAEVA,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;WACbkD,QAAQ,UAACC,IAAD,EAAU;YACjBC,OAAO;;YACPD,gBAAgB1B,UAAU;iBACrB0B;eACFE,SAAS,MAAKrD,MAAM;eACpB;iBACE,IAAIyB,QAAJ,CAAa,MAAKzB,IAAlB,EAAwBmD,IAAxB,EAA8B,KAA9B;mBACEF,KAAKG;;;WAGbpB,OAAO;WACPsB;;AAzOF;AAAA;AAAA,WA6OE,kBACLtD,IADK,EAELE,MAFK,EAGLqD,KAHK,EAIC;AAAA;;UACAC,aAAatD;UACf,CAACsD;UAECC,gBAAgBD,WAAWE,UAAX;UAChBC,iBAAiBF,cAAcG,IAAd,CAAmB,UAACR,IAAD;AAAA,eAAUA,KAAKzC,KAAL,KAAe,OAAKA,KAA9B;AAAA,OAAnB;;UACnBgD,gBAAgB;;;;UAKhB1B,MAAMC,OAAN,CAAcsB,WAAWjD,QAAzB,GAAoC;YAClCsD,cAAc;;YACd,OAAON,KAAP,KAAiB,UAAU;wBACfA;;;YAEVO,gBAAgBN,WAAWjD,QAAX,CAAoBsD,WAApB;;YAClBC,cAAcnD,KAAd,KAAwB,KAAKA,OAAO;;;;;WAMrCoD;WACA7D,SAASsD;UAEVQ,WAAW;;UACXR,sBAAsB/B,UAAU;YAC9B,CAACQ,MAAMC,OAAN,CAAcsB,WAAWjD,QAAzB,GAAoC;qBAC5BA,WAAW;;;mBAEbL,OAAOK;aACb;mBACMP,KAAKO;;;UAEd0B,MAAMC,OAAN,CAAc8B,QAAd,GAAyB;YACvB,OAAOT,KAAP,KAAiB,UAAU;mBACpBU,OAAOV,OAAO,GAAG;eACrB;mBACIN,KAAK;;;;UAMZiB,QAAQ,KAAKC,IAAL;YACRjB,QAAQ,UAACC,IAAD,EAAU;YAChBC,OAAOD;aACRnD,OAAOA;aACPwB,QAAQD,IAAI6B,KAAKzC,OAAOyC;;YACzBA,KAAK/B,UAAU;eACZwB,YAAYtB,IAAI6B,KAAKzC,OAAO;;;UAI/ByD,cAAcZ,WAAWW,IAAX;kBACRjB,QAAQ,UAACE,IAAD,EAAU;aACvBrB;aACAQ;;WAGFP;;AA9SF;AAAA;AAAA,WAkTE,gBACLmB,IADK,EAELI,KAFK,EAGC;UACEvD,OAAiB,KAAjBA;UAAME,SAAW,KAAXA;UACR8D,WAAW,KAAKK,WAAL;UACbjB,OAAO;;UACPD,gBAAgB1B,UAAU;eACrB0B;aACFE,SAASrD,MAAME,QAAQqD;iBACnBJ,MAAM;eACR,IAAI1B,QAAJ,CAAazB,IAAb,EAAmBmD,IAAnB,EAAyBjD,MAAzB;;YACH,OAAOqD,KAAP,KAAiB,UAAU;mBACpBU,OAAOV,OAAO,GAAGH;;;iBAEnBF,QAAQ,UAACoB,OAAD,EAAa;kBACpBvC;;;;WAGPC;;AArUF;AAAA;AAAA,WAyUE,sBAAauC,OAAb,EAA0C;UACzChB,QAAQ,KAAKiB,QAAL;WACTC,OAAOF,SAAShB;;AA3UlB;AAAA;AAAA,WA+UE,qBAAYgB,OAAZ,EAAyC;UACxChB,QAAQ,KAAKiB,QAAL;WACTC,OAAOF,SAAShB,QAAQ;;AAjV1B;AAAA;AAAA,WAqVE,kBAAe;UACZvD,OAAS,KAATA;UAEFkE,QAAQ,KAAKC,IAAL;UACRH,WAAW,KAAKK,WAAL;UACXd,QAAQ,KAAKiB,QAAL;;UAGVvC,MAAMC,OAAN,CAAc8B,QAAd,GAAyB;iBAClBC,OAAOV,OAAO;;;YAGnBL,QAAQ,UAACE,IAAD,EAAU;aACjBsB;;eAGExB,QAAQ,UAACE,IAAD,EAAU;aACpBrB;;WAGF4C;WACA3C;;AA1WF;AAAA;AAAA,WA8WE,iBAAc;UACXhC,OAAgB,KAAhBA;UAAMW,QAAU,KAAVA;WACToC,qBAAkBpC;WAClB+B,qBAAkB/B;WAClBkC,sBAAmBlC;WACnBa,kBAAeb;;AAnXjB;AAAA;AAAA;AAAA;;;;;;AAwXGR,gBAAAA,SAASE,MAAI,MAAM,cAAV,IAA4B;;sBACvC,KAAKE,QAAL,KAAkB,IAAlB,IAA0B,CAAC,KAAKR;;;;;sBAC9B,OAAOI,OAAOyE,IAAd,KAAuB;;;;;qBACpB7E,UAAU;qBACVgC;AACDiB,gBAAAA,OAAO;;uBACE7C,OAAOyE,IAAP,CAAY,IAAZ;;;;qBACR5E,KAAK6E,KAAK,QAAQ;AACrBzB,kBAAAA,MAAM,IADe;AAErBnD,kBAAAA,MAAM+C;AAFe;qBAIlBjD,UAAU;;oBACXkC,MAAMC,OAAN,CAAcc,IAAd,KAAuBA,KAAK3E,MAAL,GAAc,GAAG;uBACrC8D,OAAOa;uBACP;uBACAzC,WAAW;;;qBAEbwB;;;;;;;;OAzYN;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA,WA+YE,aAAIoB,IAAJ,EAA+B;AAAA;;UAC5BnD,OAAS,KAATA;UACFI,OAAO1B,OAAO0B,IAAP,CAAY+C,IAAZ;WACRD,QAAQ,UAACtE,GAAD,EAAS;YAChBY,eAAesF,IAAf,CAAoBrF,aAApB,EAAmCb,GAAnC,KAA2CA,QAAQ,SAAS;iBACzDA,OAAOuE,KAAKvE;;;WAGhBmG,QAAQ;;AAvZV;AAAA;AAAA,WA6ZE,qBAAsB;aACpB,KAAK7E;;AA9ZT;AAAA;AAAA,WAkaE,sBAAyB;UACxB8E,UAAU;UACZ5B,OAAO,KAAKlD;;aACTkD,MAAM;gBACHH,KAAKG;eACNA,KAAKlD;;;aAEP8E;;AAzaJ;AAAA;AAAA,WA6aE,uBAA0B;UACvB9E,SAAiB,KAAjBA;UAAQF,OAAS,KAATA;UACZgD,OAAmB;;UACnB9C,QAAQ;YACN+B,MAAMC,OAAN,CAAchC,OAAOK,QAArB,GAAgC;iBAC3BL,OAAOK;;iBAEPP,MAAM;eACRA,KAAKO;;;aAEPyC;;AAvbJ;AAAA;AAAA,WA2bE,mBAAoB;UACnBgC,UAAU,KAAKtB,UAAL;aACTsB,QAAQA,QAAQ3G,MAAR,GAAiB,EAAzB,IAA+B;;AA7bnC;AAAA;AAAA,WAkcE,oBAAmB;UAClB2E,OAAO,KAAKqB,WAAL;aACNrB,KAAKiC,OAAL,CAAa,IAAb;;AApcJ;AAAA;AAAA,WAwcE,mBAAsB;UACrBf,QAAQ,KAAKR,UAAL;YACRwB,QAAQ;aACPhB,MAAMiB,OAAN;;AA3cJ;AAAA;AAAA,WA+cE,oBAAmB;UAClBH,UAAU,KAAKtB,UAAL;aACTsB,QAAQ3G;;AAjdZ;AAAA;AAAA,WAudE,kBAAkB;uBAInB,KAAK2B;UAFPG,oBAAAA;UACAiF,uBAAAA;UAGEC,OAAO;;UACP,OAAOlF,OAAOmF,MAAd,KAAyB,YAAY;YACjCC,YAAY,KAAKC,QAAL;eACXrF,OAAOmF,MAAP,CAAcC,SAAd;;;UAGLF,MAAM;kBACE9D,IAAI,KAAKZ,OAAO;iBACjByE,UAAU/E,GAAV,CAAc,KAAKM,KAAnB,GAA2B;4BACnB,KAAKA;;;aAGjB0E;;AAzeJ;AAAA;AAAA,WA6eE,qBAAqB;UAExB7D,UACE,KAAKxB,KADPwB;UAGEG,UAAU;;UAGV,KAAKT,YAAY;eACZ;;;UAILM,QAAQnB,GAAR,CAAY,KAAKM,KAAjB,GAAyB;YAErB8E,gBAAgB,KAAKC,MAAL;YAGlBC,gBAAgB;YACdX,UAAU,KAAKtB,UAAL;;YACZsB,QAAQ3G,MAAR,GAAiB,GAAG;0BACN2G,QAAQY,KAAR,CAAc,UAACxC,IAAD;AAAA,mBAAoBA,KAAKyC,UAAL,EAApB;AAAA,WAAd;;;kBAIRF,iBAAiBF;aACtB;kBACK;;;aAEL9D;;AA1gBJ;AAAA;AAAA,WA8gBE,sBAAa;UACd,KAAKT,mBAAmB;UACtB4E,eAAezF,MAAI,MAAM;aACxB,CAAC,kBAAkB,KAAKR,QAAvB;;AAjhBL;AAAA;AAAA,WAqhBE,yBAAgB;aACd,CAAC,QAAM,MAAM,8BAA8B,KAAKH,WAA/C;;AAthBL;AAAA;AAAA,WA0hBE,uBAAc;aACZ,CAAC,QAAM,MAAM,4BAA4B,KAAKC,SAA7C;;AA3hBL;AAAA;AAAA,WA+hBE,uBAAc;aACZ,CAAC,QAAM,MAAM,4BAA4B,KAAKC,SAA7C;;AAhiBL;AAAA;AAAA,WAoiBE,mBAAUmG,GAAV,EAA+C;UAC5C/F,OAAgB,KAAhBA;UAAMW,QAAU,KAAVA;UACRoC,aAAagD,OAAO/F,KAAK+C;aACxB,CAAC,OAAOvB,QAAQnB,IAAIM,UAAUoC,WAAW1C,GAAX,CAAeM,KAAf,CAA7B;;AAviBL;AAAA;AAAA,WA2iBE,oBAAWoF,GAAX,EAAgD;UAC7C/F,OAA4B,KAA5BA;UAAMW,QAAsB,KAAtBA;UAAOO,aAAe,KAAfA;UACjBA,mBAAmB;UACjB2B,cAAckD,OAAO/F,KAAK6C;aACzB,CAAC,OAAOrB,QAAQnB,IAAIM,UAAUkC,YAAYxC,GAAZ,CAAgBM,KAAhB,CAA7B;;AA/iBL;AAAA;AAAA,WAojBE,mBAAUoF,GAAV,EAAoC;UACjCxF,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;UACVwC,gBAAkBxC,KAAKG,OAAvBqC;UACJlB,UAAU;UACRoB,aAAaqD,OAAO/F,KAAK0C;;UAC3B1C,KAAKwB,OAAL,CAAanB,GAAb,CAAiB,KAAKM,KAAtB,GAA8B;YAC5B+B,WAAWrC,GAAX,CAAe,KAAKM,KAApB,GAA4B;oBAEpB;mBAEVsB,MAAMC,OAAN,CAAc3B,QAAd,KACGA,SAASlC,MAAT,GAAkB,CADrB,IAEG,CAACmE,eACJ;oBAEUjC,SAASqF,KAAT,CAAe,UAACxC,IAAD,EAAU;gBAC3B4C,iBAAiB5C,KAAKX,SAAL,CAAeC,UAAf;mBAChBsD;WAFC;mBAID,CAACxD,eAAe;cAGnBwC,UAAU,KAAKtB,UAAL;oBACNsB,QAAQpB,IAAR,CAAa,UAACR,IAAD;AAAA,mBAAUV,WAAWrC,GAAX,CAAe+C,KAAKzC,KAApB,CAAV;AAAA,WAAb;;;;aAGP,CAAC,CAACW;;AA9kBN;AAAA;AAAA,WAklBE,2BAA2B;UACxBf,WAAmB,KAAnBA;UAAUP,OAAS,KAATA;UACVwC,gBAAkBxC,KAAKG,OAAvBqC;;UACJA,eAAe;eACV;;;UAELF,gBAAgB;;UAChBL,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;YAEvB0F,eAA+B;wBACnB1F,SAASqD,IAAT,CAAc,UAACR,IAAD,EAAoB;cAC5CA,KAAK8C,eAAL,IAAwB;mBAEnB;;;cAELD,iBAAiB,MAAM;2BACV7C,KAAKX,SAAL;;;cAEbwD,iBAAiB7C,KAAKX,SAAL,IAAkB;mBAE9B;;;iBAEF;SAZO;;;aAeXH;;AA3mBJ;AAAA;AAAA,WA8mBE,mBAAmB;UAClB0B,WAAW,KAAKK,WAAL;aACVL,SAAS,EAAT,KAAgB;;AAhnBpB;AAAA;AAAA,WAmnBE,kBAAkB;UACjBA,WAAW,KAAKK,WAAL;aACVL,SAASA,SAAS3F,MAAT,GAAkB,EAA3B,KAAkC;;AArnBtC;AAAA;AAAA,WAynBE,kBAAkB;UACnB8H,SAAS;;UACTlE,MAAMC,OAAN,CAAc,KAAK3B,QAAnB,GAA8B;iBACvB,KAAKA,QAAL,CAAclC,MAAd,IAAwB;aAC5B;iBACI,CAAC,KAAKkC;;;aAEV4F;;AAhoBJ;AAAA;AAAA,WAuoBE,cAAKC,SAAL,EAA+B;WAC/BlF,aAAakF;WACb/E,WAAW,KAAKwE,UAAL;WACXlE,UAAU,KAAK0E,SAAL;;AA1oBZ;AAAA;AAAA,WA8oBE,yBAAsB;WACtBtE;;UAED,KAAKV,QAAL,IAAiB,KAAKd,QAAL,KAAkB,MAAM;aACtC8B;;;AAlpBJ;AAAA;AAAA,WAupBE,0BAAkC;aAChC,KAAKiE,WAAL,CAAiB,CAAC,KAAKT,UAAL,EAAlB;;AAxpBJ;AAAA;AAAA,WA4pBE,qBAAYxE,QAAZ,EAA+BkF,IAA/B,EAA2E;UACxEvG,OAAS,KAATA;;UACFwG;AACJC,QAAAA,UAAU;SACPF;;UAGDR,MAAM/F,KAAK6C;;UACX,CAAC2D,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK6C,WAAb;;;UAIJxB,UAAU;YACNsF,oBAAoB;0BACR1D,KAAK;;YACnB5C,MAAIL,MAAM,wBAAwB;eAC/B0D,aAAaR,QAAQ,UAACE,IAAD,EAAU;8BAChBH,KAAKG;;;;0BAGTF,QAAQ,UAACE,IAAD,EAAU;cAC9BwD,gBAAgB;;cAChBxD,KAAKlD,QAAQ;4BACCkD,KAAKlD,MAAL,CAAY0G,aAAZ;iBACX;AAAA;;4BACW5G,iBAAAA,2CAAAA,KAAMG,uDAAN,aAAcT;;;cAE5BkH,eAAe;gBACX5C,WAAWZ,KAAKiB,WAAL;qBACRnB,QAAQ,UAAC2D,KAAD,EAAW;4BACfA,MAAMlG;;;;cAGjBY,IAAI6B,KAAKzC,OAAO;;aAEjB;sBACM,KAAKA;;;UAGd6F,QAAQC,UAAU;aACfK;aACA/E;aACAgF;;;aAGA/G,KAAKgH,WAAL,CAAiBjB,GAAjB;;AA1sBJ;AAAA;AAAA,WA8sBE,yBAAiC;aAC/B,KAAKkB,UAAL,CAAgB,CAAC,KAAKC,SAAL,EAAjB;;AA/sBJ;AAAA;AAAA,WAmtBE,oBAAW9F,OAAX,EAA6BmF,IAA7B,EAAyE;UACtEvG,OAAS,KAATA;;UACFwG;AACJC,QAAAA,UAAU;SACPF;;UAECpG,SAASH,KAAKG,MAAL,IAAe;UAC1B4F,MAAM/F,KAAK+C;;UACX,CAACyD,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK+C,UAAb;;;UAEJ,KAAKoE,WAAL,IAAoB;YAClB/F,SAAS;cACP,CAACjB,OAAOiH,gBAAgB;gBACtBC;;;cAEF9F,IAAI,KAAKZ,OAAO;eACf;wBACM,KAAKA;;;;UAGhB6F,QAAQC,UAAU;aACf1E;;;aAEA/B,KAAKsH,UAAL,CAAgBvB,GAAhB;;AA3uBJ;AAAA;AAAA,WA+uBE,yBAAiC;aAC/B,KAAKwB,UAAL,CAAgB,CAAC,KAAK9E,SAAL,EAAjB;;AAhvBJ;AAAA;AAAA,WAqvBE,oBAAWnB,OAAX,EAA6BiF,IAA7B,EAAyE;UACtEvG,OAAS,KAATA;UACFG,SAASH,KAAKG,MAAL,IAAe;;UACxBqG;AACJC,QAAAA,UAAU;SACPF;;UAEDR,MAAM/F,KAAK0C;;UACX,CAAC8D,QAAQC,UAAU;cACf,IAAIC,GAAJ,CAAQ1G,KAAK0C,UAAb;;;UAEJ,KAAK8E,WAAL,MAAsBlG,YAAY,KAAKmB,SAAL,IAAkB;YAClDtC,OAAOqC,eAAe;cACpBlB,SAAS;gBACPC,IAAI,KAAKZ,OAAO;iBACf;0BACM,KAAKA;;eAEb;cACCJ,WAAW,KAAK4D,IAAL;mBAERjB,QAAQ,UAACE,IAAD,EAAU;gBACrB9B,SAAS;kBACPC,IAAI6B,KAAKzC,OAAO;mBACf;4BACMyC,KAAKzC;;;cAKdqE,UAAU,KAAKtB,UAAL;kBACRR,QAAQ,UAACE,IAAD,EAAU;0BACbA,KAAKzC;;;;;UAIlB6F,QAAQC,UAAU;YAChBtG,OAAOqC,eAAe;eACnBD;eACA;cACCkF,eAAezH,KAAK0H,eAAL,CAAqB,CAAC,KAAK/G,KAAN,CAArB;uBACRuC,QAAQ,UAACE,IAAD,EAAU;iBACxBb;;;;;aAIJvC,KAAK2H,UAAL,CAAgB5B,GAAhB;;AAnyBJ;AAAA;AAAA,WAyyBE,kBAAe;WACfrE,QAAQ,KAAKkB,QAAL;WACRxB,UAAU,KAAK8F,SAAL;WACV7F,WAAW,KAAKwE,UAAL;WACXhF,cAAc,KAAK2G,WAAL;WACd7F,UAAU,KAAK0E,SAAL;WACVpF,WAAW,KAAKyE,MAAL;WACX3E,YAAY,KAAK6G,OAAL;WACZ5G,WAAW,KAAK6G,MAAL;WACX/G,WAAW,KAAKqF,MAAL;WACXnG,KAAK+E,QAAQ;;AAnzBf;AAAA;AAAA,WAuzBE,yBAAsB;UACnB/E,OAAS,KAATA;WACHa,cAAc,KAAK2G,WAAL;;UACf,KAAK3G,aAAa;aACfS,UAAU,KAAKmB,SAAL;;YACX,KAAKnB,SAAS;eACXoB,WAAWnB,IAAI,KAAKZ,OAAO;;;aAE7B2B,gBAAgB,KAAK4D,eAAL;aAChBnB,QAAQ;;;AAh0BZ;AAAA;AAAA,WAs0BE,0BAAuB;UACpBxE,WAAa,KAAbA;;UACJ0B,MAAMC,OAAN,CAAc3B,QAAd,GAAyB;iBAClB2C,QAAQ,UAACE,IAAD,EAAU;eACpBrB;eACAQ;eACAwE;;;;AA50BN;AAAA;AAAA,WAm1BE,yBAAsB;UACnB7G,SAAW,KAAXA;;UACJA,QAAQ;eACH6B;eACAQ;eACAoC;;;AAx1BN;AAAA;AAAA,WA61BE,yBAAgB;UACb3E,OAAS,KAATA;UACFyH,eAAezH,KAAK0H,eAAL,CAAqB,CAAC,KAAK/G,KAAN,CAArB;mBACRuC,QAAQ,UAACE,IAAD,EAAU;aACxBrB;aACAQ;;WAEFP;;AAp2BF;AAAA;AAAA,WA02BE,gBAAmB;UAChBzB,WAAa,KAAbA;UACJyC,OAAmB;WAClBC,KAAK;;UACNhB,MAAMC,OAAN,CAAc3B,QAAd,KAA2BA,SAASlC,MAAT,GAAkB,GAAG;iBACzC6E,QAAQ,UAACE,IAAD,EAAU;iBAClBJ,KAAK8E,MAAL,CAAY1E,KAAKe,IAAL,EAAZ;;;;aAGJnB;;AAn3BJ;AAAA;AAAA,WAy3BE,oBAA8B;UAC7BpC,QAAU,KAAVA;;UACF,CAACA,OAAO;gBACFmH,gBAAgB;aACnBnH,QAAQA;;;sBAECA,OAAO;aAChBA;;AAh4BJ;;AAAA;AAAA;;;;"}

package/esm/_chunks/{dep-0a958aee.js → dep-9d2e7b62.js}

@@ -1,13 +1,13 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
 
-import { _ as _typeof } from './dep-45dee455.js';
-import './dep-9052d175.js';
-import { _ as _baseGetTag } from './dep-2f74dba2.js';
-import { i as isObjectLike_1 } from './dep-7e897399.js';
+import { _ as _typeof } from './dep-1189939f.js';
+import './dep-cb80da27.js';
+import { _ as _baseGetTag } from './dep-b6ff8559.js';
+import { i as isObjectLike_1 } from './dep-f3eac264.js';
 
 var baseGetTag = _baseGetTag,
     isObjectLike = isObjectLike_1;
@@ -39,4 +39,4 @@ function isSymbol(value) {
 var isSymbol_1 = isSymbol;
 
 export { isSymbol_1 as i };
-//# sourceMappingURL=dep-0a958aee.js.map
+//# sourceMappingURL=dep-9d2e7b62.js.map

package/{es/_chunks/dep-0a958aee.js.map → esm/_chunks/dep-9d2e7b62.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-0a958aee.js","sources":["../../node_modules/lodash/isSymbol.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n"],"names":["baseGetTag","require$$0","isObjectLike","require$$1","symbolTag","isSymbol","value","isSymbol_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,WAAjB;AAAA,IACIC,YAAY,GAAGC,cADnB;AAGA;;AACA,IAAIC,SAAS,GAAG,iBAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,KAAlB,EAAyB;AACvB,SAAO,QAAOA,KAAP,KAAgB,QAAhB,IACJJ,YAAY,CAACI,KAAD,CAAZ,IAAuBN,UAAU,CAACM,KAAD,CAAV,IAAqBF,SAD/C;AAED;;IAEDG,UAAc,GAAGF;;;;"}
+{"version":3,"file":"dep-9d2e7b62.js","sources":["../../node_modules/lodash/isSymbol.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n"],"names":["baseGetTag","require$$0","isObjectLike","require$$1","symbolTag","isSymbol","value","isSymbol_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,WAAjB;AAAA,IACIC,YAAY,GAAGC,cADnB;AAGA;;AACA,IAAIC,SAAS,GAAG,iBAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,KAAlB,EAAyB;AACvB,SAAO,QAAOA,KAAP,KAAgB,QAAhB,IACJJ,YAAY,CAACI,KAAD,CAAZ,IAAuBN,UAAU,CAACM,KAAD,CAAV,IAAqBF,SAD/C;AAED;;IAEDG,UAAc,GAAGF;;;;"}