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

package/es/_chunks/dep-e5d11062.js

@@ -0,0 +1,172 @@
+/**
+ * tdesign v1.8.0-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+import './dep-24fbd2a1.js';
+import { _ as _arrayFilter } from './dep-043c4639.js';
+import { _ as _baseRest, i as isArrayLikeObject_1 } from './dep-d2fa1b97.js';
+import { _ as _baseDifference } from './dep-86fb58f5.js';
+import { _ as _baseFlatten } from './dep-635d460f.js';
+import { _ as _SetCache, b as _arrayIncludes, c as _arrayIncludesWith, a as _cacheHas } from './dep-27bf81da.js';
+import { _ as _Set } from './dep-2c6548db.js';
+import { n as noop_1 } from './dep-a4b8f9c3.js';
+import { _ as _setToArray } from './dep-d313030d.js';
+import { l as last_1 } from './dep-4df6f512.js';
+
+var Set = _Set,
+  noop = noop_1,
+  setToArray$1 = _setToArray;
+
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
+
+/**
+ * Creates a set object of `values`.
+ *
+ * @private
+ * @param {Array} values The values to add to the set.
+ * @returns {Object} Returns the new set.
+ */
+var createSet$1 = !(Set && 1 / setToArray$1(new Set([, -0]))[1] == INFINITY) ? noop : function (values) {
+  return new Set(values);
+};
+var _createSet = createSet$1;
+
+var SetCache = _SetCache,
+  arrayIncludes = _arrayIncludes,
+  arrayIncludesWith = _arrayIncludesWith,
+  cacheHas = _cacheHas,
+  createSet = _createSet,
+  setToArray = _setToArray;
+
+/** Used as the size to enable large array optimizations. */
+var LARGE_ARRAY_SIZE = 200;
+
+/**
+ * The base implementation of `_.uniqBy` without support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new duplicate free array.
+ */
+function baseUniq$1(array, iteratee, comparator) {
+  var index = -1,
+    includes = arrayIncludes,
+    length = array.length,
+    isCommon = true,
+    result = [],
+    seen = result;
+  if (comparator) {
+    isCommon = false;
+    includes = arrayIncludesWith;
+  } else if (length >= LARGE_ARRAY_SIZE) {
+    var set = iteratee ? null : createSet(array);
+    if (set) {
+      return setToArray(set);
+    }
+    isCommon = false;
+    includes = cacheHas;
+    seen = new SetCache();
+  } else {
+    seen = iteratee ? [] : result;
+  }
+  outer: while (++index < length) {
+    var value = array[index],
+      computed = iteratee ? iteratee(value) : value;
+    value = comparator || value !== 0 ? value : 0;
+    if (isCommon && computed === computed) {
+      var seenIndex = seen.length;
+      while (seenIndex--) {
+        if (seen[seenIndex] === computed) {
+          continue outer;
+        }
+      }
+      if (iteratee) {
+        seen.push(computed);
+      }
+      result.push(value);
+    } else if (!includes(seen, computed, comparator)) {
+      if (seen !== result) {
+        seen.push(computed);
+      }
+      result.push(value);
+    }
+  }
+  return result;
+}
+var _baseUniq = baseUniq$1;
+
+var baseDifference = _baseDifference,
+  baseFlatten = _baseFlatten,
+  baseUniq = _baseUniq;
+
+/**
+ * The base implementation of methods like `_.xor`, 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 values.
+ */
+function baseXor$1(arrays, iteratee, comparator) {
+  var length = arrays.length;
+  if (length < 2) {
+    return length ? baseUniq(arrays[0]) : [];
+  }
+  var index = -1,
+    result = Array(length);
+  while (++index < length) {
+    var array = arrays[index],
+      othIndex = -1;
+    while (++othIndex < length) {
+      if (othIndex != index) {
+        result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);
+      }
+    }
+  }
+  return baseUniq(baseFlatten(result, 1), iteratee, comparator);
+}
+var _baseXor = baseXor$1;
+
+var arrayFilter = _arrayFilter,
+  baseRest = _baseRest,
+  baseXor = _baseXor,
+  isArrayLikeObject = isArrayLikeObject_1,
+  last = last_1;
+
+/**
+ * This method is like `_.xor` except that it accepts `comparator` which is
+ * invoked to compare elements of `arrays`. The order of result values is
+ * determined by the order they occur in the arrays. The comparator is invoked
+ * with two arguments: (arrVal, othVal).
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Array
+ * @param {...Array} [arrays] The arrays to inspect.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ * @example
+ *
+ * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+ * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+ *
+ * _.xorWith(objects, others, _.isEqual);
+ * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
+ */
+var xorWith = baseRest(function (arrays) {
+  var comparator = last(arrays);
+  comparator = typeof comparator == 'function' ? comparator : undefined;
+  return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);
+});
+var xorWith_1 = xorWith;
+
+export { xorWith_1 as x };
+//# sourceMappingURL=dep-e5d11062.js.map

