tdesign-react 0.18.1 → 0.18.2

package/cjs/_chunks/{dep-30d6be99.js → dep-3a707dd3.js}

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
@@ -27,4 +27,4 @@ function _unsupportedIterableToArray(o, minLen) {
 
 exports._arrayLikeToArray = _arrayLikeToArray;
 exports._unsupportedIterableToArray = _unsupportedIterableToArray;
-//# sourceMappingURL=dep-30d6be99.js.map
+//# sourceMappingURL=dep-3a707dd3.js.map

package/cjs/_chunks/{dep-30d6be99.js.map → dep-3a707dd3.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-30d6be99.js","sources":["../../node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js","../../node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js"],"sourcesContent":["export default function _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n\n  for (var i = 0, arr2 = new Array(len); i < len; i++) {\n    arr2[i] = arr[i];\n  }\n\n  return arr2;\n}","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}"],"names":["_arrayLikeToArray","arr","len","length","i","arr2","Array","_unsupportedIterableToArray","o","minLen","arrayLikeToArray","n","Object","prototype","toString","call","slice","constructor","name","from","test"],"mappings":";;;;;;;;AAAe,SAASA,iBAAT,CAA2BC,GAA3B,EAAgCC,GAAhC,EAAqC;AAClD,MAAIA,GAAG,IAAI,IAAP,IAAeA,GAAG,GAAGD,GAAG,CAACE,MAA7B,EAAqCD,GAAG,GAAGD,GAAG,CAACE,MAAV;;AAErC,OAAK,IAAIC,CAAC,GAAG,CAAR,EAAWC,IAAI,GAAG,IAAIC,KAAJ,CAAUJ,GAAV,CAAvB,EAAuCE,CAAC,GAAGF,GAA3C,EAAgDE,CAAC,EAAjD,EAAqD;AACnDC,IAAAA,IAAI,CAACD,CAAD,CAAJ,GAAUH,GAAG,CAACG,CAAD,CAAb;AACD;;AAED,SAAOC,IAAP;AACD;;ACPc,SAASE,2BAAT,CAAqCC,CAArC,EAAwCC,MAAxC,EAAgD;AAC7D,MAAI,CAACD,CAAL,EAAQ;AACR,MAAI,OAAOA,CAAP,KAAa,QAAjB,EAA2B,OAAOE,iBAAgB,CAACF,CAAD,EAAIC,MAAJ,CAAvB;AAC3B,MAAIE,CAAC,GAAGC,MAAM,CAACC,SAAP,CAAiBC,QAAjB,CAA0BC,IAA1B,CAA+BP,CAA/B,EAAkCQ,KAAlC,CAAwC,CAAxC,EAA2C,CAAC,CAA5C,CAAR;AACA,MAAIL,CAAC,KAAK,QAAN,IAAkBH,CAAC,CAACS,WAAxB,EAAqCN,CAAC,GAAGH,CAAC,CAACS,WAAF,CAAcC,IAAlB;AACrC,MAAIP,CAAC,KAAK,KAAN,IAAeA,CAAC,KAAK,KAAzB,EAAgC,OAAOL,KAAK,CAACa,IAAN,CAAWX,CAAX,CAAP;AAChC,MAAIG,CAAC,KAAK,WAAN,IAAqB,2CAA2CS,IAA3C,CAAgDT,CAAhD,CAAzB,EAA6E,OAAOD,iBAAgB,CAACF,CAAD,EAAIC,MAAJ,CAAvB;AAC9E;;;;;"}
+{"version":3,"file":"dep-3a707dd3.js","sources":["../../node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js","../../node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js"],"sourcesContent":["export default function _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n\n  for (var i = 0, arr2 = new Array(len); i < len; i++) {\n    arr2[i] = arr[i];\n  }\n\n  return arr2;\n}","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}"],"names":["_arrayLikeToArray","arr","len","length","i","arr2","Array","_unsupportedIterableToArray","o","minLen","arrayLikeToArray","n","Object","prototype","toString","call","slice","constructor","name","from","test"],"mappings":";;;;;;;;AAAe,SAASA,iBAAT,CAA2BC,GAA3B,EAAgCC,GAAhC,EAAqC;AAClD,MAAIA,GAAG,IAAI,IAAP,IAAeA,GAAG,GAAGD,GAAG,CAACE,MAA7B,EAAqCD,GAAG,GAAGD,GAAG,CAACE,MAAV;;AAErC,OAAK,IAAIC,CAAC,GAAG,CAAR,EAAWC,IAAI,GAAG,IAAIC,KAAJ,CAAUJ,GAAV,CAAvB,EAAuCE,CAAC,GAAGF,GAA3C,EAAgDE,CAAC,EAAjD,EAAqD;AACnDC,IAAAA,IAAI,CAACD,CAAD,CAAJ,GAAUH,GAAG,CAACG,CAAD,CAAb;AACD;;AAED,SAAOC,IAAP;AACD;;ACPc,SAASE,2BAAT,CAAqCC,CAArC,EAAwCC,MAAxC,EAAgD;AAC7D,MAAI,CAACD,CAAL,EAAQ;AACR,MAAI,OAAOA,CAAP,KAAa,QAAjB,EAA2B,OAAOE,iBAAgB,CAACF,CAAD,EAAIC,MAAJ,CAAvB;AAC3B,MAAIE,CAAC,GAAGC,MAAM,CAACC,SAAP,CAAiBC,QAAjB,CAA0BC,IAA1B,CAA+BP,CAA/B,EAAkCQ,KAAlC,CAAwC,CAAxC,EAA2C,CAAC,CAA5C,CAAR;AACA,MAAIL,CAAC,KAAK,QAAN,IAAkBH,CAAC,CAACS,WAAxB,EAAqCN,CAAC,GAAGH,CAAC,CAACS,WAAF,CAAcC,IAAlB;AACrC,MAAIP,CAAC,KAAK,KAAN,IAAeA,CAAC,KAAK,KAAzB,EAAgC,OAAOL,KAAK,CAACa,IAAN,CAAWX,CAAX,CAAP;AAChC,MAAIG,CAAC,KAAK,WAAN,IAAqB,2CAA2CS,IAA3C,CAAgDT,CAAhD,CAAzB,EAA6E,OAAOD,iBAAgB,CAACF,CAAD,EAAIC,MAAJ,CAAvB;AAC9E;;;;;"}

package/cjs/_chunks/{dep-f3958d67.js → dep-3e8d1212.js}

@@ -1,5 +1,5 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
@@ -33,4 +33,4 @@ var isArray = Array.isArray;
 var isArray_1 = isArray;
 
 exports.isArray_1 = isArray_1;
-//# sourceMappingURL=dep-f3958d67.js.map
+//# sourceMappingURL=dep-3e8d1212.js.map

package/{esm/_chunks/dep-776ae9a7.js.map → cjs/_chunks/dep-3e8d1212.js.map}

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

package/cjs/_chunks/{dep-852077f1.js → dep-45c93631.js}

@@ -1,13 +1,13 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
 
 'use strict';
 
-var _baseGetTag = require('./dep-9a470f87.js');
-var isObject$1 = require('./dep-75ddac9a.js');
+var _baseGetTag = require('./dep-2bf84a94.js');
+var isObject$1 = require('./dep-d3e9cd11.js');
 
 var baseGetTag = _baseGetTag._baseGetTag,
     isObject = isObject$1.isObject_1;
