tdesign-react 0.42.1-alpha.2 → 0.42.1-alpha.3

package/lib/_chunks/dep-12e6867c.js

@@ -0,0 +1,42 @@
+/**
+ * tdesign v0.42.1-alpha.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+function _objectWithoutPropertiesLoose(source, excluded) {
+  if (source == null) return {};
+  var target = {};
+  var sourceKeys = Object.keys(source);
+  var key, i;
+
+  for (i = 0; i < sourceKeys.length; i++) {
+    key = sourceKeys[i];
+    if (excluded.indexOf(key) >= 0) continue;
+    target[key] = source[key];
+  }
+
+  return target;
+}
+
+function _objectWithoutProperties(source, excluded) {
+  if (source == null) return {};
+  var target = _objectWithoutPropertiesLoose(source, excluded);
+  var key, i;
+
+  if (Object.getOwnPropertySymbols) {
+    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
+
+    for (i = 0; i < sourceSymbolKeys.length; i++) {
+      key = sourceSymbolKeys[i];
+      if (excluded.indexOf(key) >= 0) continue;
+      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
+      target[key] = source[key];
+    }
+  }
+
+  return target;
+}
+
+export { _objectWithoutProperties as _ };
+//# sourceMappingURL=dep-12e6867c.js.map

package/lib/_chunks/dep-12e6867c.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-12e6867c.js","sources":["../../node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js","../../node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js"],"sourcesContent":["export default function _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n\n  return target;\n}","import objectWithoutPropertiesLoose from \"./objectWithoutPropertiesLoose.js\";\nexport default function _objectWithoutProperties(source, excluded) {\n  if (source == null) return {};\n  var target = objectWithoutPropertiesLoose(source, excluded);\n  var key, i;\n\n  if (Object.getOwnPropertySymbols) {\n    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n\n    for (i = 0; i < sourceSymbolKeys.length; i++) {\n      key = sourceSymbolKeys[i];\n      if (excluded.indexOf(key) >= 0) continue;\n      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n      target[key] = source[key];\n    }\n  }\n\n  return target;\n}"],"names":["_objectWithoutPropertiesLoose","source","excluded","target","sourceKeys","Object","keys","key","i","length","indexOf","_objectWithoutProperties","objectWithoutPropertiesLoose","getOwnPropertySymbols","sourceSymbolKeys","prototype","propertyIsEnumerable","call"],"mappings":";;;;;;AAAe,SAASA,6BAAT,CAAuCC,MAAvC,EAA+CC,QAA/C,EAAyD;AACtE,EAAA,IAAID,MAAM,IAAI,IAAd,EAAoB,OAAO,EAAP,CAAA;EACpB,IAAIE,MAAM,GAAG,EAAb,CAAA;AACA,EAAA,IAAIC,UAAU,GAAGC,MAAM,CAACC,IAAP,CAAYL,MAAZ,CAAjB,CAAA;EACA,IAAIM,GAAJ,EAASC,CAAT,CAAA;;AAEA,EAAA,KAAKA,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGJ,UAAU,CAACK,MAA3B,EAAmCD,CAAC,EAApC,EAAwC;AACtCD,IAAAA,GAAG,GAAGH,UAAU,CAACI,CAAD,CAAhB,CAAA;AACA,IAAA,IAAIN,QAAQ,CAACQ,OAAT,CAAiBH,GAAjB,CAAA,IAAyB,CAA7B,EAAgC,SAAA;AAChCJ,IAAAA,MAAM,CAACI,GAAD,CAAN,GAAcN,MAAM,CAACM,GAAD,CAApB,CAAA;AACD,GAAA;;AAED,EAAA,OAAOJ,MAAP,CAAA;AACD;;ACZc,SAASQ,wBAAT,CAAkCV,MAAlC,EAA0CC,QAA1C,EAAoD;AACjE,EAAA,IAAID,MAAM,IAAI,IAAd,EAAoB,OAAO,EAAP,CAAA;AACpB,EAAA,IAAIE,MAAM,GAAGS,6BAA4B,CAACX,MAAD,EAASC,QAAT,CAAzC,CAAA;EACA,IAAIK,GAAJ,EAASC,CAAT,CAAA;;EAEA,IAAIH,MAAM,CAACQ,qBAAX,EAAkC;AAChC,IAAA,IAAIC,gBAAgB,GAAGT,MAAM,CAACQ,qBAAP,CAA6BZ,MAA7B,CAAvB,CAAA;;AAEA,IAAA,KAAKO,CAAC,GAAG,CAAT,EAAYA,CAAC,GAAGM,gBAAgB,CAACL,MAAjC,EAAyCD,CAAC,EAA1C,EAA8C;AAC5CD,MAAAA,GAAG,GAAGO,gBAAgB,CAACN,CAAD,CAAtB,CAAA;AACA,MAAA,IAAIN,QAAQ,CAACQ,OAAT,CAAiBH,GAAjB,CAAA,IAAyB,CAA7B,EAAgC,SAAA;AAChC,MAAA,IAAI,CAACF,MAAM,CAACU,SAAP,CAAiBC,oBAAjB,CAAsCC,IAAtC,CAA2ChB,MAA3C,EAAmDM,GAAnD,CAAL,EAA8D,SAAA;AAC9DJ,MAAAA,MAAM,CAACI,GAAD,CAAN,GAAcN,MAAM,CAACM,GAAD,CAApB,CAAA;AACD,KAAA;AACF,GAAA;;AAED,EAAA,OAAOJ,MAAP,CAAA;AACD;;;;"}

package/lib/_chunks/dep-195801f7.js

@@ -0,0 +1,218 @@
+/**
+ * tdesign v0.42.1-alpha.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import { _ as _MapCache } from './dep-b73da1e8.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,
+    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;
+
+export { _SetCache as _, _cacheHas as a, _arrayIncludes as b, _arrayIncludesWith as c };
+//# sourceMappingURL=dep-195801f7.js.map

package/lib/_chunks/dep-195801f7.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-195801f7.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,2BAArB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,aAAT,CAAqBC,KAArB,EAA4B;AAC1B,EAAA,IAAA,CAAKC,QAAL,CAAcC,GAAd,CAAkBF,KAAlB,EAAyBF,cAAzB,CAAA,CAAA;;AACA,EAAA,OAAO,IAAP,CAAA;AACD,CAAA;;AAED,IAAAK,YAAc,GAAGJ,aAAjB;;;;;;;;;;;;ACTA,SAASK,aAAT,CAAqBJ,KAArB,EAA4B;AAC1B,EAAA,OAAO,KAAKC,QAAL,CAAcI,GAAd,CAAkBL,KAAlB,CAAP,CAAA;AACD,CAAA;;AAED,IAAAM,YAAc,GAAGF,aAAjB;;ACbA,IAAIG,QAAQ,GAAGC,SAAf;AAAA,IACIT,WAAW,GAAGU,YADlB;AAAA,IAEIL,WAAW,GAAGM,YAFlB,CAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,MAAlB,EAA0B;EACxB,IAAIC,KAAK,GAAG,CAAC,CAAb;MACIC,MAAM,GAAGF,MAAM,IAAI,IAAV,GAAiB,CAAjB,GAAqBA,MAAM,CAACE,MADzC,CAAA;AAGA,EAAA,IAAA,CAAKb,QAAL,GAAgB,IAAIM,QAAJ,EAAhB,CAAA;;AACA,EAAA,OAAO,EAAEM,KAAF,GAAUC,MAAjB,EAAyB;AACvB,IAAA,IAAA,CAAKC,GAAL,CAASH,MAAM,CAACC,KAAD,CAAf,CAAA,CAAA;AACD,GAAA;AACF;;;AAGDF,QAAQ,CAACK,SAAT,CAAmBD,GAAnB,GAAyBJ,QAAQ,CAACK,SAAT,CAAmBC,IAAnB,GAA0BlB,WAAnD,CAAA;AACAY,QAAQ,CAACK,SAAT,CAAmBX,GAAnB,GAAyBD,WAAzB,CAAA;AAEAc,IAAAA,SAAc,GAAGP;;;;;;;;;;;;;;ACfjB,SAASQ,eAAT,CAAuBC,KAAvB,EAA8BC,SAA9B,EAAyCC,SAAzC,EAAoDC,SAApD,EAA+D;AAC7D,EAAA,IAAIT,MAAM,GAAGM,KAAK,CAACN,MAAnB;MACID,KAAK,GAAGS,SAAS,IAAIC,SAAS,GAAG,CAAH,GAAO,CAAC,CAArB,CADrB,CAAA;;EAGA,OAAQA,SAAS,GAAGV,KAAK,EAAR,GAAa,EAAEA,KAAF,GAAUC,MAAxC,EAAiD;IAC/C,IAAIO,SAAS,CAACD,KAAK,CAACP,KAAD,CAAN,EAAeA,KAAf,EAAsBO,KAAtB,CAAb,EAA2C;AACzC,MAAA,OAAOP,KAAP,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAO,CAAC,CAAR,CAAA;AACD,CAAA;;AAED,IAAAW,cAAc,GAAGL,eAAjB;;;;;;;;;;AChBA,SAASM,WAAT,CAAmBzB,KAAnB,EAA0B;EACxB,OAAOA,KAAK,KAAKA,KAAjB,CAAA;AACD,CAAA;;AAED,IAAA0B,UAAc,GAAGD,WAAjB;;;;;;;;;;;;;ACDA,SAASE,eAAT,CAAuBP,KAAvB,EAA8BpB,KAA9B,EAAqCsB,SAArC,EAAgD;AAC9C,EAAA,IAAIT,KAAK,GAAGS,SAAS,GAAG,CAAxB;AAAA,MACIR,MAAM,GAAGM,KAAK,CAACN,MADnB,CAAA;;AAGA,EAAA,OAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;AACvB,IAAA,IAAIM,KAAK,CAACP,KAAD,CAAL,KAAiBb,KAArB,EAA4B;AAC1B,MAAA,OAAOa,KAAP,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAO,CAAC,CAAR,CAAA;AACD,CAAA;;AAED,IAAAe,cAAc,GAAGD,eAAjB;;ACtBA,IAAIR,aAAa,GAAGX,cAApB;AAAA,IACIiB,SAAS,GAAGhB,UADhB;AAAA,IAEIkB,aAAa,GAAGjB,cAFpB,CAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASmB,aAAT,CAAqBT,KAArB,EAA4BpB,KAA5B,EAAmCsB,SAAnC,EAA8C;EAC5C,OAAOtB,KAAK,KAAKA,KAAV,GACH2B,aAAa,CAACP,KAAD,EAAQpB,KAAR,EAAesB,SAAf,CADV,GAEHH,aAAa,CAACC,KAAD,EAAQK,SAAR,EAAmBH,SAAnB,CAFjB,CAAA;AAGD,CAAA;;AAED,IAAAQ,YAAc,GAAGD,aAAjB;;ACnBA,IAAIA,WAAW,GAAGrB,YAAlB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASuB,aAAT,CAAuBX,KAAvB,EAA8BpB,KAA9B,EAAqC;EACnC,IAAIc,MAAM,GAAGM,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACN,MAAvC,CAAA;AACA,EAAA,OAAO,CAAC,CAACA,MAAF,IAAYe,WAAW,CAACT,KAAD,EAAQpB,KAAR,EAAe,CAAf,CAAX,GAA+B,CAAC,CAAnD,CAAA;AACD,CAAA;;AAEDgC,IAAAA,cAAc,GAAGD;;;;;;;;;;;;ACPjB,SAASE,iBAAT,CAA2Bb,KAA3B,EAAkCpB,KAAlC,EAAyCkC,UAAzC,EAAqD;EACnD,IAAIrB,KAAK,GAAG,CAAC,CAAb;MACIC,MAAM,GAAGM,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACN,MADvC,CAAA;;AAGA,EAAA,OAAO,EAAED,KAAF,GAAUC,MAAjB,EAAyB;IACvB,IAAIoB,UAAU,CAAClC,KAAD,EAAQoB,KAAK,CAACP,KAAD,CAAb,CAAd,EAAqC;AACnC,MAAA,OAAO,IAAP,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAO,KAAP,CAAA;AACD,CAAA;;AAEDsB,IAAAA,kBAAc,GAAGF;;;;;;;;;;;ACbjB,SAASG,QAAT,CAAkBC,KAAlB,EAAyBC,GAAzB,EAA8B;AAC5B,EAAA,OAAOD,KAAK,CAAChC,GAAN,CAAUiC,GAAV,CAAP,CAAA;AACD,CAAA;;AAEDC,IAAAA,SAAc,GAAGH;;;;"}

package/lib/_chunks/dep-1bda39e0.js

@@ -0,0 +1,16 @@
+/**
+ * tdesign v0.42.1-alpha.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import { _ as _typeof } from './dep-93f6ba7d.js';
+
+function isObjectLike(value) {
+  return value != null && _typeof(value) == 'object';
+}
+
+var isObjectLike_1 = isObjectLike;
+
+export { isObjectLike_1 as i };
+//# sourceMappingURL=dep-1bda39e0.js.map

package/lib/_chunks/dep-1bda39e0.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-1bda39e0.js","sources":["../../node_modules/lodash/isObjectLike.js"],"sourcesContent":["/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n"],"names":["isObjectLike","value","isObjectLike_1"],"mappings":";;;;;;;;AAwBA,SAASA,YAAT,CAAsBC,KAAtB,EAA6B;AAC3B,EAAA,OAAOA,KAAK,IAAI,IAAT,IAAiB,OAAOA,CAAAA,KAAP,KAAgB,QAAxC,CAAA;AACD,CAAA;;AAEDC,IAAAA,cAAc,GAAGF;;;;"}

package/lib/_chunks/dep-1f033285.js

@@ -0,0 +1,64 @@
+/**
+ * tdesign v0.42.1-alpha.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import { i as isArrayLike_1 } from './dep-7460bf49.js';
+import { i as isObjectLike_1 } from './dep-1bda39e0.js';
+import { a as _overRest, b as _setToString, i as identity_1 } from './dep-d58668a9.js';
+
+var isArrayLike = isArrayLike_1,
+    isObjectLike = isObjectLike_1;
+/**
+ * This method is like `_.isArrayLike` except that it also checks if `value`
+ * is an object.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array-like object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArrayLikeObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLikeObject(document.body.children);
+ * // => true
+ *
+ * _.isArrayLikeObject('abc');
+ * // => false
+ *
+ * _.isArrayLikeObject(_.noop);
+ * // => false
+ */
+
+function isArrayLikeObject(value) {
+  return isObjectLike(value) && isArrayLike(value);
+}
+
+var isArrayLikeObject_1 = isArrayLikeObject;
+
+var identity = identity_1,
+    overRest = _overRest,
+    setToString = _setToString;
+/**
+ * The base implementation of `_.rest` which doesn't validate or coerce arguments.
+ *
+ * @private
+ * @param {Function} func The function to apply a rest parameter to.
+ * @param {number} [start=func.length-1] The start position of the rest parameter.
+ * @returns {Function} Returns the new function.
+ */
+
+function baseRest(func, start) {
+  return setToString(overRest(func, start, identity), func + '');
+}
+
+var _baseRest = baseRest;
+
+export { _baseRest as _, isArrayLikeObject_1 as i };
+//# sourceMappingURL=dep-1f033285.js.map

