@hi-ui/tree-select 4.0.0-beta.6 → 4.0.0-beta.7

package/lib/esm/node_modules/lodash/_baseUniq.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_baseUniq.js","sources":["../../../../../../../node_modules/lodash/_baseUniq.js"],"sourcesContent":["var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n"],"names":["SetCache","require$$0","arrayIncludes","require$$1","arrayIncludesWith","require$$2","cacheHas","require$$3","createSet","require$$4","setToArray","require$$5","LARGE_ARRAY_SIZE","baseUniq","array","iteratee","comparator","index","includes","length","isCommon","result","seen","set","outer","value","computed","seenIndex","push","_baseUniq"],"mappings":";;;;;;;;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,SAAf;AAAA,IACIC,aAAa,GAAGC,cADpB;AAAA,IAEIC,iBAAiB,GAAGC,kBAFxB;AAAA,IAGIC,QAAQ,GAAGC,SAHf;AAAA,IAIIC,SAAS,GAAGC,UAJhB;AAAA,IAKIC,UAAU,GAAGC,WALjB;AAOA;;AACA,IAAIC,gBAAgB,GAAG,GAAvB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,KAAlB,EAAyBC,QAAzB,EAAmCC,UAAnC,EAA+C;AAC7C,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,QAAQ,GAAGhB,aADf;AAAA,MAEIiB,MAAM,GAAGL,KAAK,CAACK,MAFnB;AAAA,MAGIC,QAAQ,GAAG,IAHf;AAAA,MAIIC,MAAM,GAAG,EAJb;AAAA,MAKIC,IAAI,GAAGD,MALX;;AAOA,MAAIL,UAAJ,EAAgB;AACdI,IAAAA,QAAQ,GAAG,KAAX;AACAF,IAAAA,QAAQ,GAAGd,iBAAX;AACD,GAHD,MAIK,IAAIe,MAAM,IAAIP,gBAAd,EAAgC;AACnC,QAAIW,GAAG,GAAGR,QAAQ,GAAG,IAAH,GAAUP,SAAS,CAACM,KAAD,CAArC;;AACA,QAAIS,GAAJ,EAAS;AACP,aAAOb,UAAU,CAACa,GAAD,CAAjB;AACD;;AACDH,IAAAA,QAAQ,GAAG,KAAX;AACAF,IAAAA,QAAQ,GAAGZ,QAAX;AACAgB,IAAAA,IAAI,GAAG,IAAItB,QAAJ,EAAP;AACD,GARI,MASA;AACHsB,IAAAA,IAAI,GAAGP,QAAQ,GAAG,EAAH,GAAQM,MAAvB;AACD;;AACDG,EAAAA,KAAK,EACL,OAAO,EAAEP,KAAF,GAAUE,MAAjB,EAAyB;AACvB,QAAIM,KAAK,GAAGX,KAAK,CAACG,KAAD,CAAjB;AAAA,QACIS,QAAQ,GAAGX,QAAQ,GAAGA,QAAQ,CAACU,KAAD,CAAX,GAAqBA,KAD5C;AAGAA,IAAAA,KAAK,GAAIT,UAAU,IAAIS,KAAK,KAAK,CAAzB,GAA8BA,KAA9B,GAAsC,CAA9C;;AACA,QAAIL,QAAQ,IAAIM,QAAQ,KAAKA,QAA7B,EAAuC;AACrC,UAAIC,SAAS,GAAGL,IAAI,CAACH,MAArB;;AACA,aAAOQ,SAAS,EAAhB,EAAoB;AAClB,YAAIL,IAAI,CAACK,SAAD,CAAJ,KAAoBD,QAAxB,EAAkC;AAChC,mBAASF,KAAT;AACD;AACF;;AACD,UAAIT,QAAJ,EAAc;AACZO,QAAAA,IAAI,CAACM,IAAL,CAAUF,QAAV;AACD;;AACDL,MAAAA,MAAM,CAACO,IAAP,CAAYH,KAAZ;AACD,KAXD,MAYK,IAAI,CAACP,QAAQ,CAACI,IAAD,EAAOI,QAAP,EAAiBV,UAAjB,CAAb,EAA2C;AAC9C,UAAIM,IAAI,KAAKD,MAAb,EAAqB;AACnBC,QAAAA,IAAI,CAACM,IAAL,CAAUF,QAAV;AACD;;AACDL,MAAAA,MAAM,CAACO,IAAP,CAAYH,KAAZ;AACD;AACF;;AACD,SAAOJ,MAAP;AACD;;IAEDQ,SAAc,GAAGhB;"}

package/lib/esm/node_modules/lodash/_cacheHas.js

@@ -1,25 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
-/**
- * Checks if a `cache` value for `key` exists.
- *
- * @private
- * @param {Object} cache The cache to query.
- * @param {string} key The key of the entry to check.
- * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
- */
-function cacheHas(cache, key) {
-  return cache.has(key);
-}
-
-var _cacheHas = cacheHas;
-export default _cacheHas;
-//# sourceMappingURL=_cacheHas.js.map

