tdesign-react 0.31.2-alpha.1 → 0.32.0

package/es/_chunks/dep-a2e45d0b.js

@@ -0,0 +1,118 @@
+/**
+ * tdesign v0.32.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-20942df6.js';
+import { _ as _SetCache, a as _cacheHas } from './dep-60b27bfe.js';
+import { _ as _arrayIncludes, a as _arrayIncludesWith } from './dep-2d44e2b6.js';
+import { _ as _arrayMap } from './dep-266d4260.js';
+import { _ as _baseUnary } from './dep-bb5a950d.js';
+import { _ as _baseFlatten } from './dep-1b2ff48a.js';
+import { _ as _baseRest, i as isArrayLikeObject_1 } from './dep-7ff49a9f.js';
+
+var SetCache = _SetCache,
+    arrayIncludes = _arrayIncludes,
+    arrayIncludesWith = _arrayIncludesWith,
+    arrayMap = _arrayMap,
+    baseUnary = _baseUnary,
+    cacheHas = _cacheHas;
+/** Used as the size to enable large array optimizations. */
+
+var LARGE_ARRAY_SIZE = 200;
+/**
+ * The base implementation of methods like `_.difference` without support
+ * for excluding multiple arrays or iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Array} values The values to exclude.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ */
+
+function baseDifference$1(array, values, iteratee, comparator) {
+  var index = -1,
+      includes = arrayIncludes,
+      isCommon = true,
+      length = array.length,
+      result = [],
+      valuesLength = values.length;
+
+  if (!length) {
+    return result;
+  }
+
+  if (iteratee) {
+    values = arrayMap(values, baseUnary(iteratee));
+  }
+
+  if (comparator) {
+    includes = arrayIncludesWith;
+    isCommon = false;
+  } else if (values.length >= LARGE_ARRAY_SIZE) {
+    includes = cacheHas;
+    isCommon = false;
+    values = new SetCache(values);
+  }
+
+  outer: while (++index < length) {
+    var value = array[index],
+        computed = iteratee == null ? value : iteratee(value);
+    value = comparator || value !== 0 ? value : 0;
+
+    if (isCommon && computed === computed) {
+      var valuesIndex = valuesLength;
+
+      while (valuesIndex--) {
+        if (values[valuesIndex] === computed) {
+          continue outer;
+        }
+      }
+
+      result.push(value);
+    } else if (!includes(values, computed, comparator)) {
+      result.push(value);
+    }
+  }
+
+  return result;
+}
+
+var _baseDifference = baseDifference$1;
+
+var baseDifference = _baseDifference,
+    baseFlatten = _baseFlatten,
+    baseRest = _baseRest,
+    isArrayLikeObject = isArrayLikeObject_1;
+/**
+ * Creates an array of `array` values not included in the other given arrays
+ * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+ * for equality comparisons. The order and references of result values are
+ * determined by the first array.
+ *
+ * **Note:** Unlike `_.pullAll`, this method returns a new array.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {Array} array The array to inspect.
+ * @param {...Array} [values] The values to exclude.
+ * @returns {Array} Returns the new array of filtered values.
+ * @see _.without, _.xor
+ * @example
+ *
+ * _.difference([2, 1], [2, 3]);
+ * // => [1]
+ */
+
+var difference = baseRest(function (array, values) {
+  return isArrayLikeObject(array) ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true)) : [];
+});
+var difference_1 = difference;
+
+export { difference_1 as d };
+//# sourceMappingURL=dep-a2e45d0b.js.map