package/lib/_chunks/dep-1f033285.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-1f033285.js","sources":["../../node_modules/lodash/isArrayLikeObject.js","../../node_modules/lodash/_baseRest.js"],"sourcesContent":["var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n"],"names":["isArrayLike","require$$0","isObjectLike","require$$1","isArrayLikeObject","value","isArrayLikeObject_1","identity","overRest","setToString","require$$2","baseRest","func","start","_baseRest"],"mappings":";;;;;;;;;;AAAA,IAAIA,WAAW,GAAGC,aAAlB;AAAA,IACIC,YAAY,GAAGC,cADnB,CAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,iBAAT,CAA2BC,KAA3B,EAAkC;EAChC,OAAOH,YAAY,CAACG,KAAD,CAAZ,IAAuBL,WAAW,CAACK,KAAD,CAAzC,CAAA;AACD,CAAA;;AAEDC,IAAAA,mBAAc,GAAGF;;AChCjB,IAAIG,QAAQ,GAAGN,UAAf;AAAA,IACIO,QAAQ,GAAGL,SADf;AAAA,IAEIM,WAAW,GAAGC,YAFlB,CAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAkBC,IAAlB,EAAwBC,KAAxB,EAA+B;AAC7B,EAAA,OAAOJ,WAAW,CAACD,QAAQ,CAACI,IAAD,EAAOC,KAAP,EAAcN,QAAd,CAAT,EAAkCK,IAAI,GAAG,EAAzC,CAAlB,CAAA;AACD,CAAA;;AAEDE,IAAAA,SAAc,GAAGH;;;;"}