package/lib/esm/node_modules/lodash/_cacheHas.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_cacheHas.js","sources":["../../../../../../../node_modules/lodash/_cacheHas.js"],"sourcesContent":["/**\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"],"names":["cacheHas","cache","key","has","_cacheHas"],"mappings":";;;;;;;;;;;;;;;;;;AAQA,SAASA,QAAT,CAAkBC,KAAlB,EAAyBC,GAAzB,EAA8B;AAC5B,SAAOD,KAAK,CAACE,GAAN,CAAUD,GAAV,CAAP;AACD;;IAEDE,SAAc,GAAGJ;"}

package/lib/esm/node_modules/lodash/_castPath.js

@@ -1,37 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import isArray_1 from './isArray.js';
-import _isKey from './_isKey.js';
-import _stringToPath from './_stringToPath.js';
-import toString_1 from './toString.js';
-var isArray = isArray_1,
-    isKey = _isKey,
-    stringToPath = _stringToPath,
-    toString = toString_1;
-/**
- * Casts `value` to a path array if it's not one.
- *
- * @private
- * @param {*} value The value to inspect.
- * @param {Object} [object] The object to query keys on.
- * @returns {Array} Returns the cast property path array.
- */
-
-function castPath(value, object) {
-  if (isArray(value)) {
-    return value;
-  }
-
-  return isKey(value, object) ? [value] : stringToPath(toString(value));
-}
-
-var _castPath = castPath;
-export default _castPath;
-//# sourceMappingURL=_castPath.js.map

package/lib/esm/node_modules/lodash/_castPath.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_castPath.js","sources":["../../../../../../../node_modules/lodash/_castPath.js"],"sourcesContent":["var isArray = require('./isArray'),\n    isKey = require('./_isKey'),\n    stringToPath = require('./_stringToPath'),\n    toString = require('./toString');\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n"],"names":["isArray","require$$0","isKey","require$$1","stringToPath","require$$2","toString","require$$3","castPath","value","object","_castPath"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,OAAO,GAAGC,SAAd;AAAA,IACIC,KAAK,GAAGC,MADZ;AAAA,IAEIC,YAAY,GAAGC,aAFnB;AAAA,IAGIC,QAAQ,GAAGC,UAHf;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,KAAlB,EAAyBC,MAAzB,EAAiC;AAC/B,MAAIV,OAAO,CAACS,KAAD,CAAX,EAAoB;AAClB,WAAOA,KAAP;AACD;;AACD,SAAOP,KAAK,CAACO,KAAD,EAAQC,MAAR,CAAL,GAAuB,CAACD,KAAD,CAAvB,GAAiCL,YAAY,CAACE,QAAQ,CAACG,KAAD,CAAT,CAApD;AACD;;IAEDE,SAAc,GAAGH;"}

package/lib/esm/node_modules/lodash/_coreJsData.js

@@ -1,17 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import _root from './_root.js';
-var root = _root;
-/** Used to detect overreaching core-js shims. */
-
-var coreJsData = root['__core-js_shared__'];
-var _coreJsData = coreJsData;
-export default _coreJsData;
-//# sourceMappingURL=_coreJsData.js.map

package/lib/esm/node_modules/lodash/_coreJsData.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_coreJsData.js","sources":["../../../../../../../node_modules/lodash/_coreJsData.js"],"sourcesContent":["var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n"],"names":["root","require$$0","coreJsData","_coreJsData"],"mappings":";;;;;;;;;;AAAA,IAAIA,IAAI,GAAGC,KAAX;AAEA;;AACA,IAAIC,UAAU,GAAGF,IAAI,CAAC,oBAAD,CAArB;IAEAG,WAAc,GAAGD;"}

package/lib/esm/node_modules/lodash/_createSet.js

@@ -1,32 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import _Set from './_Set.js';
-import noop_1 from './noop.js';
-import _setToArray from './_setToArray.js';
-var Set = _Set,
-    noop = noop_1,
-    setToArray = _setToArray;
-/** Used as references for various `Number` constants. */
-
-var INFINITY = 1 / 0;
-/**
- * Creates a set object of `values`.
- *
- * @private
- * @param {Array} values The values to add to the set.
- * @returns {Object} Returns the new set.
- */
-
-var createSet = !(Set && 1 / setToArray(new Set([, -0]))[1] == INFINITY) ? noop : function (values) {
-  return new Set(values);
-};
-var _createSet = createSet;
-export default _createSet;
-//# sourceMappingURL=_createSet.js.map

package/lib/esm/node_modules/lodash/_createSet.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_createSet.js","sources":["../../../../../../../node_modules/lodash/_createSet.js"],"sourcesContent":["var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n"],"names":["Set","require$$0","noop","require$$1","setToArray","require$$2","INFINITY","createSet","values","_createSet"],"mappings":";;;;;;;;;;;;AAAA,IAAIA,GAAG,GAAGC,IAAV;AAAA,IACIC,IAAI,GAAGC,MADX;AAAA,IAEIC,UAAU,GAAGC,WAFjB;AAIA;;AACA,IAAIC,QAAQ,GAAG,IAAI,CAAnB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,SAAS,GAAG,EAAEP,GAAG,IAAK,IAAII,UAAU,CAAC,IAAIJ,GAAJ,CAAQ,GAAE,CAAC,CAAH,CAAR,CAAD,CAAV,CAA2B,CAA3B,CAAL,IAAuCM,QAAhD,IAA4DJ,IAA5D,GAAmE,UAASM,MAAT,EAAiB;AAClG,SAAO,IAAIR,GAAJ,CAAQQ,MAAR,CAAP;AACD,CAFD;IAIAC,UAAc,GAAGF;"}

package/lib/esm/node_modules/lodash/_equalArrays.js