package/es/_chunks/dep-a2e45d0b.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-a2e45d0b.js","sources":["../../node_modules/lodash/_baseDifference.js","../../node_modules/lodash/difference.js"],"sourcesContent":["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 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"],"names":["SetCache","require$$0","arrayIncludes","require$$1","arrayIncludesWith","require$$2","arrayMap","require$$3","baseUnary","require$$4","cacheHas","require$$5","LARGE_ARRAY_SIZE","baseDifference","array","values","iteratee","comparator","index","includes","isCommon","length","result","valuesLength","outer","value","computed","valuesIndex","push","_baseDifference","baseFlatten","baseRest","isArrayLikeObject","difference","difference_1"],"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,QAAQ,GAAGC,SALf,CAAA;AAOA;;AACA,IAAIC,gBAAgB,GAAG,GAAvB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,gBAAT,CAAwBC,KAAxB,EAA+BC,MAA/B,EAAuCC,QAAvC,EAAiDC,UAAjD,EAA6D;AAC3D,EAAIC,IAAAA,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,QAAQ,GAAGjB,aADf;AAAA,MAEIkB,QAAQ,GAAG,IAFf;AAAA,MAGIC,MAAM,GAAGP,KAAK,CAACO,MAHnB;AAAA,MAIIC,MAAM,GAAG,EAJb;AAAA,MAKIC,YAAY,GAAGR,MAAM,CAACM,MAL1B,CAAA;;AAOA,EAAI,IAAA,CAACA,MAAL,EAAa;AACX,IAAA,OAAOC,MAAP,CAAA;AACD,GAAA;;AACD,EAAA,IAAIN,QAAJ,EAAc;AACZD,IAAAA,MAAM,GAAGT,QAAQ,CAACS,MAAD,EAASP,SAAS,CAACQ,QAAD,CAAlB,CAAjB,CAAA;AACD,GAAA;;AACD,EAAA,IAAIC,UAAJ,EAAgB;AACdE,IAAAA,QAAQ,GAAGf,iBAAX,CAAA;AACAgB,IAAAA,QAAQ,GAAG,KAAX,CAAA;AACD,GAHD,MAIK,IAAIL,MAAM,CAACM,MAAP,IAAiBT,gBAArB,EAAuC;AAC1CO,IAAAA,QAAQ,GAAGT,QAAX,CAAA;AACAU,IAAAA,QAAQ,GAAG,KAAX,CAAA;AACAL,IAAAA,MAAM,GAAG,IAAIf,QAAJ,CAAae,MAAb,CAAT,CAAA;AACD,GAAA;;AACDS,EAAAA,KAAK,EACL,OAAO,EAAEN,KAAF,GAAUG,MAAjB,EAAyB;AACvB,IAAA,IAAII,KAAK,GAAGX,KAAK,CAACI,KAAD,CAAjB;AAAA,QACIQ,QAAQ,GAAGV,QAAQ,IAAI,IAAZ,GAAmBS,KAAnB,GAA2BT,QAAQ,CAACS,KAAD,CADlD,CAAA;AAGAA,IAAAA,KAAK,GAAIR,UAAU,IAAIQ,KAAK,KAAK,CAAzB,GAA8BA,KAA9B,GAAsC,CAA9C,CAAA;;AACA,IAAA,IAAIL,QAAQ,IAAIM,QAAQ,KAAKA,QAA7B,EAAuC;AACrC,MAAIC,IAAAA,WAAW,GAAGJ,YAAlB,CAAA;;AACA,MAAOI,OAAAA,WAAW,EAAlB,EAAsB;AACpB,QAAA,IAAIZ,MAAM,CAACY,WAAD,CAAN,KAAwBD,QAA5B,EAAsC;AACpC,UAAA,SAASF,KAAT,CAAA;AACD,SAAA;AACF,OAAA;;AACDF,MAAAA,MAAM,CAACM,IAAP,CAAYH,KAAZ,CAAA,CAAA;AACD,KARD,MASK,IAAI,CAACN,QAAQ,CAACJ,MAAD,EAASW,QAAT,EAAmBT,UAAnB,CAAb,EAA6C;AAChDK,MAAAA,MAAM,CAACM,IAAP,CAAYH,KAAZ,CAAA,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAOH,MAAP,CAAA;AACD,CAAA;;AAED,IAAAO,eAAc,GAAGhB,gBAAjB;;AClEA,IAAIA,cAAc,GAAGZ,eAArB;AAAA,IACI6B,WAAW,GAAG3B,YADlB;AAAA,IAEI4B,QAAQ,GAAG1B,SAFf;AAAA,IAGI2B,iBAAiB,GAAGzB,mBAHxB,CAAA;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAI0B,UAAU,GAAGF,QAAQ,CAAC,UAASjB,KAAT,EAAgBC,MAAhB,EAAwB;AAChD,EAAOiB,OAAAA,iBAAiB,CAAClB,KAAD,CAAjB,GACHD,cAAc,CAACC,KAAD,EAAQgB,WAAW,CAACf,MAAD,EAAS,CAAT,EAAYiB,iBAAZ,EAA+B,IAA/B,CAAnB,CADX,GAEH,EAFJ,CAAA;AAGD,CAJwB,CAAzB,CAAA;AAMAE,IAAAA,YAAc,GAAGD;;;;"}

package/es/_chunks/dep-a92150b2.js

