tdesign-react 1.1.2 → 1.1.3-alpha

package/cjs/_chunks/dep-6bb503fb.js

@@ -0,0 +1,41 @@
+/**
+ * tdesign v1.1.1
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _baseClone = require('./dep-a6f5782d.js');
+
+var baseClone = _baseClone._baseClone;
+
+/** Used to compose bitmasks for cloning. */
+var CLONE_DEEP_FLAG = 1,
+  CLONE_SYMBOLS_FLAG = 4;
+
+/**
+ * This method is like `_.clone` except that it recursively clones `value`.
+ *
+ * @static
+ * @memberOf _
+ * @since 1.0.0
+ * @category Lang
+ * @param {*} value The value to recursively clone.
+ * @returns {*} Returns the deep cloned value.
+ * @see _.clone
+ * @example
+ *
+ * var objects = [{ 'a': 1 }, { 'b': 2 }];
+ *
+ * var deep = _.cloneDeep(objects);
+ * console.log(deep[0] === objects[0]);
+ * // => false
+ */
+function cloneDeep(value) {
+  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);
+}
+var cloneDeep_1 = cloneDeep;
+
+exports.cloneDeep_1 = cloneDeep_1;
+//# sourceMappingURL=dep-6bb503fb.js.map

package/cjs/_chunks/{dep-a4ed3eca.js.map → dep-6bb503fb.js.map}

@@ -1 +1 @@
-{"version":3,"file":"dep-a4ed3eca.js","sources":["../../node_modules/lodash/cloneDeep.js"],"sourcesContent":["var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\n"],"names":["baseClone","require$$0","CLONE_DEEP_FLAG","CLONE_SYMBOLS_FLAG","cloneDeep","value","cloneDeep_1"],"mappings":";;;;;;;;;;AAAA,IAAIA,SAAS,GAAGC,qBAAuB,CAAA;;AAEvC;AACA,IAAIC,eAAe,GAAG,CAAC;AACnBC,EAAAA,kBAAkB,GAAG,CAAC,CAAA;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,SAASA,CAACC,KAAK,EAAE;AACxB,EAAA,OAAOL,SAAS,CAACK,KAAK,EAAEH,eAAe,GAAGC,kBAAkB,CAAC,CAAA;AAC/D,CAAA;AAEAG,IAAAA,WAAc,GAAGF;;;;"}
+{"version":3,"file":"dep-6bb503fb.js","sources":["../../node_modules/lodash/cloneDeep.js"],"sourcesContent":["var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\n"],"names":["baseClone","require$$0","CLONE_DEEP_FLAG","CLONE_SYMBOLS_FLAG","cloneDeep","value","cloneDeep_1"],"mappings":";;;;;;;;;;AAAA,IAAIA,SAAS,GAAGC,qBAAuB,CAAA;;AAEvC;AACA,IAAIC,eAAe,GAAG,CAAC;AACnBC,EAAAA,kBAAkB,GAAG,CAAC,CAAA;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,SAASA,CAACC,KAAK,EAAE;AACxB,EAAA,OAAOL,SAAS,CAACK,KAAK,EAAEH,eAAe,GAAGC,kBAAkB,CAAC,CAAA;AAC/D,CAAA;AAEAG,IAAAA,WAAc,GAAGF;;;;"}

package/cjs/_chunks/dep-6bc07789.js

