tdesign-react 0.24.2 → 0.25.2

package/lib/_common/js/tree/tree-node-model.js

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.24.2
+ * tdesign v0.25.2
  * (c) 2022 tdesign
  * @license MIT
  */
@@ -8,162 +8,33 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-var defineProperty = require('../../../_chunks/dep-d569a74d.js');
-var _baseGet = require('../../../_chunks/dep-c699e15c.js');
-var _setToString = require('../../../_chunks/dep-8f62190e.js');
-var _isIndex = require('../../../_chunks/dep-6dc159e8.js');
-var isFunction = require('../../../_chunks/dep-7316483e.js');
-var hasIn$1 = require('../../../_chunks/dep-c98256d7.js');
-var _flatRest = require('../../../_chunks/dep-53731324.js');
+var defineProperty = require('../../../_chunks/dep-54e5d466.js');
+var pick = require('../../../_chunks/dep-ac45a626.js');
 var _common_js_log_log = require('../log/log.js');
-require('../../../_chunks/dep-58b55d35.js');
-require('../../../_chunks/dep-92449e5d.js');
-require('../../../_chunks/dep-48784cef.js');
-require('../../../_chunks/dep-824a3ee6.js');
-require('../../../_chunks/dep-4fb5c464.js');
-require('../../../_chunks/dep-46734f40.js');
-require('../../../_chunks/dep-e0f1e391.js');
-require('../../../_chunks/dep-3d45cbc8.js');
-require('../../../_chunks/dep-39285892.js');
-require('../../../_chunks/dep-eeca3a4d.js');
-require('../../../_chunks/dep-1184898a.js');
-
-var assignValue = _setToString._assignValue,
-    castPath$1 = _baseGet._castPath,
-    isIndex = _isIndex._isIndex,
-    isObject = isFunction.isObject_1,
-    toKey = _baseGet._toKey;
-/**
- * The base implementation of `_.set`.
- *
- * @private
- * @param {Object} object The object to modify.
- * @param {Array|string} path The path of the property to set.
- * @param {*} value The value to set.
- * @param {Function} [customizer] The function to customize path creation.
- * @returns {Object} Returns `object`.
- */
-
-function baseSet$1(object, path, value, customizer) {
-  if (!isObject(object)) {
-    return object;
-  }
-
-  path = castPath$1(path, object);
-  var index = -1,
-      length = path.length,
-      lastIndex = length - 1,
-      nested = object;
-
-  while (nested != null && ++index < length) {
-    var key = toKey(path[index]),
-        newValue = value;
-
-    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
-      return object;
-    }
-
-    if (index != lastIndex) {
-      var objValue = nested[key];
-      newValue = customizer ? customizer(objValue, key, nested) : undefined;
-
-      if (newValue === undefined) {
-        newValue = isObject(objValue) ? objValue : isIndex(path[index + 1]) ? [] : {};
-      }
-    }
-
-    assignValue(nested, key, newValue);
-    nested = nested[key];
-  }
-
-  return object;
-}
-
-var _baseSet = baseSet$1;
-
-var baseGet = _baseGet._baseGet,
-    baseSet = _baseSet,
-    castPath = _baseGet._castPath;
-/**
- * The base implementation of  `_.pickBy` without support for iteratee shorthands.
- *
- * @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @param {Function} predicate The function invoked per property.
- * @returns {Object} Returns the new object.
- */
-
-function basePickBy$1(object, paths, predicate) {
-  var index = -1,
-      length = paths.length,
-      result = {};
-
-  while (++index < length) {
-    var path = paths[index],
-        value = baseGet(object, path);
-
-    if (predicate(value, path)) {
-      baseSet(result, castPath(path, object), value);
-    }
-  }
-
-  return result;
-}
-
-var _basePickBy = basePickBy$1;
-
-var basePickBy = _basePickBy,
-    hasIn = hasIn$1.hasIn_1;
-/**
- * The base implementation of `_.pick` without support for individual
- * property identifiers.
- *
- * @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @returns {Object} Returns the new object.
- */
-
-function basePick$1(object, paths) {
-  return basePickBy(object, paths, function (value, path) {
-    return hasIn(object, path);
-  });
-}
-
-var _basePick = basePick$1;
-
-var basePick = _basePick,
-    flatRest = _flatRest._flatRest;
-/**
- * Creates an object composed of the picked `object` properties.
- *
- * @static
- * @since 0.1.0
- * @memberOf _
- * @category Object
- * @param {Object} object The source object.
- * @param {...(string|string[])} [paths] The property paths to pick.
- * @returns {Object} Returns the new object.
- * @example
- *
- * var object = { 'a': 1, 'b': '2', 'c': 3 };
- *
- * _.pick(object, ['a', 'c']);
- * // => { 'a': 1, 'c': 3 }
- */
-
-var pick = flatRest(function (object, paths) {
-  return object == null ? {} : basePick(object, paths);
-});
-var pick_1 = pick;
+require('../../../_chunks/dep-3b2b764c.js');
+require('../../../_chunks/dep-0706ae8b.js');
+require('../../../_chunks/dep-22e00850.js');
+require('../../../_chunks/dep-08fec65f.js');
+require('../../../_chunks/dep-7bbe83c7.js');
+require('../../../_chunks/dep-a19cf0b0.js');
+require('../../../_chunks/dep-43d2b778.js');
+require('../../../_chunks/dep-a4e63197.js');
+require('../../../_chunks/dep-5d12d655.js');
+require('../../../_chunks/dep-140a2995.js');
+require('../../../_chunks/dep-207637ec.js');
+require('../../../_chunks/dep-a02ab8da.js');
+require('../../../_chunks/dep-ec6a3b8b.js');
+require('../../../_chunks/dep-186436f8.js');
+require('../../../_chunks/dep-56f3eb6f.js');
+require('../../../_chunks/dep-866e7a44.js');
+require('../../../_chunks/dep-6c84bdfe.js');
 
 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._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; }
 
 function getExposedProps(node) {
-  var props = pick_1(node, ["value", "label", "data", "actived", "expanded", "checked", "indeterminate", "loading"]);
+  var props = pick.pick_1(node, ["value", "label", "data", "actived", "expanded", "checked", "indeterminate", "loading"]);
   return props;
 }
 

package/lib/_common/js/tree/tree-node-model.js.map