@@ -0,0 +1,51 @@
+/**
+ * tdesign v0.32.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-20942df6.js';
+import { _ as _baseGetTag } from './dep-43f5f41f.js';
+import { i as isObject_1 } from './dep-e2a56b9c.js';
+
+var baseGetTag = _baseGetTag,
+    isObject = isObject_1;
+/** `Object#toString` result references. */
+
+var asyncTag = '[object AsyncFunction]',
+    funcTag = '[object Function]',
+    genTag = '[object GeneratorFunction]',
+    proxyTag = '[object Proxy]';
+/**
+ * Checks if `value` is classified as a `Function` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a function, else `false`.
+ * @example
+ *
+ * _.isFunction(_);
+ * // => true
+ *
+ * _.isFunction(/abc/);
+ * // => false
+ */
+
+function isFunction(value) {
+  if (!isObject(value)) {
+    return false;
+  } // The use of `Object#toString` avoids issues with the `typeof` operator
+  // in Safari 9 which returns 'object' for typed arrays and other constructors.
+
+
+  var tag = baseGetTag(value);
+  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;
+}
+
+var isFunction_1 = isFunction;
+
+export { isFunction_1 as i };
+//# sourceMappingURL=dep-a92150b2.js.map

package/es/_chunks/dep-a92150b2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-a92150b2.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,WAAjB;AAAA,IACIC,QAAQ,GAAGC,UADf,CAAA;AAGA;;AACA,IAAIC,QAAQ,GAAG,wBAAf;AAAA,IACIC,OAAO,GAAG,mBADd;AAAA,IAEIC,MAAM,GAAG,4BAFb;AAAA,IAGIC,QAAQ,GAAG,gBAHf,CAAA;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,UAAT,CAAoBC,KAApB,EAA2B;AACzB,EAAA,IAAI,CAACP,QAAQ,CAACO,KAAD,CAAb,EAAsB;AACpB,IAAA,OAAO,KAAP,CAAA;AACD,GAHwB;AAK3B;;;AACE,EAAA,IAAIC,GAAG,GAAGV,UAAU,CAACS,KAAD,CAApB,CAAA;AACA,EAAA,OAAOC,GAAG,IAAIL,OAAP,IAAkBK,GAAG,IAAIJ,MAAzB,IAAmCI,GAAG,IAAIN,QAA1C,IAAsDM,GAAG,IAAIH,QAApE,CAAA;AACD,CAAA;;AAEDI,IAAAA,YAAc,GAAGH;;;;"}

package/es/_chunks/dep-ae758695.js