package/lib/_chunks/dep-221761b0.js

@@ -0,0 +1,156 @@
+/**
+ * tdesign v0.42.1-alpha.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import { _ as _arrayMap } from './dep-2c663505.js';
+import { _ as _getAllKeysIn, a as _baseClone } from './dep-cb3ff2b2.js';
+import { _ as _baseGet, a as _castPath, b as _toKey } from './dep-6c0dc49f.js';
+import { _ as _baseSlice } from './dep-8540beb1.js';
+import { _ as _copyObject } from './dep-e362e533.js';
+import { i as isPlainObject_1 } from './dep-447daaf9.js';
+import { _ as _flatRest } from './dep-a6bf7453.js';
+
+/**
+ * Gets the last element of `array`.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {Array} array The array to query.
+ * @returns {*} Returns the last element of `array`.
+ * @example
+ *
+ * _.last([1, 2, 3]);
+ * // => 3
+ */
+
+function last$1(array) {
+  var length = array == null ? 0 : array.length;
+  return length ? array[length - 1] : undefined;
+}
+
+var last_1 = last$1;
+
+var baseGet = _baseGet,
+    baseSlice = _baseSlice;
+/**
+ * Gets the parent value at `path` of `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {Array} path The path to get the parent value of.
+ * @returns {*} Returns the parent value.
+ */
+
+function parent$1(object, path) {
+  return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));
+}
+
+var _parent = parent$1;
+
+var castPath$1 = _castPath,
+    last = last_1,
+    parent = _parent,
+    toKey = _toKey;
+/**
+ * The base implementation of `_.unset`.
+ *
+ * @private
+ * @param {Object} object The object to modify.
+ * @param {Array|string} path The property path to unset.
+ * @returns {boolean} Returns `true` if the property is deleted, else `false`.
+ */
+
+function baseUnset$1(object, path) {
+  path = castPath$1(path, object);
+  object = parent(object, path);
+  return object == null || delete object[toKey(last(path))];
+}
+
+var _baseUnset = baseUnset$1;
+
+var isPlainObject = isPlainObject_1;
+/**
+ * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain
+ * objects.
+ *
+ * @private
+ * @param {*} value The value to inspect.
+ * @param {string} key The key of the property to inspect.
+ * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.
+ */
+
+function customOmitClone$1(value) {
+  return isPlainObject(value) ? undefined : value;
+}
+
+var _customOmitClone = customOmitClone$1;
+
+var arrayMap = _arrayMap,
+    baseClone = _baseClone,
+    baseUnset = _baseUnset,
+    castPath = _castPath,
+    copyObject = _copyObject,
+    customOmitClone = _customOmitClone,
+    flatRest = _flatRest,
+    getAllKeysIn = _getAllKeysIn;
+/** Used to compose bitmasks for cloning. */
+
+var CLONE_DEEP_FLAG = 1,
+    CLONE_FLAT_FLAG = 2,
+    CLONE_SYMBOLS_FLAG = 4;
+/**
+ * The opposite of `_.pick`; this method creates an object composed of the
+ * own and inherited enumerable property paths of `object` that are not omitted.
+ *
+ * **Note:** This method is considerably slower than `_.pick`.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The source object.
+ * @param {...(string|string[])} [paths] The property paths to omit.
+ * @returns {Object} Returns the new object.
+ * @example
+ *
+ * var object = { 'a': 1, 'b': '2', 'c': 3 };
+ *
+ * _.omit(object, ['a', 'c']);
+ * // => { 'b': '2' }
+ */
+
+var omit = flatRest(function (object, paths) {
+  var result = {};
+
+  if (object == null) {
+    return result;
+  }
+
+  var isDeep = false;
+  paths = arrayMap(paths, function (path) {
+    path = castPath(path, object);
+    isDeep || (isDeep = path.length > 1);
+    return path;
+  });
+  copyObject(object, getAllKeysIn(object), result);
+
+  if (isDeep) {
+    result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);
+  }
+
+  var length = paths.length;
+
+  while (length--) {
+    baseUnset(result, paths[length]);
+  }
+
+  return result;
+});
+var omit_1 = omit;
+
+export { omit_1 as o };
+//# sourceMappingURL=dep-221761b0.js.map

