tdesign-react 1.8.0-alpha.3 → 1.8.0

package/CHANGELOG.md

@@ -5,6 +5,22 @@ toc: false
 spline: explain
 ---
 
+## 🌈 1.8.0 `2024-08-22` 
+### 🚀 Features
+- `Empty`: 新增 `Empty` 空状态组件 @ZWkang @HaixingOoO @double-deng ([#2817](https://github.com/Tencent/tdesign-react/pull/2817))
+- `ConfigProvider`: 支持 `colonText` 属性配置 `Description`、`Form` 组件的 `colon` 属性 @liweijie0812 ([#3055](https://github.com/Tencent/tdesign-react/pull/3055))
+
+### 🐞 Bug Fixes
+- `ColorPicker`: 修复 `slider` 部分在鼠标移入移出的缺陷 @Jippp ([#3042](https://github.com/Tencent/tdesign-react/pull/3042))
+- `useVirtualScroll`: 修改 `visibleData` 计算方式，解决可视区域过高时，滚动后底部留白的问题 @huangchen1031 ([#2999](https://github.com/Tencent/tdesign-react/pull/2999))
+- `Table`: 修复拖拽排序时，祖先节点内的顺序错误的问题 @uyarn ([#3046](https://github.com/Tencent/tdesign-react/pull/3046))
+- `InputNumber`: 修复小数点精度计算，以 0 开头的计算边界逻辑缺失导致计算错误的问题 @uyarn ([#3046](https://github.com/Tencent/tdesign-react/pull/3046))
+- `Popup`: 修复 `popup` 某些场景下，隐藏时定位会闪烁的问题 @HaixingOoO ([#3052](https://github.com/Tencent/tdesign-react/pull/3052))
+
+### 🚧 Others
+- `Popup`: 修复官网`Popup`的位置展示问题 @HaixingOoO ([#3048](https://github.com/Tencent/tdesign-react/pull/3048))
+- `DatePicker`: 修复 presets 示例代码错误的问题 @uyarn ([#3050](https://github.com/Tencent/tdesign-react/pull/3050))
+
 ## 🌈 1.7.9 `2024-08-07` 
 ### 🐞 Bug Fixes
 - `Tree`:  修复`1.7.8`版本更新导致的展开收起功能的缺陷 @HaixingOoO ([#3039](https://github.com/Tencent/tdesign-react/pull/3039))

package/cjs/_chunks/dep-00e81b9a.js

@@ -0,0 +1,29 @@
+/**
+ * tdesign v1.8.0
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+/**
+ * Appends the elements of `values` to `array`.
+ *
+ * @private
+ * @param {Array} array The array to modify.
+ * @param {Array} values The values to append.
+ * @returns {Array} Returns `array`.
+ */
+function arrayPush(array, values) {
+  var index = -1,
+    length = values.length,
+    offset = array.length;
+  while (++index < length) {
+    array[offset + index] = values[index];
+  }
+  return array;
+}
+var _arrayPush = arrayPush;
+
+exports._arrayPush = _arrayPush;
+//# sourceMappingURL=dep-00e81b9a.js.map

package/cjs/_chunks/dep-00e81b9a.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-00e81b9a.js","sources":["../../node_modules/lodash/_arrayPush.js"],"sourcesContent":["/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n"],"names":["arrayPush","array","values","index","length","offset","_arrayPush"],"mappings":";;;;;;;;;;;;;;;;AAQA,SAASA,SAASA,CAACC,KAAK,EAAEC,MAAM,EAAE;EAChC,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGF,MAAM,CAACE,MAAM;IACtBC,MAAM,GAAGJ,KAAK,CAACG,MAAM,CAAA;AAEzB,EAAA,OAAO,EAAED,KAAK,GAAGC,MAAM,EAAE;IACvBH,KAAK,CAACI,MAAM,GAAGF,KAAK,CAAC,GAAGD,MAAM,CAACC,KAAK,CAAC,CAAA;AACtC,GAAA;AACD,EAAA,OAAOF,KAAK,CAAA;AACd,CAAA;AAEAK,IAAAA,UAAc,GAAGN;;;;"}

package/cjs/_chunks/dep-05d639dd.js

@@ -0,0 +1,54 @@
+/**
+ * tdesign v1.8.0
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var unsupportedIterableToArray = require('./dep-6674ee37.js');
+
+function _arrayWithHoles(r) {
+  if (Array.isArray(r)) return r;
+}
+
+function _iterableToArrayLimit(r, l) {
+  var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
+  if (null != t) {
+    var e,
+      n,
+      i,
+      u,
+      a = [],
+      f = !0,
+      o = !1;
+    try {
+      if (i = (t = t.call(r)).next, 0 === l) {
+        if (Object(t) !== t) return;
+        f = !1;
+      } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);
+    } catch (r) {
+      o = !0, n = r;
+    } finally {
+      try {
+        if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return;
+      } finally {
+        if (o) throw n;
+      }
+    }
+    return a;
+  }
+}
+
+function _nonIterableRest() {
+  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+
+function _slicedToArray(r, e) {
+  return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || unsupportedIterableToArray._unsupportedIterableToArray(r, e) || _nonIterableRest();
+}
+
+exports._arrayWithHoles = _arrayWithHoles;
+exports._nonIterableRest = _nonIterableRest;
+exports._slicedToArray = _slicedToArray;
+//# sourceMappingURL=dep-05d639dd.js.map

package/cjs/_chunks/dep-05d639dd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-05d639dd.js","sources":["../../node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js","../../node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js","../../node_modules/@babel/runtime/helpers/esm/nonIterableRest.js","../../node_modules/@babel/runtime/helpers/esm/slicedToArray.js"],"sourcesContent":["function _arrayWithHoles(r) {\n  if (Array.isArray(r)) return r;\n}\nexport { _arrayWithHoles as default };","function _iterableToArrayLimit(r, l) {\n  var t = null == r ? null : \"undefined\" != typeof Symbol && r[Symbol.iterator] || r[\"@@iterator\"];\n  if (null != t) {\n    var e,\n      n,\n      i,\n      u,\n      a = [],\n      f = !0,\n      o = !1;\n    try {\n      if (i = (t = t.call(r)).next, 0 === l) {\n        if (Object(t) !== t) return;\n        f = !1;\n      } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0);\n    } catch (r) {\n      o = !0, n = r;\n    } finally {\n      try {\n        if (!f && null != t[\"return\"] && (u = t[\"return\"](), Object(u) !== u)) return;\n      } finally {\n        if (o) throw n;\n      }\n    }\n    return a;\n  }\n}\nexport { _iterableToArrayLimit as default };","function _nonIterableRest() {\n  throw new TypeError(\"Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\");\n}\nexport { _nonIterableRest as default };","import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArrayLimit from \"./iterableToArrayLimit.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nfunction _slicedToArray(r, e) {\n  return arrayWithHoles(r) || iterableToArrayLimit(r, e) || unsupportedIterableToArray(r, e) || nonIterableRest();\n}\nexport { _slicedToArray as default };"],"names":["_arrayWithHoles","r","Array","isArray","_iterableToArrayLimit","l","t","Symbol","iterator","e","n","i","u","a","f","o","call","next","Object","done","push","value","length","_nonIterableRest","TypeError","_slicedToArray","arrayWithHoles","iterableToArrayLimit","unsupportedIterableToArray","nonIterableRest"],"mappings":";;;;;;;;;;AAAA,SAASA,eAAeA,CAACC,CAAC,EAAE;EAC1B,IAAIC,KAAK,CAACC,OAAO,CAACF,CAAC,CAAC,EAAE,OAAOA,CAAC,CAAA;AAChC;;ACFA,SAASG,qBAAqBA,CAACH,CAAC,EAAEI,CAAC,EAAE;EACnC,IAAIC,CAAC,GAAG,IAAI,IAAIL,CAAC,GAAG,IAAI,GAAG,WAAW,IAAI,OAAOM,MAAM,IAAIN,CAAC,CAACM,MAAM,CAACC,QAAQ,CAAC,IAAIP,CAAC,CAAC,YAAY,CAAC,CAAA;EAChG,IAAI,IAAI,IAAIK,CAAC,EAAE;AACb,IAAA,IAAIG,CAAC;MACHC,CAAC;MACDC,CAAC;MACDC,CAAC;AACDC,MAAAA,CAAC,GAAG,EAAE;MACNC,CAAC,GAAG,CAAC,CAAC;MACNC,CAAC,GAAG,CAAC,CAAC,CAAA;IACR,IAAI;AACF,MAAA,IAAIJ,CAAC,GAAG,CAACL,CAAC,GAAGA,CAAC,CAACU,IAAI,CAACf,CAAC,CAAC,EAAEgB,IAAI,EAAE,CAAC,KAAKZ,CAAC,EAAE;AACrC,QAAA,IAAIa,MAAM,CAACZ,CAAC,CAAC,KAAKA,CAAC,EAAE,OAAA;QACrBQ,CAAC,GAAG,CAAC,CAAC,CAAA;AACR,OAAC,MAAM,OAAO,EAAEA,CAAC,GAAG,CAACL,CAAC,GAAGE,CAAC,CAACK,IAAI,CAACV,CAAC,CAAC,EAAEa,IAAI,CAAC,KAAKN,CAAC,CAACO,IAAI,CAACX,CAAC,CAACY,KAAK,CAAC,EAAER,CAAC,CAACS,MAAM,KAAKjB,CAAC,CAAC,EAAES,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;KACxF,CAAC,OAAOb,CAAC,EAAE;AACVc,MAAAA,CAAC,GAAG,CAAC,CAAC,EAAEL,CAAC,GAAGT,CAAC,CAAA;AACf,KAAC,SAAS;MACR,IAAI;QACF,IAAI,CAACa,CAAC,IAAI,IAAI,IAAIR,CAAC,CAAC,QAAQ,CAAC,KAAKM,CAAC,GAAGN,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAEY,MAAM,CAACN,CAAC,CAAC,KAAKA,CAAC,CAAC,EAAE,OAAA;AACzE,OAAC,SAAS;QACR,IAAIG,CAAC,EAAE,MAAML,CAAC,CAAA;AAChB,OAAA;AACF,KAAA;AACA,IAAA,OAAOG,CAAC,CAAA;AACV,GAAA;AACF;;AC1BA,SAASU,gBAAgBA,GAAG;AAC1B,EAAA,MAAM,IAAIC,SAAS,CAAC,2IAA2I,CAAC,CAAA;AAClK;;ACEA,SAASC,cAAcA,CAACxB,CAAC,EAAEQ,CAAC,EAAE;EAC5B,OAAOiB,eAAc,CAACzB,CAAC,CAAC,IAAI0B,qBAAoB,CAAC1B,CAAC,EAAEQ,CAAC,CAAC,IAAImB,sDAA0B,CAAC3B,CAAC,EAAEQ,CAAC,CAAC,IAAIoB,gBAAe,EAAE,CAAA;AACjH;;;;;;"}

package/cjs/_chunks/dep-076509eb.js

@@ -0,0 +1,211 @@
+/**
+ * tdesign v1.8.0
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var isObject$1 = require('./dep-eeeec9f3.js');
+var _baseGetTag = require('./dep-a5d6f49d.js');
+var toNumber$1 = require('./dep-2cb1cf5e.js');
+
+var root = _baseGetTag._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.isObject_1,
+  now = now_1,
+  toNumber = toNumber$1.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;
+
+exports.debounce_1 = debounce_1;
+//# sourceMappingURL=dep-076509eb.js.map

package/cjs/_chunks/dep-076509eb.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-076509eb.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,iBAAkB,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,qBAAqB;AAChCC,EAAAA,GAAG,GAAGI,KAAgB;AACtBC,EAAAA,QAAQ,GAAGC,qBAAqB,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/cjs/_chunks/dep-07eee1f0.js

@@ -0,0 +1,173 @@
+/**
+ * tdesign v1.8.0
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _arrayFilter = require('./dep-32184cc0.js');
+var _baseRest = require('./dep-4c31b1b2.js');
+var _baseDifference = require('./dep-19d2bc11.js');
+var _baseFlatten = require('./dep-664a2c2f.js');
+var _cacheHas = require('./dep-e759bc0f.js');
+var _Set = require('./dep-7674bc7b.js');
+var noop$1 = require('./dep-450b6f37.js');
+var _setToArray = require('./dep-1ce1569c.js');
+var last$1 = require('./dep-5354c27d.js');
+
+var Set = _Set._Set,
+  noop = noop$1.noop_1,
+  setToArray$1 = _setToArray._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 = _cacheHas._SetCache,
+  arrayIncludes = _cacheHas._arrayIncludes,
+  arrayIncludesWith = _cacheHas._arrayIncludesWith,
+  cacheHas = _cacheHas._cacheHas,
+  createSet = _createSet,
+  setToArray = _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._baseDifference,
+  baseFlatten = _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._arrayFilter,
+  baseRest = _baseRest._baseRest,
+  baseXor = _baseXor,
+  isArrayLikeObject = _baseRest.isArrayLikeObject_1,
+  last = last$1.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;
+
+exports.xorWith_1 = xorWith_1;
+//# sourceMappingURL=dep-07eee1f0.js.map

package/cjs/_chunks/dep-07eee1f0.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-07eee1f0.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,SAAiB;AACvBC,EAAAA,IAAI,GAAGC,aAAiB;AACxBC,EAAAA,YAAU,GAAGC,uBAAwB,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,mBAAsB;AACjCU,EAAAA,aAAa,GAAGR,wBAA2B;AAC3CS,EAAAA,iBAAiB,GAAGP,4BAA+B;AACnDQ,EAAAA,QAAQ,GAAGC,mBAAsB;AACjCP,EAAAA,SAAS,GAAGQ,UAAuB;AACnCX,EAAAA,UAAU,GAAGY,uBAAwB,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,+BAA4B;AAC7CmC,EAAAA,WAAW,GAAGjC,yBAAyB;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,yBAAyB;AACvC0C,EAAAA,QAAQ,GAAGxC,mBAAsB;AACjCkC,EAAAA,OAAO,GAAGhC,QAAqB;AAC/BuC,EAAAA,iBAAiB,GAAG9B,6BAA8B;AAClD+B,EAAAA,IAAI,GAAG9B,aAAiB,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/cjs/_chunks/dep-1081aaec.js

@@ -0,0 +1,68 @@
+/**
+ * tdesign v1.8.0
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _typeof = require('./dep-9486d2cf.js');
+var _commonjsHelpers = require('./dep-a481097f.js');
+var dayjs = require('dayjs');
+
+function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }
+
+var dayjs__default = /*#__PURE__*/_interopDefaultLegacy(dayjs);
+
+var it = {exports: {}};
+
+(function (module, exports) {
+  !function (e, o) {
+    module.exports = o(dayjs__default["default"]) ;
+  }(_commonjsHelpers.commonjsGlobal, function (e) {
+
+    function o(e) {
+      return e && "object" == _typeof._typeof(e) && "default" in e ? e : {
+        "default": e
+      };
+    }
+    var t = o(e),
+      n = {
+        name: "it",
+        weekdays: "domenica_lunedì_martedì_mercoledì_giovedì_venerdì_sabato".split("_"),
+        weekdaysShort: "dom_lun_mar_mer_gio_ven_sab".split("_"),
+        weekdaysMin: "do_lu_ma_me_gi_ve_sa".split("_"),
+        months: "gennaio_febbraio_marzo_aprile_maggio_giugno_luglio_agosto_settembre_ottobre_novembre_dicembre".split("_"),
+        weekStart: 1,
+        monthsShort: "gen_feb_mar_apr_mag_giu_lug_ago_set_ott_nov_dic".split("_"),
+        formats: {
+          LT: "HH:mm",
+          LTS: "HH:mm:ss",
+          L: "DD/MM/YYYY",
+          LL: "D MMMM YYYY",
+          LLL: "D MMMM YYYY HH:mm",
+          LLLL: "dddd D MMMM YYYY HH:mm"
+        },
+        relativeTime: {
+          future: "tra %s",
+          past: "%s fa",
+          s: "qualche secondo",
+          m: "un minuto",
+          mm: "%d minuti",
+          h: "un' ora",
+          hh: "%d ore",
+          d: "un giorno",
+          dd: "%d giorni",
+          M: "un mese",
+          MM: "%d mesi",
+          y: "un anno",
+          yy: "%d anni"
+        },
+        ordinal: function ordinal(e) {
+          return e + "º";
+        }
+      };
+    return t["default"].locale(n, null, !0), n;
+  });
+})(it);
+//# sourceMappingURL=dep-1081aaec.js.map

package/cjs/_chunks/dep-1081aaec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-1081aaec.js","sources":["../../node_modules/dayjs/locale/it.js"],"sourcesContent":["!function(e,o){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=o(require(\"dayjs\")):\"function\"==typeof define&&define.amd?define([\"dayjs\"],o):(e=\"undefined\"!=typeof globalThis?globalThis:e||self).dayjs_locale_it=o(e.dayjs)}(this,(function(e){\"use strict\";function o(e){return e&&\"object\"==typeof e&&\"default\"in e?e:{default:e}}var t=o(e),n={name:\"it\",weekdays:\"domenica_lunedì_martedì_mercoledì_giovedì_venerdì_sabato\".split(\"_\"),weekdaysShort:\"dom_lun_mar_mer_gio_ven_sab\".split(\"_\"),weekdaysMin:\"do_lu_ma_me_gi_ve_sa\".split(\"_\"),months:\"gennaio_febbraio_marzo_aprile_maggio_giugno_luglio_agosto_settembre_ottobre_novembre_dicembre\".split(\"_\"),weekStart:1,monthsShort:\"gen_feb_mar_apr_mag_giu_lug_ago_set_ott_nov_dic\".split(\"_\"),formats:{LT:\"HH:mm\",LTS:\"HH:mm:ss\",L:\"DD/MM/YYYY\",LL:\"D MMMM YYYY\",LLL:\"D MMMM YYYY HH:mm\",LLLL:\"dddd D MMMM YYYY HH:mm\"},relativeTime:{future:\"tra %s\",past:\"%s fa\",s:\"qualche secondo\",m:\"un minuto\",mm:\"%d minuti\",h:\"un' ora\",hh:\"%d ore\",d:\"un giorno\",dd:\"%d giorni\",M:\"un mese\",MM:\"%d mesi\",y:\"un anno\",yy:\"%d anni\"},ordinal:function(e){return e+\"º\"}};return t.default.locale(n,null,!0),n}));"],"names":["e","o","module","exports","require$$0","this","_typeof","t","n","name","weekdays","split","weekdaysShort","weekdaysMin","months","weekStart","monthsShort","formats","LT","LTS","L","LL","LLL","LLLL","relativeTime","future","past","s","m","mm","h","hh","d","dd","M","MM","y","yy","ordinal","locale"],"mappings":";;;;;;;;;;;;;;;;;;;AAAA,EAAA,CAAC,UAASA,CAAC,EAACC,CAAC,EAAC;IAAsDC,MAAA,CAAAC,OAAA,GAAeF,CAAC,CAACG,yBAAgB,CAAC,CAA2I,CAAA;AAAA,GAAC,CAACC,+BAAI,EAAE,UAASL,CAAC,EAAC;;IAAc,SAASC,CAACA,CAACD,CAAC,EAAC;AAAC,MAAA,OAAOA,CAAC,IAAE,QAAQ,IAAAM,eAAA,CAASN,CAAC,CAAA,IAAE,SAAS,IAAGA,CAAC,GAACA,CAAC,GAAC;QAAC,SAAQA,EAAAA,CAAAA;OAAE,CAAA;AAAA,KAAA;AAAC,IAAA,IAAIO,CAAC,GAACN,CAAC,CAACD,CAAC,CAAC;AAACQ,MAAAA,CAAC,GAAC;AAACC,QAAAA,IAAI,EAAC,IAAI;AAACC,QAAAA,QAAQ,EAAC,0DAA0D,CAACC,KAAK,CAAC,GAAG,CAAC;AAACC,QAAAA,aAAa,EAAC,6BAA6B,CAACD,KAAK,CAAC,GAAG,CAAC;AAACE,QAAAA,WAAW,EAAC,sBAAsB,CAACF,KAAK,CAAC,GAAG,CAAC;AAACG,QAAAA,MAAM,EAAC,+FAA+F,CAACH,KAAK,CAAC,GAAG,CAAC;AAACI,QAAAA,SAAS,EAAC,CAAC;AAACC,QAAAA,WAAW,EAAC,iDAAiD,CAACL,KAAK,CAAC,GAAG,CAAC;AAACM,QAAAA,OAAO,EAAC;AAACC,UAAAA,EAAE,EAAC,OAAO;AAACC,UAAAA,GAAG,EAAC,UAAU;AAACC,UAAAA,CAAC,EAAC,YAAY;AAACC,UAAAA,EAAE,EAAC,aAAa;AAACC,UAAAA,GAAG,EAAC,mBAAmB;AAACC,UAAAA,IAAI,EAAC,wBAAA;SAAyB;AAACC,QAAAA,YAAY,EAAC;AAACC,UAAAA,MAAM,EAAC,QAAQ;AAACC,UAAAA,IAAI,EAAC,OAAO;AAACC,UAAAA,CAAC,EAAC,iBAAiB;AAACC,UAAAA,CAAC,EAAC,WAAW;AAACC,UAAAA,EAAE,EAAC,WAAW;AAACC,UAAAA,CAAC,EAAC,SAAS;AAACC,UAAAA,EAAE,EAAC,QAAQ;AAACC,UAAAA,CAAC,EAAC,WAAW;AAACC,UAAAA,EAAE,EAAC,WAAW;AAACC,UAAAA,CAAC,EAAC,SAAS;AAACC,UAAAA,EAAE,EAAC,SAAS;AAACC,UAAAA,CAAC,EAAC,SAAS;AAACC,UAAAA,EAAE,EAAC,SAAA;SAAU;AAACC,QAAAA,OAAO,EAAC,SAARA,OAAOA,CAAUtC,CAAC,EAAC;UAAC,OAAOA,CAAC,GAAC,GAAG,CAAA;AAAA,SAAA;OAAE,CAAA;AAAC,IAAA,OAAOO,CAAC,CAAA,SAAA,CAAQ,CAACgC,MAAM,CAAC/B,CAAC,EAAC,IAAI,EAAC,CAAC,CAAC,CAAC,EAACA,CAAC,CAAA;AAAA,GAAG,CAAA,CAAA;;;"}

package/cjs/_chunks/dep-18180303.js

@@ -0,0 +1,18 @@
+/**
+ * tdesign v1.8.0
+ * (c) 2024 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var slicedToArray = require('./dep-05d639dd.js');
+var toConsumableArray = require('./dep-c76cf4e7.js');
+var unsupportedIterableToArray = require('./dep-6674ee37.js');
+
+function _toArray(r) {
+  return slicedToArray._arrayWithHoles(r) || toConsumableArray._iterableToArray(r) || unsupportedIterableToArray._unsupportedIterableToArray(r) || slicedToArray._nonIterableRest();
+}
+
+exports._toArray = _toArray;
+//# sourceMappingURL=dep-18180303.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-18180303.js","sources":["../../node_modules/@babel/runtime/helpers/esm/toArray.js"],"sourcesContent":["import arrayWithHoles from \"./arrayWithHoles.js\";\nimport iterableToArray from \"./iterableToArray.js\";\nimport unsupportedIterableToArray from \"./unsupportedIterableToArray.js\";\nimport nonIterableRest from \"./nonIterableRest.js\";\nfunction _toArray(r) {\n  return arrayWithHoles(r) || iterableToArray(r) || unsupportedIterableToArray(r) || nonIterableRest();\n}\nexport { _toArray as default };"],"names":["_toArray","r","arrayWithHoles","iterableToArray","unsupportedIterableToArray","nonIterableRest"],"mappings":";;;;;;;;;;;;AAIA,SAASA,QAAQA,CAACC,CAAC,EAAE;AACnB,EAAA,OAAOC,6BAAc,CAACD,CAAC,CAAC,IAAIE,kCAAe,CAACF,CAAC,CAAC,IAAIG,sDAA0B,CAACH,CAAC,CAAC,IAAII,8BAAe,EAAE,CAAA;AACtG;;;;"}