package/es/_chunks/dep-e5d11062.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-e5d11062.js","sources":["../../node_modules/lodash/_createSet.js","../../node_modules/lodash/_baseUniq.js","../../node_modules/lodash/_baseXor.js","../../node_modules/lodash/xorWith.js"],"sourcesContent":["var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array 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 duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseUniq = require('./_baseUniq');\n\n/**\n * The base implementation of methods like `_.xor`, without support for\n * 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 values.\n */\nfunction baseXor(arrays, iteratee, comparator) {\n  var length = arrays.length;\n  if (length < 2) {\n    return length ? baseUniq(arrays[0]) : [];\n  }\n  var index = -1,\n      result = Array(length);\n\n  while (++index < length) {\n    var array = arrays[index],\n        othIndex = -1;\n\n    while (++othIndex < length) {\n      if (othIndex != index) {\n        result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n      }\n    }\n  }\n  return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n}\n\nmodule.exports = baseXor;\n","var arrayFilter = require('./_arrayFilter'),\n    baseRest = require('./_baseRest'),\n    baseXor = require('./_baseXor'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    last = require('./last');\n\n/**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\nvar xorWith = baseRest(function(arrays) {\n  var comparator = last(arrays);\n  comparator = typeof comparator == 'function' ? comparator : undefined;\n  return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n});\n\nmodule.exports = xorWith;\n"],"names":["Set","require$$0","noop","require$$1","setToArray","require$$2","INFINITY","createSet","values","_createSet","SetCache","arrayIncludes","arrayIncludesWith","cacheHas","require$$3","require$$4","require$$5","LARGE_ARRAY_SIZE","baseUniq","array","iteratee","comparator","index","includes","length","isCommon","result","seen","set","outer","value","computed","seenIndex","push","_baseUniq","baseDifference","baseFlatten","baseXor","arrays","Array","othIndex","_baseXor","arrayFilter","baseRest","isArrayLikeObject","last","xorWith","undefined","xorWith_1"],"mappings":";;;;;;;;;;;;;;;;;AAAA,IAAIA,GAAG,GAAGC,IAAiB;AACvBC,EAAAA,IAAI,GAAGC,MAAiB;AACxBC,EAAAA,YAAU,GAAGC,WAAwB,CAAA;;AAEzC;AACA,IAAIC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAA;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIC,WAAS,GAAG,EAAEP,GAAG,IAAK,CAAC,GAAGI,YAAU,CAAC,IAAIJ,GAAG,CAAC,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAKM,QAAQ,CAAC,GAAGJ,IAAI,GAAG,UAASM,MAAM,EAAE;AAClG,EAAA,OAAO,IAAIR,GAAG,CAACQ,MAAM,CAAC,CAAA;AACxB,CAAC,CAAA;AAED,IAAAC,UAAc,GAAGF,WAAS;;AClB1B,IAAIG,QAAQ,GAAGT,SAAsB;AACjCU,EAAAA,aAAa,GAAGR,cAA2B;AAC3CS,EAAAA,iBAAiB,GAAGP,kBAA+B;AACnDQ,EAAAA,QAAQ,GAAGC,SAAsB;AACjCP,EAAAA,SAAS,GAAGQ,UAAuB;AACnCX,EAAAA,UAAU,GAAGY,WAAwB,CAAA;;AAEzC;AACA,IAAIC,gBAAgB,GAAG,GAAG,CAAA;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAQA,CAACC,KAAK,EAAEC,QAAQ,EAAEC,UAAU,EAAE;EAC7C,IAAIC,KAAK,GAAG,CAAC,CAAC;AACVC,IAAAA,QAAQ,GAAGZ,aAAa;IACxBa,MAAM,GAAGL,KAAK,CAACK,MAAM;AACrBC,IAAAA,QAAQ,GAAG,IAAI;AACfC,IAAAA,MAAM,GAAG,EAAE;AACXC,IAAAA,IAAI,GAAGD,MAAM,CAAA;AAEjB,EAAA,IAAIL,UAAU,EAAE;AACdI,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAChBF,IAAAA,QAAQ,GAAGX,iBAAiB,CAAA;AAC7B,GAAA,MACI,IAAIY,MAAM,IAAIP,gBAAgB,EAAE;IACnC,IAAIW,GAAG,GAAGR,QAAQ,GAAG,IAAI,GAAGb,SAAS,CAACY,KAAK,CAAC,CAAA;AAC5C,IAAA,IAAIS,GAAG,EAAE;MACP,OAAOxB,UAAU,CAACwB,GAAG,CAAC,CAAA;AACvB,KAAA;AACDH,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAChBF,IAAAA,QAAQ,GAAGV,QAAQ,CAAA;AACnBc,IAAAA,IAAI,GAAG,IAAIjB,QAAQ,EAAA,CAAA;AACpB,GAAA,MACI;AACHiB,IAAAA,IAAI,GAAGP,QAAQ,GAAG,EAAE,GAAGM,MAAM,CAAA;AAC9B,GAAA;AACDG,EAAAA,KAAK,EACL,OAAO,EAAEP,KAAK,GAAGE,MAAM,EAAE;AACvB,IAAA,IAAIM,KAAK,GAAGX,KAAK,CAACG,KAAK,CAAC;MACpBS,QAAQ,GAAGX,QAAQ,GAAGA,QAAQ,CAACU,KAAK,CAAC,GAAGA,KAAK,CAAA;IAEjDA,KAAK,GAAIT,UAAU,IAAIS,KAAK,KAAK,CAAC,GAAIA,KAAK,GAAG,CAAC,CAAA;AAC/C,IAAA,IAAIL,QAAQ,IAAIM,QAAQ,KAAKA,QAAQ,EAAE;AACrC,MAAA,IAAIC,SAAS,GAAGL,IAAI,CAACH,MAAM,CAAA;MAC3B,OAAOQ,SAAS,EAAE,EAAE;AAClB,QAAA,IAAIL,IAAI,CAACK,SAAS,CAAC,KAAKD,QAAQ,EAAE;AAChC,UAAA,SAASF,KAAK,CAAA;AACf,SAAA;AACF,OAAA;AACD,MAAA,IAAIT,QAAQ,EAAE;AACZO,QAAAA,IAAI,CAACM,IAAI,CAACF,QAAQ,CAAC,CAAA;AACpB,OAAA;AACDL,MAAAA,MAAM,CAACO,IAAI,CAACH,KAAK,CAAC,CAAA;KACnB,MACI,IAAI,CAACP,QAAQ,CAACI,IAAI,EAAEI,QAAQ,EAAEV,UAAU,CAAC,EAAE;MAC9C,IAAIM,IAAI,KAAKD,MAAM,EAAE;AACnBC,QAAAA,IAAI,CAACM,IAAI,CAACF,QAAQ,CAAC,CAAA;AACpB,OAAA;AACDL,MAAAA,MAAM,CAACO,IAAI,CAACH,KAAK,CAAC,CAAA;AACnB,KAAA;AACF,GAAA;AACD,EAAA,OAAOJ,MAAM,CAAA;AACf,CAAA;AAEA,IAAAQ,SAAc,GAAGhB,UAAQ;;ACvEzB,IAAIiB,cAAc,GAAGlC,eAA4B;AAC7CmC,EAAAA,WAAW,GAAGjC,YAAyB;AACvCe,EAAAA,QAAQ,GAAGb,SAAsB,CAAA;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASgC,SAAOA,CAACC,MAAM,EAAElB,QAAQ,EAAEC,UAAU,EAAE;AAC7C,EAAA,IAAIG,MAAM,GAAGc,MAAM,CAACd,MAAM,CAAA;EAC1B,IAAIA,MAAM,GAAG,CAAC,EAAE;IACd,OAAOA,MAAM,GAAGN,QAAQ,CAACoB,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAA;AACzC,GAAA;EACD,IAAIhB,KAAK,GAAG,CAAC,CAAC;AACVI,IAAAA,MAAM,GAAGa,KAAK,CAACf,MAAM,CAAC,CAAA;AAE1B,EAAA,OAAO,EAAEF,KAAK,GAAGE,MAAM,EAAE;AACvB,IAAA,IAAIL,KAAK,GAAGmB,MAAM,CAAChB,KAAK,CAAC;MACrBkB,QAAQ,GAAG,CAAC,CAAC,CAAA;AAEjB,IAAA,OAAO,EAAEA,QAAQ,GAAGhB,MAAM,EAAE;MAC1B,IAAIgB,QAAQ,IAAIlB,KAAK,EAAE;QACrBI,MAAM,CAACJ,KAAK,CAAC,GAAGa,cAAc,CAACT,MAAM,CAACJ,KAAK,CAAC,IAAIH,KAAK,EAAEmB,MAAM,CAACE,QAAQ,CAAC,EAAEpB,QAAQ,EAAEC,UAAU,CAAC,CAAA;AAC/F,OAAA;AACF,KAAA;AACF,GAAA;AACD,EAAA,OAAOH,QAAQ,CAACkB,WAAW,CAACV,MAAM,EAAE,CAAC,CAAC,EAAEN,QAAQ,EAAEC,UAAU,CAAC,CAAA;AAC/D,CAAA;AAEA,IAAAoB,QAAc,GAAGJ,SAAO;;ACnCxB,IAAIK,WAAW,GAAGzC,YAAyB;AACvC0C,EAAAA,QAAQ,GAAGxC,SAAsB;AACjCkC,EAAAA,OAAO,GAAGhC,QAAqB;AAC/BuC,EAAAA,iBAAiB,GAAG9B,mBAA8B;AAClD+B,EAAAA,IAAI,GAAG9B,MAAiB,CAAA;;AAE5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI+B,OAAO,GAAGH,QAAQ,CAAC,UAASL,MAAM,EAAE;AACtC,EAAA,IAAIjB,UAAU,GAAGwB,IAAI,CAACP,MAAM,CAAC,CAAA;EAC7BjB,UAAU,GAAG,OAAOA,UAAU,IAAI,UAAU,GAAGA,UAAU,GAAG0B,SAAS,CAAA;AACrE,EAAA,OAAOV,OAAO,CAACK,WAAW,CAACJ,MAAM,EAAEM,iBAAiB,CAAC,EAAEG,SAAS,EAAE1B,UAAU,CAAC,CAAA;AAC/E,CAAC,CAAC,CAAA;AAEF2B,IAAAA,SAAc,GAAGF;;;;"}

package/es/_chunks/dep-e9221e89.js

@@ -0,0 +1,210 @@
+/**
+ * tdesign v1.8.0-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+import './dep-24fbd2a1.js';
+import { i as isObject_1 } from './dep-2eeeb9d1.js';
+import { a as _root } from './dep-7472945e.js';
+import { t as toNumber_1 } from './dep-22e28796.js';
+
+var root = _root;
+
+/**
+ * Gets the timestamp of the number of milliseconds that have elapsed since
+ * the Unix epoch (1 January 1970 00:00:00 UTC).
+ *
+ * @static
+ * @memberOf _
+ * @since 2.4.0
+ * @category Date
+ * @returns {number} Returns the timestamp.
+ * @example
+ *
+ * _.defer(function(stamp) {
+ *   console.log(_.now() - stamp);
+ * }, _.now());
+ * // => Logs the number of milliseconds it took for the deferred invocation.
+ */
+var now$1 = function now() {
+  return root.Date.now();
+};
+var now_1 = now$1;
+
+var isObject = isObject_1,
+  now = now_1,
+  toNumber = toNumber_1;
+
+/** Error message constants. */
+var FUNC_ERROR_TEXT = 'Expected a function';
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max,
+  nativeMin = Math.min;
+
+/**
+ * Creates a debounced function that delays invoking `func` until after `wait`
+ * milliseconds have elapsed since the last time the debounced function was
+ * invoked. The debounced function comes with a `cancel` method to cancel
+ * delayed `func` invocations and a `flush` method to immediately invoke them.
+ * Provide `options` to indicate whether `func` should be invoked on the
+ * leading and/or trailing edge of the `wait` timeout. The `func` is invoked
+ * with the last arguments provided to the debounced function. Subsequent
+ * calls to the debounced function return the result of the last `func`
+ * invocation.
+ *
+ * **Note:** If `leading` and `trailing` options are `true`, `func` is
+ * invoked on the trailing edge of the timeout only if the debounced function
+ * is invoked more than once during the `wait` timeout.
+ *
+ * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
+ * until to the next tick, similar to `setTimeout` with a timeout of `0`.
+ *
+ * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
+ * for details over the differences between `_.debounce` and `_.throttle`.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Function
+ * @param {Function} func The function to debounce.
+ * @param {number} [wait=0] The number of milliseconds to delay.
+ * @param {Object} [options={}] The options object.
+ * @param {boolean} [options.leading=false]
+ *  Specify invoking on the leading edge of the timeout.
+ * @param {number} [options.maxWait]
+ *  The maximum time `func` is allowed to be delayed before it's invoked.
+ * @param {boolean} [options.trailing=true]
+ *  Specify invoking on the trailing edge of the timeout.
+ * @returns {Function} Returns the new debounced function.
+ * @example
+ *
+ * // Avoid costly calculations while the window size is in flux.
+ * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
+ *
+ * // Invoke `sendMail` when clicked, debouncing subsequent calls.
+ * jQuery(element).on('click', _.debounce(sendMail, 300, {
+ *   'leading': true,
+ *   'trailing': false
+ * }));
+ *
+ * // Ensure `batchLog` is invoked once after 1 second of debounced calls.
+ * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });
+ * var source = new EventSource('/stream');
+ * jQuery(source).on('message', debounced);
+ *
+ * // Cancel the trailing debounced invocation.
+ * jQuery(window).on('popstate', debounced.cancel);
+ */
+function debounce(func, wait, options) {
+  var lastArgs,
+    lastThis,
+    maxWait,
+    result,
+    timerId,
+    lastCallTime,
+    lastInvokeTime = 0,
+    leading = false,
+    maxing = false,
+    trailing = true;
+  if (typeof func != 'function') {
+    throw new TypeError(FUNC_ERROR_TEXT);
+  }
+  wait = toNumber(wait) || 0;
+  if (isObject(options)) {
+    leading = !!options.leading;
+    maxing = 'maxWait' in options;
+    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;
+    trailing = 'trailing' in options ? !!options.trailing : trailing;
+  }
+  function invokeFunc(time) {
+    var args = lastArgs,
+      thisArg = lastThis;
+    lastArgs = lastThis = undefined;
+    lastInvokeTime = time;
+    result = func.apply(thisArg, args);
+    return result;
+  }
+  function leadingEdge(time) {
+    // Reset any `maxWait` timer.
+    lastInvokeTime = time;
+    // Start the timer for the trailing edge.
+    timerId = setTimeout(timerExpired, wait);
+    // Invoke the leading edge.
+    return leading ? invokeFunc(time) : result;
+  }
+  function remainingWait(time) {
+    var timeSinceLastCall = time - lastCallTime,
+      timeSinceLastInvoke = time - lastInvokeTime,
+      timeWaiting = wait - timeSinceLastCall;
+    return maxing ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke) : timeWaiting;
+  }
+  function shouldInvoke(time) {
+    var timeSinceLastCall = time - lastCallTime,
+      timeSinceLastInvoke = time - lastInvokeTime;
+
+    // Either this is the first call, activity has stopped and we're at the
+    // trailing edge, the system time has gone backwards and we're treating
+    // it as the trailing edge, or we've hit the `maxWait` limit.
+    return lastCallTime === undefined || timeSinceLastCall >= wait || timeSinceLastCall < 0 || maxing && timeSinceLastInvoke >= maxWait;
+  }
+  function timerExpired() {
+    var time = now();
+    if (shouldInvoke(time)) {
+      return trailingEdge(time);
+    }
+    // Restart the timer.
+    timerId = setTimeout(timerExpired, remainingWait(time));
+  }
+  function trailingEdge(time) {
+    timerId = undefined;
+
+    // Only invoke if we have `lastArgs` which means `func` has been
+    // debounced at least once.
+    if (trailing && lastArgs) {
+      return invokeFunc(time);
+    }
+    lastArgs = lastThis = undefined;
+    return result;
+  }
+  function cancel() {
+    if (timerId !== undefined) {
+      clearTimeout(timerId);
+    }
+    lastInvokeTime = 0;
+    lastArgs = lastCallTime = lastThis = timerId = undefined;
+  }
+  function flush() {
+    return timerId === undefined ? result : trailingEdge(now());
+  }
+  function debounced() {
+    var time = now(),
+      isInvoking = shouldInvoke(time);
+    lastArgs = arguments;
+    lastThis = this;
+    lastCallTime = time;
+    if (isInvoking) {
+      if (timerId === undefined) {
+        return leadingEdge(lastCallTime);
+      }
+      if (maxing) {
+        // Handle invocations in a tight loop.
+        clearTimeout(timerId);
+        timerId = setTimeout(timerExpired, wait);
+        return invokeFunc(lastCallTime);
+      }
+    }
+    if (timerId === undefined) {
+      timerId = setTimeout(timerExpired, wait);
+    }
+    return result;
+  }
+  debounced.cancel = cancel;
+  debounced.flush = flush;
+  return debounced;
+}
+var debounce_1 = debounce;
+
+export { debounce_1 as d };
+//# sourceMappingURL=dep-e9221e89.js.map