package/lib/_chunks/dep-221761b0.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-221761b0.js","sources":["../../node_modules/lodash/last.js","../../node_modules/lodash/_parent.js","../../node_modules/lodash/_baseUnset.js","../../node_modules/lodash/_customOmitClone.js","../../node_modules/lodash/omit.js"],"sourcesContent":["/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nmodule.exports = last;\n","var baseGet = require('./_baseGet'),\n    baseSlice = require('./_baseSlice');\n\n/**\n * Gets the parent value at `path` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} path The path to get the parent value of.\n * @returns {*} Returns the parent value.\n */\nfunction parent(object, path) {\n  return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n}\n\nmodule.exports = parent;\n","var castPath = require('./_castPath'),\n    last = require('./last'),\n    parent = require('./_parent'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.unset`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The property path to unset.\n * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n */\nfunction baseUnset(object, path) {\n  path = castPath(path, object);\n  object = parent(object, path);\n  return object == null || delete object[toKey(last(path))];\n}\n\nmodule.exports = baseUnset;\n","var isPlainObject = require('./isPlainObject');\n\n/**\n * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n * objects.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {string} key The key of the property to inspect.\n * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n */\nfunction customOmitClone(value) {\n  return isPlainObject(value) ? undefined : value;\n}\n\nmodule.exports = customOmitClone;\n","var arrayMap = require('./_arrayMap'),\n    baseClone = require('./_baseClone'),\n    baseUnset = require('./_baseUnset'),\n    castPath = require('./_castPath'),\n    copyObject = require('./_copyObject'),\n    customOmitClone = require('./_customOmitClone'),\n    flatRest = require('./_flatRest'),\n    getAllKeysIn = require('./_getAllKeysIn');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_FLAT_FLAG = 2,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * The opposite of `_.pick`; this method creates an object composed of the\n * own and inherited enumerable property paths of `object` that are not omitted.\n *\n * **Note:** This method is considerably slower than `_.pick`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to omit.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.omit(object, ['a', 'c']);\n * // => { 'b': '2' }\n */\nvar omit = flatRest(function(object, paths) {\n  var result = {};\n  if (object == null) {\n    return result;\n  }\n  var isDeep = false;\n  paths = arrayMap(paths, function(path) {\n    path = castPath(path, object);\n    isDeep || (isDeep = path.length > 1);\n    return path;\n  });\n  copyObject(object, getAllKeysIn(object), result);\n  if (isDeep) {\n    result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n  }\n  var length = paths.length;\n  while (length--) {\n    baseUnset(result, paths[length]);\n  }\n  return result;\n});\n\nmodule.exports = omit;\n"],"names":["last","array","length","undefined","last_1","baseGet","require$$0","baseSlice","require$$1","parent","object","path","_parent","castPath","require$$2","toKey","require$$3","baseUnset","_baseUnset","isPlainObject","customOmitClone","value","_customOmitClone","arrayMap","baseClone","copyObject","require$$4","require$$5","flatRest","require$$6","getAllKeysIn","require$$7","CLONE_DEEP_FLAG","CLONE_FLAT_FLAG","CLONE_SYMBOLS_FLAG","omit","paths","result","isDeep","omit_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAcA,SAASA,MAAT,CAAcC,KAAd,EAAqB;EACnB,IAAIC,MAAM,GAAGD,KAAK,IAAI,IAAT,GAAgB,CAAhB,GAAoBA,KAAK,CAACC,MAAvC,CAAA;EACA,OAAOA,MAAM,GAAGD,KAAK,CAACC,MAAM,GAAG,CAAV,CAAR,GAAuBC,SAApC,CAAA;AACD,CAAA;;AAED,IAAAC,MAAc,GAAGJ,MAAjB;;ACnBA,IAAIK,OAAO,GAAGC,QAAd;AAAA,IACIC,SAAS,GAAGC,UADhB,CAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,QAAT,CAAgBC,MAAhB,EAAwBC,IAAxB,EAA8B;EAC5B,OAAOA,IAAI,CAACT,MAAL,GAAc,CAAd,GAAkBQ,MAAlB,GAA2BL,OAAO,CAACK,MAAD,EAASH,SAAS,CAACI,IAAD,EAAO,CAAP,EAAU,CAAC,CAAX,CAAlB,CAAzC,CAAA;AACD,CAAA;;AAED,IAAAC,OAAc,GAAGH,QAAjB;;ACfA,IAAII,UAAQ,GAAGP,SAAf;AAAA,IACIN,IAAI,GAAGQ,MADX;AAAA,IAEIC,MAAM,GAAGK,OAFb;AAAA,IAGIC,KAAK,GAAGC,MAHZ,CAAA;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,WAAT,CAAmBP,MAAnB,EAA2BC,IAA3B,EAAiC;AAC/BA,EAAAA,IAAI,GAAGE,UAAQ,CAACF,IAAD,EAAOD,MAAP,CAAf,CAAA;AACAA,EAAAA,MAAM,GAAGD,MAAM,CAACC,MAAD,EAASC,IAAT,CAAf,CAAA;AACA,EAAA,OAAOD,MAAM,IAAI,IAAV,IAAkB,OAAOA,MAAM,CAACK,KAAK,CAACf,IAAI,CAACW,IAAD,CAAL,CAAN,CAAtC,CAAA;AACD,CAAA;;AAED,IAAAO,UAAc,GAAGD,WAAjB;;ACnBA,IAAIE,aAAa,GAAGb,eAApB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASc,iBAAT,CAAyBC,KAAzB,EAAgC;AAC9B,EAAA,OAAOF,aAAa,CAACE,KAAD,CAAb,GAAuBlB,SAAvB,GAAmCkB,KAA1C,CAAA;AACD,CAAA;;AAED,IAAAC,gBAAc,GAAGF,iBAAjB;;ACfA,IAAIG,QAAQ,GAAGjB,SAAf;AAAA,IACIkB,SAAS,GAAGhB,UADhB;AAAA,IAEIS,SAAS,GAAGH,UAFhB;AAAA,IAGID,QAAQ,GAAGG,SAHf;AAAA,IAIIS,UAAU,GAAGC,WAJjB;AAAA,IAKIN,eAAe,GAAGO,gBALtB;AAAA,IAMIC,QAAQ,GAAGC,SANf;AAAA,IAOIC,YAAY,GAAGC,aAPnB,CAAA;AASA;;AACA,IAAIC,eAAe,GAAG,CAAtB;AAAA,IACIC,eAAe,GAAG,CADtB;AAAA,IAEIC,kBAAkB,GAAG,CAFzB,CAAA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,IAAI,GAAGP,QAAQ,CAAC,UAASlB,MAAT,EAAiB0B,KAAjB,EAAwB;EAC1C,IAAIC,MAAM,GAAG,EAAb,CAAA;;EACA,IAAI3B,MAAM,IAAI,IAAd,EAAoB;AAClB,IAAA,OAAO2B,MAAP,CAAA;AACD,GAAA;;EACD,IAAIC,MAAM,GAAG,KAAb,CAAA;AACAF,EAAAA,KAAK,GAAGb,QAAQ,CAACa,KAAD,EAAQ,UAASzB,IAAT,EAAe;AACrCA,IAAAA,IAAI,GAAGE,QAAQ,CAACF,IAAD,EAAOD,MAAP,CAAf,CAAA;IACA4B,MAAM,KAAKA,MAAM,GAAG3B,IAAI,CAACT,MAAL,GAAc,CAA5B,CAAN,CAAA;AACA,IAAA,OAAOS,IAAP,CAAA;AACD,GAJe,CAAhB,CAAA;EAKAc,UAAU,CAACf,MAAD,EAASoB,YAAY,CAACpB,MAAD,CAArB,EAA+B2B,MAA/B,CAAV,CAAA;;AACA,EAAA,IAAIC,MAAJ,EAAY;AACVD,IAAAA,MAAM,GAAGb,SAAS,CAACa,MAAD,EAASL,eAAe,GAAGC,eAAlB,GAAoCC,kBAA7C,EAAiEd,eAAjE,CAAlB,CAAA;AACD,GAAA;;AACD,EAAA,IAAIlB,MAAM,GAAGkC,KAAK,CAAClC,MAAnB,CAAA;;EACA,OAAOA,MAAM,EAAb,EAAiB;AACfe,IAAAA,SAAS,CAACoB,MAAD,EAASD,KAAK,CAAClC,MAAD,CAAd,CAAT,CAAA;AACD,GAAA;;AACD,EAAA,OAAOmC,MAAP,CAAA;AACD,CApBkB,CAAnB,CAAA;AAsBAE,IAAAA,MAAc,GAAGJ;;;;"}

package/lib/_chunks/dep-26cdd12c.js

@@ -0,0 +1,116 @@
+/**
+ * tdesign v0.42.1-alpha.2
+ * (c) 2022 tdesign
+ * @license MIT
+ */
+
+import { _ as _SetCache, b as _arrayIncludes, c as _arrayIncludesWith, a as _cacheHas } from './dep-195801f7.js';
+import { _ as _arrayMap } from './dep-2c663505.js';
+import { _ as _baseUnary } from './dep-0a9ff066.js';
+import { a as _baseFlatten } from './dep-a6bf7453.js';
+import { _ as _baseRest, i as isArrayLikeObject_1 } from './dep-1f033285.js';
+
+var SetCache = _SetCache,
+    arrayIncludes = _arrayIncludes,
+    arrayIncludesWith = _arrayIncludesWith,
+    arrayMap = _arrayMap,
+    baseUnary = _baseUnary,
+    cacheHas = _cacheHas;
+/** Used as the size to enable large array optimizations. */
+
+var LARGE_ARRAY_SIZE = 200;
+/**
+ * The base implementation of methods like `_.difference` without support
+ * for excluding multiple arrays or iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Array} values The values to exclude.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ */
+
+function baseDifference$1(array, values, iteratee, comparator) {
+  var index = -1,
+      includes = arrayIncludes,
+      isCommon = true,
+      length = array.length,
+      result = [],
+      valuesLength = values.length;
+
+  if (!length) {
+    return result;
+  }
+
+  if (iteratee) {
+    values = arrayMap(values, baseUnary(iteratee));
+  }
+
+  if (comparator) {
+    includes = arrayIncludesWith;
+    isCommon = false;
+  } else if (values.length >= LARGE_ARRAY_SIZE) {
+    includes = cacheHas;
+    isCommon = false;
+    values = new SetCache(values);
+  }
+
+  outer: while (++index < length) {
+    var value = array[index],
+        computed = iteratee == null ? value : iteratee(value);
+    value = comparator || value !== 0 ? value : 0;
+
+    if (isCommon && computed === computed) {
+      var valuesIndex = valuesLength;
+
+      while (valuesIndex--) {
+        if (values[valuesIndex] === computed) {
+          continue outer;
+        }
+      }
+
+      result.push(value);
+    } else if (!includes(values, computed, comparator)) {
+      result.push(value);
+    }
+  }
+
+  return result;
+}
+
+var _baseDifference = baseDifference$1;
+
+var baseDifference = _baseDifference,
+    baseFlatten = _baseFlatten,
+    baseRest = _baseRest,
+    isArrayLikeObject = 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;
+
+export { difference_1 as d };
+//# sourceMappingURL=dep-26cdd12c.js.map