@@ -49,4 +49,4 @@ function isFunction(value) {
 var isFunction_1 = isFunction;
 
 exports.isFunction_1 = isFunction_1;
-//# sourceMappingURL=dep-852077f1.js.map
+//# sourceMappingURL=dep-45c93631.js.map

package/cjs/_chunks/{dep-852077f1.js.map → dep-45c93631.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-852077f1.js","sources":["../../node_modules/lodash/isFunction.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n"],"names":["baseGetTag","require$$0","isObject","require$$1","asyncTag","funcTag","genTag","proxyTag","isFunction","value","tag","isFunction_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,uBAAjB;AAAA,IACIC,QAAQ,GAAGC,qBADf;AAGA;;AACA,IAAIC,QAAQ,GAAG,wBAAf;AAAA,IACIC,OAAO,GAAG,mBADd;AAAA,IAEIC,MAAM,GAAG,4BAFb;AAAA,IAGIC,QAAQ,GAAG,gBAHf;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAoBC,KAApB,EAA2B;AACzB,MAAI,CAACP,QAAQ,CAACO,KAAD,CAAb,EAAsB;AACpB,WAAO,KAAP;AACD,GAHwB;;;;AAMzB,MAAIC,GAAG,GAAGV,UAAU,CAACS,KAAD,CAApB;AACA,SAAOC,GAAG,IAAIL,OAAP,IAAkBK,GAAG,IAAIJ,MAAzB,IAAmCI,GAAG,IAAIN,QAA1C,IAAsDM,GAAG,IAAIH,QAApE;AACD;;IAEDI,YAAc,GAAGH;;;;"}
+{"version":3,"file":"dep-45c93631.js","sources":["../../node_modules/lodash/isFunction.js"],"sourcesContent":["var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n"],"names":["baseGetTag","require$$0","isObject","require$$1","asyncTag","funcTag","genTag","proxyTag","isFunction","value","tag","isFunction_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,uBAAjB;AAAA,IACIC,QAAQ,GAAGC,qBADf;AAGA;;AACA,IAAIC,QAAQ,GAAG,wBAAf;AAAA,IACIC,OAAO,GAAG,mBADd;AAAA,IAEIC,MAAM,GAAG,4BAFb;AAAA,IAGIC,QAAQ,GAAG,gBAHf;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAoBC,KAApB,EAA2B;AACzB,MAAI,CAACP,QAAQ,CAACO,KAAD,CAAb,EAAsB;AACpB,WAAO,KAAP;AACD,GAHwB;;;;AAMzB,MAAIC,GAAG,GAAGV,UAAU,CAACS,KAAD,CAApB;AACA,SAAOC,GAAG,IAAIL,OAAP,IAAkBK,GAAG,IAAIJ,MAAzB,IAAmCI,GAAG,IAAIN,QAA1C,IAAsDM,GAAG,IAAIH,QAApE;AACD;;IAEDI,YAAc,GAAGH;;;;"}

package/cjs/_chunks/{dep-8c1b656d.js → dep-4a7d4d19.js}

@@ -1,22 +1,22 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
 
 'use strict';
 
-var defineProperty = require('./dep-79833567.js');
-var _common_js_tree_treeNode = require('./dep-777aec82.js');
-var _baseGet = require('./dep-d1640c2c.js');
-var toString = require('./dep-d9914aba.js');
-var _overArg = require('./dep-ec28b004.js');
-var flatten = require('./dep-37182cc2.js');
-var _common_js_tree_treeNodeModel = require('./dep-6675bbdd.js');
-var isArrayLike$1 = require('./dep-edf226b0.js');
-var isObjectLike$2 = require('./dep-31c1e318.js');
-var camelCase = require('./dep-da91b7c5.js');
-var _baseGetTag = require('./dep-9a470f87.js');
+var defineProperty = require('./dep-3690810b.js');
+var _common_js_tree_treeNode = require('./dep-acdae713.js');
+var _baseGet = require('./dep-d3f303fd.js');
+var toString = require('./dep-6c7c7494.js');
+var _overArg = require('./dep-dedf3e86.js');
+var flatten = require('./dep-1d87ce38.js');
+var _common_js_tree_treeNodeModel = require('./dep-ec553228.js');
+var isArrayLike$1 = require('./dep-cd4964a2.js');
+var isObjectLike$2 = require('./dep-39714d3a.js');
+var camelCase = require('./dep-90dd4b65.js');
+var _baseGetTag = require('./dep-2bf84a94.js');
 
 var overArg = _overArg._overArg;
 /** Built-in value references. */
@@ -454,30 +454,6 @@ var isPlainObject_1 = isPlainObject;
 function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (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 = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { defineProperty._defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
-
-function parseNodeData(tree, para, item) {
-  var value = "";
-  var node = null;
-  var data = null;
-
-  if (typeof para === "string" || typeof para === "number") {
-    value = para;
-    data = item;
-    node = tree.getNode(value);
-  } else if (para instanceof _common_js_tree_treeNode.TreeNode) {
-    node = para;
-    data = item;
-  } else {
-    data = para;
-  }
-
-  var spec = {
-    node: node,
-    data: data
-  };
-  return spec;
-}
-
 var TreeStore = /*#__PURE__*/function () {
   function TreeStore(options) {
     _common_js_tree_treeNode._classCallCheck(this, TreeStore);
@@ -520,8 +496,21 @@ var TreeStore = /*#__PURE__*/function () {
   _common_js_tree_treeNode._createClass(TreeStore, [{
     key: "setConfig",
     value: function setConfig(options) {
-      Object.assign(this.config, options);
-      this.refreshState();
+      var _this = this;
+
+      var hasChanged = false;
+      Object.keys(options).forEach(function (key) {
+        var val = options[key];
+
+        if (val !== _this.config[key]) {
+          hasChanged = true;
+          _this.config[key] = val;
+        }
+      });
+
+      if (hasChanged) {
+        this.refreshState();
+      }
     }
   }, {
     key: "getChildren",
@@ -639,12 +628,12 @@ var TreeStore = /*#__PURE__*/function () {
   }, {
     key: "append",
     value: function append(list) {
-      var _this = this;
+      var _this2 = this;
 
       list.forEach(function (item) {
-        var node = new _common_js_tree_treeNode.TreeNode(_this, item);
+        var node = new _common_js_tree_treeNode.TreeNode(_this2, item);
 
-        _this.children.push(node);
+        _this2.children.push(node);
       });
       this.reflow();
     }
@@ -658,10 +647,34 @@ var TreeStore = /*#__PURE__*/function () {
       this.removeAll();
       this.append(list);
     }
+  }, {
+    key: "parseNodeData",
+    value: function parseNodeData(para, item) {
+      var value = "";
+      var node = null;
+      var data = null;
+
+      if (typeof para === "string" || typeof para === "number") {
+        value = para;
+        data = item;
+        node = this.getNode(value);
+      } else if (para instanceof _common_js_tree_treeNode.TreeNode) {
+        node = para;
+        data = item;
+      } else {
+        data = para;
+      }
+
+      var spec = {
+        node: node,
+        data: data
+      };
+      return spec;
+    }
   }, {
     key: "appendNodes",
     value: function appendNodes(para, item) {
-      var spec = parseNodeData(this, para, item);
+      var spec = this.parseNodeData(para, item);
 
       if (spec.data) {
         if (!spec.node) {
@@ -732,7 +745,7 @@ var TreeStore = /*#__PURE__*/function () {
   }, {
     key: "updated",
     value: function updated(node) {
-      var _this2 = this;
+      var _this3 = this;
 
       if (node !== null && node !== void 0 && node.value) {
         this.updatedMap.set(node.value, true);
@@ -740,38 +753,38 @@ var TreeStore = /*#__PURE__*/function () {
 
       if (this.updateTimer) return;
       this.updateTimer = +setTimeout(function () {
-        clearTimeout(_this2.updateTimer);
-        _this2.updateTimer = null;
+        clearTimeout(_this3.updateTimer);
+        _this3.updateTimer = null;
 
-        if (_this2.shouldReflow) {
-          _this2.refreshNodes();
+        if (_this3.shouldReflow) {
+          _this3.refreshNodes();
 
-          _this2.emit("reflow");
+          _this3.emit("reflow");
         }
 
-        _this2.lockFilterPathNodes();
+        _this3.lockFilterPathNodes();
 
-        var updatedList = Array.from(_this2.updatedMap.keys());
+        var updatedList = Array.from(_this3.updatedMap.keys());
 
         if (updatedList.length > 0) {
           var updatedNodes = updatedList.map(function (value) {
-            return _this2.getNode(value);
+            return _this3.getNode(value);
           });
 
-          _this2.emit("update", {
+          _this3.emit("update", {
             nodes: updatedNodes,
-            map: _this2.updatedMap
+            map: _this3.updatedMap
           });
-        } else if (_this2.shouldReflow) {
-          _this2.emit("update", {
+        } else if (_this3.shouldReflow) {
+          _this3.emit("update", {
             nodes: [],
-            map: _this2.updatedMap
+            map: _this3.updatedMap
           });
         }
 
-        _this2.shouldReflow = false;
+        _this3.shouldReflow = false;
 
-        _this2.updatedMap.clear();
+        _this3.updatedMap.clear();
       });
     }
   }, {
@@ -798,7 +811,7 @@ var TreeStore = /*#__PURE__*/function () {
   }, {
     key: "setActived",
     value: function setActived(actived) {
-      var _this3 = this;
+      var _this4 = this;
 
       var activeMultiple = this.config.activeMultiple;
       var list = actived.slice(0);
@@ -808,9 +821,9 @@ var TreeStore = /*#__PURE__*/function () {
       }
 
       list.forEach(function (val) {
-        _this3.activedMap.set(val, true);
+        _this4.activedMap.set(val, true);
 
-        var node = _this3.getNode(val);
+        var node = _this4.getNode(val);
 
         if (node) {
           node.update();
@@ -852,20 +865,20 @@ var TreeStore = /*#__PURE__*/function () {
   }, {
     key: "setExpandedDirectly",
     value: function setExpandedDirectly(list) {
-      var _this4 = this;
+      var _this5 = this;
 
       var expanded = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
       list.forEach(function (val) {
         if (expanded) {
-          _this4.expandedMap.set(val, true);
+          _this5.expandedMap.set(val, true);
 
-          var node = _this4.getNode(val);
+          var node = _this5.getNode(val);
 
           if (node) {
             node.afterExpanded();
           }
         } else {
-          _this4.expandedMap["delete"](val);
+          _this5.expandedMap["delete"](val);
         }
       });
     }
@@ -930,7 +943,7 @@ var TreeStore = /*#__PURE__*/function () {
   }, {
     key: "setChecked",
     value: function setChecked(list) {
-      var _this5 = this;
+      var _this6 = this;
 
       var _this$config = this.config,
           valueMode = _this$config.valueMode,
@@ -938,16 +951,16 @@ var TreeStore = /*#__PURE__*/function () {
           checkable = _this$config.checkable;
       if (!checkable) return;
       list.forEach(function (val) {
-        var node = _this5.getNode(val);
+        var node = _this6.getNode(val);
 
         if (node) {
           if (valueMode === "parentFirst" && !checkStrictly) {
             var childrenNodes = node.walk();
             childrenNodes.forEach(function (childNode) {
-              _this5.checkedMap.set(childNode.value, true);
+              _this6.checkedMap.set(childNode.value, true);
             });
           } else {
-            _this5.checkedMap.set(val, true);
+            _this6.checkedMap.set(val, true);
 
             node.updateChecked();
           }
@@ -1000,7 +1013,7 @@ var TreeStore = /*#__PURE__*/function () {
   }, {
     key: "getRelatedNodes",
     value: function getRelatedNodes(list, options) {
-      var _this6 = this;
+      var _this7 = this;
 
       var conf = _objectSpread({
         withParents: true
@@ -1010,7 +1023,7 @@ var TreeStore = /*#__PURE__*/function () {
       list.forEach(function (value) {
         if (map.get(value)) return;
 
-        var node = _this6.getNode(value);
+        var node = _this7.getNode(value);
 
         if (node) {
           var parents = node.getParents();
@@ -1045,7 +1058,7 @@ var TreeStore = /*#__PURE__*/function () {
   }, {
     key: "lockFilterPathNodes",
     value: function lockFilterPathNodes() {
-      var _this7 = this;
+      var _this8 = this;
 
       var config = this.config,
           filterMap = this.filterMap;
@@ -1085,7 +1098,7 @@ var TreeStore = /*#__PURE__*/function () {
       });
       var filterPathValues = Array.from(map.keys());
       filterPathValues.forEach(function (value) {
-        var node = _this7.getNode(value);
+        var node = _this8.getNode(value);
 
         if (node) {
           node.lock(true);
@@ -1101,4 +1114,4 @@ exports.TreeStore = TreeStore;
 exports._SetCache = _SetCache;
 exports._cacheHas = _cacheHas;
 exports._getPrototype = _getPrototype;
-//# sourceMappingURL=dep-8c1b656d.js.map
+//# sourceMappingURL=dep-4a7d4d19.js.map

package/cjs/_chunks/dep-4a7d4d19.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-4a7d4d19.js","sources":["../../node_modules/lodash/_getPrototype.js","../../node_modules/lodash/_setCacheAdd.js","../../node_modules/lodash/_setCacheHas.js","../../node_modules/lodash/_SetCache.js","../../node_modules/lodash/_cacheHas.js","../../node_modules/lodash/_baseFindIndex.js","../../node_modules/lodash/_baseIsNaN.js","../../node_modules/lodash/_strictIndexOf.js","../../node_modules/lodash/_baseIndexOf.js","../../node_modules/lodash/_arrayIncludes.js","../../node_modules/lodash/_arrayIncludesWith.js","../../node_modules/lodash/_baseDifference.js","../../node_modules/lodash/_baseRest.js","../../node_modules/lodash/isArrayLikeObject.js","../../node_modules/lodash/difference.js","../../node_modules/lodash/isPlainObject.js","../../src/_common/js/tree/tree-store.ts"],"sourcesContent":["var overArg = require('./_overArg');\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee == null ? value : iteratee(value);\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseDifference;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\nvar difference = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n    : [];\n});\n\nmodule.exports = difference;\n","var baseGetTag = require('./_baseGetTag'),\n    getPrototype = require('./_getPrototype'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\n","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":["overArg","require$$0","getPrototype","Object","getPrototypeOf","_getPrototype","HASH_UNDEFINED","setCacheAdd","value","__data__","set","_setCacheAdd","setCacheHas","has","_setCacheHas","MapCache","require$$1","require$$2","SetCache","values","index","length","add","prototype","push","_SetCache","cacheHas","cache","key","_cacheHas","baseFindIndex","array","predicate","fromIndex","fromRight","_baseFindIndex","baseIsNaN","_baseIsNaN","strictIndexOf","_strictIndexOf","baseIndexOf","_baseIndexOf","arrayIncludes","_arrayIncludes","arrayIncludesWith","comparator","_arrayIncludesWith","arrayMap","require$$3","baseUnary","require$$4","require$$5","LARGE_ARRAY_SIZE","baseDifference","iteratee","includes","isCommon","result","valuesLength","outer","computed","valuesIndex","_baseDifference","identity","overRest","setToString","baseRest","func","start","_baseRest","isArrayLike","isObjectLike","isArrayLikeObject","isArrayLikeObject_1","baseFlatten","difference","difference_1","baseGetTag","objectTag","funcProto","Function","objectProto","funcToString","toString","hasOwnProperty","objectCtorString","call","isPlainObject","proto","Ctor","constructor","isPlainObject_1","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","forEach","val","refreshState","item","node","get","TreeNode","indexOf","parent","getNode","getParent","parents","getParents","getIndex","slice","walk","conf","level","Infinity","nodeModel","getModel","props","every","propEqual","list","reflow","clear","removeAll","append","para","data","spec","parseNodeData","appendTo","Array","isArray","updateRelated","insertBefore","insertAfter","apply","update","updateChecked","updated","setTimeout","refreshNodes","emit","lockFilterPathNodes","updatedList","from","updatedNodes","map","getNodes","isActived","resetActived","setActived","actived","getActived","relatedNodes","getRelatedNodes","expanded","getExpanded","added","removed","setExpandedDirectly","updateExpanded","setExpanded","afterExpanded","withParents","isChecked","isLeaf","resetChecked","setChecked","childrenNodes","childNode","checked","getChecked","remove","related","concat","relatedNode","name","state","methodName","camelCase","method","allNodes","lock","size","reverse","vmIsRest","visible","filterPathValues"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,IAAIA,OAAO,GAAGC,iBAAd;AAEA;;AACA,IAAIC,cAAY,GAAGF,OAAO,CAACG,MAAM,CAACC,cAAR,EAAwBD,MAAxB,CAA1B;IAEAE,aAAc,GAAGH;;;ACJjB,IAAII,cAAc,GAAG,2BAArB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBC,KAArB,EAA4B;AAC1B,OAAKC,QAAL,CAAcC,GAAd,CAAkBF,KAAlB,EAAyBF,cAAzB;;AACA,SAAO,IAAP;AACD;;IAEDK,YAAc,GAAGJ;;;;;;;;;;;;ACTjB,SAASK,aAAT,CAAqBJ,KAArB,EAA4B;AAC1B,SAAO,KAAKC,QAAL,CAAcI,GAAd,CAAkBL,KAAlB,CAAP;AACD;;IAEDM,YAAc,GAAGF;;ACbjB,IAAIG,QAAQ,GAAGd,kBAAf;AAAA,IACIM,WAAW,GAAGS,YADlB;AAAA,IAEIJ,WAAW,GAAGK,YAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAkBC,MAAlB,EAA0B;AACxB,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGF,MAAM,IAAI,IAAV,GAAiB,CAAjB,GAAqBA,MAAM,CAACE,MADzC;AAGA,OAAKZ,QAAL,GAAgB,IAAIM,QAAJ,EAAhB;;AACA,SAAO,EAAEK,KAAF,GAAUC,MAAjB,EAAyB;AACvB,SAAKC,GAAL,CAASH,MAAM,CAACC,KAAD,CAAf;AACD;AACF;;;AAGDF,UAAQ,CAACK,SAAT,CAAmBD,GAAnB,GAAyBJ,UAAQ,CAACK,SAAT,CAAmBC,IAAnB,GAA0BjB,WAAnD;AACAW,UAAQ,CAACK,SAAT,CAAmBV,GAAnB,GAAyBD,WAAzB;IAEAa,SAAc,GAAGP;;;;;;;;;;;AClBjB,SAASQ,UAAT,CAAkBC,KAAlB,EAAyBC,GAAzB,EAA8B;AAC5B,SAAOD,KAAK,CAACd,GAAN,CAAUe,GAAV,CAAP;AACD;;IAEDC,SAAc,GAAGH;;;;;;;;;;;;;;ACDjB,SAASI,eAAT,CAAuBC,KAAvB,EAA8BC,SAA9B,EAAyCC,SAAzC,EAAoDC,SAApD,EAA+D;AAC7D,MAAIb,MAAM,GAAGU,KAAK,CAACV,MAAnB;AAAA,MACID,KAAK,GAAGa,SAAS,IAAIC,SAAS,GAAG,CAAH,GAAO,CAAC,CAArB,CADrB;;AAGA,SAAQA,SAAS,GAAGd,KAAK,EAAR,GAAa,EAAEA,KAAF,GAAUC,MAAxC,EAAiD;AAC/C,QAAIW,SAAS,CAACD,KAAK,CAACX,KAAD,CAAN,EAAeA,KAAf,EAAsBW,KAAtB,CAAb,EAA2C;AACzC,aAAOX,KAAP;AACD;AACF;;AACD,SAAO,CAAC,CAAR;AACD;;IAEDe,cAAc,GAAGL;;;;;;;;;;AChBjB,SAASM,WAAT,CAAmB5B,KAAnB,EAA0B;AACxB,SAAOA,KAAK,KAAKA,KAAjB;AACD;;IAED6B,UAAc,GAAGD;;;;;;;;;;;;;ACDjB,SAASE,eAAT,CAAuBP,KAAvB,EAA8BvB,KAA9B,EAAqCyB,SAArC,EAAgD;AAC9C,MAAIb,KAAK,GAAGa,SAAS,GAAG,CAAxB;AAAA,MACIZ,MAAM,GAAGU,KAAK,CAACV,MADnB;;AAGA,SAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIU,KAAK,CAACX,KAAD,CAAL,KAAiBZ,KAArB,EAA4B;AAC1B,aAAOY,KAAP;AACD;AACF;;AACD,SAAO,CAAC,CAAR;AACD;;IAEDmB,cAAc,GAAGD;;ACtBjB,IAAIR,aAAa,GAAG7B,cAApB;AAAA,IACImC,SAAS,GAAGpB,UADhB;AAAA,IAEIsB,aAAa,GAAGrB,cAFpB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASuB,aAAT,CAAqBT,KAArB,EAA4BvB,KAA5B,EAAmCyB,SAAnC,EAA8C;AAC5C,SAAOzB,KAAK,KAAKA,KAAV,GACH8B,aAAa,CAACP,KAAD,EAAQvB,KAAR,EAAeyB,SAAf,CADV,GAEHH,aAAa,CAACC,KAAD,EAAQK,SAAR,EAAmBH,SAAnB,CAFjB;AAGD;;IAEDQ,YAAc,GAAGD;;ACnBjB,IAAIA,WAAW,GAAGvC,YAAlB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASyC,eAAT,CAAuBX,KAAvB,EAA8BvB,KAA9B,EAAqC;AACnC,MAAIa,MAAM,GAAGU,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACV,MAAvC;AACA,SAAO,CAAC,CAACA,MAAF,IAAYmB,WAAW,CAACT,KAAD,EAAQvB,KAAR,EAAe,CAAf,CAAX,GAA+B,CAAC,CAAnD;AACD;;IAEDmC,cAAc,GAAGD;;;;;;;;;;;;ACPjB,SAASE,mBAAT,CAA2Bb,KAA3B,EAAkCvB,KAAlC,EAAyCqC,UAAzC,EAAqD;AACnD,MAAIzB,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGU,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACV,MADvC;;AAGA,SAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIwB,UAAU,CAACrC,KAAD,EAAQuB,KAAK,CAACX,KAAD,CAAb,CAAd,EAAqC;AACnC,aAAO,IAAP;AACD;AACF;;AACD,SAAO,KAAP;AACD;;IAED0B,kBAAc,GAAGF;;ACrBjB,IAAI1B,QAAQ,GAAGjB,SAAf;AAAA,IACIyC,aAAa,GAAG1B,cADpB;AAAA,IAEI4B,iBAAiB,GAAG3B,kBAFxB;AAAA,IAGI8B,QAAQ,GAAGC,kBAHf;AAAA,IAIIC,SAAS,GAAGC,mBAJhB;AAAA,IAKIxB,QAAQ,GAAGyB,SALf;AAOA;;AACA,IAAIC,gBAAgB,GAAG,GAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,gBAAT,CAAwBtB,KAAxB,EAA+BZ,MAA/B,EAAuCmC,QAAvC,EAAiDT,UAAjD,EAA6D;AAC3D,MAAIzB,KAAK,GAAG,CAAC,CAAb;AAAA,MACImC,QAAQ,GAAGb,aADf;AAAA,MAEIc,QAAQ,GAAG,IAFf;AAAA,MAGInC,MAAM,GAAGU,KAAK,CAACV,MAHnB;AAAA,MAIIoC,MAAM,GAAG,EAJb;AAAA,MAKIC,YAAY,GAAGvC,MAAM,CAACE,MAL1B;;AAOA,MAAI,CAACA,MAAL,EAAa;AACX,WAAOoC,MAAP;AACD;;AACD,MAAIH,QAAJ,EAAc;AACZnC,IAAAA,MAAM,GAAG4B,QAAQ,CAAC5B,MAAD,EAAS8B,SAAS,CAACK,QAAD,CAAlB,CAAjB;AACD;;AACD,MAAIT,UAAJ,EAAgB;AACdU,IAAAA,QAAQ,GAAGX,iBAAX;AACAY,IAAAA,QAAQ,GAAG,KAAX;AACD,GAHD,MAIK,IAAIrC,MAAM,CAACE,MAAP,IAAiB+B,gBAArB,EAAuC;AAC1CG,IAAAA,QAAQ,GAAG7B,QAAX;AACA8B,IAAAA,QAAQ,GAAG,KAAX;AACArC,IAAAA,MAAM,GAAG,IAAID,QAAJ,CAAaC,MAAb,CAAT;AACD;;AACDwC,EAAAA,KAAK,EACL,OAAO,EAAEvC,KAAF,GAAUC,MAAjB,EAAyB;AACvB,QAAIb,KAAK,GAAGuB,KAAK,CAACX,KAAD,CAAjB;AAAA,QACIwC,QAAQ,GAAGN,QAAQ,IAAI,IAAZ,GAAmB9C,KAAnB,GAA2B8C,QAAQ,CAAC9C,KAAD,CADlD;AAGAA,IAAAA,KAAK,GAAIqC,UAAU,IAAIrC,KAAK,KAAK,CAAzB,GAA8BA,KAA9B,GAAsC,CAA9C;;AACA,QAAIgD,QAAQ,IAAII,QAAQ,KAAKA,QAA7B,EAAuC;AACrC,UAAIC,WAAW,GAAGH,YAAlB;;AACA,aAAOG,WAAW,EAAlB,EAAsB;AACpB,YAAI1C,MAAM,CAAC0C,WAAD,CAAN,KAAwBD,QAA5B,EAAsC;AACpC,mBAASD,KAAT;AACD;AACF;;AACDF,MAAAA,MAAM,CAACjC,IAAP,CAAYhB,KAAZ;AACD,KARD,MASK,IAAI,CAAC+C,QAAQ,CAACpC,MAAD,EAASyC,QAAT,EAAmBf,UAAnB,CAAb,EAA6C;AAChDY,MAAAA,MAAM,CAACjC,IAAP,CAAYhB,KAAZ;AACD;AACF;;AACD,SAAOiD,MAAP;AACD;;IAEDK,eAAc,GAAGT;;AClEjB,IAAIU,QAAQ,GAAG9D,wCAAf;AAAA,IACI+D,QAAQ,GAAGhD,uCADf;AAAA,IAEIiD,WAAW,GAAGhD,0CAFlB;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASiD,UAAT,CAAkBC,IAAlB,EAAwBC,KAAxB,EAA+B;AAC7B,SAAOH,WAAW,CAACD,QAAQ,CAACG,IAAD,EAAOC,KAAP,EAAcL,QAAd,CAAT,EAAkCI,IAAI,GAAG,EAAzC,CAAlB;AACD;;IAEDE,SAAc,GAAGH;;AChBjB,IAAII,WAAW,GAAGrE,2BAAlB;AAAA,IACIsE,cAAY,GAAGvD,6BADnB;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASwD,mBAAT,CAA2BhE,KAA3B,EAAkC;AAChC,SAAO+D,cAAY,CAAC/D,KAAD,CAAZ,IAAuB8D,WAAW,CAAC9D,KAAD,CAAzC;AACD;;IAEDiE,mBAAc,GAAGD;;AChCjB,IAAInB,cAAc,GAAGpD,eAArB;AAAA,IACIyE,WAAW,GAAG1D,oBADlB;AAAA,IAEIkD,QAAQ,GAAGjD,SAFf;AAAA,IAGIuD,iBAAiB,GAAGxB,mBAHxB;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAI2B,UAAU,GAAGT,QAAQ,CAAC,UAASnC,KAAT,EAAgBZ,MAAhB,EAAwB;AAChD,SAAOqD,iBAAiB,CAACzC,KAAD,CAAjB,GACHsB,cAAc,CAACtB,KAAD,EAAQ2C,WAAW,CAACvD,MAAD,EAAS,CAAT,EAAYqD,iBAAZ,EAA+B,IAA/B,CAAnB,CADX,GAEH,EAFJ;AAGD,CAJwB,CAAzB;IAMAI,YAAc,GAAGD;;AChCjB,IAAIE,UAAU,GAAG5E,uBAAjB;AAAA,IACIC,YAAY,GAAGc,aADnB;AAAA,IAEIuD,YAAY,GAAGtD,6BAFnB;AAIA;;AACA,IAAI6D,SAAS,GAAG,iBAAhB;AAEA;;AACA,IAAIC,SAAS,GAAGC,QAAQ,CAACzD,SAAzB;AAAA,IACI0D,WAAW,GAAG9E,MAAM,CAACoB,SADzB;AAGA;;AACA,IAAI2D,YAAY,GAAGH,SAAS,CAACI,QAA7B;AAEA;;AACA,IAAIC,cAAc,GAAGH,WAAW,CAACG,cAAjC;AAEA;;AACA,IAAIC,gBAAgB,GAAGH,YAAY,CAACI,IAAb,CAAkBnF,MAAlB,CAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASoF,aAAT,CAAuB/E,KAAvB,EAA8B;AAC5B,MAAI,CAAC+D,YAAY,CAAC/D,KAAD,CAAb,IAAwBqE,UAAU,CAACrE,KAAD,CAAV,IAAqBsE,SAAjD,EAA4D;AAC1D,WAAO,KAAP;AACD;;AACD,MAAIU,KAAK,GAAGtF,YAAY,CAACM,KAAD,CAAxB;;AACA,MAAIgF,KAAK,KAAK,IAAd,EAAoB;AAClB,WAAO,IAAP;AACD;;AACD,MAAIC,IAAI,GAAGL,cAAc,CAACE,IAAf,CAAoBE,KAApB,EAA2B,aAA3B,KAA6CA,KAAK,CAACE,WAA9D;AACA,SAAO,OAAOD,IAAP,IAAe,UAAf,IAA6BA,IAAI,YAAYA,IAA7C,IACLP,YAAY,CAACI,IAAb,CAAkBG,IAAlB,KAA2BJ,gBAD7B;AAED;;IAEDM,eAAc,GAAGJ;;;;;aCzCV;AAqCE,qBAAYK,OAAZ,EAA2C;AAAA;;QAC1CC;AACJC,MAAAA,QAAQ;AACRC,MAAAA,MAAM;AACNC,MAAAA,WAAW;AACXC,MAAAA,aAAa;AACbC,MAAAA,aAAa;AACbC,MAAAA,cAAc;AACdC,MAAAA,WAAW;AACXC,MAAAA,gBAAgB;AAChBC,MAAAA,WAAW;AACXC,MAAAA,eAAe;AACfC,MAAAA,UAAU;AACVC,MAAAA,MAAM;AACNC,MAAAA,MAAM;AACNC,MAAAA,WAAW;AACXC,MAAAA,QAAQ;AACRC,MAAAA,QAAQ;AACRC,MAAAA,UAAU;AACVC,MAAAA,UAAU;OACPnB;;SAEAC,SAASA;SACTmB,QAAQ;SACRC,WAAW;SACXC,UAAU,IAAIC,GAAJ;SACVC,aAAa,IAAID,GAAJ;SACbE,cAAc,IAAIF,GAAJ;SACdG,aAAa,IAAIH,GAAJ;SACbI,aAAa,IAAIJ,GAAJ;SACbK,YAAY,IAAIL,GAAJ;SACZM,aAAa;SAEbC,cAAc;SAEdC,eAAe;;;AAxEjB;AAAA;AAAA,WA4EE,mBAAU/B,OAAV,EAAyC;AAAA;;UAC1CgC,aAAa;aACV7B,KAAKH,SAASiC,QAAQ,UAACjG,GAAD,EAAS;YAC9BkG,MAAMlC,QAAQhE;;YAChBkG,QAAQ,MAAKjC,MAAL,CAAYjE,GAAZ,GAAkB;uBACf;gBACRiE,OAAOjE,OAAOkG;;;;UAGnBF,YAAY;aAKTG;;;AA1FJ;AAAA;AAAA,WA+FE,uBAAc;aACZ,KAAKd;;AAhGT;AAAA;AAAA,WAoGE,iBAAQe,IAAR,EAAwC;UACzCC,OAAO;;UACP,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;eACjD,KAAKd,OAAL,CAAagB,GAAb,CAAiBF,IAAjB;iBACEA,gBAAgBG,mCAAU;eAC5B,KAAKjB,OAAL,CAAagB,GAAb,CAAiBF,KAAKxH,KAAtB;;;aAEFyH;;AA3GJ;AAAA;AAAA,WA+GE,kBAASA,IAAT,EAAiC;aAC/B,KAAKjB,KAAL,CAAWoB,OAAX,CAAmBH,IAAnB;;AAhHJ;AAAA;AAAA,WAoHE,mBAAUzH,KAAV,EAA2C;UAC5C6H,SAAS;UACPJ,OAAO,KAAKK,OAAL,CAAa9H,KAAb;;UACTyH,MAAM;iBACCA,KAAKM,SAAL;;;aAEJF;;AA1HJ;AAAA;AAAA,WA8HE,oBAAW7H,KAAX,EAA8C;UAC7CyH,OAAO,KAAKK,OAAL,CAAa9H,KAAb;UACTgI,UAAsB;;UACtBP,MAAM;kBACEA,KAAKQ,UAAL;;;aAELD;;AApIJ;AAAA;AAAA,WAwIE,sBAAahI,KAAb,EAA4C;UAC3CyH,OAAO,KAAKK,OAAL,CAAa9H,KAAb;UACTY,QAAQ;;UACR6G,MAAM;gBACAA,KAAKS,QAAL;;;aAEHtH;;AA9IJ;AAAA;AAAA,WAkJE,kBACL4G,IADK,EAELpC,OAFK,EAGO;UACRoB,QAAoB;UACpBc,MAAqB;;UACrB,OAAOE,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;cAClDA;iBACGA,gBAAgBG,mCAAU;cAC7BH,KAAKxH;;;UAET,CAACsH,KAAK;gBACA,KAAKd,KAAL,CAAW2B,KAAX,CAAiB,CAAjB;aACH;YACCV,OAAO,KAAKK,OAAL,CAAaR,GAAb;;YACTG,MAAM;kBACAA,KAAKW,IAAL;;;;UAIRhD,SAAS;YACLiD;AACJjC,UAAAA,QAAQ;AACRkC,UAAAA,OAAOC;WACJnD;;YAED,OAAOiD,KAAKC,KAAZ,KAAsB,QAAtB,IAAkCD,KAAKC,KAAL,KAAeC,UAAU;kBACrD/B,MAAMJ,MAAN,CAAa,UAACqB,IAAD;AAAA,mBAAUA,KAAKa,KAAL,IAAcD,KAAKC,KAA7B;AAAA,WAAb;;;YAEN,OAAOD,KAAKjC,MAAZ,KAAuB,YAAY;kBAC7BI,MAAMJ,MAAN,CAAa,UAACqB,IAAD,EAAU;gBACvBe,YAAYf,KAAKgB,QAAL;mBACXJ,KAAKjC,MAAL,CAAYoC,SAAZ;WAFD;;;YAKNzD,gBAAcsD,KAAKK,QAAQ;kBACrBlC,MAAMJ,MAAN,CAAa,UAACqB,IAAD,EAAU;gBACvBxE,SAAStD,OAAO4F,IAAP,CAAY8C,KAAKK,KAAjB,EAAwBC,KAAxB,CAA8B,UAACvH,GAAD,EAAS;kBAC9CwH,YAAYnB,KAAKrG,IAAL,KAAciH,KAAKK,KAAL,CAAWtH,GAAX;qBACzBwH;aAFM;mBAIR3F;WALD;;;;aASLuD;;AA/LJ;AAAA;AAAA,WAmME,gBAAOqC,IAAP,EAAuC;AAAA;;WACvCxB,QAAQ,UAACG,IAAD,EAAU;YACfC,OAAO,IAAIE,iCAAJ,CAAa,MAAb,EAAmBH,IAAnB;;eACRf,SAASzF,KAAKyG;;WAEhBqB;;AAxMF;AAAA;AAAA,WA4ME,gBAAOD,IAAP,EAAuC;WACvChC,YAAYkC;WACZjC,WAAWiC;WACXnC,WAAWmC;WACX/B,UAAU+B;WACVC;WACAC,OAAOJ;;AAlNT;AAAA;AAAA,WAsNE,uBACLK,IADK,EAEL1B,IAFK,EAGL;UACIxH,QAAuB;UACvByH,OAAO;UACP0B,OAAO;;UAEP,OAAOD,IAAP,KAAgB,QAAhB,IAA4B,OAAOA,IAAP,KAAgB,UAAU;gBAChDA;eACD1B;eACA,KAAKM,OAAL,CAAa9H,KAAb;iBACEkJ,gBAAgBvB,mCAAU;eAC5BuB;eACA1B;aACF;eACE0B;;;UAEHE,OAAO;AACX3B,QAAAA,MAAAA,IADW;AAEX0B,QAAAA,MAAAA;AAFW;aAINC;;AA5OJ;AAAA;AAAA,WA0PE,qBACLF,IADK,EAEL1B,IAFK,EAGC;UACA4B,OAAO,KAAKC,aAAL,CAAmBH,IAAnB,EAAyB1B,IAAzB;;UACT4B,KAAKD,MAAM;YACT,CAACC,KAAK3B,MAAM;cAEV2B,KAAKD,IAAL,YAAqBxB,mCAAU;iBAC5BwB,KAAKG,SAAS;qBACVC,MAAMC,OAAN,CAAcJ,KAAKD,IAAnB,GAA0B;iBAC9BF,OAAOG,KAAKD;iBACZ;iBACAF,OAAO,CAACG,KAAKD,IAAN;;eAET;cAEDC,KAAKD,IAAL,YAAqBxB,mCAAU;iBAC5BwB,KAAKG,SAAS,MAAMF,KAAK3B;qBACrB8B,MAAMC,OAAN,CAAcJ,KAAKD,IAAnB,GAA0B;iBAC9B1B,KAAKwB,OAAOG,KAAKD;iBACjB;iBACA1B,KAAKwB,OAAO,CAACG,KAAKD,IAAN;;;eAEd1B,KAAKgC;;;;AAlRX;AAAA;AAAA,WAwRE,sBAAazJ,KAAb,EAAoCwH,IAApC,EAAkE;UACjEC,OAAO,KAAKK,OAAL,CAAa9H,KAAb;;UACTyH,MAAM;aACHiC,aAAalC;;;AA3RjB;AAAA;AAAA,WAgSE,qBAAYxH,KAAZ,EAAmCwH,IAAnC,EAAiE;UAChEC,OAAO,KAAKK,OAAL,CAAa9H,KAAb;;UACTyH,MAAM;aACHkC,YAAYnC;;;AAnShB;AAAA;AAAA,WAySE,wBAAqB;UAClBf,WAAoB,KAApBA;UAAUD,QAAU,KAAVA;YACZ3F,SAAS;eACNwG,QAAQ,UAACI,IAAD,EAAU;YACnBoB,OAAOpB,KAAKW,IAAL;cACPrH,UAAUC,KAAK4I,MAAMpD,OAAOqC;;;AA9SjC;AAAA;AAAA,WAmTE,wBAAqB;UAClBrC,QAAU,KAAVA;YACFa,QAAQ,UAACI,IAAD,EAAU;aACjBoC;aACAC;;;AAvTJ;AAAA;AAAA,WA6TE,gBAAOrC,IAAP,EAA8B;WAC9BN,eAAe;WACf4C,QAAQtC;;AA/TV;AAAA;AAAA,WAoUE,iBAAQA,IAAR,EAA+B;AAAA;;UAChCA,iBAAAA,mBAAAA,KAAMzH,OAAO;aACV+G,WAAW7G,IAAIuH,KAAKzH,OAAO;;;UAE9B,KAAKkH;WACJA,cAAc,CAAC8C,WAAW,YAAM;qBACtB,OAAK9C;eACbA,cAAc;;YAGf,OAAKC,cAAc;iBAChB8C;;iBACAC,KAAK;;;eAMPC;;YAECC,cAAcb,MAAMc,IAAN,CAAW,OAAKtD,UAAL,CAAgBxB,IAAhB,EAAX;;YAChB6E,YAAYvJ,MAAZ,GAAqB,GAAG;cAEpByJ,eAAeF,YAAYG,GAAZ,CAAgB,UAACvK,KAAD;AAAA,mBAAW,OAAK8H,OAAL,CAAa9H,KAAb,CAAX;AAAA,WAAhB;;iBAChBkK,KAAK,UAAU;AAClB1D,YAAAA,OAAO8D,YADW;AAElBC,YAAAA,KAAK,OAAKxD;AAFQ;mBAIX,OAAKI,cAAc;iBAGvB+C,KAAK,UAAU;AAClB1D,YAAAA,OAAO,EADW;AAElB+D,YAAAA,KAAK,OAAKxD;AAFQ;;;eAOjBI,eAAe;;eACfJ,WAAWgC;;;AA3Wf;AAAA;AAAA,WAgXE,oBAAWwB,GAAX,EAA6C;UAC5C3D,aAAa2D,OAAO,KAAK3D;aACxB2C,MAAMc,IAAN,CAAWzD,WAAWrB,IAAX,EAAX;;AAlXJ;AAAA;AAAA,WAsXE,yBAAgBiC,IAAhB,EAAmD;UACpDhB,QAAQ,KAAKgE,QAAL,CAAchD,IAAd;cACJhB,MAAMJ,MAAN,CAAa,UAACqB,IAAD;AAAA,eAAUA,KAAKgD,SAAL,EAAV;AAAA,OAAb;aACDjE;;AAzXJ;AAAA;AAAA,WA6XE,wBAAeqC,IAAf,EAA4C;WAC5C6B;WACAC,WAAW9B;;AA/Xb;AAAA;AAAA,WAmYE,oBAAW+B,OAAX,EAA2C;AAAA;;UACxC/E,iBAAmB,KAAKR,OAAxBQ;UACFgD,OAAO+B,QAAQzC,KAAR,CAAc,CAAd;;UACT,CAACtC,gBAAgB;aACdhF,SAAS;;;WAEXwG,QAAQ,UAACC,GAAD,EAAS;eACfV,WAAW1G,IAAIoH,KAAK;;YACnBG,OAAO,OAAKK,OAAL,CAAaR,GAAb;;YACTG,MAAM;eACHoC;;;;AA7YN;AAAA;AAAA,WAmZE,wBAAqB;UACpBe,UAAU,KAAKC,UAAL;WACXjE,WAAWmC;UACV+B,eAAe,KAAKC,eAAL,CAAqBH,OAArB;mBACRvD,QAAQ,UAACI,IAAD,EAAU;aACxBoC;;;AAxZJ;AAAA;AAAA,WA6ZE,qBAAYU,GAAZ,EAA8C;UAC7C1D,cAAc0D,OAAO,KAAK1D;aACzB0C,MAAMc,IAAN,CAAWxD,YAAYtB,IAAZ,EAAX;;AA/ZJ;AAAA;AAAA,WAmaE,yBAAgBsD,IAAhB,EAA6C;UAC5CmC,WAAW,KAAKC,WAAL;UACXC,QAAQ/G,aAAW0E,MAAMmC;UACzBG,UAAUhH,aAAW6G,UAAUnC;WAChCuC,oBAAoBD,SAAS;WAC7BE,eAAeF;WACfG,YAAYJ;;AAzad;AAAA;AAAA,WA6aE,qBAAYrC,IAAZ,EAAyC;WACzCuC,oBAAoBvC;WACpBwC,eAAexC;;AA/ajB;AAAA;AAAA,WAmbE,6BAAoBA,IAApB,EAAkE;AAAA;;AAAA,UAAvBmC,QAAuB,uEAAZ,IAAY;WAClE3D,QAAQ,UAACC,GAAD,EAAS;YAChB0D,UAAU;iBACPnE,YAAY3G,IAAIoH,KAAK;;cACpBG,OAAO,OAAKK,OAAL,CAAaR,GAAb;;cACTG,MAAM;iBACH8D;;eAEF;iBACA1E,sBAAmBS;;;;AA5bzB;AAAA;AAAA,WAkcE,yBAAsB;UACrB0D,WAAW,KAAKC,WAAL;WACZpE,YAAYkC;WACZsC,eAAeL;;AArcjB;AAAA;AAAA,WAycE,wBAAenC,IAAf,EAA4C;UAC3CiC,eAAe,KAAKC,eAAL,CAAqBlC,IAArB,EAA2B;AAC9C2C,QAAAA,aAAa;AADiC,OAA3B;mBAGRnE,QAAQ,UAACI,IAAD,EAAU;aACxBoC;;;AA9cJ;AAAA;AAAA,WAmdE,oBAAWU,GAAX,EAA6C;UAC1C/D,QAAkB,KAAlBA;UAAOnB,SAAW,KAAXA;UACPc,YAA6Bd,OAA7Bc;UAAWJ,gBAAkBV,OAAlBU;UACb8C,OAAwB;UACxB/B,aAAayD,OAAO,KAAKzD;YACzBO,QAAQ,UAACI,IAAD,EAAU;YAClBA,KAAKgE,SAAL,CAAe3E,UAAf,GAA4B;cAC1BX,cAAc,aAAd,IAA+B,CAACJ,eAAe;gBAC7C,CAAC0B,KAAKI,MAAN,IAAgB,CAACJ,KAAKI,MAAL,CAAY4D,SAAZ,CAAsB3E,UAAtB,GAAmC;mBACjD9F,KAAKyG,KAAKzH;;qBAERmG,cAAc,UAAd,IAA4B,CAACJ,eAAe;gBACjD0B,KAAKiE,MAAL,IAAe;mBACZ1K,KAAKyG,KAAKzH;;iBAEZ;iBACAgB,KAAKyG,KAAKzH;;;;aAId6I;;AAveJ;AAAA;AAAA,WA2eE,yBAAgBrB,IAAhB,EAAmD;UACpDhB,QAAQ,KAAKgE,QAAL,CAAchD,IAAd;cACJhB,MAAMJ,MAAN,CAAa,UAACqB,IAAD;AAAA,eAAUA,KAAKgE,SAAL,EAAV;AAAA,OAAb;aACDjF;;AA9eJ;AAAA;AAAA,WAkfE,wBAAeqC,IAAf,EAA4C;WAC5C8C;WACAC,WAAW/C;;AApfb;AAAA;AAAA,WAwfE,oBAAWA,IAAX,EAAwC;AAAA;;yBACG,KAAKxD;UAA7Cc,yBAAAA;UAAWJ,6BAAAA;UAAeD,yBAAAA;UAC9B,CAACA;WACAuB,QAAQ,UAACC,GAAD,EAAwB;YAC7BG,OAAO,OAAKK,OAAL,CAAaR,GAAb;;YACTG,MAAM;cACJtB,cAAc,aAAd,IAA+B,CAACJ,eAAe;gBAC3C8F,gBAAgBpE,KAAKW,IAAL;0BACRf,QAAQ,UAACyE,SAAD,EAAe;qBAC9BhF,WAAW5G,IAAI4L,UAAU9L,OAAO;;iBAElC;mBACA8G,WAAW5G,IAAIoH,KAAK;;iBACpBwC;;;;;UAIP,CAAC/D,eAAe;YACZgG,UAAU,KAAKC,UAAL;YACVlB,eAAe,KAAKC,eAAL,CAAqBgB,OAArB;qBACR1E,QAAQ,UAACI,IAAD,EAAU;eACxBqC;;;;AA7gBN;AAAA;AAAA,WAmhBE,wBAAqB;UACpBiC,UAAU,KAAKC,UAAL;UACVlB,eAAe,KAAKC,eAAL,CAAqBgB,OAArB;WAChBjF,WAAWiC;mBACH1B,QAAQ,UAACI,IAAD,EAAU;aACxBqC;;;AAxhBJ;AAAA;AAAA,WA6hBE,qBAAkB;UACjBtD,QAAQ,KAAKgE,QAAL;YACRnD,QAAQ,UAACI,IAAD,EAAU;aACjBoC;;;AAhiBJ;AAAA;AAAA,WAqiBE,gBAAO7J,KAAP,EAAqC;UACpCyH,OAAO,KAAKK,OAAL,CAAa9H,KAAb;;UACTyH,MAAM;aACHwE;;;AAxiBJ;AAAA;AAAA,WA6iBE,qBAAkB;UACjBzF,QAAQ,KAAKgE,QAAL;YACRnD,QAAQ,UAACI,IAAD,EAAU;aACjBwE;;;AAhjBJ;AAAA;AAAA,WAsjBE,yBACLpD,IADK,EAELzD,OAFK,EAGO;AAAA;;UACNiD;AACJmD,QAAAA,aAAa;SACVpG;;UAECmF,MAAM,IAAI5D,GAAJ;WACPU,QAAQ,UAACrH,KAAD,EAAW;YAClBuK,IAAI7C,GAAJ,CAAQ1H,KAAR;;YACEyH,OAAO,OAAKK,OAAL,CAAa9H,KAAb;;YACTyH,MAAM;cACFO,UAAUP,KAAKQ,UAAL;cACVxB,WAAWgB,KAAKW,IAAL;cACb8D,UAAU;;cACV7D,KAAKmD,aAAa;sBACVxD,QAAQmE,MAAR,CAAe1F,QAAf;iBACL;sBACKA;;;kBAEJY,QAAQ,UAAC+E,WAAD,EAAiB;gBAC3BlM,IAAIkM,YAAYpM,OAAOoM;;;;UAI3BtB,eAAevB,MAAMc,IAAN,CAAWE,IAAI5J,MAAJ,EAAX;aACdmK;;AAjlBJ;AAAA;AAAA,WAqlBE,cAAKuB,IAAL,EAAmBC,KAAnB,EAAqD;UACpDjH,SAAS,KAAKA,MAAL,IAAe;UACxBkH,aAAaC,mCAAgBH;UAC7BI,SAASpH,OAAOkH;;UAClB,OAAOE,MAAP,KAAkB,YAAY;eACzBH;;;AA1lBN;AAAA;AAAA,WAgmBE,+BAAsB;AAAA;;UAEzBjH,SAEE,KAFFA;UACA2B,YACE,KADFA;;UAME,CAAC3B,OAAOe,MAAR,IAAkB,CAAC,KAAKa,YAAY;;;;WAGnCA,aAAa5B,OAAOe;UAEnBsG,WAAW,KAAKlC,QAAL;eACRnD,QAAQ,UAACI,IAAD,EAAoB;aAC9BkF,KAAK;;;UAERD,SAAS7L,MAAT,KAAoBmG,UAAU4F,MAAM;;;;UAMlCrC,MAAM,IAAI5D,GAAJ;eAKHkG,UAAUxF,QAAQ,UAACG,IAAD,EAAoB;YACvCC,OAAOD;YAGPK,SAASJ,KAAKM,SAAL;;YACXN,KAAKqF,UAAU;cACbjF,QAAQ;mBACHmD,WAAW;;;eAGf+B,UAAU;;;YAEbtF,KAAKqF,QAAL,IAAiBvC,IAAI7C,GAAJ,CAAQD,KAAKzH,KAAb,GAAqB;cACpC6H,UAAU,CAACA,OAAOiF,UAAU;gBAC1B5M,IAAI2H,OAAO7H,OAAO;;;;UAMtBgN,mBAAmBzD,MAAMc,IAAN,CAAWE,IAAIhF,IAAJ,EAAX;uBACR8B,QAAQ,UAACrH,KAAD,EAA0B;YAC3CyH,OAAO,OAAKK,OAAL,CAAa9H,KAAb;;YACTyH,MAAM;eACHkF,KAAK;;;;AArpBX;;AAAA;AAAA;;;;;;;"}

package/cjs/_chunks/{dep-6f4cae41.js → dep-4ad44dd8.js}

@@ -1,14 +1,14 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
 
 'use strict';
 
-var _typeof = require('./dep-6c3918ff.js');
-var _baseGetTag = require('./dep-9a470f87.js');
-var isObjectLike$1 = require('./dep-31c1e318.js');
+var _typeof = require('./dep-d2731646.js');
+var _baseGetTag = require('./dep-2bf84a94.js');
+var isObjectLike$1 = require('./dep-39714d3a.js');
 
 var baseGetTag = _baseGetTag._baseGetTag,
     isObjectLike = isObjectLike$1.isObjectLike_1;
@@ -40,4 +40,4 @@ function isSymbol(value) {
 var isSymbol_1 = isSymbol;
 
 exports.isSymbol_1 = isSymbol_1;
-//# sourceMappingURL=dep-6f4cae41.js.map
+//# sourceMappingURL=dep-4ad44dd8.js.map

package/cjs/_chunks/{dep-6f4cae41.js.map → dep-4ad44dd8.js.map}

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

package/cjs/_chunks/{dep-69ded822.js → dep-4eb371ce.js}

@@ -1,12 +1,12 @@
 /**
- * tdesign v0.18.1
+ * tdesign v0.18.2
  * (c) 2021 tdesign
  * @license MIT
  */
 
 'use strict';
 
-var _typeof = require('./dep-6c3918ff.js');
+var _typeof = require('./dep-d2731646.js');
 
 function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
   try {
@@ -769,4 +769,4 @@ var regenerator = runtime.exports;
 
 exports._asyncToGenerator = _asyncToGenerator;
 exports.regenerator = regenerator;
-//# sourceMappingURL=dep-69ded822.js.map
+//# sourceMappingURL=dep-4eb371ce.js.map