@@ -1 +1 @@
-{"version":3,"file":"tree-node-model.js","sources":["../../../../node_modules/lodash/_baseSet.js","../../../../node_modules/lodash/_basePickBy.js","../../../../node_modules/lodash/_basePick.js","../../../../node_modules/lodash/pick.js","../../../../src/_common/js/tree/tree-node-model.ts"],"sourcesContent":["var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n","var baseGet = require('./_baseGet'),\n    baseSet = require('./_baseSet'),\n    castPath = require('./_castPath');\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = basePickBy;\n","var basePickBy = require('./_basePickBy'),\n    hasIn = require('./hasIn');\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nmodule.exports = basePick;\n","var basePick = require('./_basePick'),\n    flatRest = require('./_flatRest');\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","import pick from 'lodash/pick';\nimport { TreeNode } from './tree-node';\nimport { OptionData } from '../common';\nimport {\n  TreeNodeValue,\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n  TypeTreeItem,\n  TreeNodeModelProps,\n} from './types';\nimport log from '../log/log';\n\n// 获取节点需要暴露的属性\nfunction getExposedProps(node: TreeNode): TreeNodeModelProps {\n  const props = pick(node, [\n    'value',\n    'label',\n    'data',\n    'actived',\n    'expanded',\n    'checked',\n    'indeterminate',\n    'loading',\n  ]) as TreeNodeModelProps;\n  return props;\n}\n\n// 封装对外暴露的对象\nexport function createNodeModel(node: TreeNode): TypeTreeNodeModel {\n  const props = getExposedProps(node);\n\n  const model: TypeTreeNodeModel = {\n    ...props,\n\n    // 获取节点所处层级\n    getLevel() {\n      return node.getLevel();\n    },\n\n    // 获取节点在 children 中的位置\n    getIndex() {\n      return node.getIndex();\n    },\n\n    // 判断节点是否为 children 中的第一个节点\n    isFirst() {\n      return node.isFirst();\n    },\n\n    // 判断节点是否为 children 中的最后一个节点\n    isLast() {\n      return node.isLast();\n    },\n\n    // 判断节点是否为叶节点\n    isLeaf() {\n      return node.isLeaf();\n    },\n\n    // 插入数据到节点之前\n    insertBefore(newData: TypeTreeItem) {\n      return node.insertBefore(newData);\n    },\n\n    // 插入数据到节点之后\n    insertAfter(newData: TypeTreeItem) {\n      return node.insertAfter(newData);\n    },\n\n    // 给当前节点添加子节点数据\n    appendData(data: TypeTreeNodeData | TypeTreeNodeData[]) {\n      return node.append(data);\n    },\n\n    // 返回路径节点数据集合\n    getPath(): TypeTreeNodeModel[] {\n      const nodes = node.getPath();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取单个父节点数据\n    getParent(): TypeTreeNodeModel {\n      return node.parent?.getModel();\n    },\n\n    // 获取所有父节点数据\n    getParents(): TypeTreeNodeModel[] {\n      const nodes = node.getParents();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取根节点\n    getRoot(): TypeTreeNodeModel {\n      const root = node.getRoot();\n      return root?.getModel();\n    },\n\n    // 获取兄弟节点，包含自己在内\n    getSiblings(): TypeTreeNodeModel[] {\n      const nodes = node.getSiblings();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 返回当前节点的第一层子节点数据集合\n    getChildren(deep?: boolean): boolean | TypeTreeNodeModel[] {\n      let childrenModel: boolean | TypeTreeNodeModel[] = false;\n      const { children } = node;\n      if (Array.isArray(children)) {\n        if (children.length > 0) {\n          if (deep) {\n            const nodes = node.walk();\n            nodes.shift();\n            childrenModel = nodes.map((item) => item.getModel());\n          } else {\n            childrenModel = children.map((item) => item.getModel());\n          }\n        } else {\n          childrenModel = false;\n        }\n      } else if (typeof children === 'boolean') {\n        childrenModel = children;\n      }\n      return childrenModel;\n    },\n\n    // 删除本节点，或者 value 指定的子节点\n    remove(value?: TreeNodeValue) {\n      if (!value) {\n        node.remove();\n        return;\n      }\n\n      const { tree } = node;\n      const targetNode = tree.getNode(value);\n      if (!targetNode) {\n        log.warnOnce('Tree', `\\`${value}\\` is not exist`);\n        return;\n      }\n\n      const parents = targetNode.getParents();\n      const parentValues = parents.map((pnode) => (pnode.value));\n      if (parentValues.indexOf(node.value) < 0) {\n        log.warnOnce('Tree', `\\`${value}\\` is not a childNode of current node`);\n        return;\n      }\n      targetNode.remove();\n    },\n\n    // 设置本节点携带的元数据\n    setData(data: OptionData) {\n      Object.assign(node.data, data);\n    },\n  };\n\n  return model;\n}\n\n// 更新封装对象\nexport function updateNodeModel(model: TypeTreeNodeModel, node: TreeNode) {\n  // 同步节点属性\n  const props = getExposedProps(node);\n  Object.assign(model, props);\n}\n"],"names":["assignValue","require$$0","castPath","require$$1","isIndex","require$$2","isObject","require$$3","toKey","require$$4","baseSet","object","path","value","customizer","index","length","lastIndex","nested","key","newValue","objValue","undefined","_baseSet","baseGet","basePickBy","paths","predicate","result","_basePickBy","hasIn","basePick","_basePick","flatRest","pick","pick_1","getExposedProps","node","props","createNodeModel","model","getLevel","getIndex","isFirst","isLast","isLeaf","insertBefore","newData","insertAfter","appendData","data","append","getPath","nodes","map","item","getModel","getParent","parent","getParents","getRoot","root","getSiblings","getChildren","deep","childrenModel","children","Array","isArray","walk","shift","remove","tree","targetNode","getNode","log","warnOnce","parents","parentValues","pnode","indexOf","setData","Object","assign","updateNodeModel"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,IAAIA,WAAW,GAAGC,yBAAlB;AAAA,IACIC,UAAQ,GAAGC,kBADf;AAAA,IAEIC,OAAO,GAAGC,iBAFd;AAAA,IAGIC,QAAQ,GAAGC,qBAHf;AAAA,IAIIC,KAAK,GAAGC,eAJZ;AAMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiBC,MAAjB,EAAyBC,IAAzB,EAA+BC,KAA/B,EAAsCC,UAAtC,EAAkD;AAChD,MAAI,CAACR,QAAQ,CAACK,MAAD,CAAb,EAAuB;AACrB,WAAOA,MAAP;AACD;;AACDC,EAAAA,IAAI,GAAGV,UAAQ,CAACU,IAAD,EAAOD,MAAP,CAAf;AAEA,MAAII,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGJ,IAAI,CAACI,MADlB;AAAA,MAEIC,SAAS,GAAGD,MAAM,GAAG,CAFzB;AAAA,MAGIE,MAAM,GAAGP,MAHb;;AAKA,SAAOO,MAAM,IAAI,IAAV,IAAkB,EAAEH,KAAF,GAAUC,MAAnC,EAA2C;AACzC,QAAIG,GAAG,GAAGX,KAAK,CAACI,IAAI,CAACG,KAAD,CAAL,CAAf;AAAA,QACIK,QAAQ,GAAGP,KADf;;AAGA,QAAIM,GAAG,KAAK,WAAR,IAAuBA,GAAG,KAAK,aAA/B,IAAgDA,GAAG,KAAK,WAA5D,EAAyE;AACvE,aAAOR,MAAP;AACD;;AAED,QAAII,KAAK,IAAIE,SAAb,EAAwB;AACtB,UAAII,QAAQ,GAAGH,MAAM,CAACC,GAAD,CAArB;AACAC,MAAAA,QAAQ,GAAGN,UAAU,GAAGA,UAAU,CAACO,QAAD,EAAWF,GAAX,EAAgBD,MAAhB,CAAb,GAAuCI,SAA5D;;AACA,UAAIF,QAAQ,KAAKE,SAAjB,EAA4B;AAC1BF,QAAAA,QAAQ,GAAGd,QAAQ,CAACe,QAAD,CAAR,GACPA,QADO,GAENjB,OAAO,CAACQ,IAAI,CAACG,KAAK,GAAG,CAAT,CAAL,CAAP,GAA2B,EAA3B,GAAgC,EAFrC;AAGD;AACF;;AACDf,IAAAA,WAAW,CAACkB,MAAD,EAASC,GAAT,EAAcC,QAAd,CAAX;AACAF,IAAAA,MAAM,GAAGA,MAAM,CAACC,GAAD,CAAf;AACD;;AACD,SAAOR,MAAP;AACD;;IAEDY,QAAc,GAAGb;;AClDjB,IAAIc,OAAO,GAAGvB,iBAAd;AAAA,IACIS,OAAO,GAAGP,QADd;AAAA,IAEID,QAAQ,GAAGG,kBAFf;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASoB,YAAT,CAAoBd,MAApB,EAA4Be,KAA5B,EAAmCC,SAAnC,EAA8C;AAC5C,MAAIZ,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGU,KAAK,CAACV,MADnB;AAAA,MAEIY,MAAM,GAAG,EAFb;;AAIA,SAAO,EAAEb,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIJ,IAAI,GAAGc,KAAK,CAACX,KAAD,CAAhB;AAAA,QACIF,KAAK,GAAGW,OAAO,CAACb,MAAD,EAASC,IAAT,CADnB;;AAGA,QAAIe,SAAS,CAACd,KAAD,EAAQD,IAAR,CAAb,EAA4B;AAC1BF,MAAAA,OAAO,CAACkB,MAAD,EAAS1B,QAAQ,CAACU,IAAD,EAAOD,MAAP,CAAjB,EAAiCE,KAAjC,CAAP;AACD;AACF;;AACD,SAAOe,MAAP;AACD;;IAEDC,WAAc,GAAGJ;;AC7BjB,IAAIA,UAAU,GAAGxB,WAAjB;AAAA,IACI6B,KAAK,GAAG3B,eADZ;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAAS4B,UAAT,CAAkBpB,MAAlB,EAA0Be,KAA1B,EAAiC;AAC/B,SAAOD,UAAU,CAACd,MAAD,EAASe,KAAT,EAAgB,UAASb,KAAT,EAAgBD,IAAhB,EAAsB;AACrD,WAAOkB,KAAK,CAACnB,MAAD,EAASC,IAAT,CAAZ;AACD,GAFgB,CAAjB;AAGD;;IAEDoB,SAAc,GAAGD;;AClBjB,IAAIA,QAAQ,GAAG9B,SAAf;AAAA,IACIgC,QAAQ,GAAG9B,mBADf;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAI+B,IAAI,GAAGD,QAAQ,CAAC,UAAStB,MAAT,EAAiBe,KAAjB,EAAwB;AAC1C,SAAOf,MAAM,IAAI,IAAV,GAAiB,EAAjB,GAAsBoB,QAAQ,CAACpB,MAAD,EAASe,KAAT,CAArC;AACD,CAFkB,CAAnB;IAIAS,MAAc,GAAGD;;;;;;ACtBjB,SAASE,eAAT,CAAyBC,IAAzB,EAA+B;AAC7B,MAAMC,KAAK,GAAGJ,MAAI,CAACG,IAAD,EAAO,CACvB,OADuB,EAEvB,OAFuB,EAGvB,MAHuB,EAIvB,SAJuB,EAKvB,UALuB,EAMvB,SANuB,EAOvB,eAPuB,EAQvB,SARuB,CAAP,CAAlB;AAUA,SAAOC,KAAP;AACD;;AACM,SAASC,eAAT,CAAyBF,IAAzB,EAA+B;AACpC,MAAMC,KAAK,GAAGF,eAAe,CAACC,IAAD,CAA7B;;AACA,MAAMG,KAAK,mCACNF,KADM;AAETG,IAAAA,QAFS,sBAEE;AACT,aAAOJ,IAAI,CAACI,QAAL,EAAP;AACD,KAJQ;AAKTC,IAAAA,QALS,sBAKE;AACT,aAAOL,IAAI,CAACK,QAAL,EAAP;AACD,KAPQ;AAQTC,IAAAA,OARS,qBAQC;AACR,aAAON,IAAI,CAACM,OAAL,EAAP;AACD,KAVQ;AAWTC,IAAAA,MAXS,oBAWA;AACP,aAAOP,IAAI,CAACO,MAAL,EAAP;AACD,KAbQ;AAcTC,IAAAA,MAdS,oBAcA;AACP,aAAOR,IAAI,CAACQ,MAAL,EAAP;AACD,KAhBQ;AAiBTC,IAAAA,YAjBS,wBAiBIC,OAjBJ,EAiBa;AACpB,aAAOV,IAAI,CAACS,YAAL,CAAkBC,OAAlB,CAAP;AACD,KAnBQ;AAoBTC,IAAAA,WApBS,uBAoBGD,OApBH,EAoBY;AACnB,aAAOV,IAAI,CAACW,WAAL,CAAiBD,OAAjB,CAAP;AACD,KAtBQ;AAuBTE,IAAAA,UAvBS,sBAuBEC,IAvBF,EAuBQ;AACf,aAAOb,IAAI,CAACc,MAAL,CAAYD,IAAZ,CAAP;AACD,KAzBQ;AA0BTE,IAAAA,OA1BS,qBA0BC;AACR,UAAMC,KAAK,GAAGhB,IAAI,CAACe,OAAL,EAAd;AACA,aAAOC,KAAK,CAACC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,OAAV,CAAP;AACD,KA7BQ;AA8BTC,IAAAA,SA9BS,uBA8BG;AAAA;;AACV,6BAAOpB,IAAI,CAACqB,MAAZ,iDAAO,aAAaF,QAAb,EAAP;AACD,KAhCQ;AAiCTG,IAAAA,UAjCS,wBAiCI;AACX,UAAMN,KAAK,GAAGhB,IAAI,CAACsB,UAAL,EAAd;AACA,aAAON,KAAK,CAACC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,OAAV,CAAP;AACD,KApCQ;AAqCTI,IAAAA,OArCS,qBAqCC;AACR,UAAMC,IAAI,GAAGxB,IAAI,CAACuB,OAAL,EAAb;AACA,aAAOC,IAAP,aAAOA,IAAP,uBAAOA,IAAI,CAAEL,QAAN,EAAP;AACD,KAxCQ;AAyCTM,IAAAA,WAzCS,yBAyCK;AACZ,UAAMT,KAAK,GAAGhB,IAAI,CAACyB,WAAL,EAAd;AACA,aAAOT,KAAK,CAACC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,OAAV,CAAP;AACD,KA5CQ;AA6CTO,IAAAA,WA7CS,uBA6CGC,IA7CH,EA6CS;AAChB,UAAIC,aAAa,GAAG,KAApB;AACA,UAAQC,QAAR,GAAqB7B,IAArB,CAAQ6B,QAAR;;AACA,UAAIC,KAAK,CAACC,OAAN,CAAcF,QAAd,CAAJ,EAA6B;AAC3B,YAAIA,QAAQ,CAAClD,MAAT,GAAkB,CAAtB,EAAyB;AACvB,cAAIgD,IAAJ,EAAU;AACR,gBAAMX,KAAK,GAAGhB,IAAI,CAACgC,IAAL,EAAd;AACAhB,YAAAA,KAAK,CAACiB,KAAN;AACAL,YAAAA,aAAa,GAAGZ,KAAK,CAACC,GAAN,CAAU,UAACC,IAAD;AAAA,qBAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,aAAV,CAAhB;AACD,WAJD,MAIO;AACLS,YAAAA,aAAa,GAAGC,QAAQ,CAACZ,GAAT,CAAa,UAACC,IAAD;AAAA,qBAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,aAAb,CAAhB;AACD;AACF,SARD,MAQO;AACLS,UAAAA,aAAa,GAAG,KAAhB;AACD;AACF,OAZD,MAYO,IAAI,OAAOC,QAAP,KAAoB,SAAxB,EAAmC;AACxCD,QAAAA,aAAa,GAAGC,QAAhB;AACD;;AACD,aAAOD,aAAP;AACD,KAhEQ;AAiETM,IAAAA,MAjES,kBAiEF1D,KAjEE,EAiEK;AACZ,UAAI,CAACA,KAAL,EAAY;AACVwB,QAAAA,IAAI,CAACkC,MAAL;AACA;AACD;;AACD,UAAQC,IAAR,GAAiBnC,IAAjB,CAAQmC,IAAR;AACA,UAAMC,UAAU,GAAGD,IAAI,CAACE,OAAL,CAAa7D,KAAb,CAAnB;;AACA,UAAI,CAAC4D,UAAL,EAAiB;AACfE,QAAAA,6BAAG,CAACC,QAAJ,CAAa,MAAb,aAA0B/D,KAA1B;AACA;AACD;;AACD,UAAMgE,OAAO,GAAGJ,UAAU,CAACd,UAAX,EAAhB;AACA,UAAMmB,YAAY,GAAGD,OAAO,CAACvB,GAAR,CAAY,UAACyB,KAAD;AAAA,eAAWA,KAAK,CAAClE,KAAjB;AAAA,OAAZ,CAArB;;AACA,UAAIiE,YAAY,CAACE,OAAb,CAAqB3C,IAAI,CAACxB,KAA1B,IAAmC,CAAvC,EAA0C;AACxC8D,QAAAA,6BAAG,CAACC,QAAJ,CAAa,MAAb,aAA0B/D,KAA1B;AACA;AACD;;AACD4D,MAAAA,UAAU,CAACF,MAAX;AACD,KAnFQ;AAoFTU,IAAAA,OApFS,mBAoFD/B,IApFC,EAoFK;AACZgC,MAAAA,MAAM,CAACC,MAAP,CAAc9C,IAAI,CAACa,IAAnB,EAAyBA,IAAzB;AACD;AAtFQ,IAAX;;AAwFA,SAAOV,KAAP;AACD;AACM,SAAS4C,eAAT,CAAyB5C,KAAzB,EAAgCH,IAAhC,EAAsC;AAC3C,MAAMC,KAAK,GAAGF,eAAe,CAACC,IAAD,CAA7B;AACA6C,EAAAA,MAAM,CAACC,MAAP,CAAc3C,KAAd,EAAqBF,KAArB;AACD;;;;;"}
+{"version":3,"file":"tree-node-model.js","sources":["../../../../src/_common/js/tree/tree-node-model.ts"],"sourcesContent":["import pick from 'lodash/pick';\nimport { TreeNode } from './tree-node';\nimport { OptionData } from '../common';\nimport {\n  TreeNodeValue,\n  TypeTreeNodeModel,\n  TypeTreeNodeData,\n  TypeTreeItem,\n  TreeNodeModelProps,\n} from './types';\nimport log from '../log/log';\n\n// 获取节点需要暴露的属性\nfunction getExposedProps(node: TreeNode): TreeNodeModelProps {\n  const props = pick(node, [\n    'value',\n    'label',\n    'data',\n    'actived',\n    'expanded',\n    'checked',\n    'indeterminate',\n    'loading',\n  ]) as TreeNodeModelProps;\n  return props;\n}\n\n// 封装对外暴露的对象\nexport function createNodeModel(node: TreeNode): TypeTreeNodeModel {\n  const props = getExposedProps(node);\n\n  const model: TypeTreeNodeModel = {\n    ...props,\n\n    // 获取节点所处层级\n    getLevel() {\n      return node.getLevel();\n    },\n\n    // 获取节点在 children 中的位置\n    getIndex() {\n      return node.getIndex();\n    },\n\n    // 判断节点是否为 children 中的第一个节点\n    isFirst() {\n      return node.isFirst();\n    },\n\n    // 判断节点是否为 children 中的最后一个节点\n    isLast() {\n      return node.isLast();\n    },\n\n    // 判断节点是否为叶节点\n    isLeaf() {\n      return node.isLeaf();\n    },\n\n    // 插入数据到节点之前\n    insertBefore(newData: TypeTreeItem) {\n      return node.insertBefore(newData);\n    },\n\n    // 插入数据到节点之后\n    insertAfter(newData: TypeTreeItem) {\n      return node.insertAfter(newData);\n    },\n\n    // 给当前节点添加子节点数据\n    appendData(data: TypeTreeNodeData | TypeTreeNodeData[]) {\n      return node.append(data);\n    },\n\n    // 返回路径节点数据集合\n    getPath(): TypeTreeNodeModel[] {\n      const nodes = node.getPath();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取单个父节点数据\n    getParent(): TypeTreeNodeModel {\n      return node.parent?.getModel();\n    },\n\n    // 获取所有父节点数据\n    getParents(): TypeTreeNodeModel[] {\n      const nodes = node.getParents();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 获取根节点\n    getRoot(): TypeTreeNodeModel {\n      const root = node.getRoot();\n      return root?.getModel();\n    },\n\n    // 获取兄弟节点，包含自己在内\n    getSiblings(): TypeTreeNodeModel[] {\n      const nodes = node.getSiblings();\n      return nodes.map((item: TreeNode) => item.getModel());\n    },\n\n    // 返回当前节点的第一层子节点数据集合\n    getChildren(deep?: boolean): boolean | TypeTreeNodeModel[] {\n      let childrenModel: boolean | TypeTreeNodeModel[] = false;\n      const { children } = node;\n      if (Array.isArray(children)) {\n        if (children.length > 0) {\n          if (deep) {\n            const nodes = node.walk();\n            nodes.shift();\n            childrenModel = nodes.map((item) => item.getModel());\n          } else {\n            childrenModel = children.map((item) => item.getModel());\n          }\n        } else {\n          childrenModel = false;\n        }\n      } else if (typeof children === 'boolean') {\n        childrenModel = children;\n      }\n      return childrenModel;\n    },\n\n    // 删除本节点，或者 value 指定的子节点\n    remove(value?: TreeNodeValue) {\n      if (!value) {\n        node.remove();\n        return;\n      }\n\n      const { tree } = node;\n      const targetNode = tree.getNode(value);\n      if (!targetNode) {\n        log.warnOnce('Tree', `\\`${value}\\` is not exist`);\n        return;\n      }\n\n      const parents = targetNode.getParents();\n      const parentValues = parents.map((pnode) => (pnode.value));\n      if (parentValues.indexOf(node.value) < 0) {\n        log.warnOnce('Tree', `\\`${value}\\` is not a childNode of current node`);\n        return;\n      }\n      targetNode.remove();\n    },\n\n    // 设置本节点携带的元数据\n    setData(data: OptionData) {\n      Object.assign(node.data, data);\n    },\n  };\n\n  return model;\n}\n\n// 更新封装对象\nexport function updateNodeModel(model: TypeTreeNodeModel, node: TreeNode) {\n  // 同步节点属性\n  const props = getExposedProps(node);\n  Object.assign(model, props);\n}\n"],"names":["getExposedProps","node","props","pick","createNodeModel","model","getLevel","getIndex","isFirst","isLast","isLeaf","insertBefore","newData","insertAfter","appendData","data","append","getPath","nodes","map","item","getModel","getParent","parent","getParents","getRoot","root","getSiblings","getChildren","deep","childrenModel","children","Array","isArray","length","walk","shift","remove","value","tree","targetNode","getNode","log","warnOnce","parents","parentValues","pnode","indexOf","setData","Object","assign","updateNodeModel"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,SAASA,eAAT,CAAyBC,IAAzB,EAA+B;AAC7B,MAAMC,KAAK,GAAGC,WAAI,CAACF,IAAD,EAAO,CACvB,OADuB,EAEvB,OAFuB,EAGvB,MAHuB,EAIvB,SAJuB,EAKvB,UALuB,EAMvB,SANuB,EAOvB,eAPuB,EAQvB,SARuB,CAAP,CAAlB;AAUA,SAAOC,KAAP;AACD;;AACM,SAASE,eAAT,CAAyBH,IAAzB,EAA+B;AACpC,MAAMC,KAAK,GAAGF,eAAe,CAACC,IAAD,CAA7B;;AACA,MAAMI,KAAK,mCACNH,KADM;AAETI,IAAAA,QAFS,sBAEE;AACT,aAAOL,IAAI,CAACK,QAAL,EAAP;AACD,KAJQ;AAKTC,IAAAA,QALS,sBAKE;AACT,aAAON,IAAI,CAACM,QAAL,EAAP;AACD,KAPQ;AAQTC,IAAAA,OARS,qBAQC;AACR,aAAOP,IAAI,CAACO,OAAL,EAAP;AACD,KAVQ;AAWTC,IAAAA,MAXS,oBAWA;AACP,aAAOR,IAAI,CAACQ,MAAL,EAAP;AACD,KAbQ;AAcTC,IAAAA,MAdS,oBAcA;AACP,aAAOT,IAAI,CAACS,MAAL,EAAP;AACD,KAhBQ;AAiBTC,IAAAA,YAjBS,wBAiBIC,OAjBJ,EAiBa;AACpB,aAAOX,IAAI,CAACU,YAAL,CAAkBC,OAAlB,CAAP;AACD,KAnBQ;AAoBTC,IAAAA,WApBS,uBAoBGD,OApBH,EAoBY;AACnB,aAAOX,IAAI,CAACY,WAAL,CAAiBD,OAAjB,CAAP;AACD,KAtBQ;AAuBTE,IAAAA,UAvBS,sBAuBEC,IAvBF,EAuBQ;AACf,aAAOd,IAAI,CAACe,MAAL,CAAYD,IAAZ,CAAP;AACD,KAzBQ;AA0BTE,IAAAA,OA1BS,qBA0BC;AACR,UAAMC,KAAK,GAAGjB,IAAI,CAACgB,OAAL,EAAd;AACA,aAAOC,KAAK,CAACC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,OAAV,CAAP;AACD,KA7BQ;AA8BTC,IAAAA,SA9BS,uBA8BG;AAAA;;AACV,6BAAOrB,IAAI,CAACsB,MAAZ,iDAAO,aAAaF,QAAb,EAAP;AACD,KAhCQ;AAiCTG,IAAAA,UAjCS,wBAiCI;AACX,UAAMN,KAAK,GAAGjB,IAAI,CAACuB,UAAL,EAAd;AACA,aAAON,KAAK,CAACC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,OAAV,CAAP;AACD,KApCQ;AAqCTI,IAAAA,OArCS,qBAqCC;AACR,UAAMC,IAAI,GAAGzB,IAAI,CAACwB,OAAL,EAAb;AACA,aAAOC,IAAP,aAAOA,IAAP,uBAAOA,IAAI,CAAEL,QAAN,EAAP;AACD,KAxCQ;AAyCTM,IAAAA,WAzCS,yBAyCK;AACZ,UAAMT,KAAK,GAAGjB,IAAI,CAAC0B,WAAL,EAAd;AACA,aAAOT,KAAK,CAACC,GAAN,CAAU,UAACC,IAAD;AAAA,eAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,OAAV,CAAP;AACD,KA5CQ;AA6CTO,IAAAA,WA7CS,uBA6CGC,IA7CH,EA6CS;AAChB,UAAIC,aAAa,GAAG,KAApB;AACA,UAAQC,QAAR,GAAqB9B,IAArB,CAAQ8B,QAAR;;AACA,UAAIC,KAAK,CAACC,OAAN,CAAcF,QAAd,CAAJ,EAA6B;AAC3B,YAAIA,QAAQ,CAACG,MAAT,GAAkB,CAAtB,EAAyB;AACvB,cAAIL,IAAJ,EAAU;AACR,gBAAMX,KAAK,GAAGjB,IAAI,CAACkC,IAAL,EAAd;AACAjB,YAAAA,KAAK,CAACkB,KAAN;AACAN,YAAAA,aAAa,GAAGZ,KAAK,CAACC,GAAN,CAAU,UAACC,IAAD;AAAA,qBAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,aAAV,CAAhB;AACD,WAJD,MAIO;AACLS,YAAAA,aAAa,GAAGC,QAAQ,CAACZ,GAAT,CAAa,UAACC,IAAD;AAAA,qBAAUA,IAAI,CAACC,QAAL,EAAV;AAAA,aAAb,CAAhB;AACD;AACF,SARD,MAQO;AACLS,UAAAA,aAAa,GAAG,KAAhB;AACD;AACF,OAZD,MAYO,IAAI,OAAOC,QAAP,KAAoB,SAAxB,EAAmC;AACxCD,QAAAA,aAAa,GAAGC,QAAhB;AACD;;AACD,aAAOD,aAAP;AACD,KAhEQ;AAiETO,IAAAA,MAjES,kBAiEFC,KAjEE,EAiEK;AACZ,UAAI,CAACA,KAAL,EAAY;AACVrC,QAAAA,IAAI,CAACoC,MAAL;AACA;AACD;;AACD,UAAQE,IAAR,GAAiBtC,IAAjB,CAAQsC,IAAR;AACA,UAAMC,UAAU,GAAGD,IAAI,CAACE,OAAL,CAAaH,KAAb,CAAnB;;AACA,UAAI,CAACE,UAAL,EAAiB;AACfE,QAAAA,6BAAG,CAACC,QAAJ,CAAa,MAAb,aAA0BL,KAA1B;AACA;AACD;;AACD,UAAMM,OAAO,GAAGJ,UAAU,CAAChB,UAAX,EAAhB;AACA,UAAMqB,YAAY,GAAGD,OAAO,CAACzB,GAAR,CAAY,UAAC2B,KAAD;AAAA,eAAWA,KAAK,CAACR,KAAjB;AAAA,OAAZ,CAArB;;AACA,UAAIO,YAAY,CAACE,OAAb,CAAqB9C,IAAI,CAACqC,KAA1B,IAAmC,CAAvC,EAA0C;AACxCI,QAAAA,6BAAG,CAACC,QAAJ,CAAa,MAAb,aAA0BL,KAA1B;AACA;AACD;;AACDE,MAAAA,UAAU,CAACH,MAAX;AACD,KAnFQ;AAoFTW,IAAAA,OApFS,mBAoFDjC,IApFC,EAoFK;AACZkC,MAAAA,MAAM,CAACC,MAAP,CAAcjD,IAAI,CAACc,IAAnB,EAAyBA,IAAzB;AACD;AAtFQ,IAAX;;AAwFA,SAAOV,KAAP;AACD;AACM,SAAS8C,eAAT,CAAyB9C,KAAzB,EAAgCJ,IAAhC,EAAsC;AAC3C,MAAMC,KAAK,GAAGF,eAAe,CAACC,IAAD,CAA7B;AACAgD,EAAAA,MAAM,CAACC,MAAP,CAAc7C,KAAd,EAAqBH,KAArB;AACD;;;;;"}

package/lib/_common/js/tree/tree-node.js

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.24.2
+ * tdesign v0.25.2
  * (c) 2022 tdesign
  * @license MIT
  */
@@ -8,30 +8,31 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-require('../../../_chunks/dep-f41855e1.js');
-require('../../../_chunks/dep-8595bcca.js');
-require('../../../_chunks/dep-d569a74d.js');
-var _common_js_tree_treeNode = require('../../../_chunks/dep-64dde8f1.js');
-require('../../../_chunks/dep-4fafcd23.js');
+require('../../../_chunks/dep-c8336573.js');
+require('../../../_chunks/dep-551cd0f7.js');
+require('../../../_chunks/dep-54e5d466.js');
+var _common_js_tree_treeNode = require('../../../_chunks/dep-cb10b3ee.js');
+require('../../../_chunks/dep-d616be9f.js');
 require('./tree-node-model.js');
-require('../../../_chunks/dep-92449e5d.js');
-require('../../../_chunks/dep-39e97fe4.js');
-require('../../../_chunks/dep-46734f40.js');
-require('../../../_chunks/dep-824a3ee6.js');
-require('../../../_chunks/dep-58b55d35.js');
-require('../../../_chunks/dep-48784cef.js');
-require('../../../_chunks/dep-4fb5c464.js');
-require('../../../_chunks/dep-c699e15c.js');
-require('../../../_chunks/dep-8f62190e.js');
-require('../../../_chunks/dep-e0f1e391.js');
-require('../../../_chunks/dep-7316483e.js');
-require('../../../_chunks/dep-6dc159e8.js');
-require('../../../_chunks/dep-c98256d7.js');
-require('../../../_chunks/dep-3d45cbc8.js');
-require('../../../_chunks/dep-53731324.js');
-require('../../../_chunks/dep-39285892.js');
-require('../../../_chunks/dep-eeca3a4d.js');
-require('../../../_chunks/dep-1184898a.js');
+require('../../../_chunks/dep-22e00850.js');
+require('../../../_chunks/dep-24860d3b.js');
+require('../../../_chunks/dep-207637ec.js');
+require('../../../_chunks/dep-7bbe83c7.js');
+require('../../../_chunks/dep-0706ae8b.js');
+require('../../../_chunks/dep-08fec65f.js');
+require('../../../_chunks/dep-a19cf0b0.js');
+require('../../../_chunks/dep-3b2b764c.js');
+require('../../../_chunks/dep-43d2b778.js');
+require('../../../_chunks/dep-a4e63197.js');
+require('../../../_chunks/dep-5d12d655.js');
+require('../../../_chunks/dep-140a2995.js');
+require('../../../_chunks/dep-ac45a626.js');
+require('../../../_chunks/dep-a02ab8da.js');
+require('../../../_chunks/dep-ec6a3b8b.js');
+require('../../../_chunks/dep-186436f8.js');
+require('../../../_chunks/dep-56f3eb6f.js');
+require('../../../_chunks/dep-866e7a44.js');
+require('../../../_chunks/dep-6c84bdfe.js');
 require('../log/log.js');
 
 

package/lib/_common/js/tree/tree-node.js.map

@@ -1 +1 @@
-{"version":3,"file":"tree-node.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"tree-node.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/lib/_common/js/tree/tree-store.js

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.24.2
+ * tdesign v0.25.2
  * (c) 2022 tdesign
  * @license MIT
  */
@@ -8,39 +8,40 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-var defineProperty = require('../../../_chunks/dep-d569a74d.js');
-var _common_js_tree_treeNode = require('../../../_chunks/dep-64dde8f1.js');
-var difference = require('../../../_chunks/dep-04c4cfff.js');
-var camelCase = require('../../../_chunks/dep-4f657a93.js');
-var _baseRest = require('../../../_chunks/dep-851964b6.js');
-require('../../../_chunks/dep-f41855e1.js');
-require('../../../_chunks/dep-92449e5d.js');
-require('../../../_chunks/dep-8595bcca.js');
-require('../../../_chunks/dep-39e97fe4.js');
-require('../../../_chunks/dep-46734f40.js');
-require('../../../_chunks/dep-824a3ee6.js');
-require('../../../_chunks/dep-58b55d35.js');
-require('../../../_chunks/dep-48784cef.js');
-require('../../../_chunks/dep-4fb5c464.js');
-require('../../../_chunks/dep-4fafcd23.js');
-require('../../../_chunks/dep-c699e15c.js');
-require('../../../_chunks/dep-8f62190e.js');
-require('../../../_chunks/dep-e0f1e391.js');
-require('../../../_chunks/dep-7316483e.js');
-require('../../../_chunks/dep-6dc159e8.js');
+var defineProperty = require('../../../_chunks/dep-54e5d466.js');
+var _common_js_tree_treeNode = require('../../../_chunks/dep-cb10b3ee.js');
+var difference = require('../../../_chunks/dep-a958b70e.js');
+var camelCase = require('../../../_chunks/dep-e69612eb.js');
+var _baseRest = require('../../../_chunks/dep-d2ca8f73.js');
+require('../../../_chunks/dep-c8336573.js');
+require('../../../_chunks/dep-22e00850.js');
+require('../../../_chunks/dep-551cd0f7.js');
+require('../../../_chunks/dep-24860d3b.js');
+require('../../../_chunks/dep-207637ec.js');
+require('../../../_chunks/dep-7bbe83c7.js');
+require('../../../_chunks/dep-0706ae8b.js');
+require('../../../_chunks/dep-08fec65f.js');
+require('../../../_chunks/dep-a19cf0b0.js');
+require('../../../_chunks/dep-d616be9f.js');
+require('../../../_chunks/dep-3b2b764c.js');
+require('../../../_chunks/dep-43d2b778.js');
+require('../../../_chunks/dep-a4e63197.js');
+require('../../../_chunks/dep-5d12d655.js');
+require('../../../_chunks/dep-140a2995.js');
 require('./tree-node-model.js');
-require('../../../_chunks/dep-c98256d7.js');
-require('../../../_chunks/dep-3d45cbc8.js');
-require('../../../_chunks/dep-53731324.js');
-require('../../../_chunks/dep-39285892.js');
-require('../../../_chunks/dep-eeca3a4d.js');
-require('../../../_chunks/dep-1184898a.js');
+require('../../../_chunks/dep-ac45a626.js');
+require('../../../_chunks/dep-a02ab8da.js');
+require('../../../_chunks/dep-ec6a3b8b.js');
+require('../../../_chunks/dep-186436f8.js');
+require('../../../_chunks/dep-56f3eb6f.js');
+require('../../../_chunks/dep-866e7a44.js');
+require('../../../_chunks/dep-6c84bdfe.js');
 require('../log/log.js');
-require('../../../_chunks/dep-856aa3bf.js');
-require('../../../_chunks/dep-013cf2de.js');
-require('../../../_chunks/dep-e160c5b3.js');
-require('../../../_chunks/dep-e8076836.js');
-require('../../../_chunks/dep-46a203a6.js');
+require('../../../_chunks/dep-640aadbb.js');
+require('../../../_chunks/dep-37d3829a.js');
+require('../../../_chunks/dep-14fcdbd0.js');
+require('../../../_chunks/dep-a7e4c0ea.js');
+require('../../../_chunks/dep-0a2d9525.js');
 
 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; }
 

package/lib/_common/js/tree/tree-store.js.map

@@ -1 +1 @@
-{"version":3,"file":"tree-store.js","sources":["../../../../src/_common/js/tree/tree-store.ts"],"sourcesContent":["import difference from 'lodash/difference';\nimport camelCase from 'lodash/camelCase';\nimport isPlainObject from 'lodash/isPlainObject';\nimport { TreeNode } from './tree-node';\nimport {\n  TreeNodeValue,\n  TypeIdMap,\n  TypeTimer,\n  TypeTargetNode,\n  TypeTreeNodeData,\n  TypeTreeStoreOptions,\n  TypeTreeFilter,\n  TypeTreeFilterOptions,\n  TypeRelatedNodesOptions,\n  TypeTreeEventState,\n} from './types';\n\n// 构建一个树的数据模型\n// 基本设计思想：写入时更新，减少读取消耗，以减少未来实现虚拟滚动所需的计算量\n// 任何一次数据写入，会触发相应节点的状态更新\nexport class TreeStore {\n  // 根节点集合\n  public children: TreeNode[];\n\n  // 所有节点集合\n  public nodes: TreeNode[];\n\n  // 所有节点映射\n  public nodeMap: Map<TreeNodeValue, TreeNode>;\n\n  // 配置选项\n  public config: TypeTreeStoreOptions;\n\n  // 活动节点集合\n  public activedMap: TypeIdMap;\n\n  // 数据被更新的节点集合\n  public updatedMap: TypeIdMap;\n\n  // 选中节点集合\n  public checkedMap: TypeIdMap;\n\n  // 展开节点的集合\n  public expandedMap: TypeIdMap;\n\n  // 符合过滤条件的节点的集合\n  public filterMap: TypeIdMap;\n\n  // 数据更新计时器\n  public updateTimer: TypeTimer;\n\n  // 识别是否需要重排\n  public shouldReflow: boolean;\n\n  // 树节点过滤器\n  public prevFilter: TypeTreeFilter;\n\n  public constructor(options: TypeTreeStoreOptions) {\n    const config: TypeTreeStoreOptions = {\n      prefix: 't',\n      keys: {},\n      expandAll: false,\n      expandLevel: 0,\n      expandMutex: false,\n      expandParent: false,\n      activable: false,\n      activeMultiple: false,\n      checkable: false,\n      checkStrictly: false,\n      disabled: false,\n      load: null,\n      lazy: false,\n      valueMode: 'onlyLeaf',\n      filter: null,\n      onLoad: null,\n      onReflow: null,\n      onUpdate: null,\n      ...options,\n    };\n    this.config = config;\n    this.nodes = [];\n    this.children = [];\n    this.nodeMap = new Map();\n    this.activedMap = new Map();\n    this.expandedMap = new Map();\n    this.checkedMap = new Map();\n    this.updatedMap = new Map();\n    this.filterMap = new Map();\n    this.prevFilter = null;\n    // 这个计时器确保频繁的 update 事件被归纳为1次完整数据更新后的触发\n    this.updateTimer = null;\n    // 在子节点增删改查时，将此属性设置为 true，来触发视图更新\n    this.shouldReflow = false;\n  }\n\n  // 配置选项\n  public setConfig(options: TypeTreeStoreOptions) {\n    let hasChanged = false;\n    Object.keys(options).forEach((key) => {\n      const val = options[key];\n      if (val !== this.config[key]) {\n        hasChanged = true;\n        this.config[key] = val;\n      }\n    });\n    if (hasChanged) {\n      // 在 td-tree 的 render 方法中调用 setConfig\n      // 这样减少了 watch 属性\n      // 仅在属性变更后刷新状态\n      // 这样可以避免触发渲染死循环\n      this.refreshState();\n    }\n  }\n\n  // 获取根孩子节点列表\n  public getChildren() {\n    return this.children;\n  }\n\n  // 获取节点对象\n  public getNode(item: TypeTargetNode): TreeNode {\n    let node = null;\n    if (typeof item === 'string' || typeof item === 'number') {\n      node = this.nodeMap.get(item);\n    } else if (item instanceof TreeNode) {\n      node = this.nodeMap.get(item.value);\n    }\n    return node;\n  }\n\n  // 获取节点在总节点列表中的位置\n  public getIndex(node: TreeNode): number {\n    return this.nodes.indexOf(node);\n  }\n\n  // 获取指定节点的父节点\n  public getParent(value: TypeTargetNode): TreeNode {\n    let parent = null;\n    const node = this.getNode(value);\n    if (node) {\n      parent = node.getParent();\n    }\n    return parent;\n  }\n\n  // 获取指定节点的所有父节点\n  public getParents(value: TypeTargetNode): TreeNode[] {\n    const node = this.getNode(value);\n    let parents: TreeNode[] = [];\n    if (node) {\n      parents = node.getParents();\n    }\n    return parents;\n  }\n\n  // 获取指定节点在其所在 children 中的位置\n  public getNodeIndex(value: TypeTargetNode): number {\n    const node = this.getNode(value);\n    let index = -1;\n    if (node) {\n      index = node.getIndex();\n    }\n    return index;\n  }\n\n  // 获取所有符合条件的节点\n  public getNodes(\n    item?: TypeTargetNode,\n    options?: TypeTreeFilterOptions,\n  ): TreeNode[] {\n    let nodes: TreeNode[] = [];\n    let val: TreeNodeValue = '';\n    if (typeof item === 'string' || typeof item === 'number') {\n      val = item;\n    } else if (item instanceof TreeNode) {\n      val = item.value;\n    }\n    if (!val) {\n      nodes = this.nodes.slice(0);\n    } else {\n      const node = this.getNode(val);\n      if (node) {\n        nodes = node.walk();\n      }\n    }\n\n    if (options) {\n      const conf: TypeTreeFilterOptions = {\n        filter: null,\n        level: Infinity,\n        ...options,\n      };\n      if (typeof conf.level === 'number' && conf.level !== Infinity) {\n        nodes = nodes.filter((node) => node.level <= conf.level);\n      }\n      if (typeof conf.filter === 'function') {\n        nodes = nodes.filter((node) => {\n          const nodeModel = node.getModel();\n          return conf.filter(nodeModel);\n        });\n      }\n      if (isPlainObject(conf.props)) {\n        nodes = nodes.filter((node) => {\n          const result = Object.keys(conf.props).every((key) => {\n            const propEqual = node[key] === conf.props[key];\n            return propEqual;\n          });\n          return result;\n        });\n      }\n    }\n    return nodes;\n  }\n\n  // 给树添加节点数据\n  public append(list: TypeTreeNodeData[]): void {\n    list.forEach((item) => {\n      const node = new TreeNode(this, item);\n      this.children.push(node);\n    });\n    this.reflow();\n  }\n\n  // 重新加载数据\n  public reload(list: TypeTreeNodeData[]): void {\n    this.expandedMap.clear();\n    this.checkedMap.clear();\n    this.activedMap.clear();\n    this.filterMap.clear();\n    this.removeAll();\n    this.append(list);\n  }\n\n  // 解析节点数据，适配多种节点类型\n  public parseNodeData(\n    para: TreeNodeValue | TreeNode | TypeTreeNodeData,\n    item: TypeTreeNodeData | TypeTreeNodeData[] | TreeNode,\n  ) {\n    let value: TreeNodeValue = '';\n    let node = null;\n    let data = null;\n\n    if (typeof para === 'string' || typeof para === 'number') {\n      value = para;\n      data = item;\n      node = this.getNode(value);\n    } else if (para instanceof TreeNode) {\n      node = para;\n      data = item;\n    } else {\n      data = para;\n    }\n    const spec = {\n      node,\n      data,\n    };\n    return spec;\n  }\n\n  /**\n   * 向指定节点追加节点或者数据\n   * 支持下列使用方式\n   * item: 节点数据, TreeNode: 节点实例, value: 节点值(ID)\n   * appendNodes(item)\n   * appendNodes(TreeNode)\n   * appendNodes(value, item)\n   * appendNodes(value, TreeNode)\n   * appendNodes(TreeNode, item)\n   * appendNodes(TreeNode, TreeNode)\n   */\n  public appendNodes(\n    para?: TypeTargetNode | TypeTreeNodeData,\n    item?: TypeTreeNodeData | TreeNode,\n  ): void {\n    const spec = this.parseNodeData(para, item);\n    if (spec.data) {\n      if (!spec.node) {\n        // 在根节点插入\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this);\n        } else if (Array.isArray(spec.data)) {\n          this.append(spec.data);\n        } else {\n          this.append([spec.data]);\n        }\n      } else {\n        // 插入到目标节点之下\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this, spec.node);\n        } else if (Array.isArray(spec.data)) {\n          spec.node.append(spec.data);\n        } else {\n          spec.node.append([spec.data]);\n        }\n        spec.node.updateRelated();\n      }\n    }\n  }\n\n  // 在目标节点之前插入节点\n  public insertBefore(value: TypeTargetNode, item: TypeTreeNodeData): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertBefore(item);\n    }\n  }\n\n  // 在目标节点之后插入节点\n  public insertAfter(value: TypeTargetNode, item: TypeTreeNodeData): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertAfter(item);\n    }\n  }\n\n  // 更新树结构\n  // 清空 nodes 数组，然后遍历所有根节点重新插入 node\n  public refreshNodes(): void {\n    const { children, nodes } = this;\n    nodes.length = 0;\n    children.forEach((node) => {\n      const list = node.walk();\n      Array.prototype.push.apply(nodes, list);\n    });\n  }\n\n  // 更新所有树节点状态\n  public refreshState(): void {\n    const { nodes } = this;\n    nodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n  }\n\n  // 节点重排\n  // 应该仅在树节点增删改查时调用\n  public reflow(node?: TreeNode): void {\n    this.shouldReflow = true;\n    this.updated(node);\n  }\n\n  // 触发更新事件\n  // 节点属性变更时调用\n  public updated(node?: TreeNode): void {\n    if (node?.value) {\n      this.updatedMap.set(node.value, true);\n    }\n    if (this.updateTimer) return;\n    this.updateTimer = +setTimeout(() => {\n      clearTimeout(this.updateTimer);\n      this.updateTimer = null;\n\n      // 检查节点是否需要回流，重排数组\n      if (this.shouldReflow) {\n        this.refreshNodes();\n        this.emit('reflow');\n      }\n\n      // 检查节点是否有被过滤，锁定路径节点\n      // 在此之前要遍历节点生成一个经过排序的节点数组\n      // 以便于优化锁定检查算法\n      this.lockFilterPathNodes();\n\n      const updatedList = Array.from(this.updatedMap.keys());\n      if (updatedList.length > 0) {\n        // 统计需要更新状态的节点，派发更新事件\n        const updatedNodes = updatedList.map((value) => this.getNode(value));\n        this.emit('update', {\n          nodes: updatedNodes,\n          map: this.updatedMap,\n        });\n      } else if (this.shouldReflow) {\n        // 单纯的回流不需要更新节点状态\n        // 但需要触发更新事件\n        this.emit('update', {\n          nodes: [],\n          map: this.updatedMap,\n        });\n      }\n\n      // 每次回流检查完毕，还原检查状态\n      this.shouldReflow = false;\n      this.updatedMap.clear();\n    });\n  }\n\n  // 获取激活节点集合\n  public getActived(map?: TypeIdMap): TreeNodeValue[] {\n    const activedMap = map || this.activedMap;\n    return Array.from(activedMap.keys());\n  }\n\n  // 获取指定范围的高亮节点\n  public getActivedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isActived());\n    return nodes;\n  }\n\n  // 替换激活态\n  public replaceActived(list: TreeNodeValue[]): void {\n    this.resetActived();\n    this.setActived(list);\n  }\n\n  // 设置激活态\n  public setActived(actived: TreeNodeValue[]): void {\n    const { activeMultiple } = this.config;\n    const list = actived.slice(0);\n    if (!activeMultiple) {\n      list.length = 1;\n    }\n    list.forEach((val) => {\n      this.activedMap.set(val, true);\n      const node = this.getNode(val);\n      if (node) {\n        node.update();\n      }\n    });\n  }\n\n  // 重置激活态\n  public resetActived(): void {\n    const actived = this.getActived();\n    this.activedMap.clear();\n    const relatedNodes = this.getRelatedNodes(actived);\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 获取展开节点集合\n  public getExpanded(map?: TypeIdMap): TreeNodeValue[] {\n    const expandedMap = map || this.expandedMap;\n    return Array.from(expandedMap.keys());\n  }\n\n  // 替换展开节点\n  public replaceExpanded(list: TreeNodeValue[]): void {\n    const expanded = this.getExpanded();\n    const added = difference(list, expanded);\n    const removed = difference(expanded, list);\n    this.setExpandedDirectly(removed, false);\n    this.updateExpanded(removed);\n    this.setExpanded(added);\n  }\n\n  // 批量设置展开节点\n  public setExpanded(list: TreeNodeValue[]): void {\n    this.setExpandedDirectly(list);\n    this.updateExpanded(list);\n  }\n\n  // 直接设置展开节点数据，不更新节点状态\n  public setExpandedDirectly(list: TreeNodeValue[], expanded = true): void {\n    list.forEach((val) => {\n      if (expanded) {\n        this.expandedMap.set(val, true);\n        const node = this.getNode(val);\n        if (node) {\n          node.afterExpanded();\n        }\n      } else {\n        this.expandedMap.delete(val);\n      }\n    });\n  }\n\n  // 清除所有展开节点\n  public resetExpanded(): void {\n    const expanded = this.getExpanded();\n    this.expandedMap.clear();\n    this.updateExpanded(expanded);\n  }\n\n  // 更新展开节点相关节点的状态\n  public updateExpanded(list: TreeNodeValue[]): void {\n    const relatedNodes = this.getRelatedNodes(list, {\n      withParents: false,\n    });\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 获取选中态节点 value 数组\n  public getChecked(map?: TypeIdMap): TreeNodeValue[] {\n    const { nodes, config } = this;\n    const { valueMode, checkStrictly } = config;\n    const list: TreeNodeValue[] = [];\n    const checkedMap = map || this.checkedMap;\n    nodes.forEach((node) => {\n      if (node.isChecked(checkedMap)) {\n        if (valueMode === 'parentFirst' && !checkStrictly) {\n          if (!node.parent || !node.parent.isChecked(checkedMap)) {\n            list.push(node.value);\n          }\n        } else if (valueMode === 'onlyLeaf' && !checkStrictly) {\n          if (node.isLeaf()) {\n            list.push(node.value);\n          }\n        } else {\n          list.push(node.value);\n        }\n      }\n    });\n    return list;\n  }\n\n  // 获取指定节点下的选中节点\n  public getCheckedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isChecked());\n    return nodes;\n  }\n\n  // 替换选中态列表\n  public replaceChecked(list: TreeNodeValue[]): void {\n    this.resetChecked();\n    this.setChecked(list);\n  }\n\n  // 批量设置选中态\n  public setChecked(list: TreeNodeValue[]): void {\n    const { valueMode, checkStrictly, checkable } = this.config;\n    if (!checkable) return;\n    list.forEach((val: TreeNodeValue) => {\n      const node = this.getNode(val);\n      if (node) {\n        if (valueMode === 'parentFirst' && !checkStrictly) {\n          const childrenNodes = node.walk();\n          childrenNodes.forEach((childNode) => {\n            this.checkedMap.set(childNode.value, true);\n          });\n        } else {\n          this.checkedMap.set(val, true);\n          node.updateChecked();\n        }\n      }\n    });\n    if (!checkStrictly) {\n      const checked = this.getChecked();\n      const relatedNodes = this.getRelatedNodes(checked);\n      relatedNodes.forEach((node) => {\n        node.updateChecked();\n      });\n    }\n  }\n\n  // 清除所有选中节点\n  public resetChecked(): void {\n    const checked = this.getChecked();\n    const relatedNodes = this.getRelatedNodes(checked);\n    this.checkedMap.clear();\n    relatedNodes.forEach((node) => {\n      node.updateChecked();\n    });\n  }\n\n  // 更新全部节点状态\n  public updateAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 移除指定节点\n  public remove(value?: TypeTargetNode): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.remove();\n    }\n  }\n\n  // 清空所有节点\n  public removeAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.remove();\n    });\n  }\n\n  // 获取节点状态变化可能影响的周边节点\n  // 实现最小遍历集合\n  public getRelatedNodes(\n    list: TreeNodeValue[],\n    options?: TypeRelatedNodesOptions,\n  ): TreeNode[] {\n    const conf = {\n      withParents: true,\n      ...options,\n    };\n    const map = new Map();\n    list.forEach((value) => {\n      if (map.get(value)) return;\n      const node = this.getNode(value);\n      if (node) {\n        const parents = node.getParents();\n        const children = node.walk();\n        let related = [];\n        if (conf.withParents) {\n          related = parents.concat(children);\n        } else {\n          related = children;\n        }\n        related.forEach((relatedNode) => {\n          map.set(relatedNode.value, relatedNode);\n        });\n      }\n    });\n    const relatedNodes = Array.from(map.values());\n    return relatedNodes;\n  }\n\n  // 触发绑定的事件\n  public emit(name: string, state?: TypeTreeEventState): void {\n    const config = this.config || {};\n    const methodName = camelCase(`on-${name}`);\n    const method = config[methodName];\n    if (typeof method === 'function') {\n      method(state);\n    }\n  }\n\n  // 锁定过滤节点的路径节点\n  // 使得路径节点展开，可见，且不可操作\n  public lockFilterPathNodes() {\n    const {\n      config,\n      filterMap,\n    } = this;\n\n    // 之前没有设置过过滤器\n    // 当前也没有过滤器\n    // 则无需处理锁定节点\n    if (!config.filter && !this.prevFilter) {\n      return;\n    }\n    this.prevFilter = config.filter;\n\n    const allNodes = this.getNodes();\n    allNodes.forEach((node: TreeNode) => {\n      node.lock(false);\n    });\n    if (allNodes.length === filterMap.size) {\n      // 未经任何过滤，则无需处理锁定节点\n      return;\n    }\n\n    // 构造路径节点map\n    const map = new Map();\n\n    // 全部节点要经过排序，才能使用这个算法\n    // 比起每个过滤节点调用 getParents 方法检查父节点状态\n    // 算法复杂度 O(N*log(N)) => O(N)\n    allNodes.reverse().forEach((item: TreeNode) => {\n      const node = item;\n\n      // 被过滤节点父节点固定为展开状态\n      const parent = node.getParent();\n      if (node.vmIsRest) {\n        if (parent) {\n          parent.expanded = true;\n        }\n        // 被过滤节点固定为展示状态\n        node.visible = true;\n      }\n      if (node.vmIsRest || map.get(node.value)) {\n        if (parent && !parent.vmIsRest) {\n          map.set(parent.value, true);\n        }\n      }\n    });\n\n    // 锁定路径节点展示样式\n    const filterPathValues = Array.from(map.keys());\n    filterPathValues.forEach((value: TreeNodeValue) => {\n      const node = this.getNode(value);\n      if (node) {\n        node.lock(true);\n      }\n    });\n  }\n}\n\nexport default TreeStore;\n"],"names":["TreeStore","options","config","prefix","keys","expandAll","expandLevel","expandMutex","expandParent","activable","activeMultiple","checkable","checkStrictly","disabled","load","lazy","valueMode","filter","onLoad","onReflow","onUpdate","nodes","children","nodeMap","Map","activedMap","expandedMap","checkedMap","updatedMap","filterMap","prevFilter","updateTimer","shouldReflow","hasChanged","Object","forEach","key","val","refreshState","item","node","get","TreeNode","value","indexOf","parent","getNode","getParent","parents","getParents","index","getIndex","slice","walk","conf","level","Infinity","nodeModel","getModel","isPlainObject","props","result","every","propEqual","list","push","reflow","clear","removeAll","append","para","data","spec","parseNodeData","appendTo","Array","isArray","updateRelated","insertBefore","insertAfter","length","prototype","apply","update","updateChecked","updated","set","setTimeout","clearTimeout","refreshNodes","emit","lockFilterPathNodes","updatedList","from","updatedNodes","map","getNodes","isActived","resetActived","setActived","actived","getActived","relatedNodes","getRelatedNodes","expanded","getExpanded","added","difference","removed","setExpandedDirectly","updateExpanded","setExpanded","afterExpanded","withParents","isChecked","isLeaf","resetChecked","setChecked","childrenNodes","childNode","checked","getChecked","remove","related","concat","relatedNode","values","name","state","methodName","camelCase","method","allNodes","lock","size","reverse","vmIsRest","visible","filterPathValues"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IAIaA,SAAb;AAaE,qBAAYC,OAAZ,EAAqB;AAAA;;AACnB,QAAMC,MAAM;AACVC,MAAAA,MAAM,EAAE,GADE;AAEVC,MAAAA,IAAI,EAAE,EAFI;AAGVC,MAAAA,SAAS,EAAE,KAHD;AAIVC,MAAAA,WAAW,EAAE,CAJH;AAKVC,MAAAA,WAAW,EAAE,KALH;AAMVC,MAAAA,YAAY,EAAE,KANJ;AAOVC,MAAAA,SAAS,EAAE,KAPD;AAQVC,MAAAA,cAAc,EAAE,KARN;AASVC,MAAAA,SAAS,EAAE,KATD;AAUVC,MAAAA,aAAa,EAAE,KAVL;AAWVC,MAAAA,QAAQ,EAAE,KAXA;AAYVC,MAAAA,IAAI,EAAE,IAZI;AAaVC,MAAAA,IAAI,EAAE,KAbI;AAcVC,MAAAA,SAAS,EAAE,UAdD;AAeVC,MAAAA,MAAM,EAAE,IAfE;AAgBVC,MAAAA,MAAM,EAAE,IAhBE;AAiBVC,MAAAA,QAAQ,EAAE,IAjBA;AAkBVC,MAAAA,QAAQ,EAAE;AAlBA,OAmBPnB,OAnBO,CAAZ;;AAqBA,SAAKC,MAAL,GAAcA,MAAd;AACA,SAAKmB,KAAL,GAAa,EAAb;AACA,SAAKC,QAAL,GAAgB,EAAhB;AACA,SAAKC,OAAL,kBAA+B,IAAIC,GAAJ,EAA/B;AACA,SAAKC,UAAL,kBAAkC,IAAID,GAAJ,EAAlC;AACA,SAAKE,WAAL,kBAAmC,IAAIF,GAAJ,EAAnC;AACA,SAAKG,UAAL,kBAAkC,IAAIH,GAAJ,EAAlC;AACA,SAAKI,UAAL,kBAAkC,IAAIJ,GAAJ,EAAlC;AACA,SAAKK,SAAL,kBAAiC,IAAIL,GAAJ,EAAjC;AACA,SAAKM,UAAL,GAAkB,IAAlB;AACA,SAAKC,WAAL,GAAmB,IAAnB;AACA,SAAKC,YAAL,GAAoB,KAApB;AACD;;AA/CH;AAAA;AAAA,WAgDE,mBAAU/B,OAAV,EAAmB;AAAA;;AACjB,UAAIgC,UAAU,GAAG,KAAjB;AACAC,MAAAA,MAAM,CAAC9B,IAAP,CAAYH,OAAZ,EAAqBkC,OAArB,CAA6B,UAACC,GAAD,EAAS;AACpC,YAAMC,GAAG,GAAGpC,OAAO,CAACmC,GAAD,CAAnB;;AACA,YAAIC,GAAG,KAAK,KAAI,CAACnC,MAAL,CAAYkC,GAAZ,CAAZ,EAA8B;AAC5BH,UAAAA,UAAU,GAAG,IAAb;AACA,UAAA,KAAI,CAAC/B,MAAL,CAAYkC,GAAZ,IAAmBC,GAAnB;AACD;AACF,OAND;;AAOA,UAAIJ,UAAJ,EAAgB;AACd,aAAKK,YAAL;AACD;AACF;AA5DH;AAAA;AAAA,WA6DE,uBAAc;AACZ,aAAO,KAAKhB,QAAZ;AACD;AA/DH;AAAA;AAAA,WAgEE,iBAAQiB,IAAR,EAAc;AACZ,UAAIC,IAAI,GAAG,IAAX;;AACA,UAAI,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,QAAhD,EAA0D;AACxDC,QAAAA,IAAI,GAAG,KAAKjB,OAAL,CAAakB,GAAb,CAAiBF,IAAjB,CAAP;AACD,OAFD,MAEO,IAAIA,IAAI,YAAYG,iCAApB,EAA8B;AACnCF,QAAAA,IAAI,GAAG,KAAKjB,OAAL,CAAakB,GAAb,CAAiBF,IAAI,CAACI,KAAtB,CAAP;AACD;;AACD,aAAOH,IAAP;AACD;AAxEH;AAAA;AAAA,WAyEE,kBAASA,IAAT,EAAe;AACb,aAAO,KAAKnB,KAAL,CAAWuB,OAAX,CAAmBJ,IAAnB,CAAP;AACD;AA3EH;AAAA;AAAA,WA4EE,mBAAUG,KAAV,EAAiB;AACf,UAAIE,MAAM,GAAG,IAAb;AACA,UAAML,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;;AACA,UAAIH,IAAJ,EAAU;AACRK,QAAAA,MAAM,GAAGL,IAAI,CAACO,SAAL,EAAT;AACD;;AACD,aAAOF,MAAP;AACD;AAnFH;AAAA;AAAA,WAoFE,oBAAWF,KAAX,EAAkB;AAChB,UAAMH,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;AACA,UAAIK,OAAO,GAAG,EAAd;;AACA,UAAIR,IAAJ,EAAU;AACRQ,QAAAA,OAAO,GAAGR,IAAI,CAACS,UAAL,EAAV;AACD;;AACD,aAAOD,OAAP;AACD;AA3FH;AAAA;AAAA,WA4FE,sBAAaL,KAAb,EAAoB;AAClB,UAAMH,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;AACA,UAAIO,KAAK,GAAG,CAAC,CAAb;;AACA,UAAIV,IAAJ,EAAU;AACRU,QAAAA,KAAK,GAAGV,IAAI,CAACW,QAAL,EAAR;AACD;;AACD,aAAOD,KAAP;AACD;AAnGH;AAAA;AAAA,WAoGE,kBAASX,IAAT,EAAetC,OAAf,EAAwB;AACtB,UAAIoB,KAAK,GAAG,EAAZ;AACA,UAAIgB,GAAG,GAAG,EAAV;;AACA,UAAI,OAAOE,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,QAAhD,EAA0D;AACxDF,QAAAA,GAAG,GAAGE,IAAN;AACD,OAFD,MAEO,IAAIA,IAAI,YAAYG,iCAApB,EAA8B;AACnCL,QAAAA,GAAG,GAAGE,IAAI,CAACI,KAAX;AACD;;AACD,UAAI,CAACN,GAAL,EAAU;AACRhB,QAAAA,KAAK,GAAG,KAAKA,KAAL,CAAW+B,KAAX,CAAiB,CAAjB,CAAR;AACD,OAFD,MAEO;AACL,YAAMZ,IAAI,GAAG,KAAKM,OAAL,CAAaT,GAAb,CAAb;;AACA,YAAIG,IAAJ,EAAU;AACRnB,UAAAA,KAAK,GAAGmB,IAAI,CAACa,IAAL,EAAR;AACD;AACF;;AACD,UAAIpD,OAAJ,EAAa;AACX,YAAMqD,IAAI;AACRrC,UAAAA,MAAM,EAAE,IADA;AAERsC,UAAAA,KAAK,EAAEC;AAFC,WAGLvD,OAHK,CAAV;;AAKA,YAAI,OAAOqD,IAAI,CAACC,KAAZ,KAAsB,QAAtB,IAAkCD,IAAI,CAACC,KAAL,KAAeC,QAArD,EAA+D;AAC7DnC,UAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD;AAAA,mBAAUA,IAAI,CAACe,KAAL,IAAcD,IAAI,CAACC,KAA7B;AAAA,WAAb,CAAR;AACD;;AACD,YAAI,OAAOD,IAAI,CAACrC,MAAZ,KAAuB,UAA3B,EAAuC;AACrCI,UAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD,EAAU;AAC7B,gBAAMiB,SAAS,GAAGjB,IAAI,CAACkB,QAAL,EAAlB;AACA,mBAAOJ,IAAI,CAACrC,MAAL,CAAYwC,SAAZ,CAAP;AACD,WAHO,CAAR;AAID;;AACD,YAAIE,yBAAa,CAACL,IAAI,CAACM,KAAN,CAAjB,EAA+B;AAC7BvC,UAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD,EAAU;AAC7B,gBAAMqB,MAAM,GAAG3B,MAAM,CAAC9B,IAAP,CAAYkD,IAAI,CAACM,KAAjB,EAAwBE,KAAxB,CAA8B,UAAC1B,GAAD,EAAS;AACpD,kBAAM2B,SAAS,GAAGvB,IAAI,CAACJ,GAAD,CAAJ,KAAckB,IAAI,CAACM,KAAL,CAAWxB,GAAX,CAAhC;AACA,qBAAO2B,SAAP;AACD,aAHc,CAAf;AAIA,mBAAOF,MAAP;AACD,WANO,CAAR;AAOD;AACF;;AACD,aAAOxC,KAAP;AACD;AA9IH;AAAA;AAAA,WA+IE,gBAAO2C,IAAP,EAAa;AAAA;;AACXA,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACI,IAAD,EAAU;AACrB,YAAMC,IAAI,GAAG,IAAIE,iCAAJ,CAAa,MAAb,EAAmBH,IAAnB,CAAb;;AACA,QAAA,MAAI,CAACjB,QAAL,CAAc2C,IAAd,CAAmBzB,IAAnB;AACD,OAHD;AAIA,WAAK0B,MAAL;AACD;AArJH;AAAA;AAAA,WAsJE,gBAAOF,IAAP,EAAa;AACX,WAAKtC,WAAL,CAAiByC,KAAjB;AACA,WAAKxC,UAAL,CAAgBwC,KAAhB;AACA,WAAK1C,UAAL,CAAgB0C,KAAhB;AACA,WAAKtC,SAAL,CAAesC,KAAf;AACA,WAAKC,SAAL;AACA,WAAKC,MAAL,CAAYL,IAAZ;AACD;AA7JH;AAAA;AAAA,WA8JE,uBAAcM,IAAd,EAAoB/B,IAApB,EAA0B;AACxB,UAAII,KAAK,GAAG,EAAZ;AACA,UAAIH,IAAI,GAAG,IAAX;AACA,UAAI+B,IAAI,GAAG,IAAX;;AACA,UAAI,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,QAAhD,EAA0D;AACxD3B,QAAAA,KAAK,GAAG2B,IAAR;AACAC,QAAAA,IAAI,GAAGhC,IAAP;AACAC,QAAAA,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAP;AACD,OAJD,MAIO,IAAI2B,IAAI,YAAY5B,iCAApB,EAA8B;AACnCF,QAAAA,IAAI,GAAG8B,IAAP;AACAC,QAAAA,IAAI,GAAGhC,IAAP;AACD,OAHM,MAGA;AACLgC,QAAAA,IAAI,GAAGD,IAAP;AACD;;AACD,UAAME,IAAI,GAAG;AACXhC,QAAAA,IAAI,EAAJA,IADW;AAEX+B,QAAAA,IAAI,EAAJA;AAFW,OAAb;AAIA,aAAOC,IAAP;AACD;AAjLH;AAAA;AAAA,WAkLE,qBAAYF,IAAZ,EAAkB/B,IAAlB,EAAwB;AACtB,UAAMiC,IAAI,GAAG,KAAKC,aAAL,CAAmBH,IAAnB,EAAyB/B,IAAzB,CAAb;;AACA,UAAIiC,IAAI,CAACD,IAAT,EAAe;AACb,YAAI,CAACC,IAAI,CAAChC,IAAV,EAAgB;AACd,cAAIgC,IAAI,CAACD,IAAL,YAAqB7B,iCAAzB,EAAmC;AACjC8B,YAAAA,IAAI,CAACD,IAAL,CAAUG,QAAV,CAAmB,IAAnB;AACD,WAFD,MAEO,IAAIC,KAAK,CAACC,OAAN,CAAcJ,IAAI,CAACD,IAAnB,CAAJ,EAA8B;AACnC,iBAAKF,MAAL,CAAYG,IAAI,CAACD,IAAjB;AACD,WAFM,MAEA;AACL,iBAAKF,MAAL,CAAY,CAACG,IAAI,CAACD,IAAN,CAAZ;AACD;AACF,SARD,MAQO;AACL,cAAIC,IAAI,CAACD,IAAL,YAAqB7B,iCAAzB,EAAmC;AACjC8B,YAAAA,IAAI,CAACD,IAAL,CAAUG,QAAV,CAAmB,IAAnB,EAAyBF,IAAI,CAAChC,IAA9B;AACD,WAFD,MAEO,IAAImC,KAAK,CAACC,OAAN,CAAcJ,IAAI,CAACD,IAAnB,CAAJ,EAA8B;AACnCC,YAAAA,IAAI,CAAChC,IAAL,CAAU6B,MAAV,CAAiBG,IAAI,CAACD,IAAtB;AACD,WAFM,MAEA;AACLC,YAAAA,IAAI,CAAChC,IAAL,CAAU6B,MAAV,CAAiB,CAACG,IAAI,CAACD,IAAN,CAAjB;AACD;;AACDC,UAAAA,IAAI,CAAChC,IAAL,CAAUqC,aAAV;AACD;AACF;AACF;AAxMH;AAAA;AAAA,WAyME,sBAAalC,KAAb,EAAoBJ,IAApB,EAA0B;AACxB,UAAMC,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;;AACA,UAAIH,IAAJ,EAAU;AACRA,QAAAA,IAAI,CAACsC,YAAL,CAAkBvC,IAAlB;AACD;AACF;AA9MH;AAAA;AAAA,WA+ME,qBAAYI,KAAZ,EAAmBJ,IAAnB,EAAyB;AACvB,UAAMC,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;;AACA,UAAIH,IAAJ,EAAU;AACRA,QAAAA,IAAI,CAACuC,WAAL,CAAiBxC,IAAjB;AACD;AACF;AApNH;AAAA;AAAA,WAqNE,wBAAe;AACb,UAAQjB,QAAR,GAA4B,IAA5B,CAAQA,QAAR;AAAA,UAAkBD,KAAlB,GAA4B,IAA5B,CAAkBA,KAAlB;AACAA,MAAAA,KAAK,CAAC2D,MAAN,GAAe,CAAf;AACA1D,MAAAA,QAAQ,CAACa,OAAT,CAAiB,UAACK,IAAD,EAAU;AACzB,YAAMwB,IAAI,GAAGxB,IAAI,CAACa,IAAL,EAAb;AACAsB,QAAAA,KAAK,CAACM,SAAN,CAAgBhB,IAAhB,CAAqBiB,KAArB,CAA2B7D,KAA3B,EAAkC2C,IAAlC;AACD,OAHD;AAID;AA5NH;AAAA;AAAA,WA6NE,wBAAe;AACb,UAAQ3C,KAAR,GAAkB,IAAlB,CAAQA,KAAR;AACAA,MAAAA,KAAK,CAACc,OAAN,CAAc,UAACK,IAAD,EAAU;AACtBA,QAAAA,IAAI,CAAC2C,MAAL;AACA3C,QAAAA,IAAI,CAAC4C,aAAL;AACD,OAHD;AAID;AAnOH;AAAA;AAAA,WAoOE,gBAAO5C,IAAP,EAAa;AACX,WAAKR,YAAL,GAAoB,IAApB;AACA,WAAKqD,OAAL,CAAa7C,IAAb;AACD;AAvOH;AAAA;AAAA,WAwOE,iBAAQA,IAAR,EAAc;AAAA;;AACZ,UAAIA,IAAJ,aAAIA,IAAJ,eAAIA,IAAI,CAAEG,KAAV,EAAiB;AACf,aAAKf,UAAL,CAAgB0D,GAAhB,CAAoB9C,IAAI,CAACG,KAAzB,EAAgC,IAAhC;AACD;;AACD,UAAI,KAAKZ,WAAT,EACE;AACF,WAAKA,WAAL,GAAmB,CAACwD,UAAU,CAAC,YAAM;AACnCC,QAAAA,YAAY,CAAC,MAAI,CAACzD,WAAN,CAAZ;AACA,QAAA,MAAI,CAACA,WAAL,GAAmB,IAAnB;;AACA,YAAI,MAAI,CAACC,YAAT,EAAuB;AACrB,UAAA,MAAI,CAACyD,YAAL;;AACA,UAAA,MAAI,CAACC,IAAL,CAAU,QAAV;AACD;;AACD,QAAA,MAAI,CAACC,mBAAL;;AACA,YAAMC,WAAW,GAAGjB,KAAK,CAACkB,IAAN,CAAW,MAAI,CAACjE,UAAL,CAAgBxB,IAAhB,EAAX,CAApB;;AACA,YAAIwF,WAAW,CAACZ,MAAZ,GAAqB,CAAzB,EAA4B;AAC1B,cAAMc,YAAY,GAAGF,WAAW,CAACG,GAAZ,CAAgB,UAACpD,KAAD;AAAA,mBAAW,MAAI,CAACG,OAAL,CAAaH,KAAb,CAAX;AAAA,WAAhB,CAArB;;AACA,UAAA,MAAI,CAAC+C,IAAL,CAAU,QAAV,EAAoB;AAClBrE,YAAAA,KAAK,EAAEyE,YADW;AAElBC,YAAAA,GAAG,EAAE,MAAI,CAACnE;AAFQ,WAApB;AAID,SAND,MAMO,IAAI,MAAI,CAACI,YAAT,EAAuB;AAC5B,UAAA,MAAI,CAAC0D,IAAL,CAAU,QAAV,EAAoB;AAClBrE,YAAAA,KAAK,EAAE,EADW;AAElB0E,YAAAA,GAAG,EAAE,MAAI,CAACnE;AAFQ,WAApB;AAID;;AACD,QAAA,MAAI,CAACI,YAAL,GAAoB,KAApB;;AACA,QAAA,MAAI,CAACJ,UAAL,CAAgBuC,KAAhB;AACD,OAvB6B,CAA9B;AAwBD;AAtQH;AAAA;AAAA,WAuQE,oBAAW4B,GAAX,EAAgB;AACd,UAAMtE,UAAU,GAAGsE,GAAG,IAAI,KAAKtE,UAA/B;AACA,aAAOkD,KAAK,CAACkB,IAAN,CAAWpE,UAAU,CAACrB,IAAX,EAAX,CAAP;AACD;AA1QH;AAAA;AAAA,WA2QE,yBAAgBmC,IAAhB,EAAsB;AACpB,UAAIlB,KAAK,GAAG,KAAK2E,QAAL,CAAczD,IAAd,CAAZ;AACAlB,MAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD;AAAA,eAAUA,IAAI,CAACyD,SAAL,EAAV;AAAA,OAAb,CAAR;AACA,aAAO5E,KAAP;AACD;AA/QH;AAAA;AAAA,WAgRE,wBAAe2C,IAAf,EAAqB;AACnB,WAAKkC,YAAL;AACA,WAAKC,UAAL,CAAgBnC,IAAhB;AACD;AAnRH;AAAA;AAAA,WAoRE,oBAAWoC,OAAX,EAAoB;AAAA;;AAClB,UAAQ1F,cAAR,GAA2B,KAAKR,MAAhC,CAAQQ,cAAR;AACA,UAAMsD,IAAI,GAAGoC,OAAO,CAAChD,KAAR,CAAc,CAAd,CAAb;;AACA,UAAI,CAAC1C,cAAL,EAAqB;AACnBsD,QAAAA,IAAI,CAACgB,MAAL,GAAc,CAAd;AACD;;AACDhB,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACE,GAAD,EAAS;AACpB,QAAA,MAAI,CAACZ,UAAL,CAAgB6D,GAAhB,CAAoBjD,GAApB,EAAyB,IAAzB;;AACA,YAAMG,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaT,GAAb,CAAb;;AACA,YAAIG,IAAJ,EAAU;AACRA,UAAAA,IAAI,CAAC2C,MAAL;AACD;AACF,OAND;AAOD;AAjSH;AAAA;AAAA,WAkSE,wBAAe;AACb,UAAMiB,OAAO,GAAG,KAAKC,UAAL,EAAhB;AACA,WAAK5E,UAAL,CAAgB0C,KAAhB;AACA,UAAMmC,YAAY,GAAG,KAAKC,eAAL,CAAqBH,OAArB,CAArB;AACAE,MAAAA,YAAY,CAACnE,OAAb,CAAqB,UAACK,IAAD,EAAU;AAC7BA,QAAAA,IAAI,CAAC2C,MAAL;AACD,OAFD;AAGD;AAzSH;AAAA;AAAA,WA0SE,qBAAYY,GAAZ,EAAiB;AACf,UAAMrE,WAAW,GAAGqE,GAAG,IAAI,KAAKrE,WAAhC;AACA,aAAOiD,KAAK,CAACkB,IAAN,CAAWnE,WAAW,CAACtB,IAAZ,EAAX,CAAP;AACD;AA7SH;AAAA;AAAA,WA8SE,yBAAgB4D,IAAhB,EAAsB;AACpB,UAAMwC,QAAQ,GAAG,KAAKC,WAAL,EAAjB;AACA,UAAMC,KAAK,GAAGC,uBAAU,CAAC3C,IAAD,EAAOwC,QAAP,CAAxB;AACA,UAAMI,OAAO,GAAGD,uBAAU,CAACH,QAAD,EAAWxC,IAAX,CAA1B;AACA,WAAK6C,mBAAL,CAAyBD,OAAzB,EAAkC,KAAlC;AACA,WAAKE,cAAL,CAAoBF,OAApB;AACA,WAAKG,WAAL,CAAiBL,KAAjB;AACD;AArTH;AAAA;AAAA,WAsTE,qBAAY1C,IAAZ,EAAkB;AAChB,WAAK6C,mBAAL,CAAyB7C,IAAzB;AACA,WAAK8C,cAAL,CAAoB9C,IAApB;AACD;AAzTH;AAAA;AAAA,WA0TE,6BAAoBA,IAApB,EAA2C;AAAA;;AAAA,UAAjBwC,QAAiB,uEAAN,IAAM;AACzCxC,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACE,GAAD,EAAS;AACpB,YAAImE,QAAJ,EAAc;AACZ,UAAA,MAAI,CAAC9E,WAAL,CAAiB4D,GAAjB,CAAqBjD,GAArB,EAA0B,IAA1B;;AACA,cAAMG,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaT,GAAb,CAAb;;AACA,cAAIG,IAAJ,EAAU;AACRA,YAAAA,IAAI,CAACwE,aAAL;AACD;AACF,SAND,MAMO;AACL,UAAA,MAAI,CAACtF,WAAL,WAAwBW,GAAxB;AACD;AACF,OAVD;AAWD;AAtUH;AAAA;AAAA,WAuUE,yBAAgB;AACd,UAAMmE,QAAQ,GAAG,KAAKC,WAAL,EAAjB;AACA,WAAK/E,WAAL,CAAiByC,KAAjB;AACA,WAAK2C,cAAL,CAAoBN,QAApB;AACD;AA3UH;AAAA;AAAA,WA4UE,wBAAexC,IAAf,EAAqB;AACnB,UAAMsC,YAAY,GAAG,KAAKC,eAAL,CAAqBvC,IAArB,EAA2B;AAC9CiD,QAAAA,WAAW,EAAE;AADiC,OAA3B,CAArB;AAGAX,MAAAA,YAAY,CAACnE,OAAb,CAAqB,UAACK,IAAD,EAAU;AAC7BA,QAAAA,IAAI,CAAC2C,MAAL;AACD,OAFD;AAGD;AAnVH;AAAA;AAAA,WAoVE,oBAAWY,GAAX,EAAgB;AACd,UAAQ1E,KAAR,GAA0B,IAA1B,CAAQA,KAAR;AAAA,UAAenB,MAAf,GAA0B,IAA1B,CAAeA,MAAf;AACA,UAAQc,SAAR,GAAqCd,MAArC,CAAQc,SAAR;AAAA,UAAmBJ,aAAnB,GAAqCV,MAArC,CAAmBU,aAAnB;AACA,UAAMoD,IAAI,GAAG,EAAb;AACA,UAAMrC,UAAU,GAAGoE,GAAG,IAAI,KAAKpE,UAA/B;AACAN,MAAAA,KAAK,CAACc,OAAN,CAAc,UAACK,IAAD,EAAU;AACtB,YAAIA,IAAI,CAAC0E,SAAL,CAAevF,UAAf,CAAJ,EAAgC;AAC9B,cAAIX,SAAS,KAAK,aAAd,IAA+B,CAACJ,aAApC,EAAmD;AACjD,gBAAI,CAAC4B,IAAI,CAACK,MAAN,IAAgB,CAACL,IAAI,CAACK,MAAL,CAAYqE,SAAZ,CAAsBvF,UAAtB,CAArB,EAAwD;AACtDqC,cAAAA,IAAI,CAACC,IAAL,CAAUzB,IAAI,CAACG,KAAf;AACD;AACF,WAJD,MAIO,IAAI3B,SAAS,KAAK,UAAd,IAA4B,CAACJ,aAAjC,EAAgD;AACrD,gBAAI4B,IAAI,CAAC2E,MAAL,EAAJ,EAAmB;AACjBnD,cAAAA,IAAI,CAACC,IAAL,CAAUzB,IAAI,CAACG,KAAf;AACD;AACF,WAJM,MAIA;AACLqB,YAAAA,IAAI,CAACC,IAAL,CAAUzB,IAAI,CAACG,KAAf;AACD;AACF;AACF,OAdD;AAeA,aAAOqB,IAAP;AACD;AAzWH;AAAA;AAAA,WA0WE,yBAAgBzB,IAAhB,EAAsB;AACpB,UAAIlB,KAAK,GAAG,KAAK2E,QAAL,CAAczD,IAAd,CAAZ;AACAlB,MAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD;AAAA,eAAUA,IAAI,CAAC0E,SAAL,EAAV;AAAA,OAAb,CAAR;AACA,aAAO7F,KAAP;AACD;AA9WH;AAAA;AAAA,WA+WE,wBAAe2C,IAAf,EAAqB;AACnB,WAAKoD,YAAL;AACA,WAAKC,UAAL,CAAgBrD,IAAhB;AACD;AAlXH;AAAA;AAAA,WAmXE,oBAAWA,IAAX,EAAiB;AAAA;;AACf,yBAAgD,KAAK9D,MAArD;AAAA,UAAQc,SAAR,gBAAQA,SAAR;AAAA,UAAmBJ,aAAnB,gBAAmBA,aAAnB;AAAA,UAAkCD,SAAlC,gBAAkCA,SAAlC;AACA,UAAI,CAACA,SAAL,EACE;AACFqD,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACE,GAAD,EAAS;AACpB,YAAMG,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaT,GAAb,CAAb;;AACA,YAAIG,IAAJ,EAAU;AACR,cAAIxB,SAAS,KAAK,aAAd,IAA+B,CAACJ,aAApC,EAAmD;AACjD,gBAAM0G,aAAa,GAAG9E,IAAI,CAACa,IAAL,EAAtB;AACAiE,YAAAA,aAAa,CAACnF,OAAd,CAAsB,UAACoF,SAAD,EAAe;AACnC,cAAA,MAAI,CAAC5F,UAAL,CAAgB2D,GAAhB,CAAoBiC,SAAS,CAAC5E,KAA9B,EAAqC,IAArC;AACD,aAFD;AAGD,WALD,MAKO;AACL,YAAA,MAAI,CAAChB,UAAL,CAAgB2D,GAAhB,CAAoBjD,GAApB,EAAyB,IAAzB;;AACAG,YAAAA,IAAI,CAAC4C,aAAL;AACD;AACF;AACF,OAbD;;AAcA,UAAI,CAACxE,aAAL,EAAoB;AAClB,YAAM4G,OAAO,GAAG,KAAKC,UAAL,EAAhB;AACA,YAAMnB,YAAY,GAAG,KAAKC,eAAL,CAAqBiB,OAArB,CAArB;AACAlB,QAAAA,YAAY,CAACnE,OAAb,CAAqB,UAACK,IAAD,EAAU;AAC7BA,UAAAA,IAAI,CAAC4C,aAAL;AACD,SAFD;AAGD;AACF;AA5YH;AAAA;AAAA,WA6YE,wBAAe;AACb,UAAMoC,OAAO,GAAG,KAAKC,UAAL,EAAhB;AACA,UAAMnB,YAAY,GAAG,KAAKC,eAAL,CAAqBiB,OAArB,CAArB;AACA,WAAK7F,UAAL,CAAgBwC,KAAhB;AACAmC,MAAAA,YAAY,CAACnE,OAAb,CAAqB,UAACK,IAAD,EAAU;AAC7BA,QAAAA,IAAI,CAAC4C,aAAL;AACD,OAFD;AAGD;AApZH;AAAA;AAAA,WAqZE,qBAAY;AACV,UAAM/D,KAAK,GAAG,KAAK2E,QAAL,EAAd;AACA3E,MAAAA,KAAK,CAACc,OAAN,CAAc,UAACK,IAAD,EAAU;AACtBA,QAAAA,IAAI,CAAC2C,MAAL;AACD,OAFD;AAGD;AA1ZH;AAAA;AAAA,WA2ZE,gBAAOxC,KAAP,EAAc;AACZ,UAAMH,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;;AACA,UAAIH,IAAJ,EAAU;AACRA,QAAAA,IAAI,CAACkF,MAAL;AACD;AACF;AAhaH;AAAA;AAAA,WAiaE,qBAAY;AACV,UAAMrG,KAAK,GAAG,KAAK2E,QAAL,EAAd;AACA3E,MAAAA,KAAK,CAACc,OAAN,CAAc,UAACK,IAAD,EAAU;AACtBA,QAAAA,IAAI,CAACkF,MAAL;AACD,OAFD;AAGD;AAtaH;AAAA;AAAA,WAuaE,yBAAgB1D,IAAhB,EAAsB/D,OAAtB,EAA+B;AAAA;;AAC7B,UAAMqD,IAAI;AACR2D,QAAAA,WAAW,EAAE;AADL,SAELhH,OAFK,CAAV;;AAIA,UAAM8F,GAAG,kBAAmB,IAAIvE,GAAJ,EAA5B;AACAwC,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACQ,KAAD,EAAW;AACtB,YAAIoD,GAAG,CAACtD,GAAJ,CAAQE,KAAR,CAAJ,EACE;;AACF,YAAMH,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaH,KAAb,CAAb;;AACA,YAAIH,IAAJ,EAAU;AACR,cAAMQ,OAAO,GAAGR,IAAI,CAACS,UAAL,EAAhB;AACA,cAAM3B,QAAQ,GAAGkB,IAAI,CAACa,IAAL,EAAjB;AACA,cAAIsE,OAAO,GAAG,EAAd;;AACA,cAAIrE,IAAI,CAAC2D,WAAT,EAAsB;AACpBU,YAAAA,OAAO,GAAG3E,OAAO,CAAC4E,MAAR,CAAetG,QAAf,CAAV;AACD,WAFD,MAEO;AACLqG,YAAAA,OAAO,GAAGrG,QAAV;AACD;;AACDqG,UAAAA,OAAO,CAACxF,OAAR,CAAgB,UAAC0F,WAAD,EAAiB;AAC/B9B,YAAAA,GAAG,CAACT,GAAJ,CAAQuC,WAAW,CAAClF,KAApB,EAA2BkF,WAA3B;AACD,WAFD;AAGD;AACF,OAjBD;AAkBA,UAAMvB,YAAY,GAAG3B,KAAK,CAACkB,IAAN,CAAWE,GAAG,CAAC+B,MAAJ,EAAX,CAArB;AACA,aAAOxB,YAAP;AACD;AAjcH;AAAA;AAAA,WAkcE,cAAKyB,IAAL,EAAWC,KAAX,EAAkB;AAChB,UAAM9H,MAAM,GAAG,KAAKA,MAAL,IAAe,EAA9B;AACA,UAAM+H,UAAU,GAAGC,qBAAS,cAAOH,IAAP,EAA5B;AACA,UAAMI,MAAM,GAAGjI,MAAM,CAAC+H,UAAD,CAArB;;AACA,UAAI,OAAOE,MAAP,KAAkB,UAAtB,EAAkC;AAChCA,QAAAA,MAAM,CAACH,KAAD,CAAN;AACD;AACF;AAzcH;AAAA;AAAA,WA0cE,+BAAsB;AAAA;;AACpB,UACE9H,MADF,GAGI,IAHJ,CACEA,MADF;AAAA,UAEE2B,SAFF,GAGI,IAHJ,CAEEA,SAFF;;AAIA,UAAI,CAAC3B,MAAM,CAACe,MAAR,IAAkB,CAAC,KAAKa,UAA5B,EAAwC;AACtC;AACD;;AACD,WAAKA,UAAL,GAAkB5B,MAAM,CAACe,MAAzB;AACA,UAAMmH,QAAQ,GAAG,KAAKpC,QAAL,EAAjB;AACAoC,MAAAA,QAAQ,CAACjG,OAAT,CAAiB,UAACK,IAAD,EAAU;AACzBA,QAAAA,IAAI,CAAC6F,IAAL,CAAU,KAAV;AACD,OAFD;;AAGA,UAAID,QAAQ,CAACpD,MAAT,KAAoBnD,SAAS,CAACyG,IAAlC,EAAwC;AACtC;AACD;;AACD,UAAMvC,GAAG,kBAAmB,IAAIvE,GAAJ,EAA5B;AACA4G,MAAAA,QAAQ,CAACG,OAAT,GAAmBpG,OAAnB,CAA2B,UAACI,IAAD,EAAU;AACnC,YAAMC,IAAI,GAAGD,IAAb;AACA,YAAMM,MAAM,GAAGL,IAAI,CAACO,SAAL,EAAf;;AACA,YAAIP,IAAI,CAACgG,QAAT,EAAmB;AACjB,cAAI3F,MAAJ,EAAY;AACVA,YAAAA,MAAM,CAAC2D,QAAP,GAAkB,IAAlB;AACD;;AACDhE,UAAAA,IAAI,CAACiG,OAAL,GAAe,IAAf;AACD;;AACD,YAAIjG,IAAI,CAACgG,QAAL,IAAiBzC,GAAG,CAACtD,GAAJ,CAAQD,IAAI,CAACG,KAAb,CAArB,EAA0C;AACxC,cAAIE,MAAM,IAAI,CAACA,MAAM,CAAC2F,QAAtB,EAAgC;AAC9BzC,YAAAA,GAAG,CAACT,GAAJ,CAAQzC,MAAM,CAACF,KAAf,EAAsB,IAAtB;AACD;AACF;AACF,OAdD;AAeA,UAAM+F,gBAAgB,GAAG/D,KAAK,CAACkB,IAAN,CAAWE,GAAG,CAAC3F,IAAJ,EAAX,CAAzB;AACAsI,MAAAA,gBAAgB,CAACvG,OAAjB,CAAyB,UAACQ,KAAD,EAAW;AAClC,YAAMH,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaH,KAAb,CAAb;;AACA,YAAIH,IAAJ,EAAU;AACRA,UAAAA,IAAI,CAAC6F,IAAL,CAAU,IAAV;AACD;AACF,OALD;AAMD;AAjfH;;AAAA;AAAA;;;;;"}
+{"version":3,"file":"tree-store.js","sources":["../../../../src/_common/js/tree/tree-store.ts"],"sourcesContent":["import difference from 'lodash/difference';\nimport camelCase from 'lodash/camelCase';\nimport isPlainObject from 'lodash/isPlainObject';\nimport { TreeNode } from './tree-node';\nimport {\n  TreeNodeValue,\n  TypeIdMap,\n  TypeTimer,\n  TypeTargetNode,\n  TypeTreeNodeData,\n  TypeTreeStoreOptions,\n  TypeTreeFilter,\n  TypeTreeFilterOptions,\n  TypeRelatedNodesOptions,\n  TypeTreeEventState,\n} from './types';\n\n// 构建一个树的数据模型\n// 基本设计思想：写入时更新，减少读取消耗，以减少未来实现虚拟滚动所需的计算量\n// 任何一次数据写入，会触发相应节点的状态更新\nexport class TreeStore {\n  // 根节点集合\n  public children: TreeNode[];\n\n  // 所有节点集合\n  public nodes: TreeNode[];\n\n  // 所有节点映射\n  public nodeMap: Map<TreeNodeValue, TreeNode>;\n\n  // 配置选项\n  public config: TypeTreeStoreOptions;\n\n  // 活动节点集合\n  public activedMap: TypeIdMap;\n\n  // 数据被更新的节点集合\n  public updatedMap: TypeIdMap;\n\n  // 选中节点集合\n  public checkedMap: TypeIdMap;\n\n  // 展开节点的集合\n  public expandedMap: TypeIdMap;\n\n  // 符合过滤条件的节点的集合\n  public filterMap: TypeIdMap;\n\n  // 数据更新计时器\n  public updateTimer: TypeTimer;\n\n  // 识别是否需要重排\n  public shouldReflow: boolean;\n\n  // 树节点过滤器\n  public prevFilter: TypeTreeFilter;\n\n  public constructor(options: TypeTreeStoreOptions) {\n    const config: TypeTreeStoreOptions = {\n      prefix: 't',\n      keys: {},\n      expandAll: false,\n      expandLevel: 0,\n      expandMutex: false,\n      expandParent: false,\n      activable: false,\n      activeMultiple: false,\n      checkable: false,\n      checkStrictly: false,\n      disabled: false,\n      load: null,\n      lazy: false,\n      valueMode: 'onlyLeaf',\n      filter: null,\n      onLoad: null,\n      onReflow: null,\n      onUpdate: null,\n      ...options,\n    };\n    this.config = config;\n    this.nodes = [];\n    this.children = [];\n    this.nodeMap = new Map();\n    this.activedMap = new Map();\n    this.expandedMap = new Map();\n    this.checkedMap = new Map();\n    this.updatedMap = new Map();\n    this.filterMap = new Map();\n    this.prevFilter = null;\n    // 这个计时器确保频繁的 update 事件被归纳为1次完整数据更新后的触发\n    this.updateTimer = null;\n    // 在子节点增删改查时，将此属性设置为 true，来触发视图更新\n    this.shouldReflow = false;\n  }\n\n  // 配置选项\n  public setConfig(options: TypeTreeStoreOptions) {\n    let hasChanged = false;\n    Object.keys(options).forEach((key) => {\n      const val = options[key];\n      if (val !== this.config[key]) {\n        hasChanged = true;\n        this.config[key] = val;\n      }\n    });\n    if (hasChanged) {\n      // 在 td-tree 的 render 方法中调用 setConfig\n      // 这样减少了 watch 属性\n      // 仅在属性变更后刷新状态\n      // 这样可以避免触发渲染死循环\n      this.refreshState();\n    }\n  }\n\n  // 获取根孩子节点列表\n  public getChildren() {\n    return this.children;\n  }\n\n  // 获取节点对象\n  public getNode(item: TypeTargetNode): TreeNode {\n    let node = null;\n    if (typeof item === 'string' || typeof item === 'number') {\n      node = this.nodeMap.get(item);\n    } else if (item instanceof TreeNode) {\n      node = this.nodeMap.get(item.value);\n    }\n    return node;\n  }\n\n  // 获取节点在总节点列表中的位置\n  public getIndex(node: TreeNode): number {\n    return this.nodes.indexOf(node);\n  }\n\n  // 获取指定节点的父节点\n  public getParent(value: TypeTargetNode): TreeNode {\n    let parent = null;\n    const node = this.getNode(value);\n    if (node) {\n      parent = node.getParent();\n    }\n    return parent;\n  }\n\n  // 获取指定节点的所有父节点\n  public getParents(value: TypeTargetNode): TreeNode[] {\n    const node = this.getNode(value);\n    let parents: TreeNode[] = [];\n    if (node) {\n      parents = node.getParents();\n    }\n    return parents;\n  }\n\n  // 获取指定节点在其所在 children 中的位置\n  public getNodeIndex(value: TypeTargetNode): number {\n    const node = this.getNode(value);\n    let index = -1;\n    if (node) {\n      index = node.getIndex();\n    }\n    return index;\n  }\n\n  // 获取所有符合条件的节点\n  public getNodes(\n    item?: TypeTargetNode,\n    options?: TypeTreeFilterOptions,\n  ): TreeNode[] {\n    let nodes: TreeNode[] = [];\n    let val: TreeNodeValue = '';\n    if (typeof item === 'string' || typeof item === 'number') {\n      val = item;\n    } else if (item instanceof TreeNode) {\n      val = item.value;\n    }\n    if (!val) {\n      nodes = this.nodes.slice(0);\n    } else {\n      const node = this.getNode(val);\n      if (node) {\n        nodes = node.walk();\n      }\n    }\n\n    if (options) {\n      const conf: TypeTreeFilterOptions = {\n        filter: null,\n        level: Infinity,\n        ...options,\n      };\n      if (typeof conf.level === 'number' && conf.level !== Infinity) {\n        nodes = nodes.filter((node) => node.level <= conf.level);\n      }\n      if (typeof conf.filter === 'function') {\n        nodes = nodes.filter((node) => {\n          const nodeModel = node.getModel();\n          return conf.filter(nodeModel);\n        });\n      }\n      if (isPlainObject(conf.props)) {\n        nodes = nodes.filter((node) => {\n          const result = Object.keys(conf.props).every((key) => {\n            const propEqual = node[key] === conf.props[key];\n            return propEqual;\n          });\n          return result;\n        });\n      }\n    }\n    return nodes;\n  }\n\n  // 给树添加节点数据\n  public append(list: TypeTreeNodeData[]): void {\n    list.forEach((item) => {\n      const node = new TreeNode(this, item);\n      this.children.push(node);\n    });\n    this.reflow();\n  }\n\n  // 重新加载数据\n  public reload(list: TypeTreeNodeData[]): void {\n    this.expandedMap.clear();\n    this.checkedMap.clear();\n    this.activedMap.clear();\n    this.filterMap.clear();\n    this.removeAll();\n    this.append(list);\n  }\n\n  // 解析节点数据，适配多种节点类型\n  public parseNodeData(\n    para: TreeNodeValue | TreeNode | TypeTreeNodeData,\n    item: TypeTreeNodeData | TypeTreeNodeData[] | TreeNode,\n  ) {\n    let value: TreeNodeValue = '';\n    let node = null;\n    let data = null;\n\n    if (typeof para === 'string' || typeof para === 'number') {\n      value = para;\n      data = item;\n      node = this.getNode(value);\n    } else if (para instanceof TreeNode) {\n      node = para;\n      data = item;\n    } else {\n      data = para;\n    }\n    const spec = {\n      node,\n      data,\n    };\n    return spec;\n  }\n\n  /**\n   * 向指定节点追加节点或者数据\n   * 支持下列使用方式\n   * item: 节点数据, TreeNode: 节点实例, value: 节点值(ID)\n   * appendNodes(item)\n   * appendNodes(TreeNode)\n   * appendNodes(value, item)\n   * appendNodes(value, TreeNode)\n   * appendNodes(TreeNode, item)\n   * appendNodes(TreeNode, TreeNode)\n   */\n  public appendNodes(\n    para?: TypeTargetNode | TypeTreeNodeData,\n    item?: TypeTreeNodeData | TreeNode,\n  ): void {\n    const spec = this.parseNodeData(para, item);\n    if (spec.data) {\n      if (!spec.node) {\n        // 在根节点插入\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this);\n        } else if (Array.isArray(spec.data)) {\n          this.append(spec.data);\n        } else {\n          this.append([spec.data]);\n        }\n      } else {\n        // 插入到目标节点之下\n        if (spec.data instanceof TreeNode) {\n          spec.data.appendTo(this, spec.node);\n        } else if (Array.isArray(spec.data)) {\n          spec.node.append(spec.data);\n        } else {\n          spec.node.append([spec.data]);\n        }\n        spec.node.updateRelated();\n      }\n    }\n  }\n\n  // 在目标节点之前插入节点\n  public insertBefore(value: TypeTargetNode, item: TypeTreeNodeData): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertBefore(item);\n    }\n  }\n\n  // 在目标节点之后插入节点\n  public insertAfter(value: TypeTargetNode, item: TypeTreeNodeData): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.insertAfter(item);\n    }\n  }\n\n  // 更新树结构\n  // 清空 nodes 数组，然后遍历所有根节点重新插入 node\n  public refreshNodes(): void {\n    const { children, nodes } = this;\n    nodes.length = 0;\n    children.forEach((node) => {\n      const list = node.walk();\n      Array.prototype.push.apply(nodes, list);\n    });\n  }\n\n  // 更新所有树节点状态\n  public refreshState(): void {\n    const { nodes } = this;\n    nodes.forEach((node) => {\n      node.update();\n      node.updateChecked();\n    });\n  }\n\n  // 节点重排\n  // 应该仅在树节点增删改查时调用\n  public reflow(node?: TreeNode): void {\n    this.shouldReflow = true;\n    this.updated(node);\n  }\n\n  // 触发更新事件\n  // 节点属性变更时调用\n  public updated(node?: TreeNode): void {\n    if (node?.value) {\n      this.updatedMap.set(node.value, true);\n    }\n    if (this.updateTimer) return;\n    this.updateTimer = +setTimeout(() => {\n      clearTimeout(this.updateTimer);\n      this.updateTimer = null;\n\n      // 检查节点是否需要回流，重排数组\n      if (this.shouldReflow) {\n        this.refreshNodes();\n        this.emit('reflow');\n      }\n\n      // 检查节点是否有被过滤，锁定路径节点\n      // 在此之前要遍历节点生成一个经过排序的节点数组\n      // 以便于优化锁定检查算法\n      this.lockFilterPathNodes();\n\n      const updatedList = Array.from(this.updatedMap.keys());\n      if (updatedList.length > 0) {\n        // 统计需要更新状态的节点，派发更新事件\n        const updatedNodes = updatedList.map((value) => this.getNode(value));\n        this.emit('update', {\n          nodes: updatedNodes,\n          map: this.updatedMap,\n        });\n      } else if (this.shouldReflow) {\n        // 单纯的回流不需要更新节点状态\n        // 但需要触发更新事件\n        this.emit('update', {\n          nodes: [],\n          map: this.updatedMap,\n        });\n      }\n\n      // 每次回流检查完毕，还原检查状态\n      this.shouldReflow = false;\n      this.updatedMap.clear();\n    });\n  }\n\n  // 获取激活节点集合\n  public getActived(map?: TypeIdMap): TreeNodeValue[] {\n    const activedMap = map || this.activedMap;\n    return Array.from(activedMap.keys());\n  }\n\n  // 获取指定范围的高亮节点\n  public getActivedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isActived());\n    return nodes;\n  }\n\n  // 替换激活态\n  public replaceActived(list: TreeNodeValue[]): void {\n    this.resetActived();\n    this.setActived(list);\n  }\n\n  // 设置激活态\n  public setActived(actived: TreeNodeValue[]): void {\n    const { activeMultiple } = this.config;\n    const list = actived.slice(0);\n    if (!activeMultiple) {\n      list.length = 1;\n    }\n    list.forEach((val) => {\n      this.activedMap.set(val, true);\n      const node = this.getNode(val);\n      if (node) {\n        node.update();\n      }\n    });\n  }\n\n  // 重置激活态\n  public resetActived(): void {\n    const actived = this.getActived();\n    this.activedMap.clear();\n    const relatedNodes = this.getRelatedNodes(actived);\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 获取展开节点集合\n  public getExpanded(map?: TypeIdMap): TreeNodeValue[] {\n    const expandedMap = map || this.expandedMap;\n    return Array.from(expandedMap.keys());\n  }\n\n  // 替换展开节点\n  public replaceExpanded(list: TreeNodeValue[]): void {\n    const expanded = this.getExpanded();\n    const added = difference(list, expanded);\n    const removed = difference(expanded, list);\n    this.setExpandedDirectly(removed, false);\n    this.updateExpanded(removed);\n    this.setExpanded(added);\n  }\n\n  // 批量设置展开节点\n  public setExpanded(list: TreeNodeValue[]): void {\n    this.setExpandedDirectly(list);\n    this.updateExpanded(list);\n  }\n\n  // 直接设置展开节点数据，不更新节点状态\n  public setExpandedDirectly(list: TreeNodeValue[], expanded = true): void {\n    list.forEach((val) => {\n      if (expanded) {\n        this.expandedMap.set(val, true);\n        const node = this.getNode(val);\n        if (node) {\n          node.afterExpanded();\n        }\n      } else {\n        this.expandedMap.delete(val);\n      }\n    });\n  }\n\n  // 清除所有展开节点\n  public resetExpanded(): void {\n    const expanded = this.getExpanded();\n    this.expandedMap.clear();\n    this.updateExpanded(expanded);\n  }\n\n  // 更新展开节点相关节点的状态\n  public updateExpanded(list: TreeNodeValue[]): void {\n    const relatedNodes = this.getRelatedNodes(list, {\n      withParents: false,\n    });\n    relatedNodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 获取选中态节点 value 数组\n  public getChecked(map?: TypeIdMap): TreeNodeValue[] {\n    const { nodes, config } = this;\n    const { valueMode, checkStrictly } = config;\n    const list: TreeNodeValue[] = [];\n    const checkedMap = map || this.checkedMap;\n    nodes.forEach((node) => {\n      if (node.isChecked(checkedMap)) {\n        if (valueMode === 'parentFirst' && !checkStrictly) {\n          if (!node.parent || !node.parent.isChecked(checkedMap)) {\n            list.push(node.value);\n          }\n        } else if (valueMode === 'onlyLeaf' && !checkStrictly) {\n          if (node.isLeaf()) {\n            list.push(node.value);\n          }\n        } else {\n          list.push(node.value);\n        }\n      }\n    });\n    return list;\n  }\n\n  // 获取指定节点下的选中节点\n  public getCheckedNodes(item?: TypeTargetNode): TreeNode[] {\n    let nodes = this.getNodes(item);\n    nodes = nodes.filter((node) => node.isChecked());\n    return nodes;\n  }\n\n  // 替换选中态列表\n  public replaceChecked(list: TreeNodeValue[]): void {\n    this.resetChecked();\n    this.setChecked(list);\n  }\n\n  // 批量设置选中态\n  public setChecked(list: TreeNodeValue[]): void {\n    const { valueMode, checkStrictly, checkable } = this.config;\n    if (!checkable) return;\n    list.forEach((val: TreeNodeValue) => {\n      const node = this.getNode(val);\n      if (node) {\n        if (valueMode === 'parentFirst' && !checkStrictly) {\n          const childrenNodes = node.walk();\n          childrenNodes.forEach((childNode) => {\n            this.checkedMap.set(childNode.value, true);\n          });\n        } else {\n          this.checkedMap.set(val, true);\n          node.updateChecked();\n        }\n      }\n    });\n    if (!checkStrictly) {\n      const checked = this.getChecked();\n      const relatedNodes = this.getRelatedNodes(checked);\n      relatedNodes.forEach((node) => {\n        node.updateChecked();\n      });\n    }\n  }\n\n  // 清除所有选中节点\n  public resetChecked(): void {\n    const checked = this.getChecked();\n    const relatedNodes = this.getRelatedNodes(checked);\n    this.checkedMap.clear();\n    relatedNodes.forEach((node) => {\n      node.updateChecked();\n    });\n  }\n\n  // 更新全部节点状态\n  public updateAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.update();\n    });\n  }\n\n  // 移除指定节点\n  public remove(value?: TypeTargetNode): void {\n    const node = this.getNode(value);\n    if (node) {\n      node.remove();\n    }\n  }\n\n  // 清空所有节点\n  public removeAll(): void {\n    const nodes = this.getNodes();\n    nodes.forEach((node) => {\n      node.remove();\n    });\n  }\n\n  // 获取节点状态变化可能影响的周边节点\n  // 实现最小遍历集合\n  public getRelatedNodes(\n    list: TreeNodeValue[],\n    options?: TypeRelatedNodesOptions,\n  ): TreeNode[] {\n    const conf = {\n      withParents: true,\n      ...options,\n    };\n    const map = new Map();\n    list.forEach((value) => {\n      if (map.get(value)) return;\n      const node = this.getNode(value);\n      if (node) {\n        const parents = node.getParents();\n        const children = node.walk();\n        let related = [];\n        if (conf.withParents) {\n          related = parents.concat(children);\n        } else {\n          related = children;\n        }\n        related.forEach((relatedNode) => {\n          map.set(relatedNode.value, relatedNode);\n        });\n      }\n    });\n    const relatedNodes = Array.from(map.values());\n    return relatedNodes;\n  }\n\n  // 触发绑定的事件\n  public emit(name: string, state?: TypeTreeEventState): void {\n    const config = this.config || {};\n    const methodName = camelCase(`on-${name}`);\n    const method = config[methodName];\n    if (typeof method === 'function') {\n      method(state);\n    }\n  }\n\n  // 锁定过滤节点的路径节点\n  // 使得路径节点展开，可见，且不可操作\n  public lockFilterPathNodes() {\n    const {\n      config,\n      filterMap,\n    } = this;\n\n    // 之前没有设置过过滤器\n    // 当前也没有过滤器\n    // 则无需处理锁定节点\n    if (!config.filter && !this.prevFilter) {\n      return;\n    }\n    this.prevFilter = config.filter;\n\n    const allNodes = this.getNodes();\n    allNodes.forEach((node: TreeNode) => {\n      node.lock(false);\n    });\n    if (allNodes.length === filterMap.size) {\n      // 未经任何过滤，则无需处理锁定节点\n      return;\n    }\n\n    // 构造路径节点map\n    const map = new Map();\n\n    // 全部节点要经过排序，才能使用这个算法\n    // 比起每个过滤节点调用 getParents 方法检查父节点状态\n    // 算法复杂度 O(N*log(N)) => O(N)\n    allNodes.reverse().forEach((item: TreeNode) => {\n      const node = item;\n\n      // 被过滤节点父节点固定为展开状态\n      const parent = node.getParent();\n      if (node.vmIsRest) {\n        if (parent) {\n          parent.expanded = true;\n        }\n        // 被过滤节点固定为展示状态\n        node.visible = true;\n      }\n      if (node.vmIsRest || map.get(node.value)) {\n        if (parent && !parent.vmIsRest) {\n          map.set(parent.value, true);\n        }\n      }\n    });\n\n    // 锁定路径节点展示样式\n    const filterPathValues = Array.from(map.keys());\n    filterPathValues.forEach((value: TreeNodeValue) => {\n      const node = this.getNode(value);\n      if (node) {\n        node.lock(true);\n      }\n    });\n  }\n}\n\nexport default TreeStore;\n"],"names":["TreeStore","options","config","prefix","keys","expandAll","expandLevel","expandMutex","expandParent","activable","activeMultiple","checkable","checkStrictly","disabled","load","lazy","valueMode","filter","onLoad","onReflow","onUpdate","nodes","children","nodeMap","Map","activedMap","expandedMap","checkedMap","updatedMap","filterMap","prevFilter","updateTimer","shouldReflow","hasChanged","Object","forEach","key","val","refreshState","item","node","get","TreeNode","value","indexOf","parent","getNode","getParent","parents","getParents","index","getIndex","slice","walk","conf","level","Infinity","nodeModel","getModel","isPlainObject","props","result","every","propEqual","list","push","reflow","clear","removeAll","append","para","data","spec","parseNodeData","appendTo","Array","isArray","updateRelated","insertBefore","insertAfter","length","prototype","apply","update","updateChecked","updated","set","setTimeout","clearTimeout","refreshNodes","emit","lockFilterPathNodes","updatedList","from","updatedNodes","map","getNodes","isActived","resetActived","setActived","actived","getActived","relatedNodes","getRelatedNodes","expanded","getExpanded","added","difference","removed","setExpandedDirectly","updateExpanded","setExpanded","afterExpanded","withParents","isChecked","isLeaf","resetChecked","setChecked","childrenNodes","childNode","checked","getChecked","remove","related","concat","relatedNode","values","name","state","methodName","camelCase","method","allNodes","lock","size","reverse","vmIsRest","visible","filterPathValues"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;IAIaA,SAAb;AAaE,qBAAYC,OAAZ,EAAqB;AAAA;;AACnB,QAAMC,MAAM;AACVC,MAAAA,MAAM,EAAE,GADE;AAEVC,MAAAA,IAAI,EAAE,EAFI;AAGVC,MAAAA,SAAS,EAAE,KAHD;AAIVC,MAAAA,WAAW,EAAE,CAJH;AAKVC,MAAAA,WAAW,EAAE,KALH;AAMVC,MAAAA,YAAY,EAAE,KANJ;AAOVC,MAAAA,SAAS,EAAE,KAPD;AAQVC,MAAAA,cAAc,EAAE,KARN;AASVC,MAAAA,SAAS,EAAE,KATD;AAUVC,MAAAA,aAAa,EAAE,KAVL;AAWVC,MAAAA,QAAQ,EAAE,KAXA;AAYVC,MAAAA,IAAI,EAAE,IAZI;AAaVC,MAAAA,IAAI,EAAE,KAbI;AAcVC,MAAAA,SAAS,EAAE,UAdD;AAeVC,MAAAA,MAAM,EAAE,IAfE;AAgBVC,MAAAA,MAAM,EAAE,IAhBE;AAiBVC,MAAAA,QAAQ,EAAE,IAjBA;AAkBVC,MAAAA,QAAQ,EAAE;AAlBA,OAmBPnB,OAnBO,CAAZ;;AAqBA,SAAKC,MAAL,GAAcA,MAAd;AACA,SAAKmB,KAAL,GAAa,EAAb;AACA,SAAKC,QAAL,GAAgB,EAAhB;AACA,SAAKC,OAAL,kBAA+B,IAAIC,GAAJ,EAA/B;AACA,SAAKC,UAAL,kBAAkC,IAAID,GAAJ,EAAlC;AACA,SAAKE,WAAL,kBAAmC,IAAIF,GAAJ,EAAnC;AACA,SAAKG,UAAL,kBAAkC,IAAIH,GAAJ,EAAlC;AACA,SAAKI,UAAL,kBAAkC,IAAIJ,GAAJ,EAAlC;AACA,SAAKK,SAAL,kBAAiC,IAAIL,GAAJ,EAAjC;AACA,SAAKM,UAAL,GAAkB,IAAlB;AACA,SAAKC,WAAL,GAAmB,IAAnB;AACA,SAAKC,YAAL,GAAoB,KAApB;AACD;;AA/CH;AAAA;AAAA,WAgDE,mBAAU/B,OAAV,EAAmB;AAAA;;AACjB,UAAIgC,UAAU,GAAG,KAAjB;AACAC,MAAAA,MAAM,CAAC9B,IAAP,CAAYH,OAAZ,EAAqBkC,OAArB,CAA6B,UAACC,GAAD,EAAS;AACpC,YAAMC,GAAG,GAAGpC,OAAO,CAACmC,GAAD,CAAnB;;AACA,YAAIC,GAAG,KAAK,KAAI,CAACnC,MAAL,CAAYkC,GAAZ,CAAZ,EAA8B;AAC5BH,UAAAA,UAAU,GAAG,IAAb;AACA,UAAA,KAAI,CAAC/B,MAAL,CAAYkC,GAAZ,IAAmBC,GAAnB;AACD;AACF,OAND;;AAOA,UAAIJ,UAAJ,EAAgB;AACd,aAAKK,YAAL;AACD;AACF;AA5DH;AAAA;AAAA,WA6DE,uBAAc;AACZ,aAAO,KAAKhB,QAAZ;AACD;AA/DH;AAAA;AAAA,WAgEE,iBAAQiB,IAAR,EAAc;AACZ,UAAIC,IAAI,GAAG,IAAX;;AACA,UAAI,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,QAAhD,EAA0D;AACxDC,QAAAA,IAAI,GAAG,KAAKjB,OAAL,CAAakB,GAAb,CAAiBF,IAAjB,CAAP;AACD,OAFD,MAEO,IAAIA,IAAI,YAAYG,iCAApB,EAA8B;AACnCF,QAAAA,IAAI,GAAG,KAAKjB,OAAL,CAAakB,GAAb,CAAiBF,IAAI,CAACI,KAAtB,CAAP;AACD;;AACD,aAAOH,IAAP;AACD;AAxEH;AAAA;AAAA,WAyEE,kBAASA,IAAT,EAAe;AACb,aAAO,KAAKnB,KAAL,CAAWuB,OAAX,CAAmBJ,IAAnB,CAAP;AACD;AA3EH;AAAA;AAAA,WA4EE,mBAAUG,KAAV,EAAiB;AACf,UAAIE,MAAM,GAAG,IAAb;AACA,UAAML,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;;AACA,UAAIH,IAAJ,EAAU;AACRK,QAAAA,MAAM,GAAGL,IAAI,CAACO,SAAL,EAAT;AACD;;AACD,aAAOF,MAAP;AACD;AAnFH;AAAA;AAAA,WAoFE,oBAAWF,KAAX,EAAkB;AAChB,UAAMH,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;AACA,UAAIK,OAAO,GAAG,EAAd;;AACA,UAAIR,IAAJ,EAAU;AACRQ,QAAAA,OAAO,GAAGR,IAAI,CAACS,UAAL,EAAV;AACD;;AACD,aAAOD,OAAP;AACD;AA3FH;AAAA;AAAA,WA4FE,sBAAaL,KAAb,EAAoB;AAClB,UAAMH,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;AACA,UAAIO,KAAK,GAAG,CAAC,CAAb;;AACA,UAAIV,IAAJ,EAAU;AACRU,QAAAA,KAAK,GAAGV,IAAI,CAACW,QAAL,EAAR;AACD;;AACD,aAAOD,KAAP;AACD;AAnGH;AAAA;AAAA,WAoGE,kBAASX,IAAT,EAAetC,OAAf,EAAwB;AACtB,UAAIoB,KAAK,GAAG,EAAZ;AACA,UAAIgB,GAAG,GAAG,EAAV;;AACA,UAAI,OAAOE,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,QAAhD,EAA0D;AACxDF,QAAAA,GAAG,GAAGE,IAAN;AACD,OAFD,MAEO,IAAIA,IAAI,YAAYG,iCAApB,EAA8B;AACnCL,QAAAA,GAAG,GAAGE,IAAI,CAACI,KAAX;AACD;;AACD,UAAI,CAACN,GAAL,EAAU;AACRhB,QAAAA,KAAK,GAAG,KAAKA,KAAL,CAAW+B,KAAX,CAAiB,CAAjB,CAAR;AACD,OAFD,MAEO;AACL,YAAMZ,IAAI,GAAG,KAAKM,OAAL,CAAaT,GAAb,CAAb;;AACA,YAAIG,IAAJ,EAAU;AACRnB,UAAAA,KAAK,GAAGmB,IAAI,CAACa,IAAL,EAAR;AACD;AACF;;AACD,UAAIpD,OAAJ,EAAa;AACX,YAAMqD,IAAI;AACRrC,UAAAA,MAAM,EAAE,IADA;AAERsC,UAAAA,KAAK,EAAEC;AAFC,WAGLvD,OAHK,CAAV;;AAKA,YAAI,OAAOqD,IAAI,CAACC,KAAZ,KAAsB,QAAtB,IAAkCD,IAAI,CAACC,KAAL,KAAeC,QAArD,EAA+D;AAC7DnC,UAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD;AAAA,mBAAUA,IAAI,CAACe,KAAL,IAAcD,IAAI,CAACC,KAA7B;AAAA,WAAb,CAAR;AACD;;AACD,YAAI,OAAOD,IAAI,CAACrC,MAAZ,KAAuB,UAA3B,EAAuC;AACrCI,UAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD,EAAU;AAC7B,gBAAMiB,SAAS,GAAGjB,IAAI,CAACkB,QAAL,EAAlB;AACA,mBAAOJ,IAAI,CAACrC,MAAL,CAAYwC,SAAZ,CAAP;AACD,WAHO,CAAR;AAID;;AACD,YAAIE,yBAAa,CAACL,IAAI,CAACM,KAAN,CAAjB,EAA+B;AAC7BvC,UAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD,EAAU;AAC7B,gBAAMqB,MAAM,GAAG3B,MAAM,CAAC9B,IAAP,CAAYkD,IAAI,CAACM,KAAjB,EAAwBE,KAAxB,CAA8B,UAAC1B,GAAD,EAAS;AACpD,kBAAM2B,SAAS,GAAGvB,IAAI,CAACJ,GAAD,CAAJ,KAAckB,IAAI,CAACM,KAAL,CAAWxB,GAAX,CAAhC;AACA,qBAAO2B,SAAP;AACD,aAHc,CAAf;AAIA,mBAAOF,MAAP;AACD,WANO,CAAR;AAOD;AACF;;AACD,aAAOxC,KAAP;AACD;AA9IH;AAAA;AAAA,WA+IE,gBAAO2C,IAAP,EAAa;AAAA;;AACXA,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACI,IAAD,EAAU;AACrB,YAAMC,IAAI,GAAG,IAAIE,iCAAJ,CAAa,MAAb,EAAmBH,IAAnB,CAAb;;AACA,QAAA,MAAI,CAACjB,QAAL,CAAc2C,IAAd,CAAmBzB,IAAnB;AACD,OAHD;AAIA,WAAK0B,MAAL;AACD;AArJH;AAAA;AAAA,WAsJE,gBAAOF,IAAP,EAAa;AACX,WAAKtC,WAAL,CAAiByC,KAAjB;AACA,WAAKxC,UAAL,CAAgBwC,KAAhB;AACA,WAAK1C,UAAL,CAAgB0C,KAAhB;AACA,WAAKtC,SAAL,CAAesC,KAAf;AACA,WAAKC,SAAL;AACA,WAAKC,MAAL,CAAYL,IAAZ;AACD;AA7JH;AAAA;AAAA,WA8JE,uBAAcM,IAAd,EAAoB/B,IAApB,EAA0B;AACxB,UAAII,KAAK,GAAG,EAAZ;AACA,UAAIH,IAAI,GAAG,IAAX;AACA,UAAI+B,IAAI,GAAG,IAAX;;AACA,UAAI,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,QAAhD,EAA0D;AACxD3B,QAAAA,KAAK,GAAG2B,IAAR;AACAC,QAAAA,IAAI,GAAGhC,IAAP;AACAC,QAAAA,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAP;AACD,OAJD,MAIO,IAAI2B,IAAI,YAAY5B,iCAApB,EAA8B;AACnCF,QAAAA,IAAI,GAAG8B,IAAP;AACAC,QAAAA,IAAI,GAAGhC,IAAP;AACD,OAHM,MAGA;AACLgC,QAAAA,IAAI,GAAGD,IAAP;AACD;;AACD,UAAME,IAAI,GAAG;AACXhC,QAAAA,IAAI,EAAJA,IADW;AAEX+B,QAAAA,IAAI,EAAJA;AAFW,OAAb;AAIA,aAAOC,IAAP;AACD;AAjLH;AAAA;AAAA,WAkLE,qBAAYF,IAAZ,EAAkB/B,IAAlB,EAAwB;AACtB,UAAMiC,IAAI,GAAG,KAAKC,aAAL,CAAmBH,IAAnB,EAAyB/B,IAAzB,CAAb;;AACA,UAAIiC,IAAI,CAACD,IAAT,EAAe;AACb,YAAI,CAACC,IAAI,CAAChC,IAAV,EAAgB;AACd,cAAIgC,IAAI,CAACD,IAAL,YAAqB7B,iCAAzB,EAAmC;AACjC8B,YAAAA,IAAI,CAACD,IAAL,CAAUG,QAAV,CAAmB,IAAnB;AACD,WAFD,MAEO,IAAIC,KAAK,CAACC,OAAN,CAAcJ,IAAI,CAACD,IAAnB,CAAJ,EAA8B;AACnC,iBAAKF,MAAL,CAAYG,IAAI,CAACD,IAAjB;AACD,WAFM,MAEA;AACL,iBAAKF,MAAL,CAAY,CAACG,IAAI,CAACD,IAAN,CAAZ;AACD;AACF,SARD,MAQO;AACL,cAAIC,IAAI,CAACD,IAAL,YAAqB7B,iCAAzB,EAAmC;AACjC8B,YAAAA,IAAI,CAACD,IAAL,CAAUG,QAAV,CAAmB,IAAnB,EAAyBF,IAAI,CAAChC,IAA9B;AACD,WAFD,MAEO,IAAImC,KAAK,CAACC,OAAN,CAAcJ,IAAI,CAACD,IAAnB,CAAJ,EAA8B;AACnCC,YAAAA,IAAI,CAAChC,IAAL,CAAU6B,MAAV,CAAiBG,IAAI,CAACD,IAAtB;AACD,WAFM,MAEA;AACLC,YAAAA,IAAI,CAAChC,IAAL,CAAU6B,MAAV,CAAiB,CAACG,IAAI,CAACD,IAAN,CAAjB;AACD;;AACDC,UAAAA,IAAI,CAAChC,IAAL,CAAUqC,aAAV;AACD;AACF;AACF;AAxMH;AAAA;AAAA,WAyME,sBAAalC,KAAb,EAAoBJ,IAApB,EAA0B;AACxB,UAAMC,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;;AACA,UAAIH,IAAJ,EAAU;AACRA,QAAAA,IAAI,CAACsC,YAAL,CAAkBvC,IAAlB;AACD;AACF;AA9MH;AAAA;AAAA,WA+ME,qBAAYI,KAAZ,EAAmBJ,IAAnB,EAAyB;AACvB,UAAMC,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;;AACA,UAAIH,IAAJ,EAAU;AACRA,QAAAA,IAAI,CAACuC,WAAL,CAAiBxC,IAAjB;AACD;AACF;AApNH;AAAA;AAAA,WAqNE,wBAAe;AACb,UAAQjB,QAAR,GAA4B,IAA5B,CAAQA,QAAR;AAAA,UAAkBD,KAAlB,GAA4B,IAA5B,CAAkBA,KAAlB;AACAA,MAAAA,KAAK,CAAC2D,MAAN,GAAe,CAAf;AACA1D,MAAAA,QAAQ,CAACa,OAAT,CAAiB,UAACK,IAAD,EAAU;AACzB,YAAMwB,IAAI,GAAGxB,IAAI,CAACa,IAAL,EAAb;AACAsB,QAAAA,KAAK,CAACM,SAAN,CAAgBhB,IAAhB,CAAqBiB,KAArB,CAA2B7D,KAA3B,EAAkC2C,IAAlC;AACD,OAHD;AAID;AA5NH;AAAA;AAAA,WA6NE,wBAAe;AACb,UAAQ3C,KAAR,GAAkB,IAAlB,CAAQA,KAAR;AACAA,MAAAA,KAAK,CAACc,OAAN,CAAc,UAACK,IAAD,EAAU;AACtBA,QAAAA,IAAI,CAAC2C,MAAL;AACA3C,QAAAA,IAAI,CAAC4C,aAAL;AACD,OAHD;AAID;AAnOH;AAAA;AAAA,WAoOE,gBAAO5C,IAAP,EAAa;AACX,WAAKR,YAAL,GAAoB,IAApB;AACA,WAAKqD,OAAL,CAAa7C,IAAb;AACD;AAvOH;AAAA;AAAA,WAwOE,iBAAQA,IAAR,EAAc;AAAA;;AACZ,UAAIA,IAAJ,aAAIA,IAAJ,eAAIA,IAAI,CAAEG,KAAV,EAAiB;AACf,aAAKf,UAAL,CAAgB0D,GAAhB,CAAoB9C,IAAI,CAACG,KAAzB,EAAgC,IAAhC;AACD;;AACD,UAAI,KAAKZ,WAAT,EACE;AACF,WAAKA,WAAL,GAAmB,CAACwD,UAAU,CAAC,YAAM;AACnCC,QAAAA,YAAY,CAAC,MAAI,CAACzD,WAAN,CAAZ;AACA,QAAA,MAAI,CAACA,WAAL,GAAmB,IAAnB;;AACA,YAAI,MAAI,CAACC,YAAT,EAAuB;AACrB,UAAA,MAAI,CAACyD,YAAL;;AACA,UAAA,MAAI,CAACC,IAAL,CAAU,QAAV;AACD;;AACD,QAAA,MAAI,CAACC,mBAAL;;AACA,YAAMC,WAAW,GAAGjB,KAAK,CAACkB,IAAN,CAAW,MAAI,CAACjE,UAAL,CAAgBxB,IAAhB,EAAX,CAApB;;AACA,YAAIwF,WAAW,CAACZ,MAAZ,GAAqB,CAAzB,EAA4B;AAC1B,cAAMc,YAAY,GAAGF,WAAW,CAACG,GAAZ,CAAgB,UAACpD,KAAD;AAAA,mBAAW,MAAI,CAACG,OAAL,CAAaH,KAAb,CAAX;AAAA,WAAhB,CAArB;;AACA,UAAA,MAAI,CAAC+C,IAAL,CAAU,QAAV,EAAoB;AAClBrE,YAAAA,KAAK,EAAEyE,YADW;AAElBC,YAAAA,GAAG,EAAE,MAAI,CAACnE;AAFQ,WAApB;AAID,SAND,MAMO,IAAI,MAAI,CAACI,YAAT,EAAuB;AAC5B,UAAA,MAAI,CAAC0D,IAAL,CAAU,QAAV,EAAoB;AAClBrE,YAAAA,KAAK,EAAE,EADW;AAElB0E,YAAAA,GAAG,EAAE,MAAI,CAACnE;AAFQ,WAApB;AAID;;AACD,QAAA,MAAI,CAACI,YAAL,GAAoB,KAApB;;AACA,QAAA,MAAI,CAACJ,UAAL,CAAgBuC,KAAhB;AACD,OAvB6B,CAA9B;AAwBD;AAtQH;AAAA;AAAA,WAuQE,oBAAW4B,GAAX,EAAgB;AACd,UAAMtE,UAAU,GAAGsE,GAAG,IAAI,KAAKtE,UAA/B;AACA,aAAOkD,KAAK,CAACkB,IAAN,CAAWpE,UAAU,CAACrB,IAAX,EAAX,CAAP;AACD;AA1QH;AAAA;AAAA,WA2QE,yBAAgBmC,IAAhB,EAAsB;AACpB,UAAIlB,KAAK,GAAG,KAAK2E,QAAL,CAAczD,IAAd,CAAZ;AACAlB,MAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD;AAAA,eAAUA,IAAI,CAACyD,SAAL,EAAV;AAAA,OAAb,CAAR;AACA,aAAO5E,KAAP;AACD;AA/QH;AAAA;AAAA,WAgRE,wBAAe2C,IAAf,EAAqB;AACnB,WAAKkC,YAAL;AACA,WAAKC,UAAL,CAAgBnC,IAAhB;AACD;AAnRH;AAAA;AAAA,WAoRE,oBAAWoC,OAAX,EAAoB;AAAA;;AAClB,UAAQ1F,cAAR,GAA2B,KAAKR,MAAhC,CAAQQ,cAAR;AACA,UAAMsD,IAAI,GAAGoC,OAAO,CAAChD,KAAR,CAAc,CAAd,CAAb;;AACA,UAAI,CAAC1C,cAAL,EAAqB;AACnBsD,QAAAA,IAAI,CAACgB,MAAL,GAAc,CAAd;AACD;;AACDhB,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACE,GAAD,EAAS;AACpB,QAAA,MAAI,CAACZ,UAAL,CAAgB6D,GAAhB,CAAoBjD,GAApB,EAAyB,IAAzB;;AACA,YAAMG,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaT,GAAb,CAAb;;AACA,YAAIG,IAAJ,EAAU;AACRA,UAAAA,IAAI,CAAC2C,MAAL;AACD;AACF,OAND;AAOD;AAjSH;AAAA;AAAA,WAkSE,wBAAe;AACb,UAAMiB,OAAO,GAAG,KAAKC,UAAL,EAAhB;AACA,WAAK5E,UAAL,CAAgB0C,KAAhB;AACA,UAAMmC,YAAY,GAAG,KAAKC,eAAL,CAAqBH,OAArB,CAArB;AACAE,MAAAA,YAAY,CAACnE,OAAb,CAAqB,UAACK,IAAD,EAAU;AAC7BA,QAAAA,IAAI,CAAC2C,MAAL;AACD,OAFD;AAGD;AAzSH;AAAA;AAAA,WA0SE,qBAAYY,GAAZ,EAAiB;AACf,UAAMrE,WAAW,GAAGqE,GAAG,IAAI,KAAKrE,WAAhC;AACA,aAAOiD,KAAK,CAACkB,IAAN,CAAWnE,WAAW,CAACtB,IAAZ,EAAX,CAAP;AACD;AA7SH;AAAA;AAAA,WA8SE,yBAAgB4D,IAAhB,EAAsB;AACpB,UAAMwC,QAAQ,GAAG,KAAKC,WAAL,EAAjB;AACA,UAAMC,KAAK,GAAGC,uBAAU,CAAC3C,IAAD,EAAOwC,QAAP,CAAxB;AACA,UAAMI,OAAO,GAAGD,uBAAU,CAACH,QAAD,EAAWxC,IAAX,CAA1B;AACA,WAAK6C,mBAAL,CAAyBD,OAAzB,EAAkC,KAAlC;AACA,WAAKE,cAAL,CAAoBF,OAApB;AACA,WAAKG,WAAL,CAAiBL,KAAjB;AACD;AArTH;AAAA;AAAA,WAsTE,qBAAY1C,IAAZ,EAAkB;AAChB,WAAK6C,mBAAL,CAAyB7C,IAAzB;AACA,WAAK8C,cAAL,CAAoB9C,IAApB;AACD;AAzTH;AAAA;AAAA,WA0TE,6BAAoBA,IAApB,EAA2C;AAAA;;AAAA,UAAjBwC,QAAiB,uEAAN,IAAM;AACzCxC,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACE,GAAD,EAAS;AACpB,YAAImE,QAAJ,EAAc;AACZ,UAAA,MAAI,CAAC9E,WAAL,CAAiB4D,GAAjB,CAAqBjD,GAArB,EAA0B,IAA1B;;AACA,cAAMG,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaT,GAAb,CAAb;;AACA,cAAIG,IAAJ,EAAU;AACRA,YAAAA,IAAI,CAACwE,aAAL;AACD;AACF,SAND,MAMO;AACL,UAAA,MAAI,CAACtF,WAAL,WAAwBW,GAAxB;AACD;AACF,OAVD;AAWD;AAtUH;AAAA;AAAA,WAuUE,yBAAgB;AACd,UAAMmE,QAAQ,GAAG,KAAKC,WAAL,EAAjB;AACA,WAAK/E,WAAL,CAAiByC,KAAjB;AACA,WAAK2C,cAAL,CAAoBN,QAApB;AACD;AA3UH;AAAA;AAAA,WA4UE,wBAAexC,IAAf,EAAqB;AACnB,UAAMsC,YAAY,GAAG,KAAKC,eAAL,CAAqBvC,IAArB,EAA2B;AAC9CiD,QAAAA,WAAW,EAAE;AADiC,OAA3B,CAArB;AAGAX,MAAAA,YAAY,CAACnE,OAAb,CAAqB,UAACK,IAAD,EAAU;AAC7BA,QAAAA,IAAI,CAAC2C,MAAL;AACD,OAFD;AAGD;AAnVH;AAAA;AAAA,WAoVE,oBAAWY,GAAX,EAAgB;AACd,UAAQ1E,KAAR,GAA0B,IAA1B,CAAQA,KAAR;AAAA,UAAenB,MAAf,GAA0B,IAA1B,CAAeA,MAAf;AACA,UAAQc,SAAR,GAAqCd,MAArC,CAAQc,SAAR;AAAA,UAAmBJ,aAAnB,GAAqCV,MAArC,CAAmBU,aAAnB;AACA,UAAMoD,IAAI,GAAG,EAAb;AACA,UAAMrC,UAAU,GAAGoE,GAAG,IAAI,KAAKpE,UAA/B;AACAN,MAAAA,KAAK,CAACc,OAAN,CAAc,UAACK,IAAD,EAAU;AACtB,YAAIA,IAAI,CAAC0E,SAAL,CAAevF,UAAf,CAAJ,EAAgC;AAC9B,cAAIX,SAAS,KAAK,aAAd,IAA+B,CAACJ,aAApC,EAAmD;AACjD,gBAAI,CAAC4B,IAAI,CAACK,MAAN,IAAgB,CAACL,IAAI,CAACK,MAAL,CAAYqE,SAAZ,CAAsBvF,UAAtB,CAArB,EAAwD;AACtDqC,cAAAA,IAAI,CAACC,IAAL,CAAUzB,IAAI,CAACG,KAAf;AACD;AACF,WAJD,MAIO,IAAI3B,SAAS,KAAK,UAAd,IAA4B,CAACJ,aAAjC,EAAgD;AACrD,gBAAI4B,IAAI,CAAC2E,MAAL,EAAJ,EAAmB;AACjBnD,cAAAA,IAAI,CAACC,IAAL,CAAUzB,IAAI,CAACG,KAAf;AACD;AACF,WAJM,MAIA;AACLqB,YAAAA,IAAI,CAACC,IAAL,CAAUzB,IAAI,CAACG,KAAf;AACD;AACF;AACF,OAdD;AAeA,aAAOqB,IAAP;AACD;AAzWH;AAAA;AAAA,WA0WE,yBAAgBzB,IAAhB,EAAsB;AACpB,UAAIlB,KAAK,GAAG,KAAK2E,QAAL,CAAczD,IAAd,CAAZ;AACAlB,MAAAA,KAAK,GAAGA,KAAK,CAACJ,MAAN,CAAa,UAACuB,IAAD;AAAA,eAAUA,IAAI,CAAC0E,SAAL,EAAV;AAAA,OAAb,CAAR;AACA,aAAO7F,KAAP;AACD;AA9WH;AAAA;AAAA,WA+WE,wBAAe2C,IAAf,EAAqB;AACnB,WAAKoD,YAAL;AACA,WAAKC,UAAL,CAAgBrD,IAAhB;AACD;AAlXH;AAAA;AAAA,WAmXE,oBAAWA,IAAX,EAAiB;AAAA;;AACf,yBAAgD,KAAK9D,MAArD;AAAA,UAAQc,SAAR,gBAAQA,SAAR;AAAA,UAAmBJ,aAAnB,gBAAmBA,aAAnB;AAAA,UAAkCD,SAAlC,gBAAkCA,SAAlC;AACA,UAAI,CAACA,SAAL,EACE;AACFqD,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACE,GAAD,EAAS;AACpB,YAAMG,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaT,GAAb,CAAb;;AACA,YAAIG,IAAJ,EAAU;AACR,cAAIxB,SAAS,KAAK,aAAd,IAA+B,CAACJ,aAApC,EAAmD;AACjD,gBAAM0G,aAAa,GAAG9E,IAAI,CAACa,IAAL,EAAtB;AACAiE,YAAAA,aAAa,CAACnF,OAAd,CAAsB,UAACoF,SAAD,EAAe;AACnC,cAAA,MAAI,CAAC5F,UAAL,CAAgB2D,GAAhB,CAAoBiC,SAAS,CAAC5E,KAA9B,EAAqC,IAArC;AACD,aAFD;AAGD,WALD,MAKO;AACL,YAAA,MAAI,CAAChB,UAAL,CAAgB2D,GAAhB,CAAoBjD,GAApB,EAAyB,IAAzB;;AACAG,YAAAA,IAAI,CAAC4C,aAAL;AACD;AACF;AACF,OAbD;;AAcA,UAAI,CAACxE,aAAL,EAAoB;AAClB,YAAM4G,OAAO,GAAG,KAAKC,UAAL,EAAhB;AACA,YAAMnB,YAAY,GAAG,KAAKC,eAAL,CAAqBiB,OAArB,CAArB;AACAlB,QAAAA,YAAY,CAACnE,OAAb,CAAqB,UAACK,IAAD,EAAU;AAC7BA,UAAAA,IAAI,CAAC4C,aAAL;AACD,SAFD;AAGD;AACF;AA5YH;AAAA;AAAA,WA6YE,wBAAe;AACb,UAAMoC,OAAO,GAAG,KAAKC,UAAL,EAAhB;AACA,UAAMnB,YAAY,GAAG,KAAKC,eAAL,CAAqBiB,OAArB,CAArB;AACA,WAAK7F,UAAL,CAAgBwC,KAAhB;AACAmC,MAAAA,YAAY,CAACnE,OAAb,CAAqB,UAACK,IAAD,EAAU;AAC7BA,QAAAA,IAAI,CAAC4C,aAAL;AACD,OAFD;AAGD;AApZH;AAAA;AAAA,WAqZE,qBAAY;AACV,UAAM/D,KAAK,GAAG,KAAK2E,QAAL,EAAd;AACA3E,MAAAA,KAAK,CAACc,OAAN,CAAc,UAACK,IAAD,EAAU;AACtBA,QAAAA,IAAI,CAAC2C,MAAL;AACD,OAFD;AAGD;AA1ZH;AAAA;AAAA,WA2ZE,gBAAOxC,KAAP,EAAc;AACZ,UAAMH,IAAI,GAAG,KAAKM,OAAL,CAAaH,KAAb,CAAb;;AACA,UAAIH,IAAJ,EAAU;AACRA,QAAAA,IAAI,CAACkF,MAAL;AACD;AACF;AAhaH;AAAA;AAAA,WAiaE,qBAAY;AACV,UAAMrG,KAAK,GAAG,KAAK2E,QAAL,EAAd;AACA3E,MAAAA,KAAK,CAACc,OAAN,CAAc,UAACK,IAAD,EAAU;AACtBA,QAAAA,IAAI,CAACkF,MAAL;AACD,OAFD;AAGD;AAtaH;AAAA;AAAA,WAuaE,yBAAgB1D,IAAhB,EAAsB/D,OAAtB,EAA+B;AAAA;;AAC7B,UAAMqD,IAAI;AACR2D,QAAAA,WAAW,EAAE;AADL,SAELhH,OAFK,CAAV;;AAIA,UAAM8F,GAAG,kBAAmB,IAAIvE,GAAJ,EAA5B;AACAwC,MAAAA,IAAI,CAAC7B,OAAL,CAAa,UAACQ,KAAD,EAAW;AACtB,YAAIoD,GAAG,CAACtD,GAAJ,CAAQE,KAAR,CAAJ,EACE;;AACF,YAAMH,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaH,KAAb,CAAb;;AACA,YAAIH,IAAJ,EAAU;AACR,cAAMQ,OAAO,GAAGR,IAAI,CAACS,UAAL,EAAhB;AACA,cAAM3B,QAAQ,GAAGkB,IAAI,CAACa,IAAL,EAAjB;AACA,cAAIsE,OAAO,GAAG,EAAd;;AACA,cAAIrE,IAAI,CAAC2D,WAAT,EAAsB;AACpBU,YAAAA,OAAO,GAAG3E,OAAO,CAAC4E,MAAR,CAAetG,QAAf,CAAV;AACD,WAFD,MAEO;AACLqG,YAAAA,OAAO,GAAGrG,QAAV;AACD;;AACDqG,UAAAA,OAAO,CAACxF,OAAR,CAAgB,UAAC0F,WAAD,EAAiB;AAC/B9B,YAAAA,GAAG,CAACT,GAAJ,CAAQuC,WAAW,CAAClF,KAApB,EAA2BkF,WAA3B;AACD,WAFD;AAGD;AACF,OAjBD;AAkBA,UAAMvB,YAAY,GAAG3B,KAAK,CAACkB,IAAN,CAAWE,GAAG,CAAC+B,MAAJ,EAAX,CAArB;AACA,aAAOxB,YAAP;AACD;AAjcH;AAAA;AAAA,WAkcE,cAAKyB,IAAL,EAAWC,KAAX,EAAkB;AAChB,UAAM9H,MAAM,GAAG,KAAKA,MAAL,IAAe,EAA9B;AACA,UAAM+H,UAAU,GAAGC,qBAAS,cAAOH,IAAP,EAA5B;AACA,UAAMI,MAAM,GAAGjI,MAAM,CAAC+H,UAAD,CAArB;;AACA,UAAI,OAAOE,MAAP,KAAkB,UAAtB,EAAkC;AAChCA,QAAAA,MAAM,CAACH,KAAD,CAAN;AACD;AACF;AAzcH;AAAA;AAAA,WA0cE,+BAAsB;AAAA;;AACpB,UACE9H,MADF,GAGI,IAHJ,CACEA,MADF;AAAA,UAEE2B,SAFF,GAGI,IAHJ,CAEEA,SAFF;;AAIA,UAAI,CAAC3B,MAAM,CAACe,MAAR,IAAkB,CAAC,KAAKa,UAA5B,EAAwC;AACtC;AACD;;AACD,WAAKA,UAAL,GAAkB5B,MAAM,CAACe,MAAzB;AACA,UAAMmH,QAAQ,GAAG,KAAKpC,QAAL,EAAjB;AACAoC,MAAAA,QAAQ,CAACjG,OAAT,CAAiB,UAACK,IAAD,EAAU;AACzBA,QAAAA,IAAI,CAAC6F,IAAL,CAAU,KAAV;AACD,OAFD;;AAGA,UAAID,QAAQ,CAACpD,MAAT,KAAoBnD,SAAS,CAACyG,IAAlC,EAAwC;AACtC;AACD;;AACD,UAAMvC,GAAG,kBAAmB,IAAIvE,GAAJ,EAA5B;AACA4G,MAAAA,QAAQ,CAACG,OAAT,GAAmBpG,OAAnB,CAA2B,UAACI,IAAD,EAAU;AACnC,YAAMC,IAAI,GAAGD,IAAb;AACA,YAAMM,MAAM,GAAGL,IAAI,CAACO,SAAL,EAAf;;AACA,YAAIP,IAAI,CAACgG,QAAT,EAAmB;AACjB,cAAI3F,MAAJ,EAAY;AACVA,YAAAA,MAAM,CAAC2D,QAAP,GAAkB,IAAlB;AACD;;AACDhE,UAAAA,IAAI,CAACiG,OAAL,GAAe,IAAf;AACD;;AACD,YAAIjG,IAAI,CAACgG,QAAL,IAAiBzC,GAAG,CAACtD,GAAJ,CAAQD,IAAI,CAACG,KAAb,CAArB,EAA0C;AACxC,cAAIE,MAAM,IAAI,CAACA,MAAM,CAAC2F,QAAtB,EAAgC;AAC9BzC,YAAAA,GAAG,CAACT,GAAJ,CAAQzC,MAAM,CAACF,KAAf,EAAsB,IAAtB;AACD;AACF;AACF,OAdD;AAeA,UAAM+F,gBAAgB,GAAG/D,KAAK,CAACkB,IAAN,CAAWE,GAAG,CAAC3F,IAAJ,EAAX,CAAzB;AACAsI,MAAAA,gBAAgB,CAACvG,OAAjB,CAAyB,UAACQ,KAAD,EAAW;AAClC,YAAMH,IAAI,GAAG,MAAI,CAACM,OAAL,CAAaH,KAAb,CAAb;;AACA,YAAIH,IAAJ,EAAU;AACRA,UAAAA,IAAI,CAAC6F,IAAL,CAAU,IAAV;AACD;AACF,OALD;AAMD;AAjfH;;AAAA;AAAA;;;;;"}

package/lib/_common/js/tree/types.js

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.24.2
+ * tdesign v0.25.2
  * (c) 2022 tdesign
  * @license MIT
  */

package/lib/_common/js/upload/types.js

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.24.2
+ * tdesign v0.25.2
  * (c) 2022 tdesign
  * @license MIT
  */

package/lib/_common/js/upload/xhr.js

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.24.2
+ * tdesign v0.25.2
  * (c) 2022 tdesign
  * @license MIT
  */

package/lib/_common/js/utils/calcTextareaHeight.d.ts

@@ -0,0 +1,7 @@
+declare type CalculateStyleType = {
+    height?: string;
+    minHeight?: string;
+};
+declare type LimitType = number | null;
+declare function calcTextareaHeight(targetElement: HTMLTextAreaElement, minRows?: LimitType, maxRows?: LimitType): CalculateStyleType;
+export default calcTextareaHeight;