@@ -0,0 +1,200 @@
+/**
+ * tdesign v1.1.1
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _MapCache = require('./dep-efb93fe4.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-6bc07789.js.map

package/cjs/_chunks/dep-6bc07789.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-6bc07789.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,aAAWA,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,aAAWA,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,QAAQA,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,eAAaA,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,WAASA,CAACzB,KAAK,EAAE;EACxB,OAAOA,KAAK,KAAKA,KAAK,CAAA;AACxB,CAAA;AAEA,IAAA0B,UAAc,GAAGD,WAAS;;;;;;;;;;;;ACD1B,SAASE,eAAaA,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,aAAWA,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,aAAaA,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,iBAAiBA,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,QAAQA,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-6c4c8532.js

@@ -0,0 +1,60 @@
+/**
+ * tdesign v1.1.1
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var keysIn = require('./dep-cf38af2d.js');
+var _baseGet = require('./dep-098391c7.js');
+var _isIndex = require('./dep-51765b9b.js');
+var isObject$1 = require('./dep-4815250e.js');
+
+var assignValue = keysIn._assignValue,
+  castPath = _baseGet._castPath,
+  isIndex = _isIndex._isIndex,
+  isObject = isObject$1.isObject_1,
+  toKey = _baseGet._toKey;
+
+/**
+ * The base implementation of `_.set`.
+ *
+ * @private
+ * @param {Object} object The object to modify.
+ * @param {Array|string} path The path of the property to set.
+ * @param {*} value The value to set.
+ * @param {Function} [customizer] The function to customize path creation.
+ * @returns {Object} Returns `object`.
+ */
+function baseSet(object, path, value, customizer) {
+  if (!isObject(object)) {
+    return object;
+  }
+  path = castPath(path, object);
+  var index = -1,
+    length = path.length,
+    lastIndex = length - 1,
+    nested = object;
+  while (nested != null && ++index < length) {
+    var key = toKey(path[index]),
+      newValue = value;
+    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
+      return object;
+    }
+    if (index != lastIndex) {
+      var objValue = nested[key];
+      newValue = customizer ? customizer(objValue, key, nested) : undefined;
+      if (newValue === undefined) {
+        newValue = isObject(objValue) ? objValue : isIndex(path[index + 1]) ? [] : {};
+      }
+    }
+    assignValue(nested, key, newValue);
+    nested = nested[key];
+  }
+  return object;
+}
+var _baseSet = baseSet;
+
+exports._baseSet = _baseSet;
+//# sourceMappingURL=dep-6c4c8532.js.map

package/cjs/_chunks/dep-6c4c8532.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-6c4c8532.js","sources":["../../node_modules/lodash/_baseSet.js"],"sourcesContent":["var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n"],"names":["assignValue","require$$0","castPath","require$$1","isIndex","require$$2","isObject","require$$3","toKey","require$$4","baseSet","object","path","value","customizer","index","length","lastIndex","nested","key","newValue","objValue","undefined","_baseSet"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,WAAW,GAAGC,mBAAyB;AACvCC,EAAAA,QAAQ,GAAGC,kBAAsB;AACjCC,EAAAA,OAAO,GAAGC,iBAAqB;AAC/BC,EAAAA,QAAQ,GAAGC,qBAAqB;AAChCC,EAAAA,KAAK,GAAGC,eAAmB,CAAA;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,OAAOA,CAACC,MAAM,EAAEC,IAAI,EAAEC,KAAK,EAAEC,UAAU,EAAE;AAChD,EAAA,IAAI,CAACR,QAAQ,CAACK,MAAM,CAAC,EAAE;AACrB,IAAA,OAAOA,MAAM,CAAA;AACd,GAAA;AACDC,EAAAA,IAAI,GAAGV,QAAQ,CAACU,IAAI,EAAED,MAAM,CAAC,CAAA;EAE7B,IAAII,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGJ,IAAI,CAACI,MAAM;IACpBC,SAAS,GAAGD,MAAM,GAAG,CAAC;AACtBE,IAAAA,MAAM,GAAGP,MAAM,CAAA;EAEnB,OAAOO,MAAM,IAAI,IAAI,IAAI,EAAEH,KAAK,GAAGC,MAAM,EAAE;IACzC,IAAIG,GAAG,GAAGX,KAAK,CAACI,IAAI,CAACG,KAAK,CAAC,CAAC;AACxBK,MAAAA,QAAQ,GAAGP,KAAK,CAAA;IAEpB,IAAIM,GAAG,KAAK,WAAW,IAAIA,GAAG,KAAK,aAAa,IAAIA,GAAG,KAAK,WAAW,EAAE;AACvE,MAAA,OAAOR,MAAM,CAAA;AACd,KAAA;IAED,IAAII,KAAK,IAAIE,SAAS,EAAE;AACtB,MAAA,IAAII,QAAQ,GAAGH,MAAM,CAACC,GAAG,CAAC,CAAA;AAC1BC,MAAAA,QAAQ,GAAGN,UAAU,GAAGA,UAAU,CAACO,QAAQ,EAAEF,GAAG,EAAED,MAAM,CAAC,GAAGI,SAAS,CAAA;MACrE,IAAIF,QAAQ,KAAKE,SAAS,EAAE;QAC1BF,QAAQ,GAAGd,QAAQ,CAACe,QAAQ,CAAC,GACzBA,QAAQ,GACPjB,OAAO,CAACQ,IAAI,CAACG,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAG,CAAA;AACzC,OAAA;AACF,KAAA;AACDf,IAAAA,WAAW,CAACkB,MAAM,EAAEC,GAAG,EAAEC,QAAQ,CAAC,CAAA;AAClCF,IAAAA,MAAM,GAAGA,MAAM,CAACC,GAAG,CAAC,CAAA;AACrB,GAAA;AACD,EAAA,OAAOR,MAAM,CAAA;AACf,CAAA;AAEAY,IAAAA,QAAc,GAAGb;;;;"}