@@ -0,0 +1,495 @@
+/**
+ * tdesign v0.32.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-20942df6.js';
+import { _ as _getNative, a as _Map } from './dep-8e097b2f.js';
+import { e as eq_1 } from './dep-5045c746.js';
+import { _ as _typeof } from './dep-6bbd82f0.js';
+
+/**
+ * Removes all key-value entries from the list cache.
+ *
+ * @private
+ * @name clear
+ * @memberOf ListCache
+ */
+
+function listCacheClear$1() {
+  this.__data__ = [];
+  this.size = 0;
+}
+
+var _listCacheClear = listCacheClear$1;
+
+var eq = eq_1;
+/**
+ * Gets the index at which the `key` is found in `array` of key-value pairs.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} key The key to search for.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function assocIndexOf$4(array, key) {
+  var length = array.length;
+
+  while (length--) {
+    if (eq(array[length][0], key)) {
+      return length;
+    }
+  }
+
+  return -1;
+}
+
+var _assocIndexOf = assocIndexOf$4;
+
+var assocIndexOf$3 = _assocIndexOf;
+/** Used for built-in method references. */
+
+var arrayProto = Array.prototype;
+/** Built-in value references. */
+
+var splice = arrayProto.splice;
+/**
+ * Removes `key` and its value from the list cache.
+ *
+ * @private
+ * @name delete
+ * @memberOf ListCache
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+
+function listCacheDelete$1(key) {
+  var data = this.__data__,
+      index = assocIndexOf$3(data, key);
+
+  if (index < 0) {
+    return false;
+  }
+
+  var lastIndex = data.length - 1;
+
+  if (index == lastIndex) {
+    data.pop();
+  } else {
+    splice.call(data, index, 1);
+  }
+
+  --this.size;
+  return true;
+}
+
+var _listCacheDelete = listCacheDelete$1;
+
+var assocIndexOf$2 = _assocIndexOf;
+/**
+ * Gets the list cache value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf ListCache
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+
+function listCacheGet$1(key) {
+  var data = this.__data__,
+      index = assocIndexOf$2(data, key);
+  return index < 0 ? undefined : data[index][1];
+}
+
+var _listCacheGet = listCacheGet$1;
+
+var assocIndexOf$1 = _assocIndexOf;
+/**
+ * Checks if a list cache value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf ListCache
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+function listCacheHas$1(key) {
+  return assocIndexOf$1(this.__data__, key) > -1;
+}
+
+var _listCacheHas = listCacheHas$1;
+
+var assocIndexOf = _assocIndexOf;
+/**
+ * Sets the list cache `key` to `value`.
+ *
+ * @private
+ * @name set
+ * @memberOf ListCache
+ * @param {string} key The key of the value to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns the list cache instance.
+ */
+
+function listCacheSet$1(key, value) {
+  var data = this.__data__,
+      index = assocIndexOf(data, key);
+
+  if (index < 0) {
+    ++this.size;
+    data.push([key, value]);
+  } else {
+    data[index][1] = value;
+  }
+
+  return this;
+}
+
+var _listCacheSet = listCacheSet$1;
+
+var listCacheClear = _listCacheClear,
+    listCacheDelete = _listCacheDelete,
+    listCacheGet = _listCacheGet,
+    listCacheHas = _listCacheHas,
+    listCacheSet = _listCacheSet;
+/**
+ * Creates an list cache object.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+
+function ListCache$1(entries) {
+  var index = -1,
+      length = entries == null ? 0 : entries.length;
+  this.clear();
+
+  while (++index < length) {
+    var entry = entries[index];
+    this.set(entry[0], entry[1]);
+  }
+} // Add methods to `ListCache`.
+
+
+ListCache$1.prototype.clear = listCacheClear;
+ListCache$1.prototype['delete'] = listCacheDelete;
+ListCache$1.prototype.get = listCacheGet;
+ListCache$1.prototype.has = listCacheHas;
+ListCache$1.prototype.set = listCacheSet;
+var _ListCache = ListCache$1;
+
+var getNative = _getNative;
+/* Built-in method references that are verified to be native. */
+
+var nativeCreate$4 = getNative(Object, 'create');
+var _nativeCreate = nativeCreate$4;
+
+var nativeCreate$3 = _nativeCreate;
+/**
+ * Removes all key-value entries from the hash.
+ *
+ * @private
+ * @name clear
+ * @memberOf Hash
+ */
+
+function hashClear$1() {
+  this.__data__ = nativeCreate$3 ? nativeCreate$3(null) : {};
+  this.size = 0;
+}
+
+var _hashClear = hashClear$1;
+
+/**
+ * Removes `key` and its value from the hash.
+ *
+ * @private
+ * @name delete
+ * @memberOf Hash
+ * @param {Object} hash The hash to modify.
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+
+function hashDelete$1(key) {
+  var result = this.has(key) && delete this.__data__[key];
+  this.size -= result ? 1 : 0;
+  return result;
+}
+
+var _hashDelete = hashDelete$1;
+
+var nativeCreate$2 = _nativeCreate;
+/** Used to stand-in for `undefined` hash values. */
+
+var HASH_UNDEFINED$1 = '__lodash_hash_undefined__';
+/** Used for built-in method references. */
+
+var objectProto$1 = Object.prototype;
+/** Used to check objects for own properties. */
+
+var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
+/**
+ * Gets the hash value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf Hash
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+
+function hashGet$1(key) {
+  var data = this.__data__;
+
+  if (nativeCreate$2) {
+    var result = data[key];
+    return result === HASH_UNDEFINED$1 ? undefined : result;
+  }
+
+  return hasOwnProperty$1.call(data, key) ? data[key] : undefined;
+}
+
+var _hashGet = hashGet$1;
+
+var nativeCreate$1 = _nativeCreate;
+/** Used for built-in method references. */
+
+var objectProto = Object.prototype;
+/** Used to check objects for own properties. */
+
+var hasOwnProperty = objectProto.hasOwnProperty;
+/**
+ * Checks if a hash value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf Hash
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+function hashHas$1(key) {
+  var data = this.__data__;
+  return nativeCreate$1 ? data[key] !== undefined : hasOwnProperty.call(data, key);
+}
+
+var _hashHas = hashHas$1;
+
+var nativeCreate = _nativeCreate;
+/** Used to stand-in for `undefined` hash values. */
+
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
+/**
+ * Sets the hash `key` to `value`.
+ *
+ * @private
+ * @name set
+ * @memberOf Hash
+ * @param {string} key The key of the value to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns the hash instance.
+ */
+
+function hashSet$1(key, value) {
+  var data = this.__data__;
+  this.size += this.has(key) ? 0 : 1;
+  data[key] = nativeCreate && value === undefined ? HASH_UNDEFINED : value;
+  return this;
+}
+
+var _hashSet = hashSet$1;
+
+var hashClear = _hashClear,
+    hashDelete = _hashDelete,
+    hashGet = _hashGet,
+    hashHas = _hashHas,
+    hashSet = _hashSet;
+/**
+ * Creates a hash object.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+
+function Hash$1(entries) {
+  var index = -1,
+      length = entries == null ? 0 : entries.length;
+  this.clear();
+
+  while (++index < length) {
+    var entry = entries[index];
+    this.set(entry[0], entry[1]);
+  }
+} // Add methods to `Hash`.
+
+
+Hash$1.prototype.clear = hashClear;
+Hash$1.prototype['delete'] = hashDelete;
+Hash$1.prototype.get = hashGet;
+Hash$1.prototype.has = hashHas;
+Hash$1.prototype.set = hashSet;
+var _Hash = Hash$1;
+
+var Hash = _Hash,
+    ListCache = _ListCache,
+    Map = _Map;
+/**
+ * Removes all key-value entries from the map.
+ *
+ * @private
+ * @name clear
+ * @memberOf MapCache
+ */
+
+function mapCacheClear$1() {
+  this.size = 0;
+  this.__data__ = {
+    'hash': new Hash(),
+    'map': new (Map || ListCache)(),
+    'string': new Hash()
+  };
+}
+
+var _mapCacheClear = mapCacheClear$1;
+
+function isKeyable$1(value) {
+  var type = _typeof(value);
+
+  return type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean' ? value !== '__proto__' : value === null;
+}
+
+var _isKeyable = isKeyable$1;
+
+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$4(map, key) {
+  var data = map.__data__;
+  return isKeyable(key) ? data[typeof key == 'string' ? 'string' : 'hash'] : data.map;
+}
+
+var _getMapData = getMapData$4;
+
+var getMapData$3 = _getMapData;
+/**
+ * Removes `key` and its value from the map.
+ *
+ * @private
+ * @name delete
+ * @memberOf MapCache
+ * @param {string} key The key of the value to remove.
+ * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+ */
+
+function mapCacheDelete$1(key) {
+  var result = getMapData$3(this, key)['delete'](key);
+  this.size -= result ? 1 : 0;
+  return result;
+}
+
+var _mapCacheDelete = mapCacheDelete$1;
+
+var getMapData$2 = _getMapData;
+/**
+ * Gets the map value for `key`.
+ *
+ * @private
+ * @name get
+ * @memberOf MapCache
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
+ */
+
+function mapCacheGet$1(key) {
+  return getMapData$2(this, key).get(key);
+}
+
+var _mapCacheGet = mapCacheGet$1;
+
+var getMapData$1 = _getMapData;
+/**
+ * Checks if a map value for `key` exists.
+ *
+ * @private
+ * @name has
+ * @memberOf MapCache
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+
+function mapCacheHas$1(key) {
+  return getMapData$1(this, key).has(key);
+}
+
+var _mapCacheHas = mapCacheHas$1;
+
+var getMapData = _getMapData;
+/**
+ * Sets the map `key` to `value`.
+ *
+ * @private
+ * @name set
+ * @memberOf MapCache
+ * @param {string} key The key of the value to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns the map cache instance.
+ */
+
+function mapCacheSet$1(key, value) {
+  var data = getMapData(this, key),
+      size = data.size;
+  data.set(key, value);
+  this.size += data.size == size ? 0 : 1;
+  return this;
+}
+
+var _mapCacheSet = mapCacheSet$1;
+
+var mapCacheClear = _mapCacheClear,
+    mapCacheDelete = _mapCacheDelete,
+    mapCacheGet = _mapCacheGet,
+    mapCacheHas = _mapCacheHas,
+    mapCacheSet = _mapCacheSet;
+/**
+ * Creates a map cache object to store key-value pairs.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [entries] The key-value pairs to cache.
+ */
+
+function MapCache(entries) {
+  var index = -1,
+      length = entries == null ? 0 : entries.length;
+  this.clear();
+
+  while (++index < length) {
+    var entry = entries[index];
+    this.set(entry[0], entry[1]);
+  }
+} // Add methods to `MapCache`.
+
+
+MapCache.prototype.clear = mapCacheClear;
+MapCache.prototype['delete'] = mapCacheDelete;
+MapCache.prototype.get = mapCacheGet;
+MapCache.prototype.has = mapCacheHas;
+MapCache.prototype.set = mapCacheSet;
+var _MapCache = MapCache;
+
+export { _MapCache as _, _ListCache as a };
+//# sourceMappingURL=dep-ae758695.js.map