tdesign-react 0.34.5-alpha.3 → 0.35.0-alpha.2

package/esm/_chunks/dep-9de55196.js

@@ -1,232 +0,0 @@
-/**
- * tdesign v0.34.5-alpha.3
- * (c) 2022 tdesign
- * @license MIT
- */
-
-import './dep-6deacc10.js';
-import { i as isObject_1 } from './dep-b3d3e9c6.js';
-import './dep-7b32d44f.js';
-import { b as _root } from './dep-e0a016d6.js';
-import { t as toNumber_1 } from './dep-47f86cc0.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-9de55196.js.map

package/esm/_chunks/dep-9de55196.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-9de55196.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,KAAX,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAIC,KAAG,GAAG,SAANA,GAAM,GAAW;AACnB,EAAA,OAAOF,IAAI,CAACG,IAAL,CAAUD,GAAV,EAAP,CAAA;AACD,CAFD,CAAA;;AAIA,IAAAE,KAAc,GAAGF,KAAjB;;ACtBA,IAAIG,QAAQ,GAAGJ,UAAf;AAAA,IACIC,GAAG,GAAGI,KADV;AAAA,IAEIC,QAAQ,GAAGC,UAFf,CAAA;AAIA;;AACA,IAAIC,eAAe,GAAG,qBAAtB,CAAA;AAEA;;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAArB;AAAA,IACIC,SAAS,GAAGF,IAAI,CAACG,GADrB,CAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;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,QAAT,CAAkBC,IAAlB,EAAwBC,IAAxB,EAA8BC,OAA9B,EAAuC;AACrC,EAAA,IAAIC,QAAJ;AAAA,MACIC,QADJ;AAAA,MAEIC,OAFJ;AAAA,MAGIC,MAHJ;AAAA,MAIIC,OAJJ;AAAA,MAKIC,YALJ;MAMIC,cAAc,GAAG,CANrB;MAOIC,OAAO,GAAG,KAPd;MAQIC,MAAM,GAAG,KARb;MASIC,QAAQ,GAAG,IATf,CAAA;;AAWA,EAAA,IAAI,OAAOZ,IAAP,IAAe,UAAnB,EAA+B;AAC7B,IAAA,MAAM,IAAIa,SAAJ,CAAcpB,eAAd,CAAN,CAAA;AACD,GAAA;;AACDQ,EAAAA,IAAI,GAAGV,QAAQ,CAACU,IAAD,CAAR,IAAkB,CAAzB,CAAA;;AACA,EAAA,IAAIZ,QAAQ,CAACa,OAAD,CAAZ,EAAuB;AACrBQ,IAAAA,OAAO,GAAG,CAAC,CAACR,OAAO,CAACQ,OAApB,CAAA;IACAC,MAAM,GAAG,aAAaT,OAAtB,CAAA;AACAG,IAAAA,OAAO,GAAGM,MAAM,GAAGjB,SAAS,CAACH,QAAQ,CAACW,OAAO,CAACG,OAAT,CAAR,IAA6B,CAA9B,EAAiCJ,IAAjC,CAAZ,GAAqDI,OAArE,CAAA;IACAO,QAAQ,GAAG,UAAcV,IAAAA,OAAd,GAAwB,CAAC,CAACA,OAAO,CAACU,QAAlC,GAA6CA,QAAxD,CAAA;AACD,GAAA;;EAED,SAASE,UAAT,CAAoBC,IAApB,EAA0B;IACxB,IAAIC,IAAI,GAAGb,QAAX;QACIc,OAAO,GAAGb,QADd,CAAA;IAGAD,QAAQ,GAAGC,QAAQ,GAAGc,SAAtB,CAAA;AACAT,IAAAA,cAAc,GAAGM,IAAjB,CAAA;IACAT,MAAM,GAAGN,IAAI,CAACmB,KAAL,CAAWF,OAAX,EAAoBD,IAApB,CAAT,CAAA;AACA,IAAA,OAAOV,MAAP,CAAA;AACD,GAAA;;EAED,SAASc,WAAT,CAAqBL,IAArB,EAA2B;AAC7B;IACIN,cAAc,GAAGM,IAAjB,CAFyB;;IAIzBR,OAAO,GAAGc,UAAU,CAACC,YAAD,EAAerB,IAAf,CAApB,CAJyB;;AAMzB,IAAA,OAAOS,OAAO,GAAGI,UAAU,CAACC,IAAD,CAAb,GAAsBT,MAApC,CAAA;AACD,GAAA;;EAED,SAASiB,aAAT,CAAuBR,IAAvB,EAA6B;AAC3B,IAAA,IAAIS,iBAAiB,GAAGT,IAAI,GAAGP,YAA/B;AAAA,QACIiB,mBAAmB,GAAGV,IAAI,GAAGN,cADjC;AAAA,QAEIiB,WAAW,GAAGzB,IAAI,GAAGuB,iBAFzB,CAAA;IAIA,OAAOb,MAAM,GACTd,SAAS,CAAC6B,WAAD,EAAcrB,OAAO,GAAGoB,mBAAxB,CADA,GAETC,WAFJ,CAAA;AAGD,GAAA;;EAED,SAASC,YAAT,CAAsBZ,IAAtB,EAA4B;AAC1B,IAAA,IAAIS,iBAAiB,GAAGT,IAAI,GAAGP,YAA/B;AAAA,QACIiB,mBAAmB,GAAGV,IAAI,GAAGN,cADjC,CAD0B;AAK9B;AACA;;AACI,IAAA,OAAQD,YAAY,KAAKU,SAAjB,IAA+BM,iBAAiB,IAAIvB,IAApD,IACLuB,iBAAiB,GAAG,CADf,IACsBb,MAAM,IAAIc,mBAAmB,IAAIpB,OAD/D,CAAA;AAED,GAAA;;AAED,EAAA,SAASiB,YAAT,GAAwB;IACtB,IAAIP,IAAI,GAAG7B,GAAG,EAAd,CAAA;;AACA,IAAA,IAAIyC,YAAY,CAACZ,IAAD,CAAhB,EAAwB;MACtB,OAAOa,YAAY,CAACb,IAAD,CAAnB,CAAA;AACD,KAJqB;;;IAMtBR,OAAO,GAAGc,UAAU,CAACC,YAAD,EAAeC,aAAa,CAACR,IAAD,CAA5B,CAApB,CAAA;AACD,GAAA;;EAED,SAASa,YAAT,CAAsBb,IAAtB,EAA4B;IAC1BR,OAAO,GAAGW,SAAV,CAD0B;AAI9B;;IACI,IAAIN,QAAQ,IAAIT,QAAhB,EAA0B;MACxB,OAAOW,UAAU,CAACC,IAAD,CAAjB,CAAA;AACD,KAAA;;IACDZ,QAAQ,GAAGC,QAAQ,GAAGc,SAAtB,CAAA;AACA,IAAA,OAAOZ,MAAP,CAAA;AACD,GAAA;;AAED,EAAA,SAASuB,MAAT,GAAkB;IAChB,IAAItB,OAAO,KAAKW,SAAhB,EAA2B;MACzBY,YAAY,CAACvB,OAAD,CAAZ,CAAA;AACD,KAAA;;AACDE,IAAAA,cAAc,GAAG,CAAjB,CAAA;AACAN,IAAAA,QAAQ,GAAGK,YAAY,GAAGJ,QAAQ,GAAGG,OAAO,GAAGW,SAA/C,CAAA;AACD,GAAA;;AAED,EAAA,SAASa,KAAT,GAAiB;IACf,OAAOxB,OAAO,KAAKW,SAAZ,GAAwBZ,MAAxB,GAAiCsB,YAAY,CAAC1C,GAAG,EAAJ,CAApD,CAAA;AACD,GAAA;;AAED,EAAA,SAAS8C,SAAT,GAAqB;IACnB,IAAIjB,IAAI,GAAG7B,GAAG,EAAd;AAAA,QACI+C,UAAU,GAAGN,YAAY,CAACZ,IAAD,CAD7B,CAAA;AAGAZ,IAAAA,QAAQ,GAAG+B,SAAX,CAAA;AACA9B,IAAAA,QAAQ,GAAG,IAAX,CAAA;AACAI,IAAAA,YAAY,GAAGO,IAAf,CAAA;;AAEA,IAAA,IAAIkB,UAAJ,EAAgB;MACd,IAAI1B,OAAO,KAAKW,SAAhB,EAA2B;QACzB,OAAOE,WAAW,CAACZ,YAAD,CAAlB,CAAA;AACD,OAAA;;AACD,MAAA,IAAIG,MAAJ,EAAY;AAClB;QACQmB,YAAY,CAACvB,OAAD,CAAZ,CAAA;AACAA,QAAAA,OAAO,GAAGc,UAAU,CAACC,YAAD,EAAerB,IAAf,CAApB,CAAA;QACA,OAAOa,UAAU,CAACN,YAAD,CAAjB,CAAA;AACD,OAAA;AACF,KAAA;;IACD,IAAID,OAAO,KAAKW,SAAhB,EAA2B;AACzBX,MAAAA,OAAO,GAAGc,UAAU,CAACC,YAAD,EAAerB,IAAf,CAApB,CAAA;AACD,KAAA;;AACD,IAAA,OAAOK,MAAP,CAAA;AACD,GAAA;;EACD0B,SAAS,CAACH,MAAV,GAAmBA,MAAnB,CAAA;EACAG,SAAS,CAACD,KAAV,GAAkBA,KAAlB,CAAA;AACA,EAAA,OAAOC,SAAP,CAAA;AACD,CAAA;;AAEDG,IAAAA,UAAc,GAAGpC;;;;"}