package/cjs/_chunks/dep-6dc9822b.js

@@ -0,0 +1,110 @@
+/**
+ * tdesign v1.0.4
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _arrayPush = require('./dep-b5b609e4.js');
+var _baseGetTag = require('./dep-4e0e0ffa.js');
+var isTypedArray = require('./dep-63223331.js');
+var isArray$1 = require('./dep-c1f362c5.js');
+var _setToString = require('./dep-8937598f.js');
+
+var _Symbol = _baseGetTag._Symbol,
+  isArguments = isTypedArray.isArguments_1,
+  isArray = isArray$1.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._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 = _setToString._overRest,
+  setToString = _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;
+
+exports._baseFlatten = _baseFlatten;
+exports._flatRest = _flatRest;
+//# sourceMappingURL=dep-6dc9822b.js.map

package/cjs/_chunks/dep-6dc9822b.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-6dc9822b.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,mBAAoB;AAC7BC,EAAAA,WAAW,GAAGC,0BAAwB;AACtCC,EAAAA,OAAO,GAAGC,mBAAoB,CAAA;;AAElC;AACA,IAAIC,gBAAgB,GAAGN,OAAM,GAAGA,OAAM,CAACO,kBAAkB,GAAGC,SAAS,CAAA;;AAErE;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,eAAa,CAACC,KAAK,EAAE;EAC5B,OAAON,OAAO,CAACM,KAAK,CAAC,IAAIR,WAAW,CAACQ,KAAK,CAAC,IACzC,CAAC,EAAEJ,gBAAgB,IAAII,KAAK,IAAIA,KAAK,CAACJ,gBAAgB,CAAC,CAAC,CAAA;AAC5D,CAAA;AAEA,IAAAK,cAAc,GAAGF,eAAa;;ACnB9B,IAAIG,SAAS,GAAGX,qBAAuB;AACnCQ,EAAAA,aAAa,GAAGN,cAA2B,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASU,aAAW,CAACC,KAAK,EAAEC,KAAK,EAAEC,SAAS,EAAEC,QAAQ,EAAEC,MAAM,EAAE;EAC9D,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGN,KAAK,CAACM,MAAM,CAAA;AAEzBJ,EAAAA,SAAS,KAAKA,SAAS,GAAGP,aAAa,CAAC,CAAA;AACxCS,EAAAA,MAAM,KAAKA,MAAM,GAAG,EAAE,CAAC,CAAA;AAEvB,EAAA,OAAO,EAAEC,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAIV,KAAK,GAAGI,KAAK,CAACK,KAAK,CAAC,CAAA;IACxB,IAAIJ,KAAK,GAAG,CAAC,IAAIC,SAAS,CAACN,KAAK,CAAC,EAAE;MACjC,IAAIK,KAAK,GAAG,CAAC,EAAE;AACrB;AACQF,QAAAA,aAAW,CAACH,KAAK,EAAEK,KAAK,GAAG,CAAC,EAAEC,SAAS,EAAEC,QAAQ,EAAEC,MAAM,CAAC,CAAA;AAClE,OAAO,MAAM;AACLN,QAAAA,SAAS,CAACM,MAAM,EAAER,KAAK,CAAC,CAAA;AACzB,OAAA;AACP,KAAK,MAAM,IAAI,CAACO,QAAQ,EAAE;AACpBC,MAAAA,MAAM,CAACA,MAAM,CAACE,MAAM,CAAC,GAAGV,KAAK,CAAA;AAC9B,KAAA;AACF,GAAA;AACD,EAAA,OAAOQ,MAAM,CAAA;AACf,CAAA;AAEAG,IAAAA,YAAc,GAAGR;;ACrCjB,IAAIA,WAAW,GAAGZ,YAAyB,CAAA;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASqB,SAAO,CAACR,KAAK,EAAE;EACtB,IAAIM,MAAM,GAAGN,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACM,MAAM,CAAA;EAC7C,OAAOA,MAAM,GAAGP,WAAW,CAACC,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAA;AAC5C,CAAA;AAEA,IAAAS,SAAc,GAAGD,SAAO;;ACrBxB,IAAIA,OAAO,GAAGrB,SAAoB;AAC9BuB,EAAAA,QAAQ,GAAGrB,sBAAsB;AACjCsB,EAAAA,WAAW,GAAGpB,yBAAyB,CAAA;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASqB,QAAQ,CAACC,IAAI,EAAE;AACtB,EAAA,OAAOF,WAAW,CAACD,QAAQ,CAACG,IAAI,EAAEnB,SAAS,EAAEc,OAAO,CAAC,EAAEK,IAAI,GAAG,EAAE,CAAC,CAAA;AACnE,CAAA;AAEAC,IAAAA,SAAc,GAAGF;;;;;"}

package/cjs/_chunks/dep-6df1c156.js

@@ -0,0 +1,81 @@
+/**
+ * tdesign v1.0.4
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var debounce$1 = require('./dep-3d9b6af3.js');
+var isObject$1 = require('./dep-226175a4.js');
+
+var debounce = debounce$1.debounce_1,
+  isObject = isObject$1.isObject_1;
+
+/** Error message constants. */
+var FUNC_ERROR_TEXT = 'Expected a function';
+
+/**
+ * Creates a throttled function that only invokes `func` at most once per
+ * every `wait` milliseconds. The throttled function comes with a `cancel`
+ * method to cancel delayed `func` invocations and a `flush` method to
+ * immediately invoke them. Provide `options` to indicate whether `func`
+ * should be invoked on the leading and/or trailing edge of the `wait`
+ * timeout. The `func` is invoked with the last arguments provided to the
+ * throttled function. Subsequent calls to the throttled function return the
+ * result of the last `func` invocation.
+ *
+ * **Note:** If `leading` and `trailing` options are `true`, `func` is
+ * invoked on the trailing edge of the timeout only if the throttled function
+ * is invoked more than once during the `wait` timeout.
+ *
+ * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
+ * until to the next tick, similar to `setTimeout` with a timeout of `0`.
+ *
+ * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
+ * for details over the differences between `_.throttle` and `_.debounce`.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Function
+ * @param {Function} func The function to throttle.
+ * @param {number} [wait=0] The number of milliseconds to throttle invocations to.
+ * @param {Object} [options={}] The options object.
+ * @param {boolean} [options.leading=true]
+ *  Specify invoking on the leading edge of the timeout.
+ * @param {boolean} [options.trailing=true]
+ *  Specify invoking on the trailing edge of the timeout.
+ * @returns {Function} Returns the new throttled function.
+ * @example
+ *
+ * // Avoid excessively updating the position while scrolling.
+ * jQuery(window).on('scroll', _.throttle(updatePosition, 100));
+ *
+ * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.
+ * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });
+ * jQuery(element).on('click', throttled);
+ *
+ * // Cancel the trailing throttled invocation.
+ * jQuery(window).on('popstate', throttled.cancel);
+ */
+function throttle(func, wait, options) {
+  var leading = true,
+    trailing = true;
+  if (typeof func != 'function') {
+    throw new TypeError(FUNC_ERROR_TEXT);
+  }
+  if (isObject(options)) {
+    leading = 'leading' in options ? !!options.leading : leading;
+    trailing = 'trailing' in options ? !!options.trailing : trailing;
+  }
+  return debounce(func, wait, {
+    'leading': leading,
+    'maxWait': wait,
+    'trailing': trailing
+  });
+}
+var throttle_1 = throttle;
+
+exports.throttle_1 = throttle_1;
+//# sourceMappingURL=dep-6df1c156.js.map