@@ -1,97 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import _SetCache from './_SetCache.js';
-import _arraySome from './_arraySome.js';
-import _cacheHas from './_cacheHas.js';
-var SetCache = _SetCache,
-    arraySome = _arraySome,
-    cacheHas = _cacheHas;
-/** Used to compose bitmasks for value comparisons. */
-
-var COMPARE_PARTIAL_FLAG = 1,
-    COMPARE_UNORDERED_FLAG = 2;
-/**
- * A specialized version of `baseIsEqualDeep` for arrays with support for
- * partial deep comparisons.
- *
- * @private
- * @param {Array} array The array to compare.
- * @param {Array} other The other array to compare.
- * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
- * @param {Function} customizer The function to customize comparisons.
- * @param {Function} equalFunc The function to determine equivalents of values.
- * @param {Object} stack Tracks traversed `array` and `other` objects.
- * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
- */
-
-function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
-  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
-      arrLength = array.length,
-      othLength = other.length;
-
-  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
-    return false;
-  } // Check that cyclic values are equal.
-
-
-  var arrStacked = stack.get(array);
-  var othStacked = stack.get(other);
-
-  if (arrStacked && othStacked) {
-    return arrStacked == other && othStacked == array;
-  }
-
-  var index = -1,
-      result = true,
-      seen = bitmask & COMPARE_UNORDERED_FLAG ? new SetCache() : undefined;
-  stack.set(array, other);
-  stack.set(other, array); // Ignore non-index properties.
-
-  while (++index < arrLength) {
-    var arrValue = array[index],
-        othValue = other[index];
-
-    if (customizer) {
-      var compared = isPartial ? customizer(othValue, arrValue, index, other, array, stack) : customizer(arrValue, othValue, index, array, other, stack);
-    }
-
-    if (compared !== undefined) {
-      if (compared) {
-        continue;
-      }
-
-      result = false;
-      break;
-    } // Recursively compare arrays (susceptible to call stack limits).
-
-
-    if (seen) {
-      if (!arraySome(other, function (othValue, othIndex) {
-        if (!cacheHas(seen, othIndex) && (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
-          return seen.push(othIndex);
-        }
-      })) {
-        result = false;
-        break;
-      }
-    } else if (!(arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
-      result = false;
-      break;
-    }
-  }
-
-  stack['delete'](array);
-  stack['delete'](other);
-  return result;
-}
-
-var _equalArrays = equalArrays;
-export default _equalArrays;
-//# sourceMappingURL=_equalArrays.js.map

package/lib/esm/node_modules/lodash/_equalArrays.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_equalArrays.js","sources":["../../../../../../../node_modules/lodash/_equalArrays.js"],"sourcesContent":["var SetCache = require('./_SetCache'),\n    arraySome = require('./_arraySome'),\n    cacheHas = require('./_cacheHas');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalArrays;\n"],"names":["SetCache","require$$0","arraySome","require$$1","cacheHas","require$$2","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","array","other","bitmask","customizer","equalFunc","stack","isPartial","arrLength","length","othLength","arrStacked","get","othStacked","index","result","seen","undefined","set","arrValue","othValue","compared","othIndex","push","_equalArrays"],"mappings":";;;;;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,SAAf;AAAA,IACIC,SAAS,GAAGC,UADhB;AAAA,IAEIC,QAAQ,GAAGC,SAFf;AAIA;;AACA,IAAIC,oBAAoB,GAAG,CAA3B;AAAA,IACIC,sBAAsB,GAAG,CAD7B;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,WAAT,CAAqBC,KAArB,EAA4BC,KAA5B,EAAmCC,OAAnC,EAA4CC,UAA5C,EAAwDC,SAAxD,EAAmEC,KAAnE,EAA0E;AACxE,MAAIC,SAAS,GAAGJ,OAAO,GAAGL,oBAA1B;AAAA,MACIU,SAAS,GAAGP,KAAK,CAACQ,MADtB;AAAA,MAEIC,SAAS,GAAGR,KAAK,CAACO,MAFtB;;AAIA,MAAID,SAAS,IAAIE,SAAb,IAA0B,EAAEH,SAAS,IAAIG,SAAS,GAAGF,SAA3B,CAA9B,EAAqE;AACnE,WAAO,KAAP;AACD,GAPuE;;;AASxE,MAAIG,UAAU,GAAGL,KAAK,CAACM,GAAN,CAAUX,KAAV,CAAjB;AACA,MAAIY,UAAU,GAAGP,KAAK,CAACM,GAAN,CAAUV,KAAV,CAAjB;;AACA,MAAIS,UAAU,IAAIE,UAAlB,EAA8B;AAC5B,WAAOF,UAAU,IAAIT,KAAd,IAAuBW,UAAU,IAAIZ,KAA5C;AACD;;AACD,MAAIa,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAG,IADb;AAAA,MAEIC,IAAI,GAAIb,OAAO,GAAGJ,sBAAX,GAAqC,IAAIP,QAAJ,EAArC,GAAoDyB,SAF/D;AAIAX,EAAAA,KAAK,CAACY,GAAN,CAAUjB,KAAV,EAAiBC,KAAjB;AACAI,EAAAA,KAAK,CAACY,GAAN,CAAUhB,KAAV,EAAiBD,KAAjB,EAnBwE;;AAsBxE,SAAO,EAAEa,KAAF,GAAUN,SAAjB,EAA4B;AAC1B,QAAIW,QAAQ,GAAGlB,KAAK,CAACa,KAAD,CAApB;AAAA,QACIM,QAAQ,GAAGlB,KAAK,CAACY,KAAD,CADpB;;AAGA,QAAIV,UAAJ,EAAgB;AACd,UAAIiB,QAAQ,GAAGd,SAAS,GACpBH,UAAU,CAACgB,QAAD,EAAWD,QAAX,EAAqBL,KAArB,EAA4BZ,KAA5B,EAAmCD,KAAnC,EAA0CK,KAA1C,CADU,GAEpBF,UAAU,CAACe,QAAD,EAAWC,QAAX,EAAqBN,KAArB,EAA4Bb,KAA5B,EAAmCC,KAAnC,EAA0CI,KAA1C,CAFd;AAGD;;AACD,QAAIe,QAAQ,KAAKJ,SAAjB,EAA4B;AAC1B,UAAII,QAAJ,EAAc;AACZ;AACD;;AACDN,MAAAA,MAAM,GAAG,KAAT;AACA;AACD,KAfyB;;;AAiB1B,QAAIC,IAAJ,EAAU;AACR,UAAI,CAACtB,SAAS,CAACQ,KAAD,EAAQ,UAASkB,QAAT,EAAmBE,QAAnB,EAA6B;AAC7C,YAAI,CAAC1B,QAAQ,CAACoB,IAAD,EAAOM,QAAP,CAAT,KACCH,QAAQ,KAAKC,QAAb,IAAyBf,SAAS,CAACc,QAAD,EAAWC,QAAX,EAAqBjB,OAArB,EAA8BC,UAA9B,EAA0CE,KAA1C,CADnC,CAAJ,EAC0F;AACxF,iBAAOU,IAAI,CAACO,IAAL,CAAUD,QAAV,CAAP;AACD;AACF,OALS,CAAd,EAKQ;AACNP,QAAAA,MAAM,GAAG,KAAT;AACA;AACD;AACF,KAVD,MAUO,IAAI,EACLI,QAAQ,KAAKC,QAAb,IACEf,SAAS,CAACc,QAAD,EAAWC,QAAX,EAAqBjB,OAArB,EAA8BC,UAA9B,EAA0CE,KAA1C,CAFN,CAAJ,EAGA;AACLS,MAAAA,MAAM,GAAG,KAAT;AACA;AACD;AACF;;AACDT,EAAAA,KAAK,CAAC,QAAD,CAAL,CAAgBL,KAAhB;AACAK,EAAAA,KAAK,CAAC,QAAD,CAAL,CAAgBJ,KAAhB;AACA,SAAOa,MAAP;AACD;;IAEDS,YAAc,GAAGxB;"}

package/lib/esm/node_modules/lodash/_equalByTag.js

@@ -1,132 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import _Symbol from './_Symbol.js';
-import _Uint8Array from './_Uint8Array.js';
-import eq_1 from './eq.js';
-import _equalArrays from './_equalArrays.js';
-import _mapToArray from './_mapToArray.js';
-import _setToArray from './_setToArray.js';
-var _Symbol2 = _Symbol,
-    Uint8Array = _Uint8Array,
-    eq = eq_1,
-    equalArrays = _equalArrays,
-    mapToArray = _mapToArray,
-    setToArray = _setToArray;
-/** Used to compose bitmasks for value comparisons. */
-
-var COMPARE_PARTIAL_FLAG = 1,
-    COMPARE_UNORDERED_FLAG = 2;
-/** `Object#toString` result references. */
-
-var boolTag = '[object Boolean]',
-    dateTag = '[object Date]',
-    errorTag = '[object Error]',
-    mapTag = '[object Map]',
-    numberTag = '[object Number]',
-    regexpTag = '[object RegExp]',
-    setTag = '[object Set]',
-    stringTag = '[object String]',
-    symbolTag = '[object Symbol]';
-var arrayBufferTag = '[object ArrayBuffer]',
-    dataViewTag = '[object DataView]';
-/** Used to convert symbols to primitives and strings. */
-
-var symbolProto = _Symbol2 ? _Symbol2.prototype : undefined,
-    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
-/**
- * A specialized version of `baseIsEqualDeep` for comparing objects of
- * the same `toStringTag`.
- *
- * **Note:** This function only supports comparing values with tags of
- * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
- *
- * @private
- * @param {Object} object The object to compare.
- * @param {Object} other The other object to compare.
- * @param {string} tag The `toStringTag` of the objects to compare.
- * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
- * @param {Function} customizer The function to customize comparisons.
- * @param {Function} equalFunc The function to determine equivalents of values.
- * @param {Object} stack Tracks traversed `object` and `other` objects.
- * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
- */
-
-function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
-  switch (tag) {
-    case dataViewTag:
-      if (object.byteLength != other.byteLength || object.byteOffset != other.byteOffset) {
-        return false;
-      }
-
-      object = object.buffer;
-      other = other.buffer;
-
-    case arrayBufferTag:
-      if (object.byteLength != other.byteLength || !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
-        return false;
-      }
-
-      return true;
-
-    case boolTag:
-    case dateTag:
-    case numberTag:
-      // Coerce booleans to `1` or `0` and dates to milliseconds.
-      // Invalid dates are coerced to `NaN`.
-      return eq(+object, +other);
-
-    case errorTag:
-      return object.name == other.name && object.message == other.message;
-
-    case regexpTag:
-    case stringTag:
-      // Coerce regexes to strings and treat strings, primitives and objects,
-      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
-      // for more details.
-      return object == other + '';
-
-    case mapTag:
-      var convert = mapToArray;
-
-    case setTag:
-      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;
-      convert || (convert = setToArray);
-
-      if (object.size != other.size && !isPartial) {
-        return false;
-      } // Assume cyclic values are equal.
-
-
-      var stacked = stack.get(object);
-
-      if (stacked) {
-        return stacked == other;
-      }
-
-      bitmask |= COMPARE_UNORDERED_FLAG; // Recursively compare objects (susceptible to call stack limits).
-
-      stack.set(object, other);
-      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
-      stack['delete'](object);
-      return result;
-
-    case symbolTag:
-      if (symbolValueOf) {
-        return symbolValueOf.call(object) == symbolValueOf.call(other);
-      }
-
-  }
-
-  return false;
-}
-
-var _equalByTag = equalByTag;
-export default _equalByTag;
-//# sourceMappingURL=_equalByTag.js.map