package/esm/_chunks/dep-9ff9e5c1.js

@@ -1,107 +0,0 @@
-/**
- * tdesign v0.34.5-alpha.3
- * (c) 2022 tdesign
- * @license MIT
- */
-
-import './dep-6deacc10.js';
-import { c as _castPath, b as _toKey } from './dep-ef1f8e28.js';
-import { i as isArguments_1 } from './dep-6b193843.js';
-import { i as isArray_1 } from './dep-4a917b8a.js';
-import { _ as _isIndex } from './dep-619dfd34.js';
-import { i as isLength_1 } from './dep-56a407af.js';
-
-/**
- * The base implementation of `_.hasIn` without support for deep paths.
- *
- * @private
- * @param {Object} [object] The object to query.
- * @param {Array|string} key The key to check.
- * @returns {boolean} Returns `true` if `key` exists, else `false`.
- */
-
-function baseHasIn$1(object, key) {
-  return object != null && key in Object(object);
-}
-
-var _baseHasIn = baseHasIn$1;
-
-var castPath = _castPath,
-    isArguments = isArguments_1,
-    isArray = isArray_1,
-    isIndex = _isIndex,
-    isLength = isLength_1,
-    toKey = _toKey;
-/**
- * Checks if `path` exists on `object`.
- *
- * @private
- * @param {Object} object The object to query.
- * @param {Array|string} path The path to check.
- * @param {Function} hasFunc The function to check properties.
- * @returns {boolean} Returns `true` if `path` exists, else `false`.
- */
-
-function hasPath$1(object, path, hasFunc) {
-  path = castPath(path, object);
-  var index = -1,
-      length = path.length,
-      result = false;
-
-  while (++index < length) {
-    var key = toKey(path[index]);
-
-    if (!(result = object != null && hasFunc(object, key))) {
-      break;
-    }
-
-    object = object[key];
-  }
-
-  if (result || ++index != length) {
-    return result;
-  }
-
-  length = object == null ? 0 : object.length;
-  return !!length && isLength(length) && isIndex(key, length) && (isArray(object) || isArguments(object));
-}
-
-var _hasPath = hasPath$1;
-
-var baseHasIn = _baseHasIn,
-    hasPath = _hasPath;
-/**
- * Checks if `path` is a direct or inherited property of `object`.
- *
- * @static
- * @memberOf _
- * @since 4.0.0
- * @category Object
- * @param {Object} object The object to query.
- * @param {Array|string} path The path to check.
- * @returns {boolean} Returns `true` if `path` exists, else `false`.
- * @example
- *
- * var object = _.create({ 'a': _.create({ 'b': 2 }) });
- *
- * _.hasIn(object, 'a');
- * // => true
- *
- * _.hasIn(object, 'a.b');
- * // => true
- *
- * _.hasIn(object, ['a', 'b']);
- * // => true
- *
- * _.hasIn(object, 'b');
- * // => false
- */
-
-function hasIn(object, path) {
-  return object != null && hasPath(object, path, baseHasIn);
-}
-
-var hasIn_1 = hasIn;
-
-export { hasIn_1 as h };
-//# sourceMappingURL=dep-9ff9e5c1.js.map

