tdesign-react 1.1.2 → 1.1.3-alpha

package/cjs/_chunks/dep-7afaeb70.js

@@ -0,0 +1,200 @@
+/**
+ * tdesign v1.0.4
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _MapCache = require('./dep-0ab068de.js');
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+/**
+ * Adds `value` to the array cache.
+ *
+ * @private
+ * @name add
+ * @memberOf SetCache
+ * @alias push
+ * @param {*} value The value to cache.
+ * @returns {Object} Returns the cache instance.
+ */
+function setCacheAdd$1(value) {
+  this.__data__.set(value, HASH_UNDEFINED);
+  return this;
+}
+var _setCacheAdd = setCacheAdd$1;
+
+/**
+ * Checks if `value` is in the array cache.
+ *
+ * @private
+ * @name has
+ * @memberOf SetCache
+ * @param {*} value The value to search for.
+ * @returns {number} Returns `true` if `value` is found, else `false`.
+ */
+function setCacheHas$1(value) {
+  return this.__data__.has(value);
+}
+var _setCacheHas = setCacheHas$1;
+
+var MapCache = _MapCache._MapCache,
+  setCacheAdd = _setCacheAdd,
+  setCacheHas = _setCacheHas;
+
+/**
+ *
+ * Creates an array cache object to store unique values.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [values] The values to cache.
+ */
+function SetCache(values) {
+  var index = -1,
+    length = values == null ? 0 : values.length;
+  this.__data__ = new MapCache();
+  while (++index < length) {
+    this.add(values[index]);
+  }
+}
+
+// Add methods to `SetCache`.
+SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
+SetCache.prototype.has = setCacheHas;
+var _SetCache = SetCache;
+
+/**
+ * The base implementation of `_.findIndex` and `_.findLastIndex` without
+ * support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {number} fromIndex The index to search from.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseFindIndex$1(array, predicate, fromIndex, fromRight) {
+  var length = array.length,
+    index = fromIndex + (fromRight ? 1 : -1);
+  while (fromRight ? index-- : ++index < length) {
+    if (predicate(array[index], index, array)) {
+      return index;
+    }
+  }
+  return -1;
+}
+var _baseFindIndex = baseFindIndex$1;
+
+/**
+ * The base implementation of `_.isNaN` without support for number objects.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+ */
+function baseIsNaN$1(value) {
+  return value !== value;
+}
+var _baseIsNaN = baseIsNaN$1;
+
+/**
+ * A specialized version of `_.indexOf` which performs strict equality
+ * comparisons of values, i.e. `===`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function strictIndexOf$1(array, value, fromIndex) {
+  var index = fromIndex - 1,
+    length = array.length;
+  while (++index < length) {
+    if (array[index] === value) {
+      return index;
+    }
+  }
+  return -1;
+}
+var _strictIndexOf = strictIndexOf$1;
+
+var baseFindIndex = _baseFindIndex,
+  baseIsNaN = _baseIsNaN,
+  strictIndexOf = _strictIndexOf;
+
+/**
+ * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseIndexOf$1(array, value, fromIndex) {
+  return value === value ? strictIndexOf(array, value, fromIndex) : baseFindIndex(array, baseIsNaN, fromIndex);
+}
+var _baseIndexOf = baseIndexOf$1;
+
+var baseIndexOf = _baseIndexOf;
+
+/**
+ * A specialized version of `_.includes` for arrays without support for
+ * specifying an index to search from.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+function arrayIncludes(array, value) {
+  var length = array == null ? 0 : array.length;
+  return !!length && baseIndexOf(array, value, 0) > -1;
+}
+var _arrayIncludes = arrayIncludes;
+
+/**
+ * This function is like `arrayIncludes` except that it accepts a comparator.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @param {Function} comparator The comparator invoked per element.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+function arrayIncludesWith(array, value, comparator) {
+  var index = -1,
+    length = array == null ? 0 : array.length;
+  while (++index < length) {
+    if (comparator(value, array[index])) {
+      return true;
+    }
+  }
+  return false;
+}
+var _arrayIncludesWith = arrayIncludesWith;
+
+/**
+ * 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;
+
+exports._SetCache = _SetCache;
+exports._arrayIncludes = _arrayIncludes;
+exports._arrayIncludesWith = _arrayIncludesWith;
+exports._cacheHas = _cacheHas;
+//# sourceMappingURL=dep-7afaeb70.js.map

package/cjs/_chunks/dep-7afaeb70.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-7afaeb70.js","sources":["../../node_modules/lodash/_setCacheAdd.js","../../node_modules/lodash/_setCacheHas.js","../../node_modules/lodash/_SetCache.js","../../node_modules/lodash/_baseFindIndex.js","../../node_modules/lodash/_baseIsNaN.js","../../node_modules/lodash/_strictIndexOf.js","../../node_modules/lodash/_baseIndexOf.js","../../node_modules/lodash/_arrayIncludes.js","../../node_modules/lodash/_arrayIncludesWith.js","../../node_modules/lodash/_cacheHas.js"],"sourcesContent":["/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","/**\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":["HASH_UNDEFINED","setCacheAdd","value","__data__","set","_setCacheAdd","setCacheHas","has","_setCacheHas","MapCache","require$$0","require$$1","require$$2","SetCache","values","index","length","add","prototype","push","_SetCache","baseFindIndex","array","predicate","fromIndex","fromRight","_baseFindIndex","baseIsNaN","_baseIsNaN","strictIndexOf","_strictIndexOf","baseIndexOf","_baseIndexOf","arrayIncludes","_arrayIncludes","arrayIncludesWith","comparator","_arrayIncludesWith","cacheHas","cache","key","_cacheHas"],"mappings":";;;;;;;;;;;AACA,IAAIA,cAAc,GAAG,2BAA2B,CAAA;;AAEhD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,aAAW,CAACC,KAAK,EAAE;EAC1B,IAAI,CAACC,QAAQ,CAACC,GAAG,CAACF,KAAK,EAAEF,cAAc,CAAC,CAAA;AACxC,EAAA,OAAO,IAAI,CAAA;AACb,CAAA;AAEA,IAAAK,YAAc,GAAGJ,aAAW;;;;;;;;;;;ACT5B,SAASK,aAAW,CAACJ,KAAK,EAAE;AAC1B,EAAA,OAAO,IAAI,CAACC,QAAQ,CAACI,GAAG,CAACL,KAAK,CAAC,CAAA;AACjC,CAAA;AAEA,IAAAM,YAAc,GAAGF,aAAW;;ACb5B,IAAIG,QAAQ,GAAGC,mBAAsB;AACjCT,EAAAA,WAAW,GAAGU,YAAyB;AACvCL,EAAAA,WAAW,GAAGM,YAAyB,CAAA;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQ,CAACC,MAAM,EAAE;EACxB,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGF,MAAM,IAAI,IAAI,GAAG,CAAC,GAAGA,MAAM,CAACE,MAAM,CAAA;AAE/C,EAAA,IAAI,CAACb,QAAQ,GAAG,IAAIM,QAAQ,EAAA,CAAA;AAC5B,EAAA,OAAO,EAAEM,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAI,CAACC,GAAG,CAACH,MAAM,CAACC,KAAK,CAAC,CAAC,CAAA;AACxB,GAAA;AACH,CAAA;;AAEA;AACAF,QAAQ,CAACK,SAAS,CAACD,GAAG,GAAGJ,QAAQ,CAACK,SAAS,CAACC,IAAI,GAAGlB,WAAW,CAAA;AAC9DY,QAAQ,CAACK,SAAS,CAACX,GAAG,GAAGD,WAAW,CAAA;AAEpCc,IAAAA,SAAc,GAAGP;;;;;;;;;;;;;ACfjB,SAASQ,eAAa,CAACC,KAAK,EAAEC,SAAS,EAAEC,SAAS,EAAEC,SAAS,EAAE;AAC7D,EAAA,IAAIT,MAAM,GAAGM,KAAK,CAACN,MAAM;IACrBD,KAAK,GAAGS,SAAS,IAAIC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;EAE5C,OAAQA,SAAS,GAAGV,KAAK,EAAE,GAAG,EAAEA,KAAK,GAAGC,MAAM,EAAG;IAC/C,IAAIO,SAAS,CAACD,KAAK,CAACP,KAAK,CAAC,EAAEA,KAAK,EAAEO,KAAK,CAAC,EAAE;AACzC,MAAA,OAAOP,KAAK,CAAA;AACb,KAAA;AACF,GAAA;AACD,EAAA,OAAO,CAAC,CAAC,CAAA;AACX,CAAA;AAEA,IAAAW,cAAc,GAAGL,eAAa;;;;;;;;;AChB9B,SAASM,WAAS,CAACzB,KAAK,EAAE;EACxB,OAAOA,KAAK,KAAKA,KAAK,CAAA;AACxB,CAAA;AAEA,IAAA0B,UAAc,GAAGD,WAAS;;;;;;;;;;;;ACD1B,SAASE,eAAa,CAACP,KAAK,EAAEpB,KAAK,EAAEsB,SAAS,EAAE;AAC9C,EAAA,IAAIT,KAAK,GAAGS,SAAS,GAAG,CAAC;IACrBR,MAAM,GAAGM,KAAK,CAACN,MAAM,CAAA;AAEzB,EAAA,OAAO,EAAED,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAIM,KAAK,CAACP,KAAK,CAAC,KAAKb,KAAK,EAAE;AAC1B,MAAA,OAAOa,KAAK,CAAA;AACb,KAAA;AACF,GAAA;AACD,EAAA,OAAO,CAAC,CAAC,CAAA;AACX,CAAA;AAEA,IAAAe,cAAc,GAAGD,eAAa;;ACtB9B,IAAIR,aAAa,GAAGX,cAA2B;AAC3CiB,EAAAA,SAAS,GAAGhB,UAAuB;AACnCkB,EAAAA,aAAa,GAAGjB,cAA2B,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASmB,aAAW,CAACT,KAAK,EAAEpB,KAAK,EAAEsB,SAAS,EAAE;EAC5C,OAAOtB,KAAK,KAAKA,KAAK,GAClB2B,aAAa,CAACP,KAAK,EAAEpB,KAAK,EAAEsB,SAAS,CAAC,GACtCH,aAAa,CAACC,KAAK,EAAEK,SAAS,EAAEH,SAAS,CAAC,CAAA;AAChD,CAAA;AAEA,IAAAQ,YAAc,GAAGD,aAAW;;ACnB5B,IAAIA,WAAW,GAAGrB,YAAyB,CAAA;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASuB,aAAa,CAACX,KAAK,EAAEpB,KAAK,EAAE;EACnC,IAAIc,MAAM,GAAGM,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACN,MAAM,CAAA;AAC7C,EAAA,OAAO,CAAC,CAACA,MAAM,IAAIe,WAAW,CAACT,KAAK,EAAEpB,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;AACtD,CAAA;AAEAgC,IAAAA,cAAc,GAAGD;;;;;;;;;;;ACPjB,SAASE,iBAAiB,CAACb,KAAK,EAAEpB,KAAK,EAAEkC,UAAU,EAAE;EACnD,IAAIrB,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGM,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACN,MAAM,CAAA;AAE7C,EAAA,OAAO,EAAED,KAAK,GAAGC,MAAM,EAAE;IACvB,IAAIoB,UAAU,CAAClC,KAAK,EAAEoB,KAAK,CAACP,KAAK,CAAC,CAAC,EAAE;AACnC,MAAA,OAAO,IAAI,CAAA;AACZ,KAAA;AACF,GAAA;AACD,EAAA,OAAO,KAAK,CAAA;AACd,CAAA;AAEAsB,IAAAA,kBAAc,GAAGF;;;;;;;;;;ACbjB,SAASG,QAAQ,CAACC,KAAK,EAAEC,GAAG,EAAE;AAC5B,EAAA,OAAOD,KAAK,CAAChC,GAAG,CAACiC,GAAG,CAAC,CAAA;AACvB,CAAA;AAEAC,IAAAA,SAAc,GAAGH;;;;;;;"}

package/cjs/_chunks/dep-7b36790c.js

@@ -0,0 +1,110 @@
+/**
+ * tdesign v1.1.1
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var isObject$1 = require('./dep-4815250e.js');
+var isSymbol$1 = require('./dep-d4801906.js');
+
+/** Used to match a single whitespace character. */
+var reWhitespace = /\s/;
+
+/**
+ * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace
+ * character of `string`.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @returns {number} Returns the index of the last non-whitespace character.
+ */
+function trimmedEndIndex$1(string) {
+  var index = string.length;
+  while (index-- && reWhitespace.test(string.charAt(index))) {}
+  return index;
+}
+var _trimmedEndIndex = trimmedEndIndex$1;
+
+var trimmedEndIndex = _trimmedEndIndex;
+
+/** Used to match leading whitespace. */
+var reTrimStart = /^\s+/;
+
+/**
+ * The base implementation of `_.trim`.
+ *
+ * @private
+ * @param {string} string The string to trim.
+ * @returns {string} Returns the trimmed string.
+ */
+function baseTrim$1(string) {
+  return string ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '') : string;
+}
+var _baseTrim = baseTrim$1;
+
+var baseTrim = _baseTrim,
+  isObject = isObject$1.isObject_1,
+  isSymbol = isSymbol$1.isSymbol_1;
+
+/** Used as references for various `Number` constants. */
+var NAN = 0 / 0;
+
+/** Used to detect bad signed hexadecimal string values. */
+var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
+
+/** Used to detect binary string values. */
+var reIsBinary = /^0b[01]+$/i;
+
+/** Used to detect octal string values. */
+var reIsOctal = /^0o[0-7]+$/i;
+
+/** Built-in method references without a dependency on `root`. */
+var freeParseInt = parseInt;
+
+/**
+ * Converts `value` to a number.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to process.
+ * @returns {number} Returns the number.
+ * @example
+ *
+ * _.toNumber(3.2);
+ * // => 3.2
+ *
+ * _.toNumber(Number.MIN_VALUE);
+ * // => 5e-324
+ *
+ * _.toNumber(Infinity);
+ * // => Infinity
+ *
+ * _.toNumber('3.2');
+ * // => 3.2
+ */
+function toNumber(value) {
+  if (typeof value == 'number') {
+    return value;
+  }
+  if (isSymbol(value)) {
+    return NAN;
+  }
+  if (isObject(value)) {
+    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;
+    value = isObject(other) ? other + '' : other;
+  }
+  if (typeof value != 'string') {
+    return value === 0 ? value : +value;
+  }
+  value = baseTrim(value);
+  var isBinary = reIsBinary.test(value);
+  return isBinary || reIsOctal.test(value) ? freeParseInt(value.slice(2), isBinary ? 2 : 8) : reIsBadHex.test(value) ? NAN : +value;
+}
+var toNumber_1 = toNumber;
+
+exports.toNumber_1 = toNumber_1;
+//# sourceMappingURL=dep-7b36790c.js.map