package/cjs/_chunks/dep-6df1c156.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-6df1c156.js","sources":["../../node_modules/lodash/throttle.js"],"sourcesContent":["var debounce = require('./debounce'),\n    isObject = require('./isObject');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a throttled function that only invokes `func` at most once per\n * every `wait` milliseconds. The throttled function comes with a `cancel`\n * method to cancel delayed `func` invocations and a `flush` method to\n * immediately invoke them. Provide `options` to indicate whether `func`\n * should be invoked on the leading and/or trailing edge of the `wait`\n * timeout. The `func` is invoked with the last arguments provided to the\n * throttled function. Subsequent calls to the throttled function return the\n * result of the last `func` invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the throttled function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.throttle` and `_.debounce`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to throttle.\n * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=true]\n *  Specify invoking on the leading edge of the timeout.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new throttled function.\n * @example\n *\n * // Avoid excessively updating the position while scrolling.\n * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n *\n * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n * jQuery(element).on('click', throttled);\n *\n * // Cancel the trailing throttled invocation.\n * jQuery(window).on('popstate', throttled.cancel);\n */\nfunction throttle(func, wait, options) {\n  var leading = true,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  if (isObject(options)) {\n    leading = 'leading' in options ? !!options.leading : leading;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n  return debounce(func, wait, {\n    'leading': leading,\n    'maxWait': wait,\n    'trailing': trailing\n  });\n}\n\nmodule.exports = throttle;\n"],"names":["debounce","require$$0","isObject","require$$1","FUNC_ERROR_TEXT","throttle","func","wait","options","leading","trailing","TypeError","throttle_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,qBAAqB;AAChCC,EAAAA,QAAQ,GAAGC,qBAAqB,CAAA;;AAEpC;AACA,IAAIC,eAAe,GAAG,qBAAqB,CAAA;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQ,CAACC,IAAI,EAAEC,IAAI,EAAEC,OAAO,EAAE;EACrC,IAAIC,OAAO,GAAG,IAAI;AACdC,IAAAA,QAAQ,GAAG,IAAI,CAAA;AAEnB,EAAA,IAAI,OAAOJ,IAAI,IAAI,UAAU,EAAE;AAC7B,IAAA,MAAM,IAAIK,SAAS,CAACP,eAAe,CAAC,CAAA;AACrC,GAAA;AACD,EAAA,IAAIF,QAAQ,CAACM,OAAO,CAAC,EAAE;IACrBC,OAAO,GAAG,SAAS,IAAID,OAAO,GAAG,CAAC,CAACA,OAAO,CAACC,OAAO,GAAGA,OAAO,CAAA;IAC5DC,QAAQ,GAAG,UAAU,IAAIF,OAAO,GAAG,CAAC,CAACA,OAAO,CAACE,QAAQ,GAAGA,QAAQ,CAAA;AACjE,GAAA;AACD,EAAA,OAAOV,QAAQ,CAACM,IAAI,EAAEC,IAAI,EAAE;AAC1B,IAAA,SAAS,EAAEE,OAAO;AAClB,IAAA,SAAS,EAAEF,IAAI;AACf,IAAA,UAAU,EAAEG,QAAAA;AAChB,GAAG,CAAC,CAAA;AACJ,CAAA;AAEAE,IAAAA,UAAc,GAAGP;;;;"}

package/cjs/_chunks/dep-6eb660e1.js

@@ -0,0 +1,39 @@
+/**
+ * tdesign v1.0.4
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+function _objectWithoutPropertiesLoose(source, excluded) {
+  if (source == null) return {};
+  var target = {};
+  var sourceKeys = Object.keys(source);
+  var key, i;
+  for (i = 0; i < sourceKeys.length; i++) {
+    key = sourceKeys[i];
+    if (excluded.indexOf(key) >= 0) continue;
+    target[key] = source[key];
+  }
+  return target;
+}
+
+function _objectWithoutProperties(source, excluded) {
+  if (source == null) return {};
+  var target = _objectWithoutPropertiesLoose(source, excluded);
+  var key, i;
+  if (Object.getOwnPropertySymbols) {
+    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
+    for (i = 0; i < sourceSymbolKeys.length; i++) {
+      key = sourceSymbolKeys[i];
+      if (excluded.indexOf(key) >= 0) continue;
+      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
+      target[key] = source[key];
+    }
+  }
+  return target;
+}
+
+exports._objectWithoutProperties = _objectWithoutProperties;
+//# sourceMappingURL=dep-6eb660e1.js.map

package/cjs/_chunks/dep-6eb660e1.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-6eb660e1.js","sources":["../../node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js","../../node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js"],"sourcesContent":["export default function _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n\n  return target;\n}","import objectWithoutPropertiesLoose from \"./objectWithoutPropertiesLoose.js\";\nexport default function _objectWithoutProperties(source, excluded) {\n  if (source == null) return {};\n  var target = objectWithoutPropertiesLoose(source, excluded);\n  var key, i;\n\n  if (Object.getOwnPropertySymbols) {\n    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n\n    for (i = 0; i < sourceSymbolKeys.length; i++) {\n      key = sourceSymbolKeys[i];\n      if (excluded.indexOf(key) >= 0) continue;\n      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n      target[key] = source[key];\n    }\n  }\n\n  return target;\n}"],"names":["_objectWithoutPropertiesLoose","source","excluded","target","sourceKeys","Object","keys","key","i","length","indexOf","_objectWithoutProperties","objectWithoutPropertiesLoose","getOwnPropertySymbols","sourceSymbolKeys","prototype","propertyIsEnumerable","call"],"mappings":";;;;;;;;AAAe,SAASA,6BAA6B,CAACC,MAAM,EAAEC,QAAQ,EAAE;AACtE,EAAA,IAAID,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,CAAA;EAC7B,IAAIE,MAAM,GAAG,EAAE,CAAA;AACf,EAAA,IAAIC,UAAU,GAAGC,MAAM,CAACC,IAAI,CAACL,MAAM,CAAC,CAAA;EACpC,IAAIM,GAAG,EAAEC,CAAC,CAAA;AAEV,EAAA,KAAKA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGJ,UAAU,CAACK,MAAM,EAAED,CAAC,EAAE,EAAE;AACtCD,IAAAA,GAAG,GAAGH,UAAU,CAACI,CAAC,CAAC,CAAA;IACnB,IAAIN,QAAQ,CAACQ,OAAO,CAACH,GAAG,CAAC,IAAI,CAAC,EAAE,SAAA;AAChCJ,IAAAA,MAAM,CAACI,GAAG,CAAC,GAAGN,MAAM,CAACM,GAAG,CAAC,CAAA;AAC3B,GAAA;AAEA,EAAA,OAAOJ,MAAM,CAAA;AACf;;ACZe,SAASQ,wBAAwB,CAACV,MAAM,EAAEC,QAAQ,EAAE;AACjE,EAAA,IAAID,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,CAAA;AAC7B,EAAA,IAAIE,MAAM,GAAGS,6BAA4B,CAACX,MAAM,EAAEC,QAAQ,CAAC,CAAA;EAC3D,IAAIK,GAAG,EAAEC,CAAC,CAAA;EAEV,IAAIH,MAAM,CAACQ,qBAAqB,EAAE;AAChC,IAAA,IAAIC,gBAAgB,GAAGT,MAAM,CAACQ,qBAAqB,CAACZ,MAAM,CAAC,CAAA;AAE3D,IAAA,KAAKO,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGM,gBAAgB,CAACL,MAAM,EAAED,CAAC,EAAE,EAAE;AAC5CD,MAAAA,GAAG,GAAGO,gBAAgB,CAACN,CAAC,CAAC,CAAA;MACzB,IAAIN,QAAQ,CAACQ,OAAO,CAACH,GAAG,CAAC,IAAI,CAAC,EAAE,SAAA;AAChC,MAAA,IAAI,CAACF,MAAM,CAACU,SAAS,CAACC,oBAAoB,CAACC,IAAI,CAAChB,MAAM,EAAEM,GAAG,CAAC,EAAE,SAAA;AAC9DJ,MAAAA,MAAM,CAACI,GAAG,CAAC,GAAGN,MAAM,CAACM,GAAG,CAAC,CAAA;AAC3B,KAAA;AACF,GAAA;AAEA,EAAA,OAAOJ,MAAM,CAAA;AACf;;;;"}