@hi-ui/tree-select 4.0.0-beta.5 → 4.0.0-beta.8

package/lib/esm/node_modules/lodash/_basePropertyDeep.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 _baseGet from './_baseGet.js';
-var baseGet = _baseGet;
-/**
- * A specialized version of `baseProperty` which supports deep paths.
- *
- * @private
- * @param {Array|string} path The path of the property to get.
- * @returns {Function} Returns the new accessor function.
- */
-
-function basePropertyDeep(path) {
-  return function (object) {
-    return baseGet(object, path);
-  };
-}
-
-var _basePropertyDeep = basePropertyDeep;
-export default _basePropertyDeep;
-//# sourceMappingURL=_basePropertyDeep.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"_basePropertyDeep.js","sources":["../../../../../../../node_modules/lodash/_basePropertyDeep.js"],"sourcesContent":["var baseGet = require('./_baseGet');\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nmodule.exports = basePropertyDeep;\n"],"names":["baseGet","require$$0","basePropertyDeep","path","object","_basePropertyDeep"],"mappings":";;;;;;;;;;AAAA,IAAIA,OAAO,GAAGC,QAAd;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,gBAAT,CAA0BC,IAA1B,EAAgC;AAC9B,SAAO,UAASC,MAAT,EAAiB;AACtB,WAAOJ,OAAO,CAACI,MAAD,EAASD,IAAT,CAAd;AACD,GAFD;AAGD;;IAEDE,iBAAc,GAAGH;"}

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

@@ -1,33 +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.
- */
-
-/**
- * The base implementation of `_.times` without support for iteratee shorthands
- * or max array length checks.
- *
- * @private
- * @param {number} n The number of times to invoke `iteratee`.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Array} Returns the array of results.
- */
-function baseTimes(n, iteratee) {
-  var index = -1,
-      result = Array(n);
-
-  while (++index < n) {
-    result[index] = iteratee(index);
-  }
-
-  return result;
-}
-
-var _baseTimes = baseTimes;
-export default _baseTimes;
-//# sourceMappingURL=_baseTimes.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"_baseTimes.js","sources":["../../../../../../../node_modules/lodash/_baseTimes.js"],"sourcesContent":["/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n"],"names":["baseTimes","n","iteratee","index","result","Array","_baseTimes"],"mappings":";;;;;;;;;;;;;;;;;;;AASA,SAASA,SAAT,CAAmBC,CAAnB,EAAsBC,QAAtB,EAAgC;AAC9B,MAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGC,KAAK,CAACJ,CAAD,CADlB;;AAGA,SAAO,EAAEE,KAAF,GAAUF,CAAjB,EAAoB;AAClBG,IAAAA,MAAM,CAACD,KAAD,CAAN,GAAgBD,QAAQ,CAACC,KAAD,CAAxB;AACD;;AACD,SAAOC,MAAP;AACD;;IAEDE,UAAc,GAAGN;"}

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

@@ -1,55 +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 _arrayMap from './_arrayMap.js';
-import isArray_1 from './isArray.js';
-import isSymbol_1 from './isSymbol.js';
-var _Symbol2 = _Symbol,
-    arrayMap = _arrayMap,
-    isArray = isArray_1,
-    isSymbol = isSymbol_1;
-/** Used as references for various `Number` constants. */
-
-var INFINITY = 1 / 0;
-/** Used to convert symbols to primitives and strings. */
-
-var symbolProto = _Symbol2 ? _Symbol2.prototype : undefined,
-    symbolToString = symbolProto ? symbolProto.toString : undefined;
-/**
- * The base implementation of `_.toString` which doesn't convert nullish
- * values to empty strings.
- *
- * @private
- * @param {*} value The value to process.
- * @returns {string} Returns the string.
- */
-
-function baseToString(value) {
-  // Exit early for strings to avoid a performance hit in some environments.
-  if (typeof value == 'string') {
-    return value;
-  }
-
-  if (isArray(value)) {
-    // Recursively convert values (susceptible to call stack limits).
-    return arrayMap(value, baseToString) + '';
-  }
-
-  if (isSymbol(value)) {
-    return symbolToString ? symbolToString.call(value) : '';
-  }
-
-  var result = value + '';
-  return result == '0' && 1 / value == -INFINITY ? '-0' : result;
-}
-
-var _baseToString = baseToString;
-export default _baseToString;
-//# sourceMappingURL=_baseToString.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"_baseToString.js","sources":["../../../../../../../node_modules/lodash/_baseToString.js"],"sourcesContent":["var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n"],"names":["Symbol","require$$0","arrayMap","require$$1","isArray","require$$2","isSymbol","require$$3","INFINITY","symbolProto","prototype","undefined","symbolToString","toString","baseToString","value","call","result","_baseToString"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,QAAM,GAAGC,OAAb;AAAA,IACIC,QAAQ,GAAGC,SADf;AAAA,IAEIC,OAAO,GAAGC,SAFd;AAAA,IAGIC,QAAQ,GAAGC,UAHf;AAKA;;AACA,IAAIC,QAAQ,GAAG,IAAI,CAAnB;AAEA;;AACA,IAAIC,WAAW,GAAGT,QAAM,GAAGA,QAAM,CAACU,SAAV,GAAsBC,SAA9C;AAAA,IACIC,cAAc,GAAGH,WAAW,GAAGA,WAAW,CAACI,QAAf,GAA0BF,SAD1D;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASG,YAAT,CAAsBC,KAAtB,EAA6B;;AAE3B,MAAI,OAAOA,KAAP,IAAgB,QAApB,EAA8B;AAC5B,WAAOA,KAAP;AACD;;AACD,MAAIX,OAAO,CAACW,KAAD,CAAX,EAAoB;;AAElB,WAAOb,QAAQ,CAACa,KAAD,EAAQD,YAAR,CAAR,GAAgC,EAAvC;AACD;;AACD,MAAIR,QAAQ,CAACS,KAAD,CAAZ,EAAqB;AACnB,WAAOH,cAAc,GAAGA,cAAc,CAACI,IAAf,CAAoBD,KAApB,CAAH,GAAgC,EAArD;AACD;;AACD,MAAIE,MAAM,GAAIF,KAAK,GAAG,EAAtB;AACA,SAAQE,MAAM,IAAI,GAAV,IAAkB,IAAIF,KAAL,IAAe,CAACP,QAAlC,GAA8C,IAA9C,GAAqDS,MAA5D;AACD;;IAEDC,aAAc,GAAGJ;"}

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