package/es/_chunks/dep-e9221e89.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-e9221e89.js","sources":["../../node_modules/lodash/now.js","../../node_modules/lodash/debounce.js"],"sourcesContent":["var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n","var isObject = require('./isObject'),\n    now = require('./now'),\n    toNumber = require('./toNumber');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nmodule.exports = debounce;\n"],"names":["root","require$$0","now","Date","now_1","isObject","require$$1","toNumber","require$$2","FUNC_ERROR_TEXT","nativeMax","Math","max","nativeMin","min","debounce","func","wait","options","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","TypeError","invokeFunc","time","args","thisArg","undefined","apply","leadingEdge","setTimeout","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","clearTimeout","flush","debounced","isInvoking","arguments","debounce_1"],"mappings":";;;;;;;;;;;AAAA,IAAIA,IAAI,GAAGC,KAAkB,CAAA;;AAE7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIC,KAAG,GAAG,SAANA,GAAGA,GAAc;AACnB,EAAA,OAAOF,IAAI,CAACG,IAAI,CAACD,GAAG,EAAE,CAAA;AACxB,CAAC,CAAA;AAED,IAAAE,KAAc,GAAGF,KAAG;;ACtBpB,IAAIG,QAAQ,GAAGJ,UAAqB;AAChCC,EAAAA,GAAG,GAAGI,KAAgB;AACtBC,EAAAA,QAAQ,GAAGC,UAAqB,CAAA;;AAEpC;AACA,IAAIC,eAAe,GAAG,qBAAqB,CAAA;;AAE3C;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAAG;EACpBC,SAAS,GAAGF,IAAI,CAACG,GAAG,CAAA;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQA,CAACC,IAAI,EAAEC,IAAI,EAAEC,OAAO,EAAE;AACrC,EAAA,IAAIC,QAAQ;IACRC,QAAQ;IACRC,OAAO;IACPC,MAAM;IACNC,OAAO;IACPC,YAAY;AACZC,IAAAA,cAAc,GAAG,CAAC;AAClBC,IAAAA,OAAO,GAAG,KAAK;AACfC,IAAAA,MAAM,GAAG,KAAK;AACdC,IAAAA,QAAQ,GAAG,IAAI,CAAA;AAEnB,EAAA,IAAI,OAAOZ,IAAI,IAAI,UAAU,EAAE;AAC7B,IAAA,MAAM,IAAIa,SAAS,CAACpB,eAAe,CAAC,CAAA;AACrC,GAAA;AACDQ,EAAAA,IAAI,GAAGV,QAAQ,CAACU,IAAI,CAAC,IAAI,CAAC,CAAA;AAC1B,EAAA,IAAIZ,QAAQ,CAACa,OAAO,CAAC,EAAE;AACrBQ,IAAAA,OAAO,GAAG,CAAC,CAACR,OAAO,CAACQ,OAAO,CAAA;IAC3BC,MAAM,GAAG,SAAS,IAAIT,OAAO,CAAA;AAC7BG,IAAAA,OAAO,GAAGM,MAAM,GAAGjB,SAAS,CAACH,QAAQ,CAACW,OAAO,CAACG,OAAO,CAAC,IAAI,CAAC,EAAEJ,IAAI,CAAC,GAAGI,OAAO,CAAA;IAC5EO,QAAQ,GAAG,UAAU,IAAIV,OAAO,GAAG,CAAC,CAACA,OAAO,CAACU,QAAQ,GAAGA,QAAQ,CAAA;AACjE,GAAA;EAED,SAASE,UAAUA,CAACC,IAAI,EAAE;IACxB,IAAIC,IAAI,GAAGb,QAAQ;AACfc,MAAAA,OAAO,GAAGb,QAAQ,CAAA;IAEtBD,QAAQ,GAAGC,QAAQ,GAAGc,SAAS,CAAA;AAC/BT,IAAAA,cAAc,GAAGM,IAAI,CAAA;IACrBT,MAAM,GAAGN,IAAI,CAACmB,KAAK,CAACF,OAAO,EAAED,IAAI,CAAC,CAAA;AAClC,IAAA,OAAOV,MAAM,CAAA;AACd,GAAA;EAED,SAASc,WAAWA,CAACL,IAAI,EAAE;AAC7B;AACIN,IAAAA,cAAc,GAAGM,IAAI,CAAA;AACzB;AACIR,IAAAA,OAAO,GAAGc,UAAU,CAACC,YAAY,EAAErB,IAAI,CAAC,CAAA;AAC5C;AACI,IAAA,OAAOS,OAAO,GAAGI,UAAU,CAACC,IAAI,CAAC,GAAGT,MAAM,CAAA;AAC3C,GAAA;EAED,SAASiB,aAAaA,CAACR,IAAI,EAAE;AAC3B,IAAA,IAAIS,iBAAiB,GAAGT,IAAI,GAAGP,YAAY;MACvCiB,mBAAmB,GAAGV,IAAI,GAAGN,cAAc;MAC3CiB,WAAW,GAAGzB,IAAI,GAAGuB,iBAAiB,CAAA;IAE1C,OAAOb,MAAM,GACTd,SAAS,CAAC6B,WAAW,EAAErB,OAAO,GAAGoB,mBAAmB,CAAC,GACrDC,WAAW,CAAA;AAChB,GAAA;EAED,SAASC,YAAYA,CAACZ,IAAI,EAAE;AAC1B,IAAA,IAAIS,iBAAiB,GAAGT,IAAI,GAAGP,YAAY;MACvCiB,mBAAmB,GAAGV,IAAI,GAAGN,cAAc,CAAA;;AAEnD;AACA;AACA;AACI,IAAA,OAAQD,YAAY,KAAKU,SAAS,IAAKM,iBAAiB,IAAIvB,IAAK,IAC9DuB,iBAAiB,GAAG,CAAE,IAAKb,MAAM,IAAIc,mBAAmB,IAAIpB,OAAQ,CAAA;AACxE,GAAA;EAED,SAASiB,YAAYA,GAAG;AACtB,IAAA,IAAIP,IAAI,GAAG7B,GAAG,EAAE,CAAA;AAChB,IAAA,IAAIyC,YAAY,CAACZ,IAAI,CAAC,EAAE;MACtB,OAAOa,YAAY,CAACb,IAAI,CAAC,CAAA;AAC1B,KAAA;AACL;IACIR,OAAO,GAAGc,UAAU,CAACC,YAAY,EAAEC,aAAa,CAACR,IAAI,CAAC,CAAC,CAAA;AACxD,GAAA;EAED,SAASa,YAAYA,CAACb,IAAI,EAAE;AAC1BR,IAAAA,OAAO,GAAGW,SAAS,CAAA;;AAEvB;AACA;IACI,IAAIN,QAAQ,IAAIT,QAAQ,EAAE;MACxB,OAAOW,UAAU,CAACC,IAAI,CAAC,CAAA;AACxB,KAAA;IACDZ,QAAQ,GAAGC,QAAQ,GAAGc,SAAS,CAAA;AAC/B,IAAA,OAAOZ,MAAM,CAAA;AACd,GAAA;EAED,SAASuB,MAAMA,GAAG;IAChB,IAAItB,OAAO,KAAKW,SAAS,EAAE;MACzBY,YAAY,CAACvB,OAAO,CAAC,CAAA;AACtB,KAAA;AACDE,IAAAA,cAAc,GAAG,CAAC,CAAA;AAClBN,IAAAA,QAAQ,GAAGK,YAAY,GAAGJ,QAAQ,GAAGG,OAAO,GAAGW,SAAS,CAAA;AACzD,GAAA;EAED,SAASa,KAAKA,GAAG;IACf,OAAOxB,OAAO,KAAKW,SAAS,GAAGZ,MAAM,GAAGsB,YAAY,CAAC1C,GAAG,EAAE,CAAC,CAAA;AAC5D,GAAA;EAED,SAAS8C,SAASA,GAAG;AACnB,IAAA,IAAIjB,IAAI,GAAG7B,GAAG,EAAE;AACZ+C,MAAAA,UAAU,GAAGN,YAAY,CAACZ,IAAI,CAAC,CAAA;AAEnCZ,IAAAA,QAAQ,GAAG+B,SAAS,CAAA;AACpB9B,IAAAA,QAAQ,GAAG,IAAI,CAAA;AACfI,IAAAA,YAAY,GAAGO,IAAI,CAAA;AAEnB,IAAA,IAAIkB,UAAU,EAAE;MACd,IAAI1B,OAAO,KAAKW,SAAS,EAAE;QACzB,OAAOE,WAAW,CAACZ,YAAY,CAAC,CAAA;AACjC,OAAA;AACD,MAAA,IAAIG,MAAM,EAAE;AAClB;QACQmB,YAAY,CAACvB,OAAO,CAAC,CAAA;AACrBA,QAAAA,OAAO,GAAGc,UAAU,CAACC,YAAY,EAAErB,IAAI,CAAC,CAAA;QACxC,OAAOa,UAAU,CAACN,YAAY,CAAC,CAAA;AAChC,OAAA;AACF,KAAA;IACD,IAAID,OAAO,KAAKW,SAAS,EAAE;AACzBX,MAAAA,OAAO,GAAGc,UAAU,CAACC,YAAY,EAAErB,IAAI,CAAC,CAAA;AACzC,KAAA;AACD,IAAA,OAAOK,MAAM,CAAA;AACd,GAAA;EACD0B,SAAS,CAACH,MAAM,GAAGA,MAAM,CAAA;EACzBG,SAAS,CAACD,KAAK,GAAGA,KAAK,CAAA;AACvB,EAAA,OAAOC,SAAS,CAAA;AAClB,CAAA;AAEAG,IAAAA,UAAc,GAAGpC;;;;"}

