tdesign-react 0.35.2-alpha.9 → 0.36.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-bd33dd52.js","sources":["../../node_modules/lodash/_arrayPush.js"],"sourcesContent":["/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n"],"names":["arrayPush","array","values","index","length","offset","_arrayPush"],"mappings":";;;;;;;;;;;;;;;;;AAQA,SAASA,SAAT,CAAmBC,KAAnB,EAA0BC,MAA1B,EAAkC;EAChC,IAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGF,MAAM,CAACE,MADpB;AAAA,MAEIC,MAAM,GAAGJ,KAAK,CAACG,MAFnB,CAAA;;AAIA,EAAA,OAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;IACvBH,KAAK,CAACI,MAAM,GAAGF,KAAV,CAAL,GAAwBD,MAAM,CAACC,KAAD,CAA9B,CAAA;AACD,GAAA;;AACD,EAAA,OAAOF,KAAP,CAAA;AACD,CAAA;;AAEDK,IAAAA,UAAc,GAAGN;;;;"}

package/es/_chunks/dep-c5508660.js

@@ -0,0 +1,8 @@
+/**
+ * tdesign v0.36.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-908a5823.js';
+//# sourceMappingURL=dep-c5508660.js.map

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

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

package/es/_chunks/dep-c6112a7e.js

@@ -0,0 +1,18 @@
+/**
+ * tdesign v0.36.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+function _typeof(obj) {
+  "@babel/helpers - typeof";
+
+  return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
+    return typeof obj;
+  } : function (obj) {
+    return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
+  }, _typeof(obj);
+}
+
+export { _typeof as _ };
+//# sourceMappingURL=dep-c6112a7e.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-c6112a7e.js","sources":["../../node_modules/@babel/runtime/helpers/esm/typeof.js"],"sourcesContent":["export default function _typeof(obj) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (obj) {\n    return typeof obj;\n  } : function (obj) {\n    return obj && \"function\" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj;\n  }, _typeof(obj);\n}"],"names":["_typeof","obj","Symbol","iterator","constructor","prototype"],"mappings":";;;;;;AAAe,SAASA,OAAT,CAAiBC,GAAjB,EAAsB;AACnC,EAAA,yBAAA,CAAA;;AAEA,EAAA,OAAOD,OAAO,GAAG,UAAc,IAAA,OAAOE,MAArB,IAA+B,QAAA,IAAY,OAAOA,MAAM,CAACC,QAAzD,GAAoE,UAAUF,GAAV,EAAe;AAClG,IAAA,OAAO,OAAOA,GAAd,CAAA;GADe,GAEb,UAAUA,GAAV,EAAe;IACjB,OAAOA,GAAG,IAAI,UAAc,IAAA,OAAOC,MAA5B,IAAsCD,GAAG,CAACG,WAAJ,KAAoBF,MAA1D,IAAoED,GAAG,KAAKC,MAAM,CAACG,SAAnF,GAA+F,QAA/F,GAA0G,OAAOJ,GAAxH,CAAA;AACD,GAJM,EAIJD,OAAO,CAACC,GAAD,CAJV,CAAA;AAKD;;;;"}

package/es/_chunks/dep-d010148e.js

@@ -0,0 +1,115 @@
+/**
+ * tdesign v0.36.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-a2b419e6.js';
+import { _ as _arrayPush } from './dep-bd33dd52.js';
+import { _ as _Symbol$1 } from './dep-6856eb15.js';
+import { i as isArguments_1 } from './dep-0a455257.js';
+import { i as isArray_1 } from './dep-94e521b8.js';
+import { b as _overRest, c as _setToString } from './dep-af090eb3.js';
+
+var _Symbol = _Symbol$1,
+    isArguments = isArguments_1,
+    isArray = isArray_1;
+/** Built-in value references. */
+
+var spreadableSymbol = _Symbol ? _Symbol.isConcatSpreadable : undefined;
+/**
+ * Checks if `value` is a flattenable `arguments` object or array.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
+ */
+
+function isFlattenable$1(value) {
+  return isArray(value) || isArguments(value) || !!(spreadableSymbol && value && value[spreadableSymbol]);
+}
+
+var _isFlattenable = isFlattenable$1;
+
+var arrayPush = _arrayPush,
+    isFlattenable = _isFlattenable;
+/**
+ * The base implementation of `_.flatten` with support for restricting flattening.
+ *
+ * @private
+ * @param {Array} array The array to flatten.
+ * @param {number} depth The maximum recursion depth.
+ * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
+ * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
+ * @param {Array} [result=[]] The initial result value.
+ * @returns {Array} Returns the new flattened array.
+ */
+
+function baseFlatten$1(array, depth, predicate, isStrict, result) {
+  var index = -1,
+      length = array.length;
+  predicate || (predicate = isFlattenable);
+  result || (result = []);
+
+  while (++index < length) {
+    var value = array[index];
+
+    if (depth > 0 && predicate(value)) {
+      if (depth > 1) {
+        // Recursively flatten arrays (susceptible to call stack limits).
+        baseFlatten$1(value, depth - 1, predicate, isStrict, result);
+      } else {
+        arrayPush(result, value);
+      }
+    } else if (!isStrict) {
+      result[result.length] = value;
+    }
+  }
+
+  return result;
+}
+
+var _baseFlatten = baseFlatten$1;
+
+var baseFlatten = _baseFlatten;
+/**
+ * Flattens `array` a single level deep.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {Array} array The array to flatten.
+ * @returns {Array} Returns the new flattened array.
+ * @example
+ *
+ * _.flatten([1, [2, [3, [4]], 5]]);
+ * // => [1, 2, [3, [4]], 5]
+ */
+
+function flatten$1(array) {
+  var length = array == null ? 0 : array.length;
+  return length ? baseFlatten(array, 1) : [];
+}
+
+var flatten_1 = flatten$1;
+
+var flatten = flatten_1,
+    overRest = _overRest,
+    setToString = _setToString;
+/**
+ * A specialized version of `baseRest` which flattens the rest array.
+ *
+ * @private
+ * @param {Function} func The function to apply a rest parameter to.
+ * @returns {Function} Returns the new function.
+ */
+
+function flatRest(func) {
+  return setToString(overRest(func, undefined, flatten), func + '');
+}
+
+var _flatRest = flatRest;
+
+export { _flatRest as _, _baseFlatten as a };
+//# sourceMappingURL=dep-d010148e.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-d010148e.js","sources":["../../node_modules/lodash/_isFlattenable.js","../../node_modules/lodash/_baseFlatten.js","../../node_modules/lodash/flatten.js","../../node_modules/lodash/_flatRest.js"],"sourcesContent":["var Symbol = require('./_Symbol'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray');\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","var arrayPush = require('./_arrayPush'),\n    isFlattenable = require('./_isFlattenable');\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseFlatten;\n","var baseFlatten = require('./_baseFlatten');\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nmodule.exports = flatten;\n","var flatten = require('./flatten'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n"],"names":["Symbol","require$$0","isArguments","require$$1","isArray","require$$2","spreadableSymbol","isConcatSpreadable","undefined","isFlattenable","value","_isFlattenable","arrayPush","baseFlatten","array","depth","predicate","isStrict","result","index","length","_baseFlatten","flatten","flatten_1","overRest","setToString","flatRest","func","_flatRest"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,OAAM,GAAGC,SAAb;AAAA,IACIC,WAAW,GAAGC,aADlB;AAAA,IAEIC,OAAO,GAAGC,SAFd,CAAA;AAIA;;AACA,IAAIC,gBAAgB,GAAGN,OAAM,GAAGA,OAAM,CAACO,kBAAV,GAA+BC,SAA5D,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,eAAT,CAAuBC,KAAvB,EAA8B;EAC5B,OAAON,OAAO,CAACM,KAAD,CAAP,IAAkBR,WAAW,CAACQ,KAAD,CAA7B,IACL,CAAC,EAAEJ,gBAAgB,IAAII,KAApB,IAA6BA,KAAK,CAACJ,gBAAD,CAApC,CADH,CAAA;AAED,CAAA;;AAED,IAAAK,cAAc,GAAGF,eAAjB;;ACnBA,IAAIG,SAAS,GAAGX,UAAhB;AAAA,IACIQ,aAAa,GAAGN,cADpB,CAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASU,aAAT,CAAqBC,KAArB,EAA4BC,KAA5B,EAAmCC,SAAnC,EAA8CC,QAA9C,EAAwDC,MAAxD,EAAgE;EAC9D,IAAIC,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGN,KAAK,CAACM,MADnB,CAAA;AAGAJ,EAAAA,SAAS,KAAKA,SAAS,GAAGP,aAAjB,CAAT,CAAA;AACAS,EAAAA,MAAM,KAAKA,MAAM,GAAG,EAAd,CAAN,CAAA;;AAEA,EAAA,OAAO,EAAEC,KAAF,GAAUC,MAAjB,EAAyB;AACvB,IAAA,IAAIV,KAAK,GAAGI,KAAK,CAACK,KAAD,CAAjB,CAAA;;IACA,IAAIJ,KAAK,GAAG,CAAR,IAAaC,SAAS,CAACN,KAAD,CAA1B,EAAmC;MACjC,IAAIK,KAAK,GAAG,CAAZ,EAAe;AACrB;AACQF,QAAAA,aAAW,CAACH,KAAD,EAAQK,KAAK,GAAG,CAAhB,EAAmBC,SAAnB,EAA8BC,QAA9B,EAAwCC,MAAxC,CAAX,CAAA;AACD,OAHD,MAGO;AACLN,QAAAA,SAAS,CAACM,MAAD,EAASR,KAAT,CAAT,CAAA;AACD,OAAA;AACF,KAPD,MAOO,IAAI,CAACO,QAAL,EAAe;AACpBC,MAAAA,MAAM,CAACA,MAAM,CAACE,MAAR,CAAN,GAAwBV,KAAxB,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAOQ,MAAP,CAAA;AACD,CAAA;;AAEDG,IAAAA,YAAc,GAAGR;;ACrCjB,IAAIA,WAAW,GAAGZ,YAAlB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASqB,SAAT,CAAiBR,KAAjB,EAAwB;EACtB,IAAIM,MAAM,GAAGN,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACM,MAAvC,CAAA;EACA,OAAOA,MAAM,GAAGP,WAAW,CAACC,KAAD,EAAQ,CAAR,CAAd,GAA2B,EAAxC,CAAA;AACD,CAAA;;AAED,IAAAS,SAAc,GAAGD,SAAjB;;ACrBA,IAAIA,OAAO,GAAGrB,SAAd;AAAA,IACIuB,QAAQ,GAAGrB,SADf;AAAA,IAEIsB,WAAW,GAAGpB,YAFlB,CAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASqB,QAAT,CAAkBC,IAAlB,EAAwB;AACtB,EAAA,OAAOF,WAAW,CAACD,QAAQ,CAACG,IAAD,EAAOnB,SAAP,EAAkBc,OAAlB,CAAT,EAAqCK,IAAI,GAAG,EAA5C,CAAlB,CAAA;AACD,CAAA;;AAEDC,IAAAA,SAAc,GAAGF;;;;"}

package/es/_chunks/dep-d16bcc09.js

@@ -0,0 +1,495 @@
+/**
+ * tdesign v0.36.0
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import './dep-a2b419e6.js';
+import { a as _getNative, _ as _Map } from './dep-345bfbb9.js';
+import { e as eq_1 } from './dep-3a89f366.js';
+import { _ as _typeof } from './dep-c6112a7e.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-d16bcc09.js.map