package/esm/_chunks/dep-9ff9e5c1.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-9ff9e5c1.js","sources":["../../node_modules/lodash/_baseHasIn.js","../../node_modules/lodash/_hasPath.js","../../node_modules/lodash/hasIn.js"],"sourcesContent":["/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n"],"names":["baseHasIn","object","key","Object","_baseHasIn","castPath","require$$0","isArguments","require$$1","isArray","require$$2","isIndex","require$$3","isLength","require$$4","toKey","require$$5","hasPath","path","hasFunc","index","length","result","_hasPath","hasIn","hasIn_1"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAQA,SAASA,WAAT,CAAmBC,MAAnB,EAA2BC,GAA3B,EAAgC;EAC9B,OAAOD,MAAM,IAAI,IAAV,IAAkBC,GAAG,IAAIC,MAAM,CAACF,MAAD,CAAtC,CAAA;AACD,CAAA;;AAED,IAAAG,UAAc,GAAGJ,WAAjB;;ACZA,IAAIK,QAAQ,GAAGC,SAAf;AAAA,IACIC,WAAW,GAAGC,aADlB;AAAA,IAEIC,OAAO,GAAGC,SAFd;AAAA,IAGIC,OAAO,GAAGC,QAHd;AAAA,IAIIC,QAAQ,GAAGC,UAJf;AAAA,IAKIC,KAAK,GAAGC,MALZ,CAAA;AAOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,SAAT,CAAiBhB,MAAjB,EAAyBiB,IAAzB,EAA+BC,OAA/B,EAAwC;AACtCD,EAAAA,IAAI,GAAGb,QAAQ,CAACa,IAAD,EAAOjB,MAAP,CAAf,CAAA;EAEA,IAAImB,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,MAAM,GAAGH,IAAI,CAACG,MADlB;MAEIC,MAAM,GAAG,KAFb,CAAA;;AAIA,EAAA,OAAO,EAAEF,KAAF,GAAUC,MAAjB,EAAyB;IACvB,IAAInB,GAAG,GAAGa,KAAK,CAACG,IAAI,CAACE,KAAD,CAAL,CAAf,CAAA;;AACA,IAAA,IAAI,EAAEE,MAAM,GAAGrB,MAAM,IAAI,IAAV,IAAkBkB,OAAO,CAAClB,MAAD,EAASC,GAAT,CAApC,CAAJ,EAAwD;AACtD,MAAA,MAAA;AACD,KAAA;;AACDD,IAAAA,MAAM,GAAGA,MAAM,CAACC,GAAD,CAAf,CAAA;AACD,GAAA;;AACD,EAAA,IAAIoB,MAAM,IAAI,EAAEF,KAAF,IAAWC,MAAzB,EAAiC;AAC/B,IAAA,OAAOC,MAAP,CAAA;AACD,GAAA;;EACDD,MAAM,GAAGpB,MAAM,IAAI,IAAV,GAAiB,CAAjB,GAAqBA,MAAM,CAACoB,MAArC,CAAA;EACA,OAAO,CAAC,CAACA,MAAF,IAAYR,QAAQ,CAACQ,MAAD,CAApB,IAAgCV,OAAO,CAACT,GAAD,EAAMmB,MAAN,CAAvC,KACJZ,OAAO,CAACR,MAAD,CAAP,IAAmBM,WAAW,CAACN,MAAD,CAD1B,CAAP,CAAA;AAED,CAAA;;AAED,IAAAsB,QAAc,GAAGN,SAAjB;;ACtCA,IAAIjB,SAAS,GAAGM,UAAhB;AAAA,IACIW,OAAO,GAAGT,QADd,CAAA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASgB,KAAT,CAAevB,MAAf,EAAuBiB,IAAvB,EAA6B;EAC3B,OAAOjB,MAAM,IAAI,IAAV,IAAkBgB,OAAO,CAAChB,MAAD,EAASiB,IAAT,EAAelB,SAAf,CAAhC,CAAA;AACD,CAAA;;AAEDyB,IAAAA,OAAc,GAAGD;;;;"}