package/es/_chunks/dep-ed847eed.js

@@ -0,0 +1,46 @@
+/**
+ * tdesign v1.8.0-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+import './dep-24fbd2a1.js';
+import { _ as _baseSet } from './dep-8954e358.js';
+
+var baseSet = _baseSet;
+
+/**
+ * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,
+ * it's created. Arrays are created for missing index properties while objects
+ * are created for all other missing properties. Use `_.setWith` to customize
+ * `path` creation.
+ *
+ * **Note:** This method mutates `object`.
+ *
+ * @static
+ * @memberOf _
+ * @since 3.7.0
+ * @category Object
+ * @param {Object} object The object to modify.
+ * @param {Array|string} path The path of the property to set.
+ * @param {*} value The value to set.
+ * @returns {Object} Returns `object`.
+ * @example
+ *
+ * var object = { 'a': [{ 'b': { 'c': 3 } }] };
+ *
+ * _.set(object, 'a[0].b.c', 4);
+ * console.log(object.a[0].b.c);
+ * // => 4
+ *
+ * _.set(object, ['x', '0', 'y', 'z'], 5);
+ * console.log(object.x[0].y.z);
+ * // => 5
+ */
+function set(object, path, value) {
+  return object == null ? object : baseSet(object, path, value);
+}
+var set_1 = set;
+
+export { set_1 as s };
+//# sourceMappingURL=dep-ed847eed.js.map