package/cjs/_chunks/dep-7b36790c.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-7b36790c.js","sources":["../../node_modules/lodash/_trimmedEndIndex.js","../../node_modules/lodash/_baseTrim.js","../../node_modules/lodash/toNumber.js"],"sourcesContent":["/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nmodule.exports = baseTrim;\n","var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n"],"names":["reWhitespace","trimmedEndIndex","string","index","length","test","charAt","_trimmedEndIndex","require$$0","reTrimStart","baseTrim","slice","replace","_baseTrim","isObject","require$$1","isSymbol","require$$2","NAN","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","toNumber","value","other","valueOf","isBinary","toNumber_1"],"mappings":";;;;;;;;;;;;AACA,IAAIA,YAAY,GAAG,IAAI,CAAA;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,iBAAeA,CAACC,MAAM,EAAE;AAC/B,EAAA,IAAIC,KAAK,GAAGD,MAAM,CAACE,MAAM,CAAA;AAEzB,EAAA,OAAOD,KAAK,EAAE,IAAIH,YAAY,CAACK,IAAI,CAACH,MAAM,CAACI,MAAM,CAACH,KAAK,CAAC,CAAC,EAAE,EAAE;AAC7D,EAAA,OAAOA,KAAK,CAAA;AACd,CAAA;AAEA,IAAAI,gBAAc,GAAGN,iBAAe;;AClBhC,IAAIA,eAAe,GAAGO,gBAA6B,CAAA;;AAEnD;AACA,IAAIC,WAAW,GAAG,MAAM,CAAA;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAQA,CAACR,MAAM,EAAE;EACxB,OAAOA,MAAM,GACTA,MAAM,CAACS,KAAK,CAAC,CAAC,EAAEV,eAAe,CAACC,MAAM,CAAC,GAAG,CAAC,CAAC,CAACU,OAAO,CAACH,WAAW,EAAE,EAAE,CAAC,GACrEP,MAAM,CAAA;AACZ,CAAA;AAEA,IAAAW,SAAc,GAAGH,UAAQ;;AClBzB,IAAIA,QAAQ,GAAGF,SAAsB;AACjCM,EAAAA,QAAQ,GAAGC,qBAAqB;AAChCC,EAAAA,QAAQ,GAAGC,qBAAqB,CAAA;;AAEpC;AACA,IAAIC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;;AAEf;AACA,IAAIC,UAAU,GAAG,oBAAoB,CAAA;;AAErC;AACA,IAAIC,UAAU,GAAG,YAAY,CAAA;;AAE7B;AACA,IAAIC,SAAS,GAAG,aAAa,CAAA;;AAE7B;AACA,IAAIC,YAAY,GAAGC,QAAQ,CAAA;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQA,CAACC,KAAK,EAAE;AACvB,EAAA,IAAI,OAAOA,KAAK,IAAI,QAAQ,EAAE;AAC5B,IAAA,OAAOA,KAAK,CAAA;AACb,GAAA;AACD,EAAA,IAAIT,QAAQ,CAACS,KAAK,CAAC,EAAE;AACnB,IAAA,OAAOP,GAAG,CAAA;AACX,GAAA;AACD,EAAA,IAAIJ,QAAQ,CAACW,KAAK,CAAC,EAAE;AACnB,IAAA,IAAIC,KAAK,GAAG,OAAOD,KAAK,CAACE,OAAO,IAAI,UAAU,GAAGF,KAAK,CAACE,OAAO,EAAE,GAAGF,KAAK,CAAA;IACxEA,KAAK,GAAGX,QAAQ,CAACY,KAAK,CAAC,GAAIA,KAAK,GAAG,EAAE,GAAIA,KAAK,CAAA;AAC/C,GAAA;AACD,EAAA,IAAI,OAAOD,KAAK,IAAI,QAAQ,EAAE;AAC5B,IAAA,OAAOA,KAAK,KAAK,CAAC,GAAGA,KAAK,GAAG,CAACA,KAAK,CAAA;AACpC,GAAA;AACDA,EAAAA,KAAK,GAAGf,QAAQ,CAACe,KAAK,CAAC,CAAA;AACvB,EAAA,IAAIG,QAAQ,GAAGR,UAAU,CAACf,IAAI,CAACoB,KAAK,CAAC,CAAA;AACrC,EAAA,OAAQG,QAAQ,IAAIP,SAAS,CAAChB,IAAI,CAACoB,KAAK,CAAC,GACrCH,YAAY,CAACG,KAAK,CAACd,KAAK,CAAC,CAAC,CAAC,EAAEiB,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAC7CT,UAAU,CAACd,IAAI,CAACoB,KAAK,CAAC,GAAGP,GAAG,GAAG,CAACO,KAAM,CAAA;AAC7C,CAAA;AAEAI,IAAAA,UAAc,GAAGL;;;;"}