package/lib/esm/node_modules/lodash/_equalByTag.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_equalByTag.js","sources":["../../../../../../../node_modules/lodash/_equalByTag.js"],"sourcesContent":["var Symbol = require('./_Symbol'),\n    Uint8Array = require('./_Uint8Array'),\n    eq = require('./eq'),\n    equalArrays = require('./_equalArrays'),\n    mapToArray = require('./_mapToArray'),\n    setToArray = require('./_setToArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nmodule.exports = equalByTag;\n"],"names":["Symbol","require$$0","Uint8Array","require$$1","eq","require$$2","equalArrays","require$$3","mapToArray","require$$4","setToArray","require$$5","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","boolTag","dateTag","errorTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","symbolProto","prototype","undefined","symbolValueOf","valueOf","equalByTag","object","other","tag","bitmask","customizer","equalFunc","stack","byteLength","byteOffset","buffer","name","message","convert","isPartial","size","stacked","get","set","result","call","_equalByTag"],"mappings":";;;;;;;;;;;;;;;AAAA,IAAIA,QAAM,GAAGC,OAAb;AAAA,IACIC,UAAU,GAAGC,WADjB;AAAA,IAEIC,EAAE,GAAGC,IAFT;AAAA,IAGIC,WAAW,GAAGC,YAHlB;AAAA,IAIIC,UAAU,GAAGC,WAJjB;AAAA,IAKIC,UAAU,GAAGC,WALjB;AAOA;;AACA,IAAIC,oBAAoB,GAAG,CAA3B;AAAA,IACIC,sBAAsB,GAAG,CAD7B;AAGA;;AACA,IAAIC,OAAO,GAAG,kBAAd;AAAA,IACIC,OAAO,GAAG,eADd;AAAA,IAEIC,QAAQ,GAAG,gBAFf;AAAA,IAGIC,MAAM,GAAG,cAHb;AAAA,IAIIC,SAAS,GAAG,iBAJhB;AAAA,IAKIC,SAAS,GAAG,iBALhB;AAAA,IAMIC,MAAM,GAAG,cANb;AAAA,IAOIC,SAAS,GAAG,iBAPhB;AAAA,IAQIC,SAAS,GAAG,iBARhB;AAUA,IAAIC,cAAc,GAAG,sBAArB;AAAA,IACIC,WAAW,GAAG,mBADlB;AAGA;;AACA,IAAIC,WAAW,GAAGzB,QAAM,GAAGA,QAAM,CAAC0B,SAAV,GAAsBC,SAA9C;AAAA,IACIC,aAAa,GAAGH,WAAW,GAAGA,WAAW,CAACI,OAAf,GAAyBF,SADxD;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASG,UAAT,CAAoBC,MAApB,EAA4BC,KAA5B,EAAmCC,GAAnC,EAAwCC,OAAxC,EAAiDC,UAAjD,EAA6DC,SAA7D,EAAwEC,KAAxE,EAA+E;AAC7E,UAAQJ,GAAR;AACE,SAAKT,WAAL;AACE,UAAKO,MAAM,CAACO,UAAP,IAAqBN,KAAK,CAACM,UAA5B,IACCP,MAAM,CAACQ,UAAP,IAAqBP,KAAK,CAACO,UADhC,EAC6C;AAC3C,eAAO,KAAP;AACD;;AACDR,MAAAA,MAAM,GAAGA,MAAM,CAACS,MAAhB;AACAR,MAAAA,KAAK,GAAGA,KAAK,CAACQ,MAAd;;AAEF,SAAKjB,cAAL;AACE,UAAKQ,MAAM,CAACO,UAAP,IAAqBN,KAAK,CAACM,UAA5B,IACA,CAACF,SAAS,CAAC,IAAIlC,UAAJ,CAAe6B,MAAf,CAAD,EAAyB,IAAI7B,UAAJ,CAAe8B,KAAf,CAAzB,CADd,EAC+D;AAC7D,eAAO,KAAP;AACD;;AACD,aAAO,IAAP;;AAEF,SAAKlB,OAAL;AACA,SAAKC,OAAL;AACA,SAAKG,SAAL;;;AAGE,aAAOd,EAAE,CAAC,CAAC2B,MAAF,EAAU,CAACC,KAAX,CAAT;;AAEF,SAAKhB,QAAL;AACE,aAAOe,MAAM,CAACU,IAAP,IAAeT,KAAK,CAACS,IAArB,IAA6BV,MAAM,CAACW,OAAP,IAAkBV,KAAK,CAACU,OAA5D;;AAEF,SAAKvB,SAAL;AACA,SAAKE,SAAL;;;;AAIE,aAAOU,MAAM,IAAKC,KAAK,GAAG,EAA1B;;AAEF,SAAKf,MAAL;AACE,UAAI0B,OAAO,GAAGnC,UAAd;;AAEF,SAAKY,MAAL;AACE,UAAIwB,SAAS,GAAGV,OAAO,GAAGtB,oBAA1B;AACA+B,MAAAA,OAAO,KAAKA,OAAO,GAAGjC,UAAf,CAAP;;AAEA,UAAIqB,MAAM,CAACc,IAAP,IAAeb,KAAK,CAACa,IAArB,IAA6B,CAACD,SAAlC,EAA6C;AAC3C,eAAO,KAAP;AACD,OANH;;;AAQE,UAAIE,OAAO,GAAGT,KAAK,CAACU,GAAN,CAAUhB,MAAV,CAAd;;AACA,UAAIe,OAAJ,EAAa;AACX,eAAOA,OAAO,IAAId,KAAlB;AACD;;AACDE,MAAAA,OAAO,IAAIrB,sBAAX,CAZF;;AAeEwB,MAAAA,KAAK,CAACW,GAAN,CAAUjB,MAAV,EAAkBC,KAAlB;AACA,UAAIiB,MAAM,GAAG3C,WAAW,CAACqC,OAAO,CAACZ,MAAD,CAAR,EAAkBY,OAAO,CAACX,KAAD,CAAzB,EAAkCE,OAAlC,EAA2CC,UAA3C,EAAuDC,SAAvD,EAAkEC,KAAlE,CAAxB;AACAA,MAAAA,KAAK,CAAC,QAAD,CAAL,CAAgBN,MAAhB;AACA,aAAOkB,MAAP;;AAEF,SAAK3B,SAAL;AACE,UAAIM,aAAJ,EAAmB;AACjB,eAAOA,aAAa,CAACsB,IAAd,CAAmBnB,MAAnB,KAA8BH,aAAa,CAACsB,IAAd,CAAmBlB,KAAnB,CAArC;AACD;;AA3DL;;AA6DA,SAAO,KAAP;AACD;;IAEDmB,WAAc,GAAGrB;"}

package/lib/esm/node_modules/lodash/_equalObjects.js

@@ -1,103 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import _getAllKeys from './_getAllKeys.js';
-var getAllKeys = _getAllKeys;
-/** Used to compose bitmasks for value comparisons. */
-
-var COMPARE_PARTIAL_FLAG = 1;
-/** Used for built-in method references. */
-
-var objectProto = Object.prototype;
-/** Used to check objects for own properties. */
-
-var hasOwnProperty = objectProto.hasOwnProperty;
-/**
- * A specialized version of `baseIsEqualDeep` for objects with support for
- * partial deep comparisons.
- *
- * @private
- * @param {Object} object The object to compare.
- * @param {Object} other The other object to compare.
- * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
- * @param {Function} customizer The function to customize comparisons.
- * @param {Function} equalFunc The function to determine equivalents of values.
- * @param {Object} stack Tracks traversed `object` and `other` objects.
- * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
- */
-
-function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
-  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
-      objProps = getAllKeys(object),
-      objLength = objProps.length,
-      othProps = getAllKeys(other),
-      othLength = othProps.length;
-
-  if (objLength != othLength && !isPartial) {
-    return false;
-  }
-
-  var index = objLength;
-
-  while (index--) {
-    var key = objProps[index];
-
-    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {
-      return false;
-    }
-  } // Check that cyclic values are equal.
-
-
-  var objStacked = stack.get(object);
-  var othStacked = stack.get(other);
-
-  if (objStacked && othStacked) {
-    return objStacked == other && othStacked == object;
-  }
-
-  var result = true;
-  stack.set(object, other);
-  stack.set(other, object);
-  var skipCtor = isPartial;
-
-  while (++index < objLength) {
-    key = objProps[index];
-    var objValue = object[key],
-        othValue = other[key];
-
-    if (customizer) {
-      var compared = isPartial ? customizer(othValue, objValue, key, other, object, stack) : customizer(objValue, othValue, key, object, other, stack);
-    } // Recursively compare objects (susceptible to call stack limits).
-
-
-    if (!(compared === undefined ? objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack) : compared)) {
-      result = false;
-      break;
-    }
-
-    skipCtor || (skipCtor = key == 'constructor');
-  }
-
-  if (result && !skipCtor) {
-    var objCtor = object.constructor,
-        othCtor = other.constructor; // Non `Object` object instances with different constructors are not equal.
-
-    if (objCtor != othCtor && 'constructor' in object && 'constructor' in other && !(typeof objCtor == 'function' && objCtor instanceof objCtor && typeof othCtor == 'function' && othCtor instanceof othCtor)) {
-      result = false;
-    }
-  }
-
-  stack['delete'](object);
-  stack['delete'](other);
-  return result;
-}
-
-var _equalObjects = equalObjects;
-export default _equalObjects;
-//# sourceMappingURL=_equalObjects.js.map