package/es/_chunks/dep-ed847eed.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-ed847eed.js","sources":["../../node_modules/lodash/set.js"],"sourcesContent":["var baseSet = require('./_baseSet');\n\n/**\n * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n * it's created. Arrays are created for missing index properties while objects\n * are created for all other missing properties. Use `_.setWith` to customize\n * `path` creation.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\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 * @returns {Object} Returns `object`.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.set(object, 'a[0].b.c', 4);\n * console.log(object.a[0].b.c);\n * // => 4\n *\n * _.set(object, ['x', '0', 'y', 'z'], 5);\n * console.log(object.x[0].y.z);\n * // => 5\n */\nfunction set(object, path, value) {\n  return object == null ? object : baseSet(object, path, value);\n}\n\nmodule.exports = set;\n"],"names":["baseSet","require$$0","set","object","path","value","set_1"],"mappings":";;;;;;;;;AAAA,IAAIA,OAAO,GAAGC,QAAqB,CAAA;;AAEnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,GAAGA,CAACC,MAAM,EAAEC,IAAI,EAAEC,KAAK,EAAE;AAChC,EAAA,OAAOF,MAAM,IAAI,IAAI,GAAGA,MAAM,GAAGH,OAAO,CAACG,MAAM,EAAEC,IAAI,EAAEC,KAAK,CAAC,CAAA;AAC/D,CAAA;AAEAC,IAAAA,KAAc,GAAGJ;;;;"}

