tdesign-react 1.1.7 → 1.1.8-alpha.1

package/cjs/_chunks/dep-69e62d5d.js

@@ -0,0 +1,28 @@
+/**
+ * tdesign v1.1.2
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+function _arrayLikeToArray(arr, len) {
+  if (len == null || len > arr.length) len = arr.length;
+  for (var i = 0, arr2 = new Array(len); i < len; i++) {
+    arr2[i] = arr[i];
+  }
+  return arr2;
+}
+
+function _unsupportedIterableToArray(o, minLen) {
+  if (!o) return;
+  if (typeof o === "string") return _arrayLikeToArray(o, minLen);
+  var n = Object.prototype.toString.call(o).slice(8, -1);
+  if (n === "Object" && o.constructor) n = o.constructor.name;
+  if (n === "Map" || n === "Set") return Array.from(o);
+  if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
+}
+
+exports._arrayLikeToArray = _arrayLikeToArray;
+exports._unsupportedIterableToArray = _unsupportedIterableToArray;
+//# sourceMappingURL=dep-69e62d5d.js.map

package/cjs/_chunks/dep-69e62d5d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-69e62d5d.js","sources":["../../node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js","../../node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js"],"sourcesContent":["export default function _arrayLikeToArray(arr, len) {\n  if (len == null || len > arr.length) len = arr.length;\n\n  for (var i = 0, arr2 = new Array(len); i < len; i++) {\n    arr2[i] = arr[i];\n  }\n\n  return arr2;\n}","import arrayLikeToArray from \"./arrayLikeToArray.js\";\nexport default function _unsupportedIterableToArray(o, minLen) {\n  if (!o) return;\n  if (typeof o === \"string\") return arrayLikeToArray(o, minLen);\n  var n = Object.prototype.toString.call(o).slice(8, -1);\n  if (n === \"Object\" && o.constructor) n = o.constructor.name;\n  if (n === \"Map\" || n === \"Set\") return Array.from(o);\n  if (n === \"Arguments\" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return arrayLikeToArray(o, minLen);\n}"],"names":["_arrayLikeToArray","arr","len","length","i","arr2","Array","_unsupportedIterableToArray","o","minLen","arrayLikeToArray","n","Object","prototype","toString","call","slice","constructor","name","from","test"],"mappings":";;;;;;;;AAAe,SAASA,iBAAiBA,CAACC,GAAG,EAAEC,GAAG,EAAE;AAClD,EAAA,IAAIA,GAAG,IAAI,IAAI,IAAIA,GAAG,GAAGD,GAAG,CAACE,MAAM,EAAED,GAAG,GAAGD,GAAG,CAACE,MAAM,CAAA;AAErD,EAAA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEC,IAAI,GAAG,IAAIC,KAAK,CAACJ,GAAG,CAAC,EAAEE,CAAC,GAAGF,GAAG,EAAEE,CAAC,EAAE,EAAE;AACnDC,IAAAA,IAAI,CAACD,CAAC,CAAC,GAAGH,GAAG,CAACG,CAAC,CAAC,CAAA;AAClB,GAAA;AAEA,EAAA,OAAOC,IAAI,CAAA;AACb;;ACPe,SAASE,2BAA2BA,CAACC,CAAC,EAAEC,MAAM,EAAE;EAC7D,IAAI,CAACD,CAAC,EAAE,OAAA;EACR,IAAI,OAAOA,CAAC,KAAK,QAAQ,EAAE,OAAOE,iBAAgB,CAACF,CAAC,EAAEC,MAAM,CAAC,CAAA;AAC7D,EAAA,IAAIE,CAAC,GAAGC,MAAM,CAACC,SAAS,CAACC,QAAQ,CAACC,IAAI,CAACP,CAAC,CAAC,CAACQ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;AACtD,EAAA,IAAIL,CAAC,KAAK,QAAQ,IAAIH,CAAC,CAACS,WAAW,EAAEN,CAAC,GAAGH,CAAC,CAACS,WAAW,CAACC,IAAI,CAAA;AAC3D,EAAA,IAAIP,CAAC,KAAK,KAAK,IAAIA,CAAC,KAAK,KAAK,EAAE,OAAOL,KAAK,CAACa,IAAI,CAACX,CAAC,CAAC,CAAA;AACpD,EAAA,IAAIG,CAAC,KAAK,WAAW,IAAI,0CAA0C,CAACS,IAAI,CAACT,CAAC,CAAC,EAAE,OAAOD,iBAAgB,CAACF,CAAC,EAAEC,MAAM,CAAC,CAAA;AACjH;;;;;"}

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-6bb503fb.js.map

@@ -0,0 +1 @@
+{"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-6d421d75.js

@@ -0,0 +1,149 @@
+/**
+ * tdesign v1.1.2
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var isFunction$1 = require('./dep-28c3f225.js');
+var _baseGetTag = require('./dep-7d37318c.js');
+var isObject$1 = require('./dep-5ec9196c.js');
+
+var root$1 = _baseGetTag._root;
+
+/** Used to detect overreaching core-js shims. */
+var coreJsData$1 = root$1['__core-js_shared__'];
+var _coreJsData = coreJsData$1;
+
+var coreJsData = _coreJsData;
+
+/** Used to detect methods masquerading as native. */
+var maskSrcKey = function () {
+  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');
+  return uid ? 'Symbol(src)_1.' + uid : '';
+}();
+
+/**
+ * Checks if `func` has its source masked.
+ *
+ * @private
+ * @param {Function} func The function to check.
+ * @returns {boolean} Returns `true` if `func` is masked, else `false`.
+ */
+function isMasked$1(func) {
+  return !!maskSrcKey && maskSrcKey in func;
+}
+var _isMasked = isMasked$1;
+
+/** Used for built-in method references. */
+var funcProto$1 = Function.prototype;
+
+/** Used to resolve the decompiled source of functions. */
+var funcToString$1 = funcProto$1.toString;
+
+/**
+ * Converts `func` to its source code.
+ *
+ * @private
+ * @param {Function} func The function to convert.
+ * @returns {string} Returns the source code.
+ */
+function toSource$1(func) {
+  if (func != null) {
+    try {
+      return funcToString$1.call(func);
+    } catch (e) {}
+    try {
+      return func + '';
+    } catch (e) {}
+  }
+  return '';
+}
+var _toSource = toSource$1;
+
+var isFunction = isFunction$1.isFunction_1,
+  isMasked = _isMasked,
+  isObject = isObject$1.isObject_1,
+  toSource = _toSource;
+
+/**
+ * Used to match `RegExp`
+ * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
+ */
+var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;
+
+/** Used to detect host constructors (Safari). */
+var reIsHostCtor = /^\[object .+?Constructor\]$/;
+
+/** Used for built-in method references. */
+var funcProto = Function.prototype,
+  objectProto = Object.prototype;
+
+/** Used to resolve the decompiled source of functions. */
+var funcToString = funcProto.toString;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/** Used to detect if a method is native. */
+var reIsNative = RegExp('^' + funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&').replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$');
+
+/**
+ * The base implementation of `_.isNative` without bad shim checks.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a native function,
+ *  else `false`.
+ */
+function baseIsNative$1(value) {
+  if (!isObject(value) || isMasked(value)) {
+    return false;
+  }
+  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;
+  return pattern.test(toSource(value));
+}
+var _baseIsNative = baseIsNative$1;
+
+/**
+ * Gets the value at `key` of `object`.
+ *
+ * @private
+ * @param {Object} [object] The object to query.
+ * @param {string} key The key of the property to get.
+ * @returns {*} Returns the property value.
+ */
+function getValue$1(object, key) {
+  return object == null ? undefined : object[key];
+}
+var _getValue = getValue$1;
+
+var baseIsNative = _baseIsNative,
+  getValue = _getValue;
+
+/**
+ * Gets the native function at `key` of `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {string} key The key of the method to get.
+ * @returns {*} Returns the function if it's native, else `undefined`.
+ */
+function getNative$1(object, key) {
+  var value = getValue(object, key);
+  return baseIsNative(value) ? value : undefined;
+}
+var _getNative = getNative$1;
+
+var getNative = _getNative,
+  root = _baseGetTag._root;
+
+/* Built-in method references that are verified to be native. */
+var Map = getNative(root, 'Map');
+var _Map = Map;
+
+exports._Map = _Map;
+exports._getNative = _getNative;
+exports._toSource = _toSource;
+//# sourceMappingURL=dep-6d421d75.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-6d421d75.js","sources":["../../node_modules/lodash/_coreJsData.js","../../node_modules/lodash/_isMasked.js","../../node_modules/lodash/_toSource.js","../../node_modules/lodash/_baseIsNative.js","../../node_modules/lodash/_getValue.js","../../node_modules/lodash/_getNative.js","../../node_modules/lodash/_Map.js"],"sourcesContent":["var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n"],"names":["root","require$$0","coreJsData","_coreJsData","maskSrcKey","uid","exec","keys","IE_PROTO","isMasked","func","_isMasked","funcProto","Function","prototype","funcToString","toString","toSource","call","e","_toSource","isFunction","require$$1","isObject","require$$2","require$$3","reRegExpChar","reIsHostCtor","objectProto","Object","hasOwnProperty","reIsNative","RegExp","replace","baseIsNative","value","pattern","test","_baseIsNative","getValue","object","key","undefined","_getValue","getNative","_getNative","Map","_Map"],"mappings":";;;;;;;;;;;;AAAA,IAAIA,MAAI,GAAGC,iBAAkB,CAAA;;AAE7B;AACA,IAAIC,YAAU,GAAGF,MAAI,CAAC,oBAAoB,CAAC,CAAA;AAE3C,IAAAG,WAAc,GAAGD,YAAU;;ACL3B,IAAIA,UAAU,GAAGD,WAAwB,CAAA;;AAEzC;AACA,IAAIG,UAAU,GAAI,YAAW;AAC3B,EAAA,IAAIC,GAAG,GAAG,QAAQ,CAACC,IAAI,CAACJ,UAAU,IAAIA,UAAU,CAACK,IAAI,IAAIL,UAAU,CAACK,IAAI,CAACC,QAAQ,IAAI,EAAE,CAAC,CAAA;AACxF,EAAA,OAAOH,GAAG,GAAI,gBAAgB,GAAGA,GAAG,GAAI,EAAE,CAAA;AAC5C,CAAC,EAAG,CAAA;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASI,UAAQA,CAACC,IAAI,EAAE;AACtB,EAAA,OAAO,CAAC,CAACN,UAAU,IAAKA,UAAU,IAAIM,IAAK,CAAA;AAC7C,CAAA;AAEA,IAAAC,SAAc,GAAGF,UAAQ;;;AClBzB,IAAIG,WAAS,GAAGC,QAAQ,CAACC,SAAS,CAAA;;AAElC;AACA,IAAIC,cAAY,GAAGH,WAAS,CAACI,QAAQ,CAAA;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAQA,CAACP,IAAI,EAAE;EACtB,IAAIA,IAAI,IAAI,IAAI,EAAE;IAChB,IAAI;AACF,MAAA,OAAOK,cAAY,CAACG,IAAI,CAACR,IAAI,CAAC,CAAA;AACpC,KAAK,CAAC,OAAOS,CAAC,EAAE,EAAE;IACd,IAAI;MACF,OAAQT,IAAI,GAAG,EAAE,CAAA;AACvB,KAAK,CAAC,OAAOS,CAAC,EAAE,EAAE;AACf,GAAA;AACD,EAAA,OAAO,EAAE,CAAA;AACX,CAAA;AAEAC,IAAAA,SAAc,GAAGH;;ACzBjB,IAAII,UAAU,GAAGpB,yBAAuB;AACpCQ,EAAAA,QAAQ,GAAGa,SAAsB;AACjCC,EAAAA,QAAQ,GAAGC,qBAAqB;AAChCP,EAAAA,QAAQ,GAAGQ,SAAsB,CAAA;;AAErC;AACA;AACA;AACA;AACA,IAAIC,YAAY,GAAG,qBAAqB,CAAA;;AAExC;AACA,IAAIC,YAAY,GAAG,6BAA6B,CAAA;;AAEhD;AACA,IAAIf,SAAS,GAAGC,QAAQ,CAACC,SAAS;EAC9Bc,WAAW,GAAGC,MAAM,CAACf,SAAS,CAAA;;AAElC;AACA,IAAIC,YAAY,GAAGH,SAAS,CAACI,QAAQ,CAAA;;AAErC;AACA,IAAIc,cAAc,GAAGF,WAAW,CAACE,cAAc,CAAA;;AAE/C;AACA,IAAIC,UAAU,GAAGC,MAAM,CAAC,GAAG,GACzBjB,YAAY,CAACG,IAAI,CAACY,cAAc,CAAC,CAACG,OAAO,CAACP,YAAY,EAAE,MAAM,CAAC,CAC9DO,OAAO,CAAC,wDAAwD,EAAE,OAAO,CAAC,GAAG,GAAG,CAClF,CAAA;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,cAAYA,CAACC,KAAK,EAAE;EAC3B,IAAI,CAACZ,QAAQ,CAACY,KAAK,CAAC,IAAI1B,QAAQ,CAAC0B,KAAK,CAAC,EAAE;AACvC,IAAA,OAAO,KAAK,CAAA;AACb,GAAA;EACD,IAAIC,OAAO,GAAGf,UAAU,CAACc,KAAK,CAAC,GAAGJ,UAAU,GAAGJ,YAAY,CAAA;EAC3D,OAAOS,OAAO,CAACC,IAAI,CAACpB,QAAQ,CAACkB,KAAK,CAAC,CAAC,CAAA;AACtC,CAAA;AAEA,IAAAG,aAAc,GAAGJ,cAAY;;;;;;;;;;ACtC7B,SAASK,UAAQA,CAACC,MAAM,EAAEC,GAAG,EAAE;EAC7B,OAAOD,MAAM,IAAI,IAAI,GAAGE,SAAS,GAAGF,MAAM,CAACC,GAAG,CAAC,CAAA;AACjD,CAAA;AAEA,IAAAE,SAAc,GAAGJ,UAAQ;;ACZzB,IAAIL,YAAY,GAAGjC,aAA0B;AACzCsC,EAAAA,QAAQ,GAAGjB,SAAsB,CAAA;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASsB,WAASA,CAACJ,MAAM,EAAEC,GAAG,EAAE;AAC9B,EAAA,IAAIN,KAAK,GAAGI,QAAQ,CAACC,MAAM,EAAEC,GAAG,CAAC,CAAA;AACjC,EAAA,OAAOP,YAAY,CAACC,KAAK,CAAC,GAAGA,KAAK,GAAGO,SAAS,CAAA;AAChD,CAAA;AAEAG,IAAAA,UAAc,GAAGD;;AChBjB,IAAIA,SAAS,GAAG3C,UAAuB;AACnCD,EAAAA,IAAI,GAAGsB,iBAAkB,CAAA;;AAE7B;AACA,IAAIwB,GAAG,GAAGF,SAAS,CAAC5C,IAAI,EAAE,KAAK,CAAC,CAAA;AAEhC+C,IAAAA,IAAc,GAAGD;;;;;;"}

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;;;;;"}