package/lib/esm/node_modules/lodash/_equalObjects.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_equalObjects.js","sources":["../../../../../../../node_modules/lodash/_equalObjects.js"],"sourcesContent":["var getAllKeys = require('./_getAllKeys');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalObjects;\n"],"names":["getAllKeys","require$$0","COMPARE_PARTIAL_FLAG","objectProto","Object","prototype","hasOwnProperty","equalObjects","object","other","bitmask","customizer","equalFunc","stack","isPartial","objProps","objLength","length","othProps","othLength","index","key","call","objStacked","get","othStacked","result","set","skipCtor","objValue","othValue","compared","undefined","objCtor","constructor","othCtor","_equalObjects"],"mappings":";;;;;;;;;;AAAA,IAAIA,UAAU,GAAGC,WAAjB;AAEA;;AACA,IAAIC,oBAAoB,GAAG,CAA3B;AAEA;;AACA,IAAIC,WAAW,GAAGC,MAAM,CAACC,SAAzB;AAEA;;AACA,IAAIC,cAAc,GAAGH,WAAW,CAACG,cAAjC;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,YAAT,CAAsBC,MAAtB,EAA8BC,KAA9B,EAAqCC,OAArC,EAA8CC,UAA9C,EAA0DC,SAA1D,EAAqEC,KAArE,EAA4E;AAC1E,MAAIC,SAAS,GAAGJ,OAAO,GAAGR,oBAA1B;AAAA,MACIa,QAAQ,GAAGf,UAAU,CAACQ,MAAD,CADzB;AAAA,MAEIQ,SAAS,GAAGD,QAAQ,CAACE,MAFzB;AAAA,MAGIC,QAAQ,GAAGlB,UAAU,CAACS,KAAD,CAHzB;AAAA,MAIIU,SAAS,GAAGD,QAAQ,CAACD,MAJzB;;AAMA,MAAID,SAAS,IAAIG,SAAb,IAA0B,CAACL,SAA/B,EAA0C;AACxC,WAAO,KAAP;AACD;;AACD,MAAIM,KAAK,GAAGJ,SAAZ;;AACA,SAAOI,KAAK,EAAZ,EAAgB;AACd,QAAIC,GAAG,GAAGN,QAAQ,CAACK,KAAD,CAAlB;;AACA,QAAI,EAAEN,SAAS,GAAGO,GAAG,IAAIZ,KAAV,GAAkBH,cAAc,CAACgB,IAAf,CAAoBb,KAApB,EAA2BY,GAA3B,CAA7B,CAAJ,EAAmE;AACjE,aAAO,KAAP;AACD;AACF,GAhByE;;;AAkB1E,MAAIE,UAAU,GAAGV,KAAK,CAACW,GAAN,CAAUhB,MAAV,CAAjB;AACA,MAAIiB,UAAU,GAAGZ,KAAK,CAACW,GAAN,CAAUf,KAAV,CAAjB;;AACA,MAAIc,UAAU,IAAIE,UAAlB,EAA8B;AAC5B,WAAOF,UAAU,IAAId,KAAd,IAAuBgB,UAAU,IAAIjB,MAA5C;AACD;;AACD,MAAIkB,MAAM,GAAG,IAAb;AACAb,EAAAA,KAAK,CAACc,GAAN,CAAUnB,MAAV,EAAkBC,KAAlB;AACAI,EAAAA,KAAK,CAACc,GAAN,CAAUlB,KAAV,EAAiBD,MAAjB;AAEA,MAAIoB,QAAQ,GAAGd,SAAf;;AACA,SAAO,EAAEM,KAAF,GAAUJ,SAAjB,EAA4B;AAC1BK,IAAAA,GAAG,GAAGN,QAAQ,CAACK,KAAD,CAAd;AACA,QAAIS,QAAQ,GAAGrB,MAAM,CAACa,GAAD,CAArB;AAAA,QACIS,QAAQ,GAAGrB,KAAK,CAACY,GAAD,CADpB;;AAGA,QAAIV,UAAJ,EAAgB;AACd,UAAIoB,QAAQ,GAAGjB,SAAS,GACpBH,UAAU,CAACmB,QAAD,EAAWD,QAAX,EAAqBR,GAArB,EAA0BZ,KAA1B,EAAiCD,MAAjC,EAAyCK,KAAzC,CADU,GAEpBF,UAAU,CAACkB,QAAD,EAAWC,QAAX,EAAqBT,GAArB,EAA0Bb,MAA1B,EAAkCC,KAAlC,EAAyCI,KAAzC,CAFd;AAGD,KATyB;;;AAW1B,QAAI,EAAEkB,QAAQ,KAAKC,SAAb,GACGH,QAAQ,KAAKC,QAAb,IAAyBlB,SAAS,CAACiB,QAAD,EAAWC,QAAX,EAAqBpB,OAArB,EAA8BC,UAA9B,EAA0CE,KAA1C,CADrC,GAEEkB,QAFJ,CAAJ,EAGO;AACLL,MAAAA,MAAM,GAAG,KAAT;AACA;AACD;;AACDE,IAAAA,QAAQ,KAAKA,QAAQ,GAAGP,GAAG,IAAI,aAAvB,CAAR;AACD;;AACD,MAAIK,MAAM,IAAI,CAACE,QAAf,EAAyB;AACvB,QAAIK,OAAO,GAAGzB,MAAM,CAAC0B,WAArB;AAAA,QACIC,OAAO,GAAG1B,KAAK,CAACyB,WADpB,CADuB;;AAKvB,QAAID,OAAO,IAAIE,OAAX,IACC,iBAAiB3B,MAAjB,IAA2B,iBAAiBC,KAD7C,IAEA,EAAE,OAAOwB,OAAP,IAAkB,UAAlB,IAAgCA,OAAO,YAAYA,OAAnD,IACA,OAAOE,OAAP,IAAkB,UADlB,IACgCA,OAAO,YAAYA,OADrD,CAFJ,EAGmE;AACjET,MAAAA,MAAM,GAAG,KAAT;AACD;AACF;;AACDb,EAAAA,KAAK,CAAC,QAAD,CAAL,CAAgBL,MAAhB;AACAK,EAAAA,KAAK,CAAC,QAAD,CAAL,CAAgBJ,KAAhB;AACA,SAAOiB,MAAP;AACD;;IAEDU,aAAc,GAAG7B;"}

