tdesign-react 1.5.6-alpha.1 → 1.5.6-alpha.2

package/cjs/_chunks/dep-ca11638b.js

@@ -0,0 +1,200 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _MapCache = require('./dep-02942e1d.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-ca11638b.js.map

package/cjs/_chunks/dep-ca11638b.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-ca11638b.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-cac75e40.js

@@ -0,0 +1,45 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _baseDifference = require('./dep-e98eb681.js');
+var _baseFlatten = require('./dep-dfc24a2a.js');
+var _baseRest = require('./dep-9581147a.js');
+
+var baseDifference = _baseDifference._baseDifference,
+  baseFlatten = _baseFlatten._baseFlatten,
+  baseRest = _baseRest._baseRest,
+  isArrayLikeObject = _baseRest.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;
+
+exports.difference_1 = difference_1;
+//# sourceMappingURL=dep-cac75e40.js.map

package/cjs/_chunks/dep-cac75e40.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-cac75e40.js","sources":["../../node_modules/lodash/difference.js"],"sourcesContent":["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":["baseDifference","require$$0","baseFlatten","require$$1","baseRest","require$$2","isArrayLikeObject","require$$3","difference","array","values","difference_1"],"mappings":";;;;;;;;;;;;AAAA,IAAIA,cAAc,GAAGC,+BAA4B;AAC7CC,EAAAA,WAAW,GAAGC,yBAAyB;AACvCC,EAAAA,QAAQ,GAAGC,mBAAsB;AACjCC,EAAAA,iBAAiB,GAAGC,6BAA8B,CAAA;;AAEtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIC,UAAU,GAAGJ,QAAQ,CAAC,UAASK,KAAK,EAAEC,MAAM,EAAE;EAChD,OAAOJ,iBAAiB,CAACG,KAAK,CAAC,GAC3BT,cAAc,CAACS,KAAK,EAAEP,WAAW,CAACQ,MAAM,EAAE,CAAC,EAAEJ,iBAAiB,EAAE,IAAI,CAAC,CAAC,GACtE,EAAE,CAAA;AACR,CAAC,CAAC,CAAA;AAEFK,IAAAA,YAAc,GAAGH;;;;"}

package/cjs/_chunks/dep-d31a7335.js

@@ -0,0 +1,118 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var toString = require('./dep-da9fe1df.js');
+var _cacheHas = require('./dep-ca11638b.js');
+var _baseUnary = require('./dep-9e3116a4.js');
+var _baseRest = require('./dep-9581147a.js');
+
+var SetCache = _cacheHas._SetCache,
+  arrayIncludes = _cacheHas._arrayIncludes,
+  arrayIncludesWith = _cacheHas._arrayIncludesWith,
+  arrayMap$1 = toString._arrayMap,
+  baseUnary = _baseUnary._baseUnary,
+  cacheHas = _cacheHas._cacheHas;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMin = Math.min;
+
+/**
+ * The base implementation of methods like `_.intersection`, without support
+ * for iteratee shorthands, that accepts an array of arrays to inspect.
+ *
+ * @private
+ * @param {Array} arrays The arrays to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of shared values.
+ */
+function baseIntersection$1(arrays, iteratee, comparator) {
+  var includes = comparator ? arrayIncludesWith : arrayIncludes,
+    length = arrays[0].length,
+    othLength = arrays.length,
+    othIndex = othLength,
+    caches = Array(othLength),
+    maxLength = Infinity,
+    result = [];
+  while (othIndex--) {
+    var array = arrays[othIndex];
+    if (othIndex && iteratee) {
+      array = arrayMap$1(array, baseUnary(iteratee));
+    }
+    maxLength = nativeMin(array.length, maxLength);
+    caches[othIndex] = !comparator && (iteratee || length >= 120 && array.length >= 120) ? new SetCache(othIndex && array) : undefined;
+  }
+  array = arrays[0];
+  var index = -1,
+    seen = caches[0];
+  outer: while (++index < length && result.length < maxLength) {
+    var value = array[index],
+      computed = iteratee ? iteratee(value) : value;
+    value = comparator || value !== 0 ? value : 0;
+    if (!(seen ? cacheHas(seen, computed) : includes(result, computed, comparator))) {
+      othIndex = othLength;
+      while (--othIndex) {
+        var cache = caches[othIndex];
+        if (!(cache ? cacheHas(cache, computed) : includes(arrays[othIndex], computed, comparator))) {
+          continue outer;
+        }
+      }
+      if (seen) {
+        seen.push(computed);
+      }
+      result.push(value);
+    }
+  }
+  return result;
+}
+var _baseIntersection = baseIntersection$1;
+
+var isArrayLikeObject = _baseRest.isArrayLikeObject_1;
+
+/**
+ * Casts `value` to an empty array if it's not an array like object.
+ *
+ * @private
+ * @param {*} value The value to inspect.
+ * @returns {Array|Object} Returns the cast array-like object.
+ */
+function castArrayLikeObject$1(value) {
+  return isArrayLikeObject(value) ? value : [];
+}
+var _castArrayLikeObject = castArrayLikeObject$1;
+
+var arrayMap = toString._arrayMap,
+  baseIntersection = _baseIntersection,
+  baseRest = _baseRest._baseRest,
+  castArrayLikeObject = _castArrayLikeObject;
+
+/**
+ * Creates an array of unique values that are included in all 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.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {...Array} [arrays] The arrays to inspect.
+ * @returns {Array} Returns the new array of intersecting values.
+ * @example
+ *
+ * _.intersection([2, 1], [2, 3]);
+ * // => [2]
+ */
+var intersection = baseRest(function (arrays) {
+  var mapped = arrayMap(arrays, castArrayLikeObject);
+  return mapped.length && mapped[0] === arrays[0] ? baseIntersection(mapped) : [];
+});
+var intersection_1 = intersection;
+
+exports.intersection_1 = intersection_1;
+//# sourceMappingURL=dep-d31a7335.js.map

package/cjs/_chunks/dep-d31a7335.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-d31a7335.js","sources":["../../node_modules/lodash/_baseIntersection.js","../../node_modules/lodash/_castArrayLikeObject.js","../../node_modules/lodash/intersection.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/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\n\n/**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\nfunction baseIntersection(arrays, iteratee, comparator) {\n  var includes = comparator ? arrayIncludesWith : arrayIncludes,\n      length = arrays[0].length,\n      othLength = arrays.length,\n      othIndex = othLength,\n      caches = Array(othLength),\n      maxLength = Infinity,\n      result = [];\n\n  while (othIndex--) {\n    var array = arrays[othIndex];\n    if (othIndex && iteratee) {\n      array = arrayMap(array, baseUnary(iteratee));\n    }\n    maxLength = nativeMin(array.length, maxLength);\n    caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n      ? new SetCache(othIndex && array)\n      : undefined;\n  }\n  array = arrays[0];\n\n  var index = -1,\n      seen = caches[0];\n\n  outer:\n  while (++index < length && result.length < maxLength) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (!(seen\n          ? cacheHas(seen, computed)\n          : includes(result, computed, comparator)\n        )) {\n      othIndex = othLength;\n      while (--othIndex) {\n        var cache = caches[othIndex];\n        if (!(cache\n              ? cacheHas(cache, computed)\n              : includes(arrays[othIndex], computed, comparator))\n            ) {\n          continue outer;\n        }\n      }\n      if (seen) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseIntersection;\n","var isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\nfunction castArrayLikeObject(value) {\n  return isArrayLikeObject(value) ? value : [];\n}\n\nmodule.exports = castArrayLikeObject;\n","var arrayMap = require('./_arrayMap'),\n    baseIntersection = require('./_baseIntersection'),\n    baseRest = require('./_baseRest'),\n    castArrayLikeObject = require('./_castArrayLikeObject');\n\n/**\n * Creates an array of unique values that are included in all 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 * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\nvar intersection = baseRest(function(arrays) {\n  var mapped = arrayMap(arrays, castArrayLikeObject);\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped)\n    : [];\n});\n\nmodule.exports = intersection;\n"],"names":["SetCache","require$$0","arrayIncludes","require$$1","arrayIncludesWith","require$$2","arrayMap","require$$3","baseUnary","require$$4","cacheHas","require$$5","nativeMin","Math","min","baseIntersection","arrays","iteratee","comparator","includes","length","othLength","othIndex","caches","Array","maxLength","Infinity","result","array","undefined","index","seen","outer","value","computed","cache","push","_baseIntersection","isArrayLikeObject","castArrayLikeObject","_castArrayLikeObject","baseRest","intersection","mapped","intersection_1"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,mBAAsB;AACjCC,EAAAA,aAAa,GAAGC,wBAA2B;AAC3CC,EAAAA,iBAAiB,GAAGC,4BAA+B;AACnDC,EAAAA,UAAQ,GAAGC,kBAAsB;AACjCC,EAAAA,SAAS,GAAGC,qBAAuB;AACnCC,EAAAA,QAAQ,GAAGC,mBAAsB,CAAA;;AAErC;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAAG,CAAA;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,kBAAgBA,CAACC,MAAM,EAAEC,QAAQ,EAAEC,UAAU,EAAE;AACtD,EAAA,IAAIC,QAAQ,GAAGD,UAAU,GAAGd,iBAAiB,GAAGF,aAAa;AACzDkB,IAAAA,MAAM,GAAGJ,MAAM,CAAC,CAAC,CAAC,CAACI,MAAM;IACzBC,SAAS,GAAGL,MAAM,CAACI,MAAM;AACzBE,IAAAA,QAAQ,GAAGD,SAAS;AACpBE,IAAAA,MAAM,GAAGC,KAAK,CAACH,SAAS,CAAC;AACzBI,IAAAA,SAAS,GAAGC,QAAQ;AACpBC,IAAAA,MAAM,GAAG,EAAE,CAAA;EAEf,OAAOL,QAAQ,EAAE,EAAE;AACjB,IAAA,IAAIM,KAAK,GAAGZ,MAAM,CAACM,QAAQ,CAAC,CAAA;IAC5B,IAAIA,QAAQ,IAAIL,QAAQ,EAAE;MACxBW,KAAK,GAAGtB,UAAQ,CAACsB,KAAK,EAAEpB,SAAS,CAACS,QAAQ,CAAC,CAAC,CAAA;AAC7C,KAAA;IACDQ,SAAS,GAAGb,SAAS,CAACgB,KAAK,CAACR,MAAM,EAAEK,SAAS,CAAC,CAAA;AAC9CF,IAAAA,MAAM,CAACD,QAAQ,CAAC,GAAG,CAACJ,UAAU,KAAKD,QAAQ,IAAKG,MAAM,IAAI,GAAG,IAAIQ,KAAK,CAACR,MAAM,IAAI,GAAI,CAAC,GAClF,IAAIpB,QAAQ,CAACsB,QAAQ,IAAIM,KAAK,CAAC,GAC/BC,SAAS,CAAA;AACd,GAAA;AACDD,EAAAA,KAAK,GAAGZ,MAAM,CAAC,CAAC,CAAC,CAAA;EAEjB,IAAIc,KAAK,GAAG,CAAC,CAAC;AACVC,IAAAA,IAAI,GAAGR,MAAM,CAAC,CAAC,CAAC,CAAA;AAEpBS,EAAAA,KAAK,EACL,OAAO,EAAEF,KAAK,GAAGV,MAAM,IAAIO,MAAM,CAACP,MAAM,GAAGK,SAAS,EAAE;AACpD,IAAA,IAAIQ,KAAK,GAAGL,KAAK,CAACE,KAAK,CAAC;MACpBI,QAAQ,GAAGjB,QAAQ,GAAGA,QAAQ,CAACgB,KAAK,CAAC,GAAGA,KAAK,CAAA;IAEjDA,KAAK,GAAIf,UAAU,IAAIe,KAAK,KAAK,CAAC,GAAIA,KAAK,GAAG,CAAC,CAAA;AAC/C,IAAA,IAAI,EAAEF,IAAI,GACFrB,QAAQ,CAACqB,IAAI,EAAEG,QAAQ,CAAC,GACxBf,QAAQ,CAACQ,MAAM,EAAEO,QAAQ,EAAEhB,UAAU,CAAC,CACzC,EAAE;AACLI,MAAAA,QAAQ,GAAGD,SAAS,CAAA;MACpB,OAAO,EAAEC,QAAQ,EAAE;AACjB,QAAA,IAAIa,KAAK,GAAGZ,MAAM,CAACD,QAAQ,CAAC,CAAA;QAC5B,IAAI,EAAEa,KAAK,GACHzB,QAAQ,CAACyB,KAAK,EAAED,QAAQ,CAAC,GACzBf,QAAQ,CAACH,MAAM,CAACM,QAAQ,CAAC,EAAEY,QAAQ,EAAEhB,UAAU,CAAC,CAAC,EACnD;AACJ,UAAA,SAASc,KAAK,CAAA;AACf,SAAA;AACF,OAAA;AACD,MAAA,IAAID,IAAI,EAAE;AACRA,QAAAA,IAAI,CAACK,IAAI,CAACF,QAAQ,CAAC,CAAA;AACpB,OAAA;AACDP,MAAAA,MAAM,CAACS,IAAI,CAACH,KAAK,CAAC,CAAA;AACnB,KAAA;AACF,GAAA;AACD,EAAA,OAAON,MAAM,CAAA;AACf,CAAA;AAEA,IAAAU,iBAAc,GAAGtB,kBAAgB;;ACzEjC,IAAIuB,iBAAiB,GAAGrC,6BAA8B,CAAA;;AAEtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASsC,qBAAmBA,CAACN,KAAK,EAAE;AAClC,EAAA,OAAOK,iBAAiB,CAACL,KAAK,CAAC,GAAGA,KAAK,GAAG,EAAE,CAAA;AAC9C,CAAA;AAEA,IAAAO,oBAAc,GAAGD,qBAAmB;;ACbpC,IAAIjC,QAAQ,GAAGL,kBAAsB;AACjCc,EAAAA,gBAAgB,GAAGZ,iBAA8B;AACjDsC,EAAAA,QAAQ,GAAGpC,mBAAsB;AACjCkC,EAAAA,mBAAmB,GAAGhC,oBAAiC,CAAA;;AAE3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAImC,YAAY,GAAGD,QAAQ,CAAC,UAASzB,MAAM,EAAE;AAC3C,EAAA,IAAI2B,MAAM,GAAGrC,QAAQ,CAACU,MAAM,EAAEuB,mBAAmB,CAAC,CAAA;AAClD,EAAA,OAAQI,MAAM,CAACvB,MAAM,IAAIuB,MAAM,CAAC,CAAC,CAAC,KAAK3B,MAAM,CAAC,CAAC,CAAC,GAC5CD,gBAAgB,CAAC4B,MAAM,CAAC,GACxB,EAAE,CAAA;AACR,CAAC,CAAC,CAAA;AAEFC,IAAAA,cAAc,GAAGF;;;;"}

package/cjs/_chunks/dep-d37e3af0.js

@@ -0,0 +1,43 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _typeof = require('./dep-58e1064c.js');
+var eq$1 = require('./dep-8f907847.js');
+var isArrayLike$1 = require('./dep-46eabb5a.js');
+var _isIndex = require('./dep-e6f14ec3.js');
+var isObject$1 = require('./dep-7d9bddfe.js');
+
+var eq = eq$1.eq_1,
+  isArrayLike = isArrayLike$1.isArrayLike_1,
+  isIndex = _isIndex._isIndex,
+  isObject = isObject$1.isObject_1;
+
+/**
+ * Checks if the given arguments are from an iteratee call.
+ *
+ * @private
+ * @param {*} value The potential iteratee value argument.
+ * @param {*} index The potential iteratee index or key argument.
+ * @param {*} object The potential iteratee object argument.
+ * @returns {boolean} Returns `true` if the arguments are from an iteratee call,
+ *  else `false`.
+ */
+function isIterateeCall(value, index, object) {
+  if (!isObject(object)) {
+    return false;
+  }
+  var type = _typeof._typeof(index);
+  if (type == 'number' ? isArrayLike(object) && isIndex(index, object.length) : type == 'string' && index in object) {
+    return eq(object[index], value);
+  }
+  return false;
+}
+var _isIterateeCall = isIterateeCall;
+
+exports._isIterateeCall = _isIterateeCall;
+//# sourceMappingURL=dep-d37e3af0.js.map

package/cjs/_chunks/dep-d37e3af0.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-d37e3af0.js","sources":["../../node_modules/lodash/_isIterateeCall.js"],"sourcesContent":["var eq = require('./eq'),\n    isArrayLike = require('./isArrayLike'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject');\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\nmodule.exports = isIterateeCall;\n"],"names":["eq","require$$0","isArrayLike","require$$1","isIndex","require$$2","isObject","require$$3","isIterateeCall","value","index","object","type","_typeof","length","_isIterateeCall"],"mappings":";;;;;;;;;;;;;;AAAA,IAAIA,EAAE,GAAGC,SAAe;AACpBC,EAAAA,WAAW,GAAGC,2BAAwB;AACtCC,EAAAA,OAAO,GAAGC,iBAAqB;AAC/BC,EAAAA,QAAQ,GAAGC,qBAAqB,CAAA;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAcA,CAACC,KAAK,EAAEC,KAAK,EAAEC,MAAM,EAAE;AAC5C,EAAA,IAAI,CAACL,QAAQ,CAACK,MAAM,CAAC,EAAE;AACrB,IAAA,OAAO,KAAK,CAAA;AACb,GAAA;AACD,EAAA,IAAIC,IAAI,GAAAC,eAAA,CAAUH,KAAK,CAAA,CAAA;EACvB,IAAIE,IAAI,IAAI,QAAQ,GACXV,WAAW,CAACS,MAAM,CAAC,IAAIP,OAAO,CAACM,KAAK,EAAEC,MAAM,CAACG,MAAM,CAAC,GACpDF,IAAI,IAAI,QAAQ,IAAIF,KAAK,IAAIC,MAAO,EACvC;IACJ,OAAOX,EAAE,CAACW,MAAM,CAACD,KAAK,CAAC,EAAED,KAAK,CAAC,CAAA;AAChC,GAAA;AACD,EAAA,OAAO,KAAK,CAAA;AACd,CAAA;AAEAM,IAAAA,eAAc,GAAGP;;;;"}

package/cjs/_chunks/dep-da9fe1df.js

@@ -0,0 +1,101 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _baseGetTag = require('./dep-54b25431.js');
+var isArray$1 = require('./dep-0b41f351.js');
+var isSymbol$1 = require('./dep-f3f24f4a.js');
+
+/**
+ * A specialized version of `_.map` for arrays without support for iteratee
+ * shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the new mapped array.
+ */
+function arrayMap$1(array, iteratee) {
+  var index = -1,
+    length = array == null ? 0 : array.length,
+    result = Array(length);
+  while (++index < length) {
+    result[index] = iteratee(array[index], index, array);
+  }
+  return result;
+}
+var _arrayMap = arrayMap$1;
+
+var _Symbol = _baseGetTag._Symbol,
+  arrayMap = _arrayMap,
+  isArray = isArray$1.isArray_1,
+  isSymbol = isSymbol$1.isSymbol_1;
+
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
+
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = _Symbol ? _Symbol.prototype : undefined,
+  symbolToString = symbolProto ? symbolProto.toString : undefined;
+
+/**
+ * The base implementation of `_.toString` which doesn't convert nullish
+ * values to empty strings.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {string} Returns the string.
+ */
+function baseToString$1(value) {
+  // Exit early for strings to avoid a performance hit in some environments.
+  if (typeof value == 'string') {
+    return value;
+  }
+  if (isArray(value)) {
+    // Recursively convert values (susceptible to call stack limits).
+    return arrayMap(value, baseToString$1) + '';
+  }
+  if (isSymbol(value)) {
+    return symbolToString ? symbolToString.call(value) : '';
+  }
+  var result = value + '';
+  return result == '0' && 1 / value == -INFINITY ? '-0' : result;
+}
+var _baseToString = baseToString$1;
+
+var baseToString = _baseToString;
+
+/**
+ * Converts `value` to a string. An empty string is returned for `null`
+ * and `undefined` values. The sign of `-0` is preserved.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to convert.
+ * @returns {string} Returns the converted string.
+ * @example
+ *
+ * _.toString(null);
+ * // => ''
+ *
+ * _.toString(-0);
+ * // => '-0'
+ *
+ * _.toString([1, 2, 3]);
+ * // => '1,2,3'
+ */
+function toString(value) {
+  return value == null ? '' : baseToString(value);
+}
+var toString_1 = toString;
+
+exports._arrayMap = _arrayMap;
+exports._baseToString = _baseToString;
+exports.toString_1 = toString_1;
+//# sourceMappingURL=dep-da9fe1df.js.map

package/cjs/_chunks/dep-da9fe1df.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-da9fe1df.js","sources":["../../node_modules/lodash/_arrayMap.js","../../node_modules/lodash/_baseToString.js","../../node_modules/lodash/toString.js"],"sourcesContent":["/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n"],"names":["arrayMap","array","iteratee","index","length","result","Array","_arrayMap","Symbol","require$$0","require$$1","isArray","require$$2","isSymbol","require$$3","INFINITY","symbolProto","prototype","undefined","symbolToString","toString","baseToString","value","call","_baseToString","toString_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;AASA,SAASA,UAAQA,CAACC,KAAK,EAAEC,QAAQ,EAAE;EACjC,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGH,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACG,MAAM;AACzCC,IAAAA,MAAM,GAAGC,KAAK,CAACF,MAAM,CAAC,CAAA;AAE1B,EAAA,OAAO,EAAED,KAAK,GAAGC,MAAM,EAAE;AACvBC,IAAAA,MAAM,CAACF,KAAK,CAAC,GAAGD,QAAQ,CAACD,KAAK,CAACE,KAAK,CAAC,EAAEA,KAAK,EAAEF,KAAK,CAAC,CAAA;AACrD,GAAA;AACD,EAAA,OAAOI,MAAM,CAAA;AACf,CAAA;AAEAE,IAAAA,SAAc,GAAGP;;ACpBjB,IAAIQ,OAAM,GAAGC,mBAAoB;AAC7BT,EAAAA,QAAQ,GAAGU,SAAsB;AACjCC,EAAAA,OAAO,GAAGC,mBAAoB;AAC9BC,EAAAA,QAAQ,GAAGC,qBAAqB,CAAA;;AAEpC;AACA,IAAIC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAA;;AAEpB;AACA,IAAIC,WAAW,GAAGR,OAAM,GAAGA,OAAM,CAACS,SAAS,GAAGC,SAAS;AACnDC,EAAAA,cAAc,GAAGH,WAAW,GAAGA,WAAW,CAACI,QAAQ,GAAGF,SAAS,CAAA;;AAEnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASG,cAAYA,CAACC,KAAK,EAAE;AAC7B;AACE,EAAA,IAAI,OAAOA,KAAK,IAAI,QAAQ,EAAE;AAC5B,IAAA,OAAOA,KAAK,CAAA;AACb,GAAA;AACD,EAAA,IAAIX,OAAO,CAACW,KAAK,CAAC,EAAE;AACtB;AACI,IAAA,OAAOtB,QAAQ,CAACsB,KAAK,EAAED,cAAY,CAAC,GAAG,EAAE,CAAA;AAC1C,GAAA;AACD,EAAA,IAAIR,QAAQ,CAACS,KAAK,CAAC,EAAE;IACnB,OAAOH,cAAc,GAAGA,cAAc,CAACI,IAAI,CAACD,KAAK,CAAC,GAAG,EAAE,CAAA;AACxD,GAAA;AACD,EAAA,IAAIjB,MAAM,GAAIiB,KAAK,GAAG,EAAG,CAAA;AACzB,EAAA,OAAQjB,MAAM,IAAI,GAAG,IAAK,CAAC,GAAGiB,KAAK,IAAK,CAACP,QAAQ,GAAI,IAAI,GAAGV,MAAM,CAAA;AACpE,CAAA;AAEAmB,IAAAA,aAAc,GAAGH;;ACpCjB,IAAIA,YAAY,GAAGZ,aAA0B,CAAA;;AAE7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASW,QAAQA,CAACE,KAAK,EAAE;EACvB,OAAOA,KAAK,IAAI,IAAI,GAAG,EAAE,GAAGD,YAAY,CAACC,KAAK,CAAC,CAAA;AACjD,CAAA;AAEAG,IAAAA,UAAc,GAAGL;;;;;;"}

package/cjs/_chunks/dep-dfc24a2a.js

@@ -0,0 +1,70 @@
+/**
+ * tdesign v1.5.6-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _arrayPush = require('./dep-a17fbac5.js');
+var _baseGetTag = require('./dep-54b25431.js');
+var isArguments$1 = require('./dep-78b0bee6.js');
+var isArray$1 = require('./dep-0b41f351.js');
+
+var _Symbol = _baseGetTag._Symbol,
+  isArguments = isArguments$1.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(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(value, depth - 1, predicate, isStrict, result);
+      } else {
+        arrayPush(result, value);
+      }
+    } else if (!isStrict) {
+      result[result.length] = value;
+    }
+  }
+  return result;
+}
+var _baseFlatten = baseFlatten;
+
+exports._baseFlatten = _baseFlatten;
+//# sourceMappingURL=dep-dfc24a2a.js.map

package/cjs/_chunks/dep-dfc24a2a.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-dfc24a2a.js","sources":["../../node_modules/lodash/_isFlattenable.js","../../node_modules/lodash/_baseFlatten.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"],"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"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,OAAM,GAAGC,mBAAoB;AAC7BC,EAAAA,WAAW,GAAGC,2BAAwB;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,eAAaA,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,WAAWA,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,WAAW,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;;;;"}