tdesign-vue-next 1.11.0 → 1.11.1-alpha.1

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-a0482c90.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIntersection.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_castArrayLikeObject.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/intersection.js"],"sourcesContent":["import SetCache from './_SetCache.js';\nimport arrayIncludes from './_arrayIncludes.js';\nimport arrayIncludesWith from './_arrayIncludesWith.js';\nimport arrayMap from './_arrayMap.js';\nimport baseUnary from './_baseUnary.js';\nimport cacheHas from './_cacheHas.js';\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\nexport default baseIntersection;\n","import isArrayLikeObject from './isArrayLikeObject.js';\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\nexport default castArrayLikeObject;\n","import arrayMap from './_arrayMap.js';\nimport baseIntersection from './_baseIntersection.js';\nimport baseRest from './_baseRest.js';\nimport castArrayLikeObject from './_castArrayLikeObject.js';\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\nexport default intersection;\n"],"names":["nativeMin","Math","min","baseIntersection","arrays","iteratee","comparator","includes","arrayIncludesWith","arrayIncludes","length","othLength","othIndex","caches","Array","maxLength","Infinity","result","array","arrayMap","baseUnary","SetCache","undefined","index","seen","outer","value","computed","cacheHas","cache","push","castArrayLikeObject","isArrayLikeObject","intersection","baseRest","mapped"],"mappings":";;;;;;;;;;;;;;AAOA;AACA,IAAIA,SAAS,GAAGC,IAAI,CAACC,GAAG,CAAA;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,gBAAgBA,CAACC,MAAM,EAAEC,QAAQ,EAAEC,UAAU,EAAE;AACtD,EAAA,IAAIC,QAAQ,GAAGD,UAAU,GAAGE,oCAAiB,GAAGC,gCAAa;AACzDC,IAAAA,MAAM,GAAGN,MAAM,CAAC,CAAC,CAAC,CAACM,MAAM;IACzBC,SAAS,GAAGP,MAAM,CAACM,MAAM;AACzBE,IAAAA,QAAQ,GAAGD,SAAS;AACpBE,IAAAA,MAAM,GAAGC,KAAK,CAACH,SAAS,CAAC;AACzBI,IAAAA,SAAS,GAAGC,QAAQ;AACpBC,IAAAA,MAAM,GAAG,EAAE,CAAA;EAEf,OAAOL,QAAQ,EAAE,EAAE;AACjB,IAAA,IAAIM,KAAK,GAAGd,MAAM,CAACQ,QAAQ,CAAC,CAAA;IAC5B,IAAIA,QAAQ,IAAIP,QAAQ,EAAE;MACxBa,KAAK,GAAGC,iBAAQ,CAACD,KAAK,EAAEE,oBAAS,CAACf,QAAQ,CAAC,CAAC,CAAA;AAC9C,KAAA;IACAU,SAAS,GAAGf,SAAS,CAACkB,KAAK,CAACR,MAAM,EAAEK,SAAS,CAAC,CAAA;AAC9CF,IAAAA,MAAM,CAACD,QAAQ,CAAC,GAAG,CAACN,UAAU,KAAKD,QAAQ,IAAKK,MAAM,IAAI,GAAG,IAAIQ,KAAK,CAACR,MAAM,IAAI,GAAI,CAAC,GAClF,IAAIW,kBAAQ,CAACT,QAAQ,IAAIM,KAAK,CAAC,GAC/BI,SAAS,CAAA;AACf,GAAA;AACAJ,EAAAA,KAAK,GAAGd,MAAM,CAAC,CAAC,CAAC,CAAA;EAEjB,IAAImB,KAAK,GAAG,CAAC,CAAC;AACVC,IAAAA,IAAI,GAAGX,MAAM,CAAC,CAAC,CAAC,CAAA;AAEpBY,EAAAA,KAAK,EACL,OAAO,EAAEF,KAAK,GAAGb,MAAM,IAAIO,MAAM,CAACP,MAAM,GAAGK,SAAS,EAAE;AACpD,IAAA,IAAIW,KAAK,GAAGR,KAAK,CAACK,KAAK,CAAC;MACpBI,QAAQ,GAAGtB,QAAQ,GAAGA,QAAQ,CAACqB,KAAK,CAAC,GAAGA,KAAK,CAAA;IAEjDA,KAAK,GAAIpB,UAAU,IAAIoB,KAAK,KAAK,CAAC,GAAIA,KAAK,GAAG,CAAC,CAAA;AAC/C,IAAA,IAAI,EAAEF,IAAI,GACFI,kBAAQ,CAACJ,IAAI,EAAEG,QAAQ,CAAC,GACxBpB,QAAQ,CAACU,MAAM,EAAEU,QAAQ,EAAErB,UAAU,CAAC,CACzC,EAAE;AACLM,MAAAA,QAAQ,GAAGD,SAAS,CAAA;MACpB,OAAO,EAAEC,QAAQ,EAAE;AACjB,QAAA,IAAIiB,KAAK,GAAGhB,MAAM,CAACD,QAAQ,CAAC,CAAA;QAC5B,IAAI,EAAEiB,KAAK,GACHD,kBAAQ,CAACC,KAAK,EAAEF,QAAQ,CAAC,GACzBpB,QAAQ,CAACH,MAAM,CAACQ,QAAQ,CAAC,EAAEe,QAAQ,EAAErB,UAAU,CAAC,CAAC,EACnD;AACJ,UAAA,SAASmB,KAAK,CAAA;AAChB,SAAA;AACF,OAAA;AACA,MAAA,IAAID,IAAI,EAAE;AACRA,QAAAA,IAAI,CAACM,IAAI,CAACH,QAAQ,CAAC,CAAA;AACrB,OAAA;AACAV,MAAAA,MAAM,CAACa,IAAI,CAACJ,KAAK,CAAC,CAAA;AACpB,KAAA;AACF,GAAA;AACA,EAAA,OAAOT,MAAM,CAAA;AACf;;ACrEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASc,mBAAmBA,CAACL,KAAK,EAAE;AAClC,EAAA,OAAOM,mCAAiB,CAACN,KAAK,CAAC,GAAGA,KAAK,GAAG,EAAE,CAAA;AAC9C;;ACNA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIO,YAAY,GAAGC,0BAAQ,CAAC,UAAS9B,MAAM,EAAE;AAC3C,EAAA,IAAI+B,MAAM,GAAGhB,iBAAQ,CAACf,MAAM,EAAE2B,mBAAmB,CAAC,CAAA;AAClD,EAAA,OAAQI,MAAM,CAACzB,MAAM,IAAIyB,MAAM,CAAC,CAAC,CAAC,KAAK/B,MAAM,CAAC,CAAC,CAAC,GAC5CD,gBAAgB,CAACgC,MAAM,CAAC,GACxB,EAAE,CAAA;AACR,CAAC,CAAC,CAAA;AAEF,qBAAeF,YAAY;;;;"}