package/lib/esm/node_modules/lodash/_freeGlobal.js

@@ -1,18 +0,0 @@
-import _typeof from "@babel/runtime/helpers/esm/typeof";
-
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import { commonjsGlobal } from '../../_virtual/_commonjsHelpers.js';
-/** Detect free variable `global` from Node.js. */
-
-var freeGlobal = _typeof(commonjsGlobal) == 'object' && commonjsGlobal && commonjsGlobal.Object === Object && commonjsGlobal;
-var _freeGlobal = freeGlobal;
-export default _freeGlobal;
-//# sourceMappingURL=_freeGlobal.js.map

package/lib/esm/node_modules/lodash/_freeGlobal.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_freeGlobal.js","sources":["../../../../../../../node_modules/lodash/_freeGlobal.js"],"sourcesContent":["/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n"],"names":["freeGlobal","global","Object","_freeGlobal"],"mappings":";;;;;;;;;;;;;;AACA,IAAIA,UAAU,GAAG,QAAOC,cAAP,KAAiB,QAAjB,IAA6BA,cAA7B,IAAuCA,cAAM,CAACC,MAAPD,KAAkBC,MAAzD,IAAmED,cAApF;IAEAE,WAAc,GAAGH;"}

package/lib/esm/node_modules/lodash/_getAllKeys.js

