tdesign-web-components 0.0.2 → 0.0.3

package/lib/_chunks/dep-8d2b691d.js

@@ -0,0 +1,369 @@
+/**
+ * TDesign Web Components v0.0.3
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+import { h } from 'omi';
+window.h = h;
+
+import { g as getDefaultExportFromCjs } from './dep-c80ad030.js';
+import { b as _MapCache } from './dep-3b9c6742.js';
+import { _ as _arrayMap } from './dep-bd20449b.js';
+import { _ as _baseUnary, a as _overRest, b as _setToString, c as identity_1, d as _baseFlatten } from './dep-4a896a08.js';
+import { a as isArrayLike_1 } from './dep-cb291ed0.js';
+import { i as isObjectLike_1 } from './dep-2fa075cf.js';
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+/**
+ * Adds `value` to the array cache.
+ *
+ * @private
+ * @name add
+ * @memberOf SetCache
+ * @alias push
+ * @param {*} value The value to cache.
+ * @returns {Object} Returns the cache instance.
+ */
+function setCacheAdd$1(value) {
+  this.__data__.set(value, HASH_UNDEFINED);
+  return this;
+}
+var _setCacheAdd = setCacheAdd$1;
+
+/**
+ * Checks if `value` is in the array cache.
+ *
+ * @private
+ * @name has
+ * @memberOf SetCache
+ * @param {*} value The value to search for.
+ * @returns {number} Returns `true` if `value` is found, else `false`.
+ */
+function setCacheHas$1(value) {
+  return this.__data__.has(value);
+}
+var _setCacheHas = setCacheHas$1;
+
+var MapCache = _MapCache,
+  setCacheAdd = _setCacheAdd,
+  setCacheHas = _setCacheHas;
+
+/**
+ *
+ * Creates an array cache object to store unique values.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [values] The values to cache.
+ */
+function SetCache$1(values) {
+  var index = -1,
+    length = values == null ? 0 : values.length;
+  this.__data__ = new MapCache();
+  while (++index < length) {
+    this.add(values[index]);
+  }
+}
+
+// Add methods to `SetCache`.
+SetCache$1.prototype.add = SetCache$1.prototype.push = setCacheAdd;
+SetCache$1.prototype.has = setCacheHas;
+var _SetCache = SetCache$1;
+
+/**
+ * The base implementation of `_.findIndex` and `_.findLastIndex` without
+ * support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {number} fromIndex The index to search from.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseFindIndex$1(array, predicate, fromIndex, fromRight) {
+  var length = array.length,
+    index = fromIndex + (fromRight ? 1 : -1);
+  while (fromRight ? index-- : ++index < length) {
+    if (predicate(array[index], index, array)) {
+      return index;
+    }
+  }
+  return -1;
+}
+var _baseFindIndex = baseFindIndex$1;
+
+/**
+ * The base implementation of `_.isNaN` without support for number objects.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+ */
+function baseIsNaN$1(value) {
+  return value !== value;
+}
+var _baseIsNaN = baseIsNaN$1;
+
+/**
+ * A specialized version of `_.indexOf` which performs strict equality
+ * comparisons of values, i.e. `===`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function strictIndexOf$1(array, value, fromIndex) {
+  var index = fromIndex - 1,
+    length = array.length;
+  while (++index < length) {
+    if (array[index] === value) {
+      return index;
+    }
+  }
+  return -1;
+}
+var _strictIndexOf = strictIndexOf$1;
+
+var baseFindIndex = _baseFindIndex,
+  baseIsNaN = _baseIsNaN,
+  strictIndexOf = _strictIndexOf;
+
+/**
+ * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseIndexOf$1(array, value, fromIndex) {
+  return value === value ? strictIndexOf(array, value, fromIndex) : baseFindIndex(array, baseIsNaN, fromIndex);
+}
+var _baseIndexOf = baseIndexOf$1;
+
+var baseIndexOf = _baseIndexOf;
+
+/**
+ * A specialized version of `_.includes` for arrays without support for
+ * specifying an index to search from.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+function arrayIncludes$1(array, value) {
+  var length = array == null ? 0 : array.length;
+  return !!length && baseIndexOf(array, value, 0) > -1;
+}
+var _arrayIncludes = arrayIncludes$1;
+
+/**
+ * This function is like `arrayIncludes` except that it accepts a comparator.
+ *
+ * @private
+ * @param {Array} [array] The array to inspect.
+ * @param {*} target The value to search for.
+ * @param {Function} comparator The comparator invoked per element.
+ * @returns {boolean} Returns `true` if `target` is found, else `false`.
+ */
+function arrayIncludesWith$1(array, value, comparator) {
+  var index = -1,
+    length = array == null ? 0 : array.length;
+  while (++index < length) {
+    if (comparator(value, array[index])) {
+      return true;
+    }
+  }
+  return false;
+}
+var _arrayIncludesWith = arrayIncludesWith$1;
+
+/**
+ * Checks if a `cache` value for `key` exists.
+ *
+ * @private
+ * @param {Object} cache The cache to query.
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+function cacheHas$1(cache, key) {
+  return cache.has(key);
+}
+var _cacheHas = cacheHas$1;
+
+var SetCache = _SetCache,
+  arrayIncludes = _arrayIncludes,
+  arrayIncludesWith = _arrayIncludesWith,
+  arrayMap = _arrayMap,
+  baseUnary = _baseUnary,
+  cacheHas = _cacheHas;
+
+/** Used as the size to enable large array optimizations. */
+var LARGE_ARRAY_SIZE = 200;
+
+/**
+ * The base implementation of methods like `_.difference` without support
+ * for excluding multiple arrays or iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Array} values The values to exclude.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ */
+function baseDifference$1(array, values, iteratee, comparator) {
+  var index = -1,
+    includes = arrayIncludes,
+    isCommon = true,
+    length = array.length,
+    result = [],
+    valuesLength = values.length;
+  if (!length) {
+    return result;
+  }
+  if (iteratee) {
+    values = arrayMap(values, baseUnary(iteratee));
+  }
+  if (comparator) {
+    includes = arrayIncludesWith;
+    isCommon = false;
+  } else if (values.length >= LARGE_ARRAY_SIZE) {
+    includes = cacheHas;
+    isCommon = false;
+    values = new SetCache(values);
+  }
+  outer: while (++index < length) {
+    var value = array[index],
+      computed = iteratee == null ? value : iteratee(value);
+    value = comparator || value !== 0 ? value : 0;
+    if (isCommon && computed === computed) {
+      var valuesIndex = valuesLength;
+      while (valuesIndex--) {
+        if (values[valuesIndex] === computed) {
+          continue outer;
+        }
+      }
+      result.push(value);
+    } else if (!includes(values, computed, comparator)) {
+      result.push(value);
+    }
+  }
+  return result;
+}
+var _baseDifference = baseDifference$1;
+
+var identity = identity_1,
+  overRest = _overRest,
+  setToString = _setToString;
+
+/**
+ * The base implementation of `_.rest` which doesn't validate or coerce arguments.
+ *
+ * @private
+ * @param {Function} func The function to apply a rest parameter to.
+ * @param {number} [start=func.length-1] The start position of the rest parameter.
+ * @returns {Function} Returns the new function.
+ */
+function baseRest$1(func, start) {
+  return setToString(overRest(func, start, identity), func + '');
+}
+var _baseRest = baseRest$1;
+
+var isArrayLike = isArrayLike_1,
+  isObjectLike = isObjectLike_1;
+
+/**
+ * This method is like `_.isArrayLike` except that it also checks if `value`
+ * is an object.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array-like object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArrayLikeObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLikeObject(document.body.children);
+ * // => true
+ *
+ * _.isArrayLikeObject('abc');
+ * // => false
+ *
+ * _.isArrayLikeObject(_.noop);
+ * // => false
+ */
+function isArrayLikeObject$1(value) {
+  return isObjectLike(value) && isArrayLike(value);
+}
+var isArrayLikeObject_1 = isArrayLikeObject$1;
+
+var baseDifference = _baseDifference,
+  baseFlatten = _baseFlatten,
+  baseRest = _baseRest,
+  isArrayLikeObject = isArrayLikeObject_1;
+
+/**
+ * Creates an array of `array` values not included in the other given arrays
+ * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+ * for equality comparisons. The order and references of result values are
+ * determined by the first array.
+ *
+ * **Note:** Unlike `_.pullAll`, this method returns a new array.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {Array} array The array to inspect.
+ * @param {...Array} [values] The values to exclude.
+ * @returns {Array} Returns the new array of filtered values.
+ * @see _.without, _.xor
+ * @example
+ *
+ * _.difference([2, 1], [2, 3]);
+ * // => [1]
+ */
+var difference = baseRest(function (array, values) {
+  return isArrayLikeObject(array) ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true)) : [];
+});
+var difference_1 = difference;
+var difference$1 = /*@__PURE__*/getDefaultExportFromCjs(difference_1);
+
+function mitt (n) {
+  return {
+    all: n = n || new Map(),
+    on: function on(t, e) {
+      var i = n.get(t);
+      i ? i.push(e) : n.set(t, [e]);
+    },
+    off: function off(t, e) {
+      var i = n.get(t);
+      i && (e ? i.splice(i.indexOf(e) >>> 0, 1) : n.set(t, []));
+    },
+    emit: function emit(t, e) {
+      var i = n.get(t);
+      i && i.slice().map(function (n) {
+        n(e);
+      }), (i = n.get("*")) && i.slice().map(function (n) {
+        n(t, e);
+      });
+    }
+  };
+}
+
+export { difference$1 as d, mitt as m };
+//# sourceMappingURL=dep-8d2b691d.js.map