package/esm/_chunks/dep-a283509f.js

@@ -1,131 +0,0 @@
-/**
- * tdesign v0.34.5-alpha.3
- * (c) 2022 tdesign
- * @license MIT
- */
-
-import './dep-6deacc10.js';
-import { _ as _arrayMap } from './dep-ec758130.js';
-import { _ as _SetCache, a as _cacheHas } from './dep-95b26b81.js';
-import { _ as _arrayIncludes, a as _arrayIncludesWith } from './dep-bcb1ac9d.js';
-import { _ as _baseUnary } from './dep-e2da5a69.js';
-import { i as isArrayLikeObject_1, _ as _baseRest } from './dep-dc7ea580.js';
-
-var SetCache = _SetCache,
-    arrayIncludes = _arrayIncludes,
-    arrayIncludesWith = _arrayIncludesWith,
-    arrayMap$1 = _arrayMap,
-    baseUnary = _baseUnary,
-    cacheHas = _cacheHas;
-/* Built-in method references for those with the same name as other `lodash` methods. */
-
-var nativeMin = Math.min;
-/**
- * The base implementation of methods like `_.intersection`, without support
- * for iteratee shorthands, that accepts an array of arrays to inspect.
- *
- * @private
- * @param {Array} arrays The arrays to inspect.
- * @param {Function} [iteratee] The iteratee invoked per element.
- * @param {Function} [comparator] The comparator invoked per element.
- * @returns {Array} Returns the new array of shared values.
- */
-
-function baseIntersection$1(arrays, iteratee, comparator) {
-  var includes = comparator ? arrayIncludesWith : arrayIncludes,
-      length = arrays[0].length,
-      othLength = arrays.length,
-      othIndex = othLength,
-      caches = Array(othLength),
-      maxLength = Infinity,
-      result = [];
-
-  while (othIndex--) {
-    var array = arrays[othIndex];
-
-    if (othIndex && iteratee) {
-      array = arrayMap$1(array, baseUnary(iteratee));
-    }
-
-    maxLength = nativeMin(array.length, maxLength);
-    caches[othIndex] = !comparator && (iteratee || length >= 120 && array.length >= 120) ? new SetCache(othIndex && array) : undefined;
-  }
-
-  array = arrays[0];
-  var index = -1,
-      seen = caches[0];
-
-  outer: while (++index < length && result.length < maxLength) {
-    var value = array[index],
-        computed = iteratee ? iteratee(value) : value;
-    value = comparator || value !== 0 ? value : 0;
-
-    if (!(seen ? cacheHas(seen, computed) : includes(result, computed, comparator))) {
-      othIndex = othLength;
-
-      while (--othIndex) {
-        var cache = caches[othIndex];
-
-        if (!(cache ? cacheHas(cache, computed) : includes(arrays[othIndex], computed, comparator))) {
-          continue outer;
-        }
-      }
-
-      if (seen) {
-        seen.push(computed);
-      }
-
-      result.push(value);
-    }
-  }
-
-  return result;
-}
-
-var _baseIntersection = baseIntersection$1;
-
-var isArrayLikeObject = isArrayLikeObject_1;
-/**
- * Casts `value` to an empty array if it's not an array like object.
- *
- * @private
- * @param {*} value The value to inspect.
- * @returns {Array|Object} Returns the cast array-like object.
- */
-
-function castArrayLikeObject$1(value) {
-  return isArrayLikeObject(value) ? value : [];
-}
-
-var _castArrayLikeObject = castArrayLikeObject$1;
-
-var arrayMap = _arrayMap,
-    baseIntersection = _baseIntersection,
-    baseRest = _baseRest,
-    castArrayLikeObject = _castArrayLikeObject;
-/**
- * Creates an array of unique values that are included in all given arrays
- * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
- * for equality comparisons. The order and references of result values are
- * determined by the first array.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Array
- * @param {...Array} [arrays] The arrays to inspect.
- * @returns {Array} Returns the new array of intersecting values.
- * @example
- *
- * _.intersection([2, 1], [2, 3]);
- * // => [2]
- */
-
-var intersection = baseRest(function (arrays) {
-  var mapped = arrayMap(arrays, castArrayLikeObject);
-  return mapped.length && mapped[0] === arrays[0] ? baseIntersection(mapped) : [];
-});
-var intersection_1 = intersection;
-
-export { intersection_1 as i };
-//# sourceMappingURL=dep-a283509f.js.map