@@ -1,26 +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.
- */
-
-/**
- * The base implementation of `_.unary` without support for storing metadata.
- *
- * @private
- * @param {Function} func The function to cap arguments for.
- * @returns {Function} Returns the new capped function.
- */
-function baseUnary(func) {
-  return function (value) {
-    return func(value);
-  };
-}
-
-var _baseUnary = baseUnary;
-export default _baseUnary;
-//# sourceMappingURL=_baseUnary.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"_baseUnary.js","sources":["../../../../../../../node_modules/lodash/_baseUnary.js"],"sourcesContent":["/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n"],"names":["baseUnary","func","value","_baseUnary"],"mappings":";;;;;;;;;;;;;;;;;AAOA,SAASA,SAAT,CAAmBC,IAAnB,EAAyB;AACvB,SAAO,UAASC,KAAT,EAAgB;AACrB,WAAOD,IAAI,CAACC,KAAD,CAAX;AACD,GAFD;AAGD;;IAEDC,UAAc,GAAGH;"}

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

@@ -1,93 +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 _arrayIncludes from './_arrayIncludes.js';
-import _arrayIncludesWith from './_arrayIncludesWith.js';
-import _cacheHas from './_cacheHas.js';
-import _createSet from './_createSet.js';
-import _setToArray from './_setToArray.js';
-var SetCache = _SetCache,
-    arrayIncludes = _arrayIncludes,
-    arrayIncludesWith = _arrayIncludesWith,
-    cacheHas = _cacheHas,
-    createSet = _createSet,
-    setToArray = _setToArray;
-/** Used as the size to enable large array optimizations. */
-
-var LARGE_ARRAY_SIZE = 200;
-/**
- * The base implementation of `_.uniqBy` without support for iteratee shorthands.
- *
- * @private
- * @param {Array} array The array to inspect.
- * @param {Function} [iteratee] The iteratee invoked per element.
- * @param {Function} [comparator] The comparator invoked per element.
- * @returns {Array} Returns the new duplicate free array.
- */
-
-function baseUniq(array, iteratee, comparator) {
-  var index = -1,
-      includes = arrayIncludes,
-      length = array.length,
-      isCommon = true,
-      result = [],
-      seen = result;
-
-  if (comparator) {
-    isCommon = false;
-    includes = arrayIncludesWith;
-  } else if (length >= LARGE_ARRAY_SIZE) {
-    var set = iteratee ? null : createSet(array);
-
-    if (set) {
-      return setToArray(set);
-    }
-
-    isCommon = false;
-    includes = cacheHas;
-    seen = new SetCache();
-  } else {
-    seen = iteratee ? [] : result;
-  }
-
-  outer: while (++index < length) {
-    var value = array[index],
-        computed = iteratee ? iteratee(value) : value;
-    value = comparator || value !== 0 ? value : 0;
-
-    if (isCommon && computed === computed) {
-      var seenIndex = seen.length;
-
-      while (seenIndex--) {
-        if (seen[seenIndex] === computed) {
-          continue outer;
-        }
-      }
-
-      if (iteratee) {
-        seen.push(computed);
-      }
-
-      result.push(value);
-    } else if (!includes(seen, computed, comparator)) {
-      if (seen !== result) {
-        seen.push(computed);
-      }
-
-      result.push(value);
-    }
-  }
-
-  return result;
-}
-
-var _baseUniq = baseUniq;
-export default _baseUniq;
-//# sourceMappingURL=_baseUniq.js.map

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