package/es/_chunks/dep-ee1de840.js

@@ -0,0 +1,189 @@
+/**
+ * tdesign v1.8.0-alpha.2
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+import { _ as _defineProperty } from './dep-079d8ebf.js';
+import React, { useState, useCallback, useMemo, useEffect } from 'react';
+import forwardRefWithStatics from '../_util/forwardRefWithStatics.js';
+import Check, { CheckContext } from '../common/Check.js';
+import { _ as _slicedToArray } from './dep-35f22fed.js';
+import { _ as _typeof } from './dep-2ebca552.js';
+import classNames from 'classnames';
+import { i as isNumber_1 } from './dep-fd36ba52.js';
+import useConfig from '../hooks/useConfig.js';
+import useControlled from '../hooks/useControlled.js';
+import { checkboxGroupDefaultProps, checkboxDefaultProps } from '../checkbox/defaultProps.js';
+import useDefaultProps from '../hooks/useDefaultProps.js';
+
+function ownKeys$1(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread$1(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$1(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$1(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+var getCheckboxValue = function getCheckboxValue(v) {
+  switch (_typeof(v)) {
+    case "number":
+      return v;
+    case "string":
+      return v;
+    case "object":
+      {
+        var vs = v;
+        return vs.value;
+      }
+    default:
+      return void 0;
+  }
+};
+var CheckboxGroup = function CheckboxGroup(props) {
+  var _useConfig = useConfig(),
+    classPrefix = _useConfig.classPrefix;
+  var _useDefaultProps = useDefaultProps(props, checkboxGroupDefaultProps),
+    onChange = _useDefaultProps.onChange,
+    disabled = _useDefaultProps.disabled,
+    className = _useDefaultProps.className,
+    style = _useDefaultProps.style,
+    children = _useDefaultProps.children,
+    max = _useDefaultProps.max,
+    _useDefaultProps$opti = _useDefaultProps.options,
+    options = _useDefaultProps$opti === void 0 ? [] : _useDefaultProps$opti;
+  var intervalOptions = Array.isArray(options) && options.length > 0 ? options : React.Children.map(children, function (child) {
+    return child.props;
+  }) || [];
+  var optionsWithoutCheckAll = intervalOptions.filter(function (t) {
+    return _typeof(t) !== "object" || !t.checkAll;
+  });
+  var optionsWithoutCheckAllValues = [];
+  optionsWithoutCheckAll.forEach(function (v) {
+    var vs = getCheckboxValue(v);
+    optionsWithoutCheckAllValues.push(vs);
+  });
+  var _useControlled = useControlled(props, "value", onChange),
+    _useControlled2 = _slicedToArray(_useControlled, 2),
+    internalValue = _useControlled2[0],
+    setInternalValue = _useControlled2[1];
+  var _useState = useState(max),
+    _useState2 = _slicedToArray(_useState, 2),
+    localMax = _useState2[0],
+    setLocalMax = _useState2[1];
+  var getCheckedSet = useCallback(function () {
+    if (!Array.isArray(internalValue)) {
+      return /* @__PURE__ */new Set([]);
+    }
+    return new Set([].concat(internalValue));
+  }, [internalValue]);
+  var checkedSet = useMemo(function () {
+    return getCheckedSet();
+  }, [getCheckedSet]);
+  var indeterminate = useMemo(function () {
+    var list = Array.from(checkedSet);
+    return list.length !== 0 && list.length !== optionsWithoutCheckAll.length;
+  }, [checkedSet, optionsWithoutCheckAll]);
+  var checkAllChecked = useMemo(function () {
+    var list = Array.from(checkedSet);
+    return list.length === optionsWithoutCheckAll.length;
+  }, [checkedSet, optionsWithoutCheckAll]);
+  useEffect(function () {
+    if (!isNumber_1(max)) {
+      return;
+    }
+    if (max < checkedSet.size) {
+      console.warn("[TDesign] max should be less than the length of value, change is invalid");
+    } else {
+      setLocalMax(max);
+    }
+  }, [max, checkedSet]);
+  var context = {
+    inject: function inject(checkProps) {
+      if (typeof checkProps.checked !== "undefined") {
+        return checkProps;
+      }
+      var checkValue = checkProps.value;
+      return _objectSpread$1(_objectSpread$1({}, checkProps), {}, {
+        checked: checkProps.checkAll ? checkAllChecked : checkedSet.has(checkValue),
+        indeterminate: checkProps.checkAll ? indeterminate : checkProps.indeterminate,
+        disabled: checkProps.disabled || disabled || checkedSet.size >= localMax && !checkedSet.has(checkValue),
+        onChange: function onChange(checked, _ref) {
+          var e = _ref.e;
+          if (typeof checkProps.onChange === "function") {
+            checkProps.onChange(checked, {
+              e: e
+            });
+          }
+          var checkedSet2 = getCheckedSet();
+          if (checkProps.checkAll) {
+            checkedSet2.clear();
+            if (checked) {
+              optionsWithoutCheckAllValues.forEach(function (v) {
+                checkedSet2.add(v);
+              });
+            }
+          } else if (checked) {
+            if (checkedSet2.size >= localMax && isNumber_1(max)) return;
+            checkedSet2.add(checkValue);
+          } else {
+            checkedSet2["delete"](checkValue);
+          }
+          setInternalValue(Array.from(checkedSet2), {
+            e: e,
+            current: checkProps.checkAll ? void 0 : checkValue,
+            type: checked ? "check" : "uncheck"
+          });
+        }
+      });
+    }
+  };
+  var useOptions = Array.isArray(options) && options.length !== 0;
+  return /* @__PURE__ */React.createElement("div", {
+    className: classNames("".concat(classPrefix, "-checkbox-group"), className),
+    style: style
+  }, /* @__PURE__ */React.createElement(CheckContext.Provider, {
+    value: context
+  }, useOptions ? options.map(function (v, index) {
+    switch (_typeof(v)) {
+      case "string":
+        return /* @__PURE__ */React.createElement(Checkbox$1, {
+          key: index,
+          label: v,
+          value: v
+        }, v);
+      case "number":
+        {
+          return /* @__PURE__ */React.createElement(Checkbox$1, {
+            key: index,
+            label: v,
+            value: v
+          }, String(v));
+        }
+      case "object":
+        {
+          var vs = v;
+          return vs.checkAll ? /* @__PURE__ */React.createElement(Checkbox$1, _objectSpread$1(_objectSpread$1({}, vs), {}, {
+            key: "checkAll_".concat(index),
+            indeterminate: indeterminate
+          })) : /* @__PURE__ */React.createElement(Checkbox$1, _objectSpread$1(_objectSpread$1({}, vs), {}, {
+            key: index,
+            disabled: vs.disabled || disabled
+          }));
+        }
+      default:
+        return null;
+    }
+  }) : children));
+};
+CheckboxGroup.displayName = "CheckboxGroup";
+
+function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
+function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
+var Checkbox = forwardRefWithStatics(function (props, ref) {
+  return /* @__PURE__ */React.createElement(Check, _objectSpread({
+    ref: ref,
+    type: "checkbox"
+  }, useDefaultProps(props, checkboxDefaultProps)));
+}, {
+  Group: CheckboxGroup
+});
+Checkbox.displayName = "Checkbox";
+var Checkbox$1 = Checkbox;
+
+export { Checkbox$1 as C, CheckboxGroup as a };
+//# sourceMappingURL=dep-ee1de840.js.map