package/esm/_chunks/dep-a283509f.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep-a283509f.js","sources":["../../node_modules/lodash/_baseIntersection.js","../../node_modules/lodash/_castArrayLikeObject.js","../../node_modules/lodash/intersection.js"],"sourcesContent":["var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\n\n/**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\nfunction baseIntersection(arrays, iteratee, comparator) {\n  var includes = comparator ? arrayIncludesWith : arrayIncludes,\n      length = arrays[0].length,\n      othLength = arrays.length,\n      othIndex = othLength,\n      caches = Array(othLength),\n      maxLength = Infinity,\n      result = [];\n\n  while (othIndex--) {\n    var array = arrays[othIndex];\n    if (othIndex && iteratee) {\n      array = arrayMap(array, baseUnary(iteratee));\n    }\n    maxLength = nativeMin(array.length, maxLength);\n    caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n      ? new SetCache(othIndex && array)\n      : undefined;\n  }\n  array = arrays[0];\n\n  var index = -1,\n      seen = caches[0];\n\n  outer:\n  while (++index < length && result.length < maxLength) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (!(seen\n          ? cacheHas(seen, computed)\n          : includes(result, computed, comparator)\n        )) {\n      othIndex = othLength;\n      while (--othIndex) {\n        var cache = caches[othIndex];\n        if (!(cache\n              ? cacheHas(cache, computed)\n              : includes(arrays[othIndex], computed, comparator))\n            ) {\n          continue outer;\n        }\n      }\n      if (seen) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseIntersection;\n","var isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\nfunction castArrayLikeObject(value) {\n  return isArrayLikeObject(value) ? value : [];\n}\n\nmodule.exports = castArrayLikeObject;\n","var arrayMap = require('./_arrayMap'),\n    baseIntersection = require('./_baseIntersection'),\n    baseRest = require('./_baseRest'),\n    castArrayLikeObject = require('./_castArrayLikeObject');\n\n/**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\nvar intersection = baseRest(function(arrays) {\n  var mapped = arrayMap(arrays, castArrayLikeObject);\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped)\n    : [];\n});\n\nmodule.exports = intersection;\n"],"names":["SetCache","require$$0","arrayIncludes","require$$1","arrayIncludesWith","require$$2","arrayMap","require$$3","baseUnary","require$$4","cacheHas","require$$5","nativeMin","Math","min","baseIntersection","arrays","iteratee","comparator","includes","length","othLength","othIndex","caches","Array","maxLength","Infinity","result","array","undefined","index","seen","outer","value","computed","cache","push","_baseIntersection","isArrayLikeObject","castArrayLikeObject","_castArrayLikeObject","baseRest","intersection","mapped","intersection_1"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,SAAf;AAAA,IACIC,aAAa,GAAGC,cADpB;AAAA,IAEIC,iBAAiB,GAAGC,kBAFxB;AAAA,IAGIC,UAAQ,GAAGC,SAHf;AAAA,IAIIC,SAAS,GAAGC,UAJhB;AAAA,IAKIC,QAAQ,GAAGC,SALf,CAAA;AAOA;;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAArB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASC,kBAAT,CAA0BC,MAA1B,EAAkCC,QAAlC,EAA4CC,UAA5C,EAAwD;AACtD,EAAA,IAAIC,QAAQ,GAAGD,UAAU,GAAGd,iBAAH,GAAuBF,aAAhD;AAAA,MACIkB,MAAM,GAAGJ,MAAM,CAAC,CAAD,CAAN,CAAUI,MADvB;AAAA,MAEIC,SAAS,GAAGL,MAAM,CAACI,MAFvB;MAGIE,QAAQ,GAAGD,SAHf;AAAA,MAIIE,MAAM,GAAGC,KAAK,CAACH,SAAD,CAJlB;MAKII,SAAS,GAAGC,QALhB;MAMIC,MAAM,GAAG,EANb,CAAA;;EAQA,OAAOL,QAAQ,EAAf,EAAmB;AACjB,IAAA,IAAIM,KAAK,GAAGZ,MAAM,CAACM,QAAD,CAAlB,CAAA;;IACA,IAAIA,QAAQ,IAAIL,QAAhB,EAA0B;MACxBW,KAAK,GAAGtB,UAAQ,CAACsB,KAAD,EAAQpB,SAAS,CAACS,QAAD,CAAjB,CAAhB,CAAA;AACD,KAAA;;IACDQ,SAAS,GAAGb,SAAS,CAACgB,KAAK,CAACR,MAAP,EAAeK,SAAf,CAArB,CAAA;IACAF,MAAM,CAACD,QAAD,CAAN,GAAmB,CAACJ,UAAD,KAAgBD,QAAQ,IAAKG,MAAM,IAAI,GAAV,IAAiBQ,KAAK,CAACR,MAAN,IAAgB,GAA9D,CAAA,GACf,IAAIpB,QAAJ,CAAasB,QAAQ,IAAIM,KAAzB,CADe,GAEfC,SAFJ,CAAA;AAGD,GAAA;;AACDD,EAAAA,KAAK,GAAGZ,MAAM,CAAC,CAAD,CAAd,CAAA;EAEA,IAAIc,KAAK,GAAG,CAAC,CAAb;AAAA,MACIC,IAAI,GAAGR,MAAM,CAAC,CAAD,CADjB,CAAA;;AAGAS,EAAAA,KAAK,EACL,OAAO,EAAEF,KAAF,GAAUV,MAAV,IAAoBO,MAAM,CAACP,MAAP,GAAgBK,SAA3C,EAAsD;AACpD,IAAA,IAAIQ,KAAK,GAAGL,KAAK,CAACE,KAAD,CAAjB;QACII,QAAQ,GAAGjB,QAAQ,GAAGA,QAAQ,CAACgB,KAAD,CAAX,GAAqBA,KAD5C,CAAA;IAGAA,KAAK,GAAIf,UAAU,IAAIe,KAAK,KAAK,CAAzB,GAA8BA,KAA9B,GAAsC,CAA9C,CAAA;;AACA,IAAA,IAAI,EAAEF,IAAI,GACFrB,QAAQ,CAACqB,IAAD,EAAOG,QAAP,CADN,GAEFf,QAAQ,CAACQ,MAAD,EAASO,QAAT,EAAmBhB,UAAnB,CAFZ,CAAJ,EAGO;AACLI,MAAAA,QAAQ,GAAGD,SAAX,CAAA;;MACA,OAAO,EAAEC,QAAT,EAAmB;AACjB,QAAA,IAAIa,KAAK,GAAGZ,MAAM,CAACD,QAAD,CAAlB,CAAA;;QACA,IAAI,EAAEa,KAAK,GACHzB,QAAQ,CAACyB,KAAD,EAAQD,QAAR,CADL,GAEHf,QAAQ,CAACH,MAAM,CAACM,QAAD,CAAP,EAAmBY,QAAnB,EAA6BhB,UAA7B,CAFZ,CAAJ,EAGM;AACJ,UAAA,SAASc,KAAT,CAAA;AACD,SAAA;AACF,OAAA;;AACD,MAAA,IAAID,IAAJ,EAAU;QACRA,IAAI,CAACK,IAAL,CAAUF,QAAV,CAAA,CAAA;AACD,OAAA;;MACDP,MAAM,CAACS,IAAP,CAAYH,KAAZ,CAAA,CAAA;AACD,KAAA;AACF,GAAA;;AACD,EAAA,OAAON,MAAP,CAAA;AACD,CAAA;;AAED,IAAAU,iBAAc,GAAGtB,kBAAjB;;ACzEA,IAAIuB,iBAAiB,GAAGrC,mBAAxB,CAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,SAASsC,qBAAT,CAA6BN,KAA7B,EAAoC;AAClC,EAAA,OAAOK,iBAAiB,CAACL,KAAD,CAAjB,GAA2BA,KAA3B,GAAmC,EAA1C,CAAA;AACD,CAAA;;AAED,IAAAO,oBAAc,GAAGD,qBAAjB;;ACbA,IAAIjC,QAAQ,GAAGL,SAAf;AAAA,IACIc,gBAAgB,GAAGZ,iBADvB;AAAA,IAEIsC,QAAQ,GAAGpC,SAFf;AAAA,IAGIkC,mBAAmB,GAAGhC,oBAH1B,CAAA;AAKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,IAAImC,YAAY,GAAGD,QAAQ,CAAC,UAASzB,MAAT,EAAiB;AAC3C,EAAA,IAAI2B,MAAM,GAAGrC,QAAQ,CAACU,MAAD,EAASuB,mBAAT,CAArB,CAAA;AACA,EAAA,OAAQI,MAAM,CAACvB,MAAP,IAAiBuB,MAAM,CAAC,CAAD,CAAN,KAAc3B,MAAM,CAAC,CAAD,CAAtC,GACHD,gBAAgB,CAAC4B,MAAD,CADb,GAEH,EAFJ,CAAA;AAGD,CAL0B,CAA3B,CAAA;AAOAC,IAAAA,cAAc,GAAGF;;;;"}

package/esm/_chunks/dep-a9a64c8b.js

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

package/esm/_chunks/dep-a9a64c8b.js.map

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

package/esm/_chunks/dep-aaeeb9b5.js

@@ -1,97 +0,0 @@
-/**
- * tdesign v0.34.5-alpha.3
- * (c) 2022 tdesign
- * @license MIT
- */
-
-import './dep-6deacc10.js';
-import { _ as _arrayPush } from './dep-d7bbd98a.js';
-import { _ as _Symbol$1 } from './dep-e0a016d6.js';
-import { i as isArguments_1 } from './dep-6b193843.js';
-import { i as isArray_1 } from './dep-4a917b8a.js';
-
-var _Symbol = _Symbol$1,
-    isArguments = isArguments_1,
-    isArray = isArray_1;
-/** Built-in value references. */
-
-var spreadableSymbol = _Symbol ? _Symbol.isConcatSpreadable : undefined;
-/**
- * Checks if `value` is a flattenable `arguments` object or array.
- *
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
- */
-
-function isFlattenable$1(value) {
-  return isArray(value) || isArguments(value) || !!(spreadableSymbol && value && value[spreadableSymbol]);
-}
-
-var _isFlattenable = isFlattenable$1;
-
-var arrayPush = _arrayPush,
-    isFlattenable = _isFlattenable;
-/**
- * The base implementation of `_.flatten` with support for restricting flattening.
- *
- * @private
- * @param {Array} array The array to flatten.
- * @param {number} depth The maximum recursion depth.
- * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
- * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
- * @param {Array} [result=[]] The initial result value.
- * @returns {Array} Returns the new flattened array.
- */
-
-function baseFlatten$1(array, depth, predicate, isStrict, result) {
-  var index = -1,
-      length = array.length;
-  predicate || (predicate = isFlattenable);
-  result || (result = []);
-
-  while (++index < length) {
-    var value = array[index];
-
-    if (depth > 0 && predicate(value)) {
-      if (depth > 1) {
-        // Recursively flatten arrays (susceptible to call stack limits).
-        baseFlatten$1(value, depth - 1, predicate, isStrict, result);
-      } else {
-        arrayPush(result, value);
-      }
-    } else if (!isStrict) {
-      result[result.length] = value;
-    }
-  }
-
-  return result;
-}
-
-var _baseFlatten = baseFlatten$1;
-
-var baseFlatten = _baseFlatten;
-/**
- * Flattens `array` a single level deep.
- *
- * @static
- * @memberOf _
- * @since 0.1.0
- * @category Array
- * @param {Array} array The array to flatten.
- * @returns {Array} Returns the new flattened array.
- * @example
- *
- * _.flatten([1, [2, [3, [4]], 5]]);
- * // => [1, 2, [3, [4]], 5]
- */
-
-function flatten(array) {
-  var length = array == null ? 0 : array.length;
-  return length ? baseFlatten(array, 1) : [];
-}
-
-var flatten_1 = flatten;
-
-export { _baseFlatten as _, flatten_1 as f };
-//# sourceMappingURL=dep-aaeeb9b5.js.map