package/lib/_chunks/dep-8d2b691d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-8d2b691d.js","sources":["../../node_modules/lodash/_setCacheAdd.js","../../node_modules/lodash/_setCacheHas.js","../../node_modules/lodash/_SetCache.js","../../node_modules/lodash/_baseFindIndex.js","../../node_modules/lodash/_baseIsNaN.js","../../node_modules/lodash/_strictIndexOf.js","../../node_modules/lodash/_baseIndexOf.js","../../node_modules/lodash/_arrayIncludes.js","../../node_modules/lodash/_arrayIncludesWith.js","../../node_modules/lodash/_cacheHas.js","../../node_modules/lodash/_baseDifference.js","../../node_modules/lodash/_baseRest.js","../../node_modules/lodash/isArrayLikeObject.js","../../node_modules/lodash/difference.js","../../node_modules/mitt/dist/mitt.mjs"],"sourcesContent":["/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","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/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\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 filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee == null ? value : iteratee(value);\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseDifference;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var baseDifference = require('./_baseDifference'),\n    baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of `array` values not included in the other 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 * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\nvar difference = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n    : [];\n});\n\nmodule.exports = difference;\n","export default function(n){return{all:n=n||new Map,on:function(t,e){var i=n.get(t);i?i.push(e):n.set(t,[e])},off:function(t,e){var i=n.get(t);i&&(e?i.splice(i.indexOf(e)>>>0,1):n.set(t,[]))},emit:function(t,e){var i=n.get(t);i&&i.slice().map(function(n){n(e)}),(i=n.get(\"*\"))&&i.slice().map(function(n){n(t,e)})}}}\n//# sourceMappingURL=mitt.mjs.map\n"],"names":["HASH_UNDEFINED","setCacheAdd","value","__data__","set","_setCacheAdd","setCacheHas","has","_setCacheHas","MapCache","require$$0","require$$1","require$$2","SetCache","values","index","length","add","prototype","push","_SetCache","baseFindIndex","array","predicate","fromIndex","fromRight","_baseFindIndex","baseIsNaN","_baseIsNaN","strictIndexOf","_strictIndexOf","baseIndexOf","_baseIndexOf","arrayIncludes","_arrayIncludes","arrayIncludesWith","comparator","_arrayIncludesWith","cacheHas","cache","key","_cacheHas","arrayMap","require$$3","baseUnary","require$$4","require$$5","LARGE_ARRAY_SIZE","baseDifference","iteratee","includes","isCommon","result","valuesLength","outer","computed","valuesIndex","_baseDifference","identity","overRest","setToString","baseRest","func","start","_baseRest","isArrayLike","isObjectLike","isArrayLikeObject","isArrayLikeObject_1","baseFlatten","difference","difference_1","n","all","Map","on","t","e","i","get","off","splice","indexOf","emit","slice","map"],"mappings":";;;;;;;;;;;;;;;;;AACA,IAAIA,cAAc,GAAG,2BAA2B,CAAA;;AAEhD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,aAAWA,CAACC,KAAK,EAAE;EAC1B,IAAI,CAACC,QAAQ,CAACC,GAAG,CAACF,KAAK,EAAEF,cAAc,CAAC,CAAA;AACxC,EAAA,OAAO,IAAI,CAAA;AACb,CAAA;AAEA,IAAAK,YAAc,GAAGJ,aAAW;;;;;;;;;;;ACT5B,SAASK,aAAWA,CAACJ,KAAK,EAAE;AAC1B,EAAA,OAAO,IAAI,CAACC,QAAQ,CAACI,GAAG,CAACL,KAAK,CAAC,CAAA;AACjC,CAAA;AAEA,IAAAM,YAAc,GAAGF,aAAW;;ACb5B,IAAIG,QAAQ,GAAGC,SAAsB;AACjCT,EAAAA,WAAW,GAAGU,YAAyB;AACvCL,EAAAA,WAAW,GAAGM,YAAyB,CAAA;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,UAAQA,CAACC,MAAM,EAAE;EACxB,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGF,MAAM,IAAI,IAAI,GAAG,CAAC,GAAGA,MAAM,CAACE,MAAM,CAAA;AAE/C,EAAA,IAAI,CAACb,QAAQ,GAAG,IAAIM,QAAQ,EAAA,CAAA;AAC5B,EAAA,OAAO,EAAEM,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAI,CAACC,GAAG,CAACH,MAAM,CAACC,KAAK,CAAC,CAAC,CAAA;AACxB,GAAA;AACH,CAAA;;AAEA;AACAF,UAAQ,CAACK,SAAS,CAACD,GAAG,GAAGJ,UAAQ,CAACK,SAAS,CAACC,IAAI,GAAGlB,WAAW,CAAA;AAC9DY,UAAQ,CAACK,SAAS,CAACX,GAAG,GAAGD,WAAW,CAAA;AAEpC,IAAAc,SAAc,GAAGP,UAAQ;;;;;;;;;;;;;ACfzB,SAASQ,eAAaA,CAACC,KAAK,EAAEC,SAAS,EAAEC,SAAS,EAAEC,SAAS,EAAE;AAC7D,EAAA,IAAIT,MAAM,GAAGM,KAAK,CAACN,MAAM;IACrBD,KAAK,GAAGS,SAAS,IAAIC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;EAE5C,OAAQA,SAAS,GAAGV,KAAK,EAAE,GAAG,EAAEA,KAAK,GAAGC,MAAM,EAAG;IAC/C,IAAIO,SAAS,CAACD,KAAK,CAACP,KAAK,CAAC,EAAEA,KAAK,EAAEO,KAAK,CAAC,EAAE;AACzC,MAAA,OAAOP,KAAK,CAAA;AACb,KAAA;AACF,GAAA;AACD,EAAA,OAAO,CAAC,CAAC,CAAA;AACX,CAAA;AAEA,IAAAW,cAAc,GAAGL,eAAa;;;;;;;;;AChB9B,SAASM,WAASA,CAACzB,KAAK,EAAE;EACxB,OAAOA,KAAK,KAAKA,KAAK,CAAA;AACxB,CAAA;AAEA,IAAA0B,UAAc,GAAGD,WAAS;;;;;;;;;;;;ACD1B,SAASE,eAAaA,CAACP,KAAK,EAAEpB,KAAK,EAAEsB,SAAS,EAAE;AAC9C,EAAA,IAAIT,KAAK,GAAGS,SAAS,GAAG,CAAC;IACrBR,MAAM,GAAGM,KAAK,CAACN,MAAM,CAAA;AAEzB,EAAA,OAAO,EAAED,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAIM,KAAK,CAACP,KAAK,CAAC,KAAKb,KAAK,EAAE;AAC1B,MAAA,OAAOa,KAAK,CAAA;AACb,KAAA;AACF,GAAA;AACD,EAAA,OAAO,CAAC,CAAC,CAAA;AACX,CAAA;AAEA,IAAAe,cAAc,GAAGD,eAAa;;ACtB9B,IAAIR,aAAa,GAAGX,cAA2B;AAC3CiB,EAAAA,SAAS,GAAGhB,UAAuB;AACnCkB,EAAAA,aAAa,GAAGjB,cAA2B,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASmB,aAAWA,CAACT,KAAK,EAAEpB,KAAK,EAAEsB,SAAS,EAAE;EAC5C,OAAOtB,KAAK,KAAKA,KAAK,GAClB2B,aAAa,CAACP,KAAK,EAAEpB,KAAK,EAAEsB,SAAS,CAAC,GACtCH,aAAa,CAACC,KAAK,EAAEK,SAAS,EAAEH,SAAS,CAAC,CAAA;AAChD,CAAA;AAEA,IAAAQ,YAAc,GAAGD,aAAW;;ACnB5B,IAAIA,WAAW,GAAGrB,YAAyB,CAAA;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASuB,eAAaA,CAACX,KAAK,EAAEpB,KAAK,EAAE;EACnC,IAAIc,MAAM,GAAGM,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACN,MAAM,CAAA;AAC7C,EAAA,OAAO,CAAC,CAACA,MAAM,IAAIe,WAAW,CAACT,KAAK,EAAEpB,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;AACtD,CAAA;AAEA,IAAAgC,cAAc,GAAGD,eAAa;;;;;;;;;;;ACP9B,SAASE,mBAAiBA,CAACb,KAAK,EAAEpB,KAAK,EAAEkC,UAAU,EAAE;EACnD,IAAIrB,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGM,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACN,MAAM,CAAA;AAE7C,EAAA,OAAO,EAAED,KAAK,GAAGC,MAAM,EAAE;IACvB,IAAIoB,UAAU,CAAClC,KAAK,EAAEoB,KAAK,CAACP,KAAK,CAAC,CAAC,EAAE;AACnC,MAAA,OAAO,IAAI,CAAA;AACZ,KAAA;AACF,GAAA;AACD,EAAA,OAAO,KAAK,CAAA;AACd,CAAA;AAEA,IAAAsB,kBAAc,GAAGF,mBAAiB;;;;;;;;;;ACblC,SAASG,UAAQA,CAACC,KAAK,EAAEC,GAAG,EAAE;AAC5B,EAAA,OAAOD,KAAK,CAAChC,GAAG,CAACiC,GAAG,CAAC,CAAA;AACvB,CAAA;AAEA,IAAAC,SAAc,GAAGH,UAAQ;;ACZzB,IAAIzB,QAAQ,GAAGH,SAAsB;AACjCuB,EAAAA,aAAa,GAAGtB,cAA2B;AAC3CwB,EAAAA,iBAAiB,GAAGvB,kBAA+B;AACnD8B,EAAAA,QAAQ,GAAGC,SAAsB;AACjCC,EAAAA,SAAS,GAAGC,UAAuB;AACnCP,EAAAA,QAAQ,GAAGQ,SAAsB,CAAA;;AAErC;AACA,IAAIC,gBAAgB,GAAG,GAAG,CAAA;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,gBAAcA,CAAC1B,KAAK,EAAER,MAAM,EAAEmC,QAAQ,EAAEb,UAAU,EAAE;EAC3D,IAAIrB,KAAK,GAAG,CAAC,CAAC;AACVmC,IAAAA,QAAQ,GAAGjB,aAAa;AACxBkB,IAAAA,QAAQ,GAAG,IAAI;IACfnC,MAAM,GAAGM,KAAK,CAACN,MAAM;AACrBoC,IAAAA,MAAM,GAAG,EAAE;IACXC,YAAY,GAAGvC,MAAM,CAACE,MAAM,CAAA;EAEhC,IAAI,CAACA,MAAM,EAAE;AACX,IAAA,OAAOoC,MAAM,CAAA;AACd,GAAA;AACD,EAAA,IAAIH,QAAQ,EAAE;IACZnC,MAAM,GAAG4B,QAAQ,CAAC5B,MAAM,EAAE8B,SAAS,CAACK,QAAQ,CAAC,CAAC,CAAA;AAC/C,GAAA;AACD,EAAA,IAAIb,UAAU,EAAE;AACdc,IAAAA,QAAQ,GAAGf,iBAAiB,CAAA;AAC5BgB,IAAAA,QAAQ,GAAG,KAAK,CAAA;AACjB,GAAA,MACI,IAAIrC,MAAM,CAACE,MAAM,IAAI+B,gBAAgB,EAAE;AAC1CG,IAAAA,QAAQ,GAAGZ,QAAQ,CAAA;AACnBa,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAChBrC,IAAAA,MAAM,GAAG,IAAID,QAAQ,CAACC,MAAM,CAAC,CAAA;AAC9B,GAAA;AACDwC,EAAAA,KAAK,EACL,OAAO,EAAEvC,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAId,KAAK,GAAGoB,KAAK,CAACP,KAAK,CAAC;MACpBwC,QAAQ,GAAGN,QAAQ,IAAI,IAAI,GAAG/C,KAAK,GAAG+C,QAAQ,CAAC/C,KAAK,CAAC,CAAA;IAEzDA,KAAK,GAAIkC,UAAU,IAAIlC,KAAK,KAAK,CAAC,GAAIA,KAAK,GAAG,CAAC,CAAA;AAC/C,IAAA,IAAIiD,QAAQ,IAAII,QAAQ,KAAKA,QAAQ,EAAE;MACrC,IAAIC,WAAW,GAAGH,YAAY,CAAA;MAC9B,OAAOG,WAAW,EAAE,EAAE;AACpB,QAAA,IAAI1C,MAAM,CAAC0C,WAAW,CAAC,KAAKD,QAAQ,EAAE;AACpC,UAAA,SAASD,KAAK,CAAA;AACf,SAAA;AACF,OAAA;AACDF,MAAAA,MAAM,CAACjC,IAAI,CAACjB,KAAK,CAAC,CAAA;KACnB,MACI,IAAI,CAACgD,QAAQ,CAACpC,MAAM,EAAEyC,QAAQ,EAAEnB,UAAU,CAAC,EAAE;AAChDgB,MAAAA,MAAM,CAACjC,IAAI,CAACjB,KAAK,CAAC,CAAA;AACnB,KAAA;AACF,GAAA;AACD,EAAA,OAAOkD,MAAM,CAAA;AACf,CAAA;AAEA,IAAAK,eAAc,GAAGT,gBAAc;;AClE/B,IAAIU,QAAQ,GAAGhD,UAAqB;AAChCiD,EAAAA,QAAQ,GAAGhD,SAAsB;AACjCiD,EAAAA,WAAW,GAAGhD,YAAyB,CAAA;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASiD,UAAQA,CAACC,IAAI,EAAEC,KAAK,EAAE;AAC7B,EAAA,OAAOH,WAAW,CAACD,QAAQ,CAACG,IAAI,EAAEC,KAAK,EAAEL,QAAQ,CAAC,EAAEI,IAAI,GAAG,EAAE,CAAC,CAAA;AAChE,CAAA;AAEA,IAAAE,SAAc,GAAGH,UAAQ;;AChBzB,IAAII,WAAW,GAAGvD,aAAwB;AACtCwD,EAAAA,YAAY,GAAGvD,cAAyB,CAAA;;AAE5C;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,SAASwD,mBAAiBA,CAACjE,KAAK,EAAE;EAChC,OAAOgE,YAAY,CAAChE,KAAK,CAAC,IAAI+D,WAAW,CAAC/D,KAAK,CAAC,CAAA;AAClD,CAAA;AAEA,IAAAkE,mBAAc,GAAGD,mBAAiB;;AChClC,IAAInB,cAAc,GAAGtC,eAA4B;AAC7C2D,EAAAA,WAAW,GAAG1D,YAAyB;AACvCkD,EAAAA,QAAQ,GAAGjD,SAAsB;AACjCuD,EAAAA,iBAAiB,GAAGxB,mBAA8B,CAAA;;AAEtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI2B,UAAU,GAAGT,QAAQ,CAAC,UAASvC,KAAK,EAAER,MAAM,EAAE;EAChD,OAAOqD,iBAAiB,CAAC7C,KAAK,CAAC,GAC3B0B,cAAc,CAAC1B,KAAK,EAAE+C,WAAW,CAACvD,MAAM,EAAE,CAAC,EAAEqD,iBAAiB,EAAE,IAAI,CAAC,CAAC,GACtE,EAAE,CAAA;AACR,CAAC,CAAC,CAAA;AAEF,IAAAI,YAAc,GAAGD,UAAU,CAAA;;;eCc1BE,CAAA,EAAA;EAOA,OAAO;AAINC,IAAAA,GAAA,EANDD,CAAA,GAAMA,CAAA,IAAO,IAAIE,GAAA,EAAA;AAchBC,IAAAA,EAAA,EAAAA,SAAAA,EAAAA,CAA6BC,CAAA,EAAWC,CAAA,EAAA;AACvC,MAAA,IAAMC,CAAA,GAAmDN,CAAA,CAAKO,GAAA,CAAIH,CAAA,CAAA,CAAA;AAC9DE,MAAAA,CAAA,GACHA,CAAA,CAAS3D,IAAA,CAAK0D,CAAA,CAAA,GAEdL,CAAA,CAAKpE,GAAA,CAAIwE,CAAA,EAAM,CAACC,CAAA,CAAA,CAAA,CAAA;AAAA,KAAA;AAWlBG,IAAAA,GAAA,EAAAA,SAAAA,GAAAA,CAA8BJ,CAAA,EAAWC,CAAA,EAAA;AACxC,MAAA,IAAMC,CAAA,GAAmDN,CAAA,CAAKO,GAAA,CAAIH,CAAA,CAAA,CAAA;MAC9DE,CAAA,KACCD,CAAA,GACHC,CAAA,CAASG,MAAA,CAAOH,CAAA,CAASI,OAAA,CAAQL,CAAA,CAAA,KAAa,GAAG,CAEjDL,CAAAA,GAAAA,CAAA,CAAKpE,GAAA,CAAIwE,CAAA,EAAM,EAAA,CAAA,CAAA,CAAA;AAAA,KAAA;AAelBO,IAAAA,IAAA,EAAAA,SAAAA,IAAAA,CAA+BP,CAAA,EAAWC,CAAA,EAAA;AACzC,MAAA,IAAIC,CAAA,GAAWN,CAAA,CAAKO,GAAA,CAAIH,CAAA,CAAA,CAAA;MACpBE,CAAA,IACFA,CAAA,CACCM,KAAA,GACAC,GAAA,CAAI,UAACb,CAAA,EAAA;AACLA,QAAAA,CAAA,CAAQK,CAAA,CAAA,CAAA;AAAA,OAAA,CAAA,EAAA,CAIXC,CAAA,GAAWN,CAAA,CAAKO,GAAA,CAAI,GAAA,CAAA,KAElBD,CAAA,CACCM,KAAA,EAAA,CACAC,GAAA,CAAI,UAACb,CAAA,EAAA;QACLA,CAAA,CAAQI,CAAA,EAAMC,CAAA,CAAA,CAAA;AAAA,OAAA,CAAA,CAAA;AAAA,KAAA;AAAA,GAAA,CAAA;AAAA;;;;"}