package/cjs/_chunks/dep-a246b8d5.js

@@ -0,0 +1,420 @@
+/**
+ * tdesign v1.11.1
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _initCloneObject = require('./dep-9e37eebf.js');
+var _cacheHas = require('./dep-d9378865.js');
+var _baseGetTag = require('./dep-8af7b432.js');
+var _MapCache = require('./dep-8db04cd4.js');
+var _setToArray = require('./dep-3a398159.js');
+var _baseClone = require('./dep-55ae3cb5.js');
+var _getTag = require('./dep-481d05e9.js');
+var isArray = require('./dep-fd23ce18.js');
+var _overArg = require('./dep-ec56dcd9.js');
+var isObjectLike = require('./dep-750b6c90.js');
+
+/**
+ * A specialized version of `_.some` for arrays without support for iteratee
+ * shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} predicate The function invoked per iteration.
+ * @returns {boolean} Returns `true` if any element passes the predicate check,
+ *  else `false`.
+ */
+function arraySome(array, predicate) {
+  var index = -1,
+    length = array == null ? 0 : array.length;
+  while (++index < length) {
+    if (predicate(array[index], index, array)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG$3 = 1,
+  COMPARE_UNORDERED_FLAG$1 = 2;
+
+/**
+ * A specialized version of `baseIsEqualDeep` for arrays with support for
+ * partial deep comparisons.
+ *
+ * @private
+ * @param {Array} array The array to compare.
+ * @param {Array} other The other array to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} stack Tracks traversed `array` and `other` objects.
+ * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
+ */
+function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
+  var isPartial = bitmask & COMPARE_PARTIAL_FLAG$3,
+    arrLength = array.length,
+    othLength = other.length;
+  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
+    return false;
+  }
+  // Check that cyclic values are equal.
+  var arrStacked = stack.get(array);
+  var othStacked = stack.get(other);
+  if (arrStacked && othStacked) {
+    return arrStacked == other && othStacked == array;
+  }
+  var index = -1,
+    result = true,
+    seen = bitmask & COMPARE_UNORDERED_FLAG$1 ? new _cacheHas.SetCache() : undefined;
+  stack.set(array, other);
+  stack.set(other, array);
+
+  // Ignore non-index properties.
+  while (++index < arrLength) {
+    var arrValue = array[index],
+      othValue = other[index];
+    if (customizer) {
+      var compared = isPartial ? customizer(othValue, arrValue, index, other, array, stack) : customizer(arrValue, othValue, index, array, other, stack);
+    }
+    if (compared !== undefined) {
+      if (compared) {
+        continue;
+      }
+      result = false;
+      break;
+    }
+    // Recursively compare arrays (susceptible to call stack limits).
+    if (seen) {
+      if (!arraySome(other, function (othValue, othIndex) {
+        if (!_cacheHas.cacheHas(seen, othIndex) && (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
+          return seen.push(othIndex);
+        }
+      })) {
+        result = false;
+        break;
+      }
+    } else if (!(arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
+      result = false;
+      break;
+    }
+  }
+  stack['delete'](array);
+  stack['delete'](other);
+  return result;
+}
+
+/**
+ * Converts `map` to its key-value pairs.
+ *
+ * @private
+ * @param {Object} map The map to convert.
+ * @returns {Array} Returns the key-value pairs.
+ */
+function mapToArray(map) {
+  var index = -1,
+    result = Array(map.size);
+  map.forEach(function (value, key) {
+    result[++index] = [key, value];
+  });
+  return result;
+}
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG$2 = 1,
+  COMPARE_UNORDERED_FLAG = 2;
+
+/** `Object#toString` result references. */
+var boolTag = '[object Boolean]',
+  dateTag = '[object Date]',
+  errorTag = '[object Error]',
+  mapTag = '[object Map]',
+  numberTag = '[object Number]',
+  regexpTag = '[object RegExp]',
+  setTag = '[object Set]',
+  stringTag = '[object String]',
+  symbolTag = '[object Symbol]';
+var arrayBufferTag = '[object ArrayBuffer]',
+  dataViewTag = '[object DataView]';
+
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = _baseGetTag._Symbol ? _baseGetTag._Symbol.prototype : undefined,
+  symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
+
+/**
+ * A specialized version of `baseIsEqualDeep` for comparing objects of
+ * the same `toStringTag`.
+ *
+ * **Note:** This function only supports comparing values with tags of
+ * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {string} tag The `toStringTag` of the objects to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} stack Tracks traversed `object` and `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
+  switch (tag) {
+    case dataViewTag:
+      if (object.byteLength != other.byteLength || object.byteOffset != other.byteOffset) {
+        return false;
+      }
+      object = object.buffer;
+      other = other.buffer;
+    case arrayBufferTag:
+      if (object.byteLength != other.byteLength || !equalFunc(new _initCloneObject.Uint8Array(object), new _initCloneObject.Uint8Array(other))) {
+        return false;
+      }
+      return true;
+    case boolTag:
+    case dateTag:
+    case numberTag:
+      // Coerce booleans to `1` or `0` and dates to milliseconds.
+      // Invalid dates are coerced to `NaN`.
+      return _MapCache.eq(+object, +other);
+    case errorTag:
+      return object.name == other.name && object.message == other.message;
+    case regexpTag:
+    case stringTag:
+      // Coerce regexes to strings and treat strings, primitives and objects,
+      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
+      // for more details.
+      return object == other + '';
+    case mapTag:
+      var convert = mapToArray;
+    case setTag:
+      var isPartial = bitmask & COMPARE_PARTIAL_FLAG$2;
+      convert || (convert = _setToArray.setToArray);
+      if (object.size != other.size && !isPartial) {
+        return false;
+      }
+      // Assume cyclic values are equal.
+      var stacked = stack.get(object);
+      if (stacked) {
+        return stacked == other;
+      }
+      bitmask |= COMPARE_UNORDERED_FLAG;
+
+      // Recursively compare objects (susceptible to call stack limits).
+      stack.set(object, other);
+      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
+      stack['delete'](object);
+      return result;
+    case symbolTag:
+      if (symbolValueOf) {
+        return symbolValueOf.call(object) == symbolValueOf.call(other);
+      }
+  }
+  return false;
+}
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG$1 = 1;
+
+/** Used for built-in method references. */
+var objectProto$1 = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
+
+/**
+ * A specialized version of `baseIsEqualDeep` for objects with support for
+ * partial deep comparisons.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} stack Tracks traversed `object` and `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
+  var isPartial = bitmask & COMPARE_PARTIAL_FLAG$1,
+    objProps = _baseClone.getAllKeys(object),
+    objLength = objProps.length,
+    othProps = _baseClone.getAllKeys(other),
+    othLength = othProps.length;
+  if (objLength != othLength && !isPartial) {
+    return false;
+  }
+  var index = objLength;
+  while (index--) {
+    var key = objProps[index];
+    if (!(isPartial ? key in other : hasOwnProperty$1.call(other, key))) {
+      return false;
+    }
+  }
+  // Check that cyclic values are equal.
+  var objStacked = stack.get(object);
+  var othStacked = stack.get(other);
+  if (objStacked && othStacked) {
+    return objStacked == other && othStacked == object;
+  }
+  var result = true;
+  stack.set(object, other);
+  stack.set(other, object);
+  var skipCtor = isPartial;
+  while (++index < objLength) {
+    key = objProps[index];
+    var objValue = object[key],
+      othValue = other[key];
+    if (customizer) {
+      var compared = isPartial ? customizer(othValue, objValue, key, other, object, stack) : customizer(objValue, othValue, key, object, other, stack);
+    }
+    // Recursively compare objects (susceptible to call stack limits).
+    if (!(compared === undefined ? objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack) : compared)) {
+      result = false;
+      break;
+    }
+    skipCtor || (skipCtor = key == 'constructor');
+  }
+  if (result && !skipCtor) {
+    var objCtor = object.constructor,
+      othCtor = other.constructor;
+
+    // Non `Object` object instances with different constructors are not equal.
+    if (objCtor != othCtor && 'constructor' in object && 'constructor' in other && !(typeof objCtor == 'function' && objCtor instanceof objCtor && typeof othCtor == 'function' && othCtor instanceof othCtor)) {
+      result = false;
+    }
+  }
+  stack['delete'](object);
+  stack['delete'](other);
+  return result;
+}
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG = 1;
+
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]',
+  arrayTag = '[object Array]',
+  objectTag = '[object Object]';
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * A specialized version of `baseIsEqual` for arrays and objects which performs
+ * deep comparisons and tracks traversed objects enabling objects with circular
+ * references to be compared.
+ *
+ * @private
+ * @param {Object} object The object to compare.
+ * @param {Object} other The other object to compare.
+ * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+ * @param {Function} customizer The function to customize comparisons.
+ * @param {Function} equalFunc The function to determine equivalents of values.
+ * @param {Object} [stack] Tracks traversed `object` and `other` objects.
+ * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+ */
+function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
+  var objIsArr = isArray.isArray(object),
+    othIsArr = isArray.isArray(other),
+    objTag = objIsArr ? arrayTag : _getTag.getTag(object),
+    othTag = othIsArr ? arrayTag : _getTag.getTag(other);
+  objTag = objTag == argsTag ? objectTag : objTag;
+  othTag = othTag == argsTag ? objectTag : othTag;
+  var objIsObj = objTag == objectTag,
+    othIsObj = othTag == objectTag,
+    isSameTag = objTag == othTag;
+  if (isSameTag && _overArg.isBuffer(object)) {
+    if (!_overArg.isBuffer(other)) {
+      return false;
+    }
+    objIsArr = true;
+    objIsObj = false;
+  }
+  if (isSameTag && !objIsObj) {
+    stack || (stack = new _initCloneObject.Stack());
+    return objIsArr || _overArg.isTypedArray(object) ? equalArrays(object, other, bitmask, customizer, equalFunc, stack) : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
+  }
+  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {
+    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
+      othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
+    if (objIsWrapped || othIsWrapped) {
+      var objUnwrapped = objIsWrapped ? object.value() : object,
+        othUnwrapped = othIsWrapped ? other.value() : other;
+      stack || (stack = new _initCloneObject.Stack());
+      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
+    }
+  }
+  if (!isSameTag) {
+    return false;
+  }
+  stack || (stack = new _initCloneObject.Stack());
+  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
+}
+
+/**
+ * The base implementation of `_.isEqual` which supports partial comparisons
+ * and tracks traversed objects.
+ *
+ * @private
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @param {boolean} bitmask The bitmask flags.
+ *  1 - Unordered comparison
+ *  2 - Partial comparison
+ * @param {Function} [customizer] The function to customize comparisons.
+ * @param {Object} [stack] Tracks traversed `value` and `other` objects.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ */
+function baseIsEqual(value, other, bitmask, customizer, stack) {
+  if (value === other) {
+    return true;
+  }
+  if (value == null || other == null || !isObjectLike.isObjectLike(value) && !isObjectLike.isObjectLike(other)) {
+    return value !== value && other !== other;
+  }
+  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
+}
+
+/**
+ * Performs a deep comparison between two values to determine if they are
+ * equivalent.
+ *
+ * **Note:** This method supports comparing arrays, array buffers, booleans,
+ * date objects, error objects, maps, numbers, `Object` objects, regexes,
+ * sets, strings, symbols, and typed arrays. `Object` objects are compared
+ * by their own, not inherited, enumerable properties. Functions and DOM
+ * nodes are compared by strict equality, i.e. `===`.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to compare.
+ * @param {*} other The other value to compare.
+ * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+ * @example
+ *
+ * var object = { 'a': 1 };
+ * var other = { 'a': 1 };
+ *
+ * _.isEqual(object, other);
+ * // => true
+ *
+ * object === other;
+ * // => false
+ */
+function isEqual(value, other) {
+  return baseIsEqual(value, other);
+}
+
+exports.baseIsEqual = baseIsEqual;
+exports.isEqual = isEqual;
+//# sourceMappingURL=dep-a246b8d5.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-a246b8d5.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_arraySome.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_equalArrays.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_mapToArray.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_equalByTag.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_equalObjects.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsEqualDeep.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseIsEqual.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isEqual.js"],"sourcesContent":["/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nexport default arraySome;\n","import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalArrays;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nexport default mapToArray;\n","import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nexport default equalByTag;\n","import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalObjects;\n","import Stack from './_Stack.js';\nimport equalArrays from './_equalArrays.js';\nimport equalByTag from './_equalByTag.js';\nimport equalObjects from './_equalObjects.js';\nimport getTag from './_getTag.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nexport default baseIsEqualDeep;\n","import baseIsEqualDeep from './_baseIsEqualDeep.js';\nimport isObjectLike from './isObjectLike.js';\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nexport default baseIsEqual;\n","import baseIsEqual from './_baseIsEqual.js';\n\n/**\n * Performs a deep comparison between two values to determine if they are\n * equivalent.\n *\n * **Note:** This method supports comparing arrays, array buffers, booleans,\n * date objects, error objects, maps, numbers, `Object` objects, regexes,\n * sets, strings, symbols, and typed arrays. `Object` objects are compared\n * by their own, not inherited, enumerable properties. Functions and DOM\n * nodes are compared by strict equality, i.e. `===`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.isEqual(object, other);\n * // => true\n *\n * object === other;\n * // => false\n */\nfunction isEqual(value, other) {\n  return baseIsEqual(value, other);\n}\n\nexport default isEqual;\n"],"names":["arraySome","array","predicate","index","length","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","other","bitmask","customizer","equalFunc","stack","isPartial","arrLength","othLength","arrStacked","get","othStacked","result","seen","SetCache","undefined","set","arrValue","othValue","compared","othIndex","cacheHas","push","mapToArray","map","Array","size","forEach","value","key","boolTag","dateTag","errorTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","symbolProto","Symbol","prototype","symbolValueOf","valueOf","equalByTag","object","tag","byteLength","byteOffset","buffer","Uint8Array","eq","name","message","convert","setToArray","stacked","call","objectProto","Object","hasOwnProperty","equalObjects","objProps","getAllKeys","objLength","othProps","objStacked","skipCtor","objValue","objCtor","constructor","othCtor","argsTag","arrayTag","objectTag","baseIsEqualDeep","objIsArr","isArray","othIsArr","objTag","getTag","othTag","objIsObj","othIsObj","isSameTag","isBuffer","Stack","isTypedArray","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","baseIsEqual","isObjectLike","isEqual"],"mappings":";;;;;;;;;;;;;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASA,SAASA,CAACC,KAAK,EAAEC,SAAS,EAAE;EACnC,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGH,KAAK,IAAI,IAAI,GAAG,CAAC,GAAGA,KAAK,CAACG,MAAM,CAAA;AAE7C,EAAA,OAAO,EAAED,KAAK,GAAGC,MAAM,EAAE;IACvB,IAAIF,SAAS,CAACD,KAAK,CAACE,KAAK,CAAC,EAAEA,KAAK,EAAEF,KAAK,CAAC,EAAE;AACzC,MAAA,OAAO,IAAI,CAAA;AACb,KAAA;AACF,GAAA;AACA,EAAA,OAAO,KAAK,CAAA;AACd;;AChBA;AACA,IAAII,sBAAoB,GAAG,CAAC;AACxBC,EAAAA,wBAAsB,GAAG,CAAC,CAAA;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAACN,KAAK,EAAEO,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,EAAE;AACxE,EAAA,IAAIC,SAAS,GAAGJ,OAAO,GAAGJ,sBAAoB;IAC1CS,SAAS,GAAGb,KAAK,CAACG,MAAM;IACxBW,SAAS,GAAGP,KAAK,CAACJ,MAAM,CAAA;EAE5B,IAAIU,SAAS,IAAIC,SAAS,IAAI,EAAEF,SAAS,IAAIE,SAAS,GAAGD,SAAS,CAAC,EAAE;AACnE,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACA;AACA,EAAA,IAAIE,UAAU,GAAGJ,KAAK,CAACK,GAAG,CAAChB,KAAK,CAAC,CAAA;AACjC,EAAA,IAAIiB,UAAU,GAAGN,KAAK,CAACK,GAAG,CAACT,KAAK,CAAC,CAAA;EACjC,IAAIQ,UAAU,IAAIE,UAAU,EAAE;AAC5B,IAAA,OAAOF,UAAU,IAAIR,KAAK,IAAIU,UAAU,IAAIjB,KAAK,CAAA;AACnD,GAAA;EACA,IAAIE,KAAK,GAAG,CAAC,CAAC;AACVgB,IAAAA,MAAM,GAAG,IAAI;IACbC,IAAI,GAAIX,OAAO,GAAGH,wBAAsB,GAAI,IAAIe,kBAAQ,EAAA,GAAGC,SAAS,CAAA;AAExEV,EAAAA,KAAK,CAACW,GAAG,CAACtB,KAAK,EAAEO,KAAK,CAAC,CAAA;AACvBI,EAAAA,KAAK,CAACW,GAAG,CAACf,KAAK,EAAEP,KAAK,CAAC,CAAA;;AAEvB;AACA,EAAA,OAAO,EAAEE,KAAK,GAAGW,SAAS,EAAE;AAC1B,IAAA,IAAIU,QAAQ,GAAGvB,KAAK,CAACE,KAAK,CAAC;AACvBsB,MAAAA,QAAQ,GAAGjB,KAAK,CAACL,KAAK,CAAC,CAAA;AAE3B,IAAA,IAAIO,UAAU,EAAE;AACd,MAAA,IAAIgB,QAAQ,GAAGb,SAAS,GACpBH,UAAU,CAACe,QAAQ,EAAED,QAAQ,EAAErB,KAAK,EAAEK,KAAK,EAAEP,KAAK,EAAEW,KAAK,CAAC,GAC1DF,UAAU,CAACc,QAAQ,EAAEC,QAAQ,EAAEtB,KAAK,EAAEF,KAAK,EAAEO,KAAK,EAAEI,KAAK,CAAC,CAAA;AAChE,KAAA;IACA,IAAIc,QAAQ,KAAKJ,SAAS,EAAE;AAC1B,MAAA,IAAII,QAAQ,EAAE;AACZ,QAAA,SAAA;AACF,OAAA;AACAP,MAAAA,MAAM,GAAG,KAAK,CAAA;AACd,MAAA,MAAA;AACF,KAAA;AACA;AACA,IAAA,IAAIC,IAAI,EAAE;MACR,IAAI,CAACpB,SAAS,CAACQ,KAAK,EAAE,UAASiB,QAAQ,EAAEE,QAAQ,EAAE;QAC7C,IAAI,CAACC,kBAAQ,CAACR,IAAI,EAAEO,QAAQ,CAAC,KACxBH,QAAQ,KAAKC,QAAQ,IAAId,SAAS,CAACa,QAAQ,EAAEC,QAAQ,EAAEhB,OAAO,EAAEC,UAAU,EAAEE,KAAK,CAAC,CAAC,EAAE;AACxF,UAAA,OAAOQ,IAAI,CAACS,IAAI,CAACF,QAAQ,CAAC,CAAA;AAC5B,SAAA;AACF,OAAC,CAAC,EAAE;AACNR,QAAAA,MAAM,GAAG,KAAK,CAAA;AACd,QAAA,MAAA;AACF,OAAA;KACD,MAAM,IAAI,EACLK,QAAQ,KAAKC,QAAQ,IACnBd,SAAS,CAACa,QAAQ,EAAEC,QAAQ,EAAEhB,OAAO,EAAEC,UAAU,EAAEE,KAAK,CAAC,CAC5D,EAAE;AACLO,MAAAA,MAAM,GAAG,KAAK,CAAA;AACd,MAAA,MAAA;AACF,KAAA;AACF,GAAA;AACAP,EAAAA,KAAK,CAAC,QAAQ,CAAC,CAACX,KAAK,CAAC,CAAA;AACtBW,EAAAA,KAAK,CAAC,QAAQ,CAAC,CAACJ,KAAK,CAAC,CAAA;AACtB,EAAA,OAAOW,MAAM,CAAA;AACf;;ACjFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASW,UAAUA,CAACC,GAAG,EAAE;EACvB,IAAI5B,KAAK,GAAG,CAAC,CAAC;AACVgB,IAAAA,MAAM,GAAGa,KAAK,CAACD,GAAG,CAACE,IAAI,CAAC,CAAA;AAE5BF,EAAAA,GAAG,CAACG,OAAO,CAAC,UAASC,KAAK,EAAEC,GAAG,EAAE;IAC/BjB,MAAM,CAAC,EAAEhB,KAAK,CAAC,GAAG,CAACiC,GAAG,EAAED,KAAK,CAAC,CAAA;AAChC,GAAC,CAAC,CAAA;AACF,EAAA,OAAOhB,MAAM,CAAA;AACf;;ACRA;AACA,IAAId,sBAAoB,GAAG,CAAC;AACxBC,EAAAA,sBAAsB,GAAG,CAAC,CAAA;;AAE9B;AACA,IAAI+B,OAAO,GAAG,kBAAkB;AAC5BC,EAAAA,OAAO,GAAG,eAAe;AACzBC,EAAAA,QAAQ,GAAG,gBAAgB;AAC3BC,EAAAA,MAAM,GAAG,cAAc;AACvBC,EAAAA,SAAS,GAAG,iBAAiB;AAC7BC,EAAAA,SAAS,GAAG,iBAAiB;AAC7BC,EAAAA,MAAM,GAAG,cAAc;AACvBC,EAAAA,SAAS,GAAG,iBAAiB;AAC7BC,EAAAA,SAAS,GAAG,iBAAiB,CAAA;AAEjC,IAAIC,cAAc,GAAG,sBAAsB;AACvCC,EAAAA,WAAW,GAAG,mBAAmB,CAAA;;AAErC;AACA,IAAIC,WAAW,GAAGC,mBAAM,GAAGA,mBAAM,CAACC,SAAS,GAAG5B,SAAS;AACnD6B,EAAAA,aAAa,GAAGH,WAAW,GAAGA,WAAW,CAACI,OAAO,GAAG9B,SAAS,CAAA;;AAEjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS+B,UAAUA,CAACC,MAAM,EAAE9C,KAAK,EAAE+C,GAAG,EAAE9C,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,EAAE;AAC7E,EAAA,QAAQ2C,GAAG;AACT,IAAA,KAAKR,WAAW;AACd,MAAA,IAAKO,MAAM,CAACE,UAAU,IAAIhD,KAAK,CAACgD,UAAU,IACrCF,MAAM,CAACG,UAAU,IAAIjD,KAAK,CAACiD,UAAW,EAAE;AAC3C,QAAA,OAAO,KAAK,CAAA;AACd,OAAA;MACAH,MAAM,GAAGA,MAAM,CAACI,MAAM,CAAA;MACtBlD,KAAK,GAAGA,KAAK,CAACkD,MAAM,CAAA;AAEtB,IAAA,KAAKZ,cAAc;MACjB,IAAKQ,MAAM,CAACE,UAAU,IAAIhD,KAAK,CAACgD,UAAU,IACtC,CAAC7C,SAAS,CAAC,IAAIgD,2BAAU,CAACL,MAAM,CAAC,EAAE,IAAIK,2BAAU,CAACnD,KAAK,CAAC,CAAC,EAAE;AAC7D,QAAA,OAAO,KAAK,CAAA;AACd,OAAA;AACA,MAAA,OAAO,IAAI,CAAA;AAEb,IAAA,KAAK6B,OAAO,CAAA;AACZ,IAAA,KAAKC,OAAO,CAAA;AACZ,IAAA,KAAKG,SAAS;AACZ;AACA;AACA,MAAA,OAAOmB,YAAE,CAAC,CAACN,MAAM,EAAE,CAAC9C,KAAK,CAAC,CAAA;AAE5B,IAAA,KAAK+B,QAAQ;AACX,MAAA,OAAOe,MAAM,CAACO,IAAI,IAAIrD,KAAK,CAACqD,IAAI,IAAIP,MAAM,CAACQ,OAAO,IAAItD,KAAK,CAACsD,OAAO,CAAA;AAErE,IAAA,KAAKpB,SAAS,CAAA;AACd,IAAA,KAAKE,SAAS;AACZ;AACA;AACA;AACA,MAAA,OAAOU,MAAM,IAAK9C,KAAK,GAAG,EAAG,CAAA;AAE/B,IAAA,KAAKgC,MAAM;MACT,IAAIuB,OAAO,GAAGjC,UAAU,CAAA;AAE1B,IAAA,KAAKa,MAAM;AACT,MAAA,IAAI9B,SAAS,GAAGJ,OAAO,GAAGJ,sBAAoB,CAAA;AAC9C0D,MAAAA,OAAO,KAAKA,OAAO,GAAGC,sBAAU,CAAC,CAAA;MAEjC,IAAIV,MAAM,CAACrB,IAAI,IAAIzB,KAAK,CAACyB,IAAI,IAAI,CAACpB,SAAS,EAAE;AAC3C,QAAA,OAAO,KAAK,CAAA;AACd,OAAA;AACA;AACA,MAAA,IAAIoD,OAAO,GAAGrD,KAAK,CAACK,GAAG,CAACqC,MAAM,CAAC,CAAA;AAC/B,MAAA,IAAIW,OAAO,EAAE;QACX,OAAOA,OAAO,IAAIzD,KAAK,CAAA;AACzB,OAAA;AACAC,MAAAA,OAAO,IAAIH,sBAAsB,CAAA;;AAEjC;AACAM,MAAAA,KAAK,CAACW,GAAG,CAAC+B,MAAM,EAAE9C,KAAK,CAAC,CAAA;MACxB,IAAIW,MAAM,GAAGZ,WAAW,CAACwD,OAAO,CAACT,MAAM,CAAC,EAAES,OAAO,CAACvD,KAAK,CAAC,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,CAAC,CAAA;AAChGA,MAAAA,KAAK,CAAC,QAAQ,CAAC,CAAC0C,MAAM,CAAC,CAAA;AACvB,MAAA,OAAOnC,MAAM,CAAA;AAEf,IAAA,KAAK0B,SAAS;AACZ,MAAA,IAAIM,aAAa,EAAE;AACjB,QAAA,OAAOA,aAAa,CAACe,IAAI,CAACZ,MAAM,CAAC,IAAIH,aAAa,CAACe,IAAI,CAAC1D,KAAK,CAAC,CAAA;AAChE,OAAA;AACJ,GAAA;AACA,EAAA,OAAO,KAAK,CAAA;AACd;;AC3GA;AACA,IAAIH,sBAAoB,GAAG,CAAC,CAAA;;AAE5B;AACA,IAAI8D,aAAW,GAAGC,MAAM,CAAClB,SAAS,CAAA;;AAElC;AACA,IAAImB,gBAAc,GAAGF,aAAW,CAACE,cAAc,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,YAAYA,CAAChB,MAAM,EAAE9C,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,EAAE;AAC1E,EAAA,IAAIC,SAAS,GAAGJ,OAAO,GAAGJ,sBAAoB;AAC1CkE,IAAAA,QAAQ,GAAGC,qBAAU,CAAClB,MAAM,CAAC;IAC7BmB,SAAS,GAAGF,QAAQ,CAACnE,MAAM;AAC3BsE,IAAAA,QAAQ,GAAGF,qBAAU,CAAChE,KAAK,CAAC;IAC5BO,SAAS,GAAG2D,QAAQ,CAACtE,MAAM,CAAA;AAE/B,EAAA,IAAIqE,SAAS,IAAI1D,SAAS,IAAI,CAACF,SAAS,EAAE;AACxC,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;EACA,IAAIV,KAAK,GAAGsE,SAAS,CAAA;EACrB,OAAOtE,KAAK,EAAE,EAAE;AACd,IAAA,IAAIiC,GAAG,GAAGmC,QAAQ,CAACpE,KAAK,CAAC,CAAA;AACzB,IAAA,IAAI,EAAEU,SAAS,GAAGuB,GAAG,IAAI5B,KAAK,GAAG6D,gBAAc,CAACH,IAAI,CAAC1D,KAAK,EAAE4B,GAAG,CAAC,CAAC,EAAE;AACjE,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AACF,GAAA;AACA;AACA,EAAA,IAAIuC,UAAU,GAAG/D,KAAK,CAACK,GAAG,CAACqC,MAAM,CAAC,CAAA;AAClC,EAAA,IAAIpC,UAAU,GAAGN,KAAK,CAACK,GAAG,CAACT,KAAK,CAAC,CAAA;EACjC,IAAImE,UAAU,IAAIzD,UAAU,EAAE;AAC5B,IAAA,OAAOyD,UAAU,IAAInE,KAAK,IAAIU,UAAU,IAAIoC,MAAM,CAAA;AACpD,GAAA;EACA,IAAInC,MAAM,GAAG,IAAI,CAAA;AACjBP,EAAAA,KAAK,CAACW,GAAG,CAAC+B,MAAM,EAAE9C,KAAK,CAAC,CAAA;AACxBI,EAAAA,KAAK,CAACW,GAAG,CAACf,KAAK,EAAE8C,MAAM,CAAC,CAAA;EAExB,IAAIsB,QAAQ,GAAG/D,SAAS,CAAA;AACxB,EAAA,OAAO,EAAEV,KAAK,GAAGsE,SAAS,EAAE;AAC1BrC,IAAAA,GAAG,GAAGmC,QAAQ,CAACpE,KAAK,CAAC,CAAA;AACrB,IAAA,IAAI0E,QAAQ,GAAGvB,MAAM,CAAClB,GAAG,CAAC;AACtBX,MAAAA,QAAQ,GAAGjB,KAAK,CAAC4B,GAAG,CAAC,CAAA;AAEzB,IAAA,IAAI1B,UAAU,EAAE;AACd,MAAA,IAAIgB,QAAQ,GAAGb,SAAS,GACpBH,UAAU,CAACe,QAAQ,EAAEoD,QAAQ,EAAEzC,GAAG,EAAE5B,KAAK,EAAE8C,MAAM,EAAE1C,KAAK,CAAC,GACzDF,UAAU,CAACmE,QAAQ,EAAEpD,QAAQ,EAAEW,GAAG,EAAEkB,MAAM,EAAE9C,KAAK,EAAEI,KAAK,CAAC,CAAA;AAC/D,KAAA;AACA;IACA,IAAI,EAAEc,QAAQ,KAAKJ,SAAS,GACnBuD,QAAQ,KAAKpD,QAAQ,IAAId,SAAS,CAACkE,QAAQ,EAAEpD,QAAQ,EAAEhB,OAAO,EAAEC,UAAU,EAAEE,KAAK,CAAC,GACnFc,QAAQ,CACX,EAAE;AACLP,MAAAA,MAAM,GAAG,KAAK,CAAA;AACd,MAAA,MAAA;AACF,KAAA;AACAyD,IAAAA,QAAQ,KAAKA,QAAQ,GAAGxC,GAAG,IAAI,aAAa,CAAC,CAAA;AAC/C,GAAA;AACA,EAAA,IAAIjB,MAAM,IAAI,CAACyD,QAAQ,EAAE;AACvB,IAAA,IAAIE,OAAO,GAAGxB,MAAM,CAACyB,WAAW;MAC5BC,OAAO,GAAGxE,KAAK,CAACuE,WAAW,CAAA;;AAE/B;AACA,IAAA,IAAID,OAAO,IAAIE,OAAO,IACjB,aAAa,IAAI1B,MAAM,IAAI,aAAa,IAAI9C,KAAM,IACnD,EAAE,OAAOsE,OAAO,IAAI,UAAU,IAAIA,OAAO,YAAYA,OAAO,IAC1D,OAAOE,OAAO,IAAI,UAAU,IAAIA,OAAO,YAAYA,OAAO,CAAC,EAAE;AACjE7D,MAAAA,MAAM,GAAG,KAAK,CAAA;AAChB,KAAA;AACF,GAAA;AACAP,EAAAA,KAAK,CAAC,QAAQ,CAAC,CAAC0C,MAAM,CAAC,CAAA;AACvB1C,EAAAA,KAAK,CAAC,QAAQ,CAAC,CAACJ,KAAK,CAAC,CAAA;AACtB,EAAA,OAAOW,MAAM,CAAA;AACf;;AC9EA;AACA,IAAId,oBAAoB,GAAG,CAAC,CAAA;;AAE5B;AACA,IAAI4E,OAAO,GAAG,oBAAoB;AAC9BC,EAAAA,QAAQ,GAAG,gBAAgB;AAC3BC,EAAAA,SAAS,GAAG,iBAAiB,CAAA;;AAEjC;AACA,IAAIhB,WAAW,GAAGC,MAAM,CAAClB,SAAS,CAAA;;AAElC;AACA,IAAImB,cAAc,GAAGF,WAAW,CAACE,cAAc,CAAA;;AAE/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASe,eAAeA,CAAC9B,MAAM,EAAE9C,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,EAAE;AAC7E,EAAA,IAAIyE,QAAQ,GAAGC,eAAO,CAAChC,MAAM,CAAC;AAC1BiC,IAAAA,QAAQ,GAAGD,eAAO,CAAC9E,KAAK,CAAC;IACzBgF,MAAM,GAAGH,QAAQ,GAAGH,QAAQ,GAAGO,cAAM,CAACnC,MAAM,CAAC;IAC7CoC,MAAM,GAAGH,QAAQ,GAAGL,QAAQ,GAAGO,cAAM,CAACjF,KAAK,CAAC,CAAA;AAEhDgF,EAAAA,MAAM,GAAGA,MAAM,IAAIP,OAAO,GAAGE,SAAS,GAAGK,MAAM,CAAA;AAC/CE,EAAAA,MAAM,GAAGA,MAAM,IAAIT,OAAO,GAAGE,SAAS,GAAGO,MAAM,CAAA;AAE/C,EAAA,IAAIC,QAAQ,GAAGH,MAAM,IAAIL,SAAS;IAC9BS,QAAQ,GAAGF,MAAM,IAAIP,SAAS;IAC9BU,SAAS,GAAGL,MAAM,IAAIE,MAAM,CAAA;AAEhC,EAAA,IAAIG,SAAS,IAAIC,iBAAQ,CAACxC,MAAM,CAAC,EAAE;AACjC,IAAA,IAAI,CAACwC,iBAAQ,CAACtF,KAAK,CAAC,EAAE;AACpB,MAAA,OAAO,KAAK,CAAA;AACd,KAAA;AACA6E,IAAAA,QAAQ,GAAG,IAAI,CAAA;AACfM,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAClB,GAAA;AACA,EAAA,IAAIE,SAAS,IAAI,CAACF,QAAQ,EAAE;AAC1B/E,IAAAA,KAAK,KAAKA,KAAK,GAAG,IAAImF,sBAAK,EAAA,CAAC,CAAA;AAC5B,IAAA,OAAQV,QAAQ,IAAIW,qBAAY,CAAC1C,MAAM,CAAC,GACpC/C,WAAW,CAAC+C,MAAM,EAAE9C,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,CAAC,GACjEyC,UAAU,CAACC,MAAM,EAAE9C,KAAK,EAAEgF,MAAM,EAAE/E,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,CAAC,CAAA;AAC9E,GAAA;AACA,EAAA,IAAI,EAAEH,OAAO,GAAGJ,oBAAoB,CAAC,EAAE;IACrC,IAAI4F,YAAY,GAAGN,QAAQ,IAAItB,cAAc,CAACH,IAAI,CAACZ,MAAM,EAAE,aAAa,CAAC;MACrE4C,YAAY,GAAGN,QAAQ,IAAIvB,cAAc,CAACH,IAAI,CAAC1D,KAAK,EAAE,aAAa,CAAC,CAAA;IAExE,IAAIyF,YAAY,IAAIC,YAAY,EAAE;MAChC,IAAIC,YAAY,GAAGF,YAAY,GAAG3C,MAAM,CAACnB,KAAK,EAAE,GAAGmB,MAAM;QACrD8C,YAAY,GAAGF,YAAY,GAAG1F,KAAK,CAAC2B,KAAK,EAAE,GAAG3B,KAAK,CAAA;AAEvDI,MAAAA,KAAK,KAAKA,KAAK,GAAG,IAAImF,sBAAK,EAAA,CAAC,CAAA;MAC5B,OAAOpF,SAAS,CAACwF,YAAY,EAAEC,YAAY,EAAE3F,OAAO,EAAEC,UAAU,EAAEE,KAAK,CAAC,CAAA;AAC1E,KAAA;AACF,GAAA;EACA,IAAI,CAACiF,SAAS,EAAE;AACd,IAAA,OAAO,KAAK,CAAA;AACd,GAAA;AACAjF,EAAAA,KAAK,KAAKA,KAAK,GAAG,IAAImF,sBAAK,EAAA,CAAC,CAAA;AAC5B,EAAA,OAAOzB,YAAY,CAAChB,MAAM,EAAE9C,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEC,SAAS,EAAEC,KAAK,CAAC,CAAA;AAC3E;;AC7EA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASyF,WAAWA,CAAClE,KAAK,EAAE3B,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAEE,KAAK,EAAE;EAC7D,IAAIuB,KAAK,KAAK3B,KAAK,EAAE;AACnB,IAAA,OAAO,IAAI,CAAA;AACb,GAAA;AACA,EAAA,IAAI2B,KAAK,IAAI,IAAI,IAAI3B,KAAK,IAAI,IAAI,IAAK,CAAC8F,yBAAY,CAACnE,KAAK,CAAC,IAAI,CAACmE,yBAAY,CAAC9F,KAAK,CAAE,EAAE;AACpF,IAAA,OAAO2B,KAAK,KAAKA,KAAK,IAAI3B,KAAK,KAAKA,KAAK,CAAA;AAC3C,GAAA;AACA,EAAA,OAAO4E,eAAe,CAACjD,KAAK,EAAE3B,KAAK,EAAEC,OAAO,EAAEC,UAAU,EAAE2F,WAAW,EAAEzF,KAAK,CAAC,CAAA;AAC/E;;ACvBA;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,SAAS2F,OAAOA,CAACpE,KAAK,EAAE3B,KAAK,EAAE;AAC7B,EAAA,OAAO6F,WAAW,CAAClE,KAAK,EAAE3B,KAAK,CAAC,CAAA;AAClC;;;;;"}

package/cjs/_chunks/dep-a61cd56e.js

@@ -0,0 +1,77 @@
+/**
+ * tdesign v1.10.7
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _MapCache = require('./dep-4405f5d6.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(value) {
+  this.__data__.set(value, HASH_UNDEFINED);
+  return this;
+}
+
+/**
+ * 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(value) {
+  return this.__data__.has(value);
+}
+
+/**
+ *
+ * Creates an array cache object to store unique values.
+ *
+ * @private
+ * @constructor
+ * @param {Array} [values] The values to cache.
+ */
+function SetCache(values) {
+  var index = -1,
+    length = values == null ? 0 : values.length;
+  this.__data__ = new _MapCache.MapCache();
+  while (++index < length) {
+    this.add(values[index]);
+  }
+}
+
+// Add methods to `SetCache`.
+SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
+SetCache.prototype.has = setCacheHas;
+
+/**
+ * Checks if a `cache` value for `key` exists.
+ *
+ * @private
+ * @param {Object} cache The cache to query.
+ * @param {string} key The key of the entry to check.
+ * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+ */
+function cacheHas(cache, key) {
+  return cache.has(key);
+}
+
+exports.SetCache = SetCache;
+exports.cacheHas = cacheHas;
+//# sourceMappingURL=dep-a61cd56e.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"dep-a61cd56e.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setCacheAdd.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setCacheHas.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_SetCache.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_cacheHas.js"],"sourcesContent":["/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nexport default 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\nexport default setCacheHas;\n","import MapCache from './_MapCache.js';\nimport setCacheAdd from './_setCacheAdd.js';\nimport setCacheHas from './_setCacheHas.js';\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\nexport default SetCache;\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\nexport default cacheHas;\n"],"names":["HASH_UNDEFINED","setCacheAdd","value","__data__","set","setCacheHas","has","SetCache","values","index","length","MapCache","add","prototype","push","cacheHas","cache","key"],"mappings":";;;;;;;;;;AAAA;AACA,IAAIA,cAAc,GAAG,2BAA2B,CAAA;;AAEhD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,WAAWA,CAACC,KAAK,EAAE;EAC1B,IAAI,CAACC,QAAQ,CAACC,GAAG,CAACF,KAAK,EAAEF,cAAc,CAAC,CAAA;AACxC,EAAA,OAAO,IAAI,CAAA;AACb;;AChBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASK,WAAWA,CAACH,KAAK,EAAE;AAC1B,EAAA,OAAO,IAAI,CAACC,QAAQ,CAACG,GAAG,CAACJ,KAAK,CAAC,CAAA;AACjC;;ACPA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASK,QAAQA,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,CAACP,QAAQ,GAAG,IAAIQ,kBAAQ,EAAA,CAAA;AAC5B,EAAA,OAAO,EAAEF,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAI,CAACE,GAAG,CAACJ,MAAM,CAACC,KAAK,CAAC,CAAC,CAAA;AACzB,GAAA;AACF,CAAA;;AAEA;AACAF,QAAQ,CAACM,SAAS,CAACD,GAAG,GAAGL,QAAQ,CAACM,SAAS,CAACC,IAAI,GAAGb,WAAW,CAAA;AAC9DM,QAAQ,CAACM,SAAS,CAACP,GAAG,GAAGD,WAAW;;ACxBpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASU,QAAQA,CAACC,KAAK,EAAEC,GAAG,EAAE;AAC5B,EAAA,OAAOD,KAAK,CAACV,GAAG,CAACW,GAAG,CAAC,CAAA;AACvB;;;;;"}