@@ -1,30 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import _baseGetAllKeys from './_baseGetAllKeys.js';
-import _getSymbols from './_getSymbols.js';
-import keys_1 from './keys.js';
-var baseGetAllKeys = _baseGetAllKeys,
-    getSymbols = _getSymbols,
-    keys = keys_1;
-/**
- * Creates an array of own enumerable property names and symbols of `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names and symbols.
- */
-
-function getAllKeys(object) {
-  return baseGetAllKeys(object, keys, getSymbols);
-}
-
-var _getAllKeys = getAllKeys;
-export default _getAllKeys;
-//# sourceMappingURL=_getAllKeys.js.map

package/lib/esm/node_modules/lodash/_getAllKeys.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_getAllKeys.js","sources":["../../../../../../../node_modules/lodash/_getAllKeys.js"],"sourcesContent":["var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbols = require('./_getSymbols'),\n    keys = require('./keys');\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n"],"names":["baseGetAllKeys","require$$0","getSymbols","require$$1","keys","require$$2","getAllKeys","object","_getAllKeys"],"mappings":";;;;;;;;;;;;AAAA,IAAIA,cAAc,GAAGC,eAArB;AAAA,IACIC,UAAU,GAAGC,WADjB;AAAA,IAEIC,IAAI,GAAGC,MAFX;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAoBC,MAApB,EAA4B;AAC1B,SAAOP,cAAc,CAACO,MAAD,EAASH,IAAT,EAAeF,UAAf,CAArB;AACD;;IAEDM,WAAc,GAAGF;"}

package/lib/esm/node_modules/lodash/_getMapData.js

@@ -1,28 +0,0 @@
-/** @LICENSE
- * @hi-ui/tree-select
- * https://github.com/XiaoMi/hiui/tree/master/packages/ui/tree-select#readme
- *
- * Copyright (c) HIUI <mi-hiui@xiaomi.com>.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-import _isKeyable from './_isKeyable.js';
-var isKeyable = _isKeyable;
-/**
- * Gets the data for `map`.
- *
- * @private
- * @param {Object} map The map to query.
- * @param {string} key The reference key.
- * @returns {*} Returns the map data.
- */
-
-function getMapData(map, key) {
-  var data = map.__data__;
-  return isKeyable(key) ? data[typeof key == 'string' ? 'string' : 'hash'] : data.map;
-}
-
-var _getMapData = getMapData;
-export default _getMapData;
-//# sourceMappingURL=_getMapData.js.map

package/lib/esm/node_modules/lodash/_getMapData.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"_getMapData.js","sources":["../../../../../../../node_modules/lodash/_getMapData.js"],"sourcesContent":["var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n"],"names":["isKeyable","require$$0","getMapData","map","key","data","__data__","_getMapData"],"mappings":";;;;;;;;;;AAAA,IAAIA,SAAS,GAAGC,UAAhB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAoBC,GAApB,EAAyBC,GAAzB,EAA8B;AAC5B,MAAIC,IAAI,GAAGF,GAAG,CAACG,QAAf;AACA,SAAON,SAAS,CAACI,GAAD,CAAT,GACHC,IAAI,CAAC,OAAOD,GAAP,IAAc,QAAd,GAAyB,QAAzB,GAAoC,MAArC,CADD,GAEHC,IAAI,CAACF,GAFT;AAGD;;IAEDI,WAAc,GAAGL;"}