tdesign-react 1.15.5-alpha.2 → 1.15.5

package/cjs/_chunks/dep-73852df6.js

@@ -0,0 +1,178 @@
+/**
+ * tdesign v1.15.5
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _defineProperty = require('./dep-6ab5433b.js');
+
+/**
+ * This method returns the first argument it receives.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Util
+ * @param {*} value Any value.
+ * @returns {*} Returns `value`.
+ * @example
+ *
+ * var object = { 'a': 1 };
+ *
+ * console.log(_.identity(object) === object);
+ * // => true
+ */
+function identity(value) {
+  return value;
+}
+
+/**
+ * A faster alternative to `Function#apply`, this function invokes `func`
+ * with the `this` binding of `thisArg` and the arguments of `args`.
+ *
+ * @private
+ * @param {Function} func The function to invoke.
+ * @param {*} thisArg The `this` binding of `func`.
+ * @param {Array} args The arguments to invoke `func` with.
+ * @returns {*} Returns the result of `func`.
+ */
+function apply(func, thisArg, args) {
+  switch (args.length) {
+    case 0:
+      return func.call(thisArg);
+    case 1:
+      return func.call(thisArg, args[0]);
+    case 2:
+      return func.call(thisArg, args[0], args[1]);
+    case 3:
+      return func.call(thisArg, args[0], args[1], args[2]);
+  }
+  return func.apply(thisArg, args);
+}
+
+/** Used to detect hot functions by number of calls within a span of milliseconds. */
+var HOT_COUNT = 800,
+  HOT_SPAN = 16;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeNow = Date.now;
+
+/**
+ * Creates a function that'll short out and invoke `identity` instead
+ * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`
+ * milliseconds.
+ *
+ * @private
+ * @param {Function} func The function to restrict.
+ * @returns {Function} Returns the new shortable function.
+ */
+function shortOut(func) {
+  var count = 0,
+    lastCalled = 0;
+  return function () {
+    var stamp = nativeNow(),
+      remaining = HOT_SPAN - (stamp - lastCalled);
+    lastCalled = stamp;
+    if (remaining > 0) {
+      if (++count >= HOT_COUNT) {
+        return arguments[0];
+      }
+    } else {
+      count = 0;
+    }
+    return func.apply(undefined, arguments);
+  };
+}
+
+/**
+ * Creates a function that returns `value`.
+ *
+ * @static
+ * @memberOf _
+ * @since 2.4.0
+ * @category Util
+ * @param {*} value The value to return from the new function.
+ * @returns {Function} Returns the new constant function.
+ * @example
+ *
+ * var objects = _.times(2, _.constant({ 'a': 1 }));
+ *
+ * console.log(objects);
+ * // => [{ 'a': 1 }, { 'a': 1 }]
+ *
+ * console.log(objects[0] === objects[1]);
+ * // => true
+ */
+function constant(value) {
+  return function () {
+    return value;
+  };
+}
+
+/**
+ * The base implementation of `setToString` without support for hot loop shorting.
+ *
+ * @private
+ * @param {Function} func The function to modify.
+ * @param {Function} string The `toString` result.
+ * @returns {Function} Returns `func`.
+ */
+var baseSetToString = !_defineProperty.defineProperty ? identity : function (func, string) {
+  return _defineProperty.defineProperty(func, 'toString', {
+    'configurable': true,
+    'enumerable': false,
+    'value': constant(string),
+    'writable': true
+  });
+};
+var baseSetToString$1 = baseSetToString;
+
+/**
+ * Sets the `toString` method of `func` to return `string`.
+ *
+ * @private
+ * @param {Function} func The function to modify.
+ * @param {Function} string The `toString` result.
+ * @returns {Function} Returns `func`.
+ */
+var setToString = shortOut(baseSetToString$1);
+var setToString$1 = setToString;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max;
+
+/**
+ * A specialized version of `baseRest` which transforms the rest array.
+ *
+ * @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.
+ * @param {Function} transform The rest array transform.
+ * @returns {Function} Returns the new function.
+ */
+function overRest(func, start, transform) {
+  start = nativeMax(start === undefined ? func.length - 1 : start, 0);
+  return function () {
+    var args = arguments,
+      index = -1,
+      length = nativeMax(args.length - start, 0),
+      array = Array(length);
+    while (++index < length) {
+      array[index] = args[start + index];
+    }
+    index = -1;
+    var otherArgs = Array(start + 1);
+    while (++index < start) {
+      otherArgs[index] = args[index];
+    }
+    otherArgs[start] = transform(array);
+    return apply(func, this, otherArgs);
+  };
+}
+
+exports.identity = identity;
+exports.overRest = overRest;
+exports.setToString = setToString$1;
+//# sourceMappingURL=dep-73852df6.js.map

package/cjs/_chunks/dep-73852df6.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-73852df6.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/identity.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_apply.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_shortOut.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/constant.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseSetToString.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_setToString.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_overRest.js"],"sourcesContent":["/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nexport default identity;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nexport default apply;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nexport default shortOut;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nexport default constant;\n","import constant from './constant.js';\nimport defineProperty from './_defineProperty.js';\nimport identity from './identity.js';\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nexport default baseSetToString;\n","import baseSetToString from './_baseSetToString.js';\nimport shortOut from './_shortOut.js';\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nexport default setToString;\n","import apply from './_apply.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\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 * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nexport default overRest;\n"],"names":["identity","value","apply","func","thisArg","args","length","call","HOT_COUNT","HOT_SPAN","nativeNow","Date","now","shortOut","count","lastCalled","stamp","remaining","arguments","undefined","constant","baseSetToString","defineProperty","string","setToString","nativeMax","Math","max","overRest","start","transform","index","array","Array","otherArgs"],"mappings":";;;;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASA,QAAQA,CAACC,KAAK,EAAE;AACvB,EAAA,OAAOA,KAAK,CAAA;AACd;;AClBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,KAAKA,CAACC,IAAI,EAAEC,OAAO,EAAEC,IAAI,EAAE;EAClC,QAAQA,IAAI,CAACC,MAAM;AACjB,IAAA,KAAK,CAAC;AAAE,MAAA,OAAOH,IAAI,CAACI,IAAI,CAACH,OAAO,CAAC,CAAA;AACjC,IAAA,KAAK,CAAC;MAAE,OAAOD,IAAI,CAACI,IAAI,CAACH,OAAO,EAAEC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AAC1C,IAAA,KAAK,CAAC;AAAE,MAAA,OAAOF,IAAI,CAACI,IAAI,CAACH,OAAO,EAAEC,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AACnD,IAAA,KAAK,CAAC;MAAE,OAAOF,IAAI,CAACI,IAAI,CAACH,OAAO,EAAEC,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,EAAEA,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9D,GAAA;AACA,EAAA,OAAOF,IAAI,CAACD,KAAK,CAACE,OAAO,EAAEC,IAAI,CAAC,CAAA;AAClC;;AClBA;AACA,IAAIG,SAAS,GAAG,GAAG;AACfC,EAAAA,QAAQ,GAAG,EAAE,CAAA;;AAEjB;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAAG,CAAA;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQA,CAACV,IAAI,EAAE;EACtB,IAAIW,KAAK,GAAG,CAAC;AACTC,IAAAA,UAAU,GAAG,CAAC,CAAA;AAElB,EAAA,OAAO,YAAW;AAChB,IAAA,IAAIC,KAAK,GAAGN,SAAS,EAAE;AACnBO,MAAAA,SAAS,GAAGR,QAAQ,IAAIO,KAAK,GAAGD,UAAU,CAAC,CAAA;AAE/CA,IAAAA,UAAU,GAAGC,KAAK,CAAA;IAClB,IAAIC,SAAS,GAAG,CAAC,EAAE;AACjB,MAAA,IAAI,EAAEH,KAAK,IAAIN,SAAS,EAAE;QACxB,OAAOU,SAAS,CAAC,CAAC,CAAC,CAAA;AACrB,OAAA;AACF,KAAC,MAAM;AACLJ,MAAAA,KAAK,GAAG,CAAC,CAAA;AACX,KAAA;AACA,IAAA,OAAOX,IAAI,CAACD,KAAK,CAACiB,SAAS,EAAED,SAAS,CAAC,CAAA;GACxC,CAAA;AACH;;AClCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,QAAQA,CAACnB,KAAK,EAAE;AACvB,EAAA,OAAO,YAAW;AAChB,IAAA,OAAOA,KAAK,CAAA;GACb,CAAA;AACH;;ACnBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIoB,eAAe,GAAG,CAACC,8BAAc,GAAGtB,QAAQ,GAAG,UAASG,IAAI,EAAEoB,MAAM,EAAE;AACxE,EAAA,OAAOD,8BAAc,CAACnB,IAAI,EAAE,UAAU,EAAE;AACtC,IAAA,cAAc,EAAE,IAAI;AACpB,IAAA,YAAY,EAAE,KAAK;AACnB,IAAA,OAAO,EAAEiB,QAAQ,CAACG,MAAM,CAAC;AACzB,IAAA,UAAU,EAAE,IAAA;AACd,GAAC,CAAC,CAAA;AACJ,CAAC,CAAA;AAED,wBAAeF,eAAe;;AClB9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIG,WAAW,GAAGX,QAAQ,CAACQ,iBAAe,CAAC,CAAA;AAE3C,oBAAeG,WAAW;;ACX1B;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAAG,CAAA;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQA,CAACzB,IAAI,EAAE0B,KAAK,EAAEC,SAAS,EAAE;AACxCD,EAAAA,KAAK,GAAGJ,SAAS,CAACI,KAAK,KAAKV,SAAS,GAAIhB,IAAI,CAACG,MAAM,GAAG,CAAC,GAAIuB,KAAK,EAAE,CAAC,CAAC,CAAA;AACrE,EAAA,OAAO,YAAW;IAChB,IAAIxB,IAAI,GAAGa,SAAS;MAChBa,KAAK,GAAG,CAAC,CAAC;MACVzB,MAAM,GAAGmB,SAAS,CAACpB,IAAI,CAACC,MAAM,GAAGuB,KAAK,EAAE,CAAC,CAAC;AAC1CG,MAAAA,KAAK,GAAGC,KAAK,CAAC3B,MAAM,CAAC,CAAA;AAEzB,IAAA,OAAO,EAAEyB,KAAK,GAAGzB,MAAM,EAAE;MACvB0B,KAAK,CAACD,KAAK,CAAC,GAAG1B,IAAI,CAACwB,KAAK,GAAGE,KAAK,CAAC,CAAA;AACpC,KAAA;IACAA,KAAK,GAAG,CAAC,CAAC,CAAA;AACV,IAAA,IAAIG,SAAS,GAAGD,KAAK,CAACJ,KAAK,GAAG,CAAC,CAAC,CAAA;AAChC,IAAA,OAAO,EAAEE,KAAK,GAAGF,KAAK,EAAE;AACtBK,MAAAA,SAAS,CAACH,KAAK,CAAC,GAAG1B,IAAI,CAAC0B,KAAK,CAAC,CAAA;AAChC,KAAA;AACAG,IAAAA,SAAS,CAACL,KAAK,CAAC,GAAGC,SAAS,CAACE,KAAK,CAAC,CAAA;AACnC,IAAA,OAAO9B,KAAK,CAACC,IAAI,EAAE,IAAI,EAAE+B,SAAS,CAAC,CAAA;GACpC,CAAA;AACH;;;;;;"}

package/cjs/_chunks/dep-744578a9.js

@@ -0,0 +1,42 @@
+/**
+ * tdesign v1.15.5
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _typeof = require('./dep-37731805.js');
+
+/**
+ * Checks if `value` is the
+ * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)
+ * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an object, else `false`.
+ * @example
+ *
+ * _.isObject({});
+ * // => true
+ *
+ * _.isObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isObject(_.noop);
+ * // => true
+ *
+ * _.isObject(null);
+ * // => false
+ */
+function isObject(value) {
+  var type = _typeof._typeof(value);
+  return value != null && (type == 'object' || type == 'function');
+}
+
+exports.isObject = isObject;
+//# sourceMappingURL=dep-744578a9.js.map

package/cjs/_chunks/dep-744578a9.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-744578a9.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/isObject.js"],"sourcesContent":["/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n"],"names":["isObject","value","type","_typeof"],"mappings":";;;;;;;;;;AAAA;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,SAASA,QAAQA,CAACC,KAAK,EAAE;AACvB,EAAA,IAAIC,IAAI,GAAAC,eAAA,CAAUF,KAAK,CAAA,CAAA;EACvB,OAAOA,KAAK,IAAI,IAAI,KAAKC,IAAI,IAAI,QAAQ,IAAIA,IAAI,IAAI,UAAU,CAAC,CAAA;AAClE;;;;"}

package/cjs/_chunks/dep-769e1555.js

@@ -0,0 +1,103 @@
+/**
+ * tdesign v1.15.5
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var toString = require('./dep-8babe9c4.js');
+var _cacheHas = require('./dep-42148a4e.js');
+var _arrayIncludesWith = require('./dep-5eda7bd5.js');
+var _baseUnary = require('./dep-1a178001.js');
+var isArrayLikeObject = require('./dep-9df1169f.js');
+
+/* 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(arrays, iteratee, comparator) {
+  var includes = comparator ? _arrayIncludesWith.arrayIncludesWith : _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 = toString.arrayMap(array, _baseUnary.baseUnary(iteratee));
+    }
+    maxLength = nativeMin(array.length, maxLength);
+    caches[othIndex] = !comparator && (iteratee || length >= 120 && array.length >= 120) ? new _cacheHas.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.cacheHas(seen, computed) : includes(result, computed, comparator))) {
+      othIndex = othLength;
+      while (--othIndex) {
+        var cache = caches[othIndex];
+        if (!(cache ? _cacheHas.cacheHas(cache, computed) : includes(arrays[othIndex], computed, comparator))) {
+          continue outer;
+        }
+      }
+      if (seen) {
+        seen.push(computed);
+      }
+      result.push(value);
+    }
+  }
+  return result;
+}
+
+/**
+ * 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(value) {
+  return isArrayLikeObject.isArrayLikeObject(value) ? value : [];
+}
+
+/**
+ * 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 = isArrayLikeObject.baseRest(function (arrays) {
+  var mapped = toString.arrayMap(arrays, castArrayLikeObject);
+  return mapped.length && mapped[0] === arrays[0] ? baseIntersection(mapped) : [];
+});
+var intersection$1 = intersection;
+
+exports.intersection = intersection$1;
+//# sourceMappingURL=dep-769e1555.js.map

package/cjs/_chunks/dep-769e1555.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-769e1555.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-7890a496.js

@@ -0,0 +1,29 @@
+/**
+ * tdesign v1.15.5
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var defineProperty = require('./dep-b351de41.js');
+
+function _classCallCheck(a, n) {
+  if (!(a instanceof n)) throw new TypeError("Cannot call a class as a function");
+}
+
+function _defineProperties(e, r) {
+  for (var t = 0; t < r.length; t++) {
+    var o = r[t];
+    o.enumerable = o.enumerable || !1, o.configurable = !0, "value" in o && (o.writable = !0), Object.defineProperty(e, defineProperty.toPropertyKey(o.key), o);
+  }
+}
+function _createClass(e, r, t) {
+  return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, "prototype", {
+    writable: !1
+  }), e;
+}
+
+exports._classCallCheck = _classCallCheck;
+exports._createClass = _createClass;
+//# sourceMappingURL=dep-7890a496.js.map

package/cjs/_chunks/dep-7890a496.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-7890a496.js","sources":["../../../../node_modules/.pnpm/@babel+runtime@7.26.10/node_modules/@babel/runtime/helpers/esm/classCallCheck.js","../../../../node_modules/.pnpm/@babel+runtime@7.26.10/node_modules/@babel/runtime/helpers/esm/createClass.js"],"sourcesContent":["function _classCallCheck(a, n) {\n  if (!(a instanceof n)) throw new TypeError(\"Cannot call a class as a function\");\n}\nexport { _classCallCheck as default };","import toPropertyKey from \"./toPropertyKey.js\";\nfunction _defineProperties(e, r) {\n  for (var t = 0; t < r.length; t++) {\n    var o = r[t];\n    o.enumerable = o.enumerable || !1, o.configurable = !0, \"value\" in o && (o.writable = !0), Object.defineProperty(e, toPropertyKey(o.key), o);\n  }\n}\nfunction _createClass(e, r, t) {\n  return r && _defineProperties(e.prototype, r), t && _defineProperties(e, t), Object.defineProperty(e, \"prototype\", {\n    writable: !1\n  }), e;\n}\nexport { _createClass as default };"],"names":["_classCallCheck","a","n","TypeError","_defineProperties","e","r","t","length","o","enumerable","configurable","writable","Object","defineProperty","toPropertyKey","key","_createClass","prototype"],"mappings":";;;;;;;;;;AAAA,SAASA,eAAeA,CAACC,CAAC,EAAEC,CAAC,EAAE;EAC7B,IAAI,EAAED,CAAC,YAAYC,CAAC,CAAC,EAAE,MAAM,IAAIC,SAAS,CAAC,mCAAmC,CAAC,CAAA;AACjF;;ACDA,SAASC,iBAAiBA,CAACC,CAAC,EAAEC,CAAC,EAAE;AAC/B,EAAA,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,CAAC,CAACE,MAAM,EAAED,CAAC,EAAE,EAAE;AACjC,IAAA,IAAIE,CAAC,GAAGH,CAAC,CAACC,CAAC,CAAC,CAAA;AACZE,IAAAA,CAAC,CAACC,UAAU,GAAGD,CAAC,CAACC,UAAU,IAAI,CAAC,CAAC,EAAED,CAAC,CAACE,YAAY,GAAG,CAAC,CAAC,EAAE,OAAO,IAAIF,CAAC,KAAKA,CAAC,CAACG,QAAQ,GAAG,CAAC,CAAC,CAAC,EAAEC,MAAM,CAACC,cAAc,CAACT,CAAC,EAAEU,4BAAa,CAACN,CAAC,CAACO,GAAG,CAAC,EAAEP,CAAC,CAAC,CAAA;AAC9I,GAAA;AACF,CAAA;AACA,SAASQ,YAAYA,CAACZ,CAAC,EAAEC,CAAC,EAAEC,CAAC,EAAE;EAC7B,OAAOD,CAAC,IAAIF,iBAAiB,CAACC,CAAC,CAACa,SAAS,EAAEZ,CAAC,CAAC,EAAEC,CAAC,IAAIH,iBAAiB,CAACC,CAAC,EAAEE,CAAC,CAAC,EAAEM,MAAM,CAACC,cAAc,CAACT,CAAC,EAAE,WAAW,EAAE;AACjHO,IAAAA,QAAQ,EAAE,CAAC,CAAA;GACZ,CAAC,EAAEP,CAAC,CAAA;AACP;;;;;"}

package/cjs/_chunks/dep-7b4bf8d5.js

@@ -0,0 +1,151 @@
+/**
+ * tdesign v1.15.5
+ * (c) 2025 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _getAllKeys = require('./dep-0e871940.js');
+var isArrayLikeObject = require('./dep-9df1169f.js');
+var _baseDifference = require('./dep-21ed9042.js');
+var _baseFlatten = require('./dep-3348f6d4.js');
+var _cacheHas = require('./dep-42148a4e.js');
+var _arrayIncludesWith = require('./dep-5eda7bd5.js');
+var _getTag = require('./dep-1028d313.js');
+var noop = require('./dep-b21d273a.js');
+var _baseIsEqual = require('./dep-f280eedc.js');
+var last = require('./dep-a46fc5e9.js');
+
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
+
+/**
+ * Creates a set object of `values`.
+ *
+ * @private
+ * @param {Array} values The values to add to the set.
+ * @returns {Object} Returns the new set.
+ */
+var createSet = !(_getTag.Set && 1 / _baseIsEqual.setToArray(new _getTag.Set([, -0]))[1] == INFINITY) ? noop.noop : function (values) {
+  return new _getTag.Set(values);
+};
+var createSet$1 = createSet;
+
+/** Used as the size to enable large array optimizations. */
+var LARGE_ARRAY_SIZE = 200;
+
+/**
+ * The base implementation of `_.uniqBy` without support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new duplicate free array.
+ */
+function baseUniq(array, iteratee, comparator) {
+  var index = -1,
+    includes = _arrayIncludesWith.arrayIncludes,
+    length = array.length,
+    isCommon = true,
+    result = [],
+    seen = result;
+  if (comparator) {
+    isCommon = false;
+    includes = _arrayIncludesWith.arrayIncludesWith;
+  } else if (length >= LARGE_ARRAY_SIZE) {
+    var set = iteratee ? null : createSet$1(array);
+    if (set) {
+      return _baseIsEqual.setToArray(set);
+    }
+    isCommon = false;
+    includes = _cacheHas.cacheHas;
+    seen = new _cacheHas.SetCache();
+  } else {
+    seen = iteratee ? [] : result;
+  }
+  outer: while (++index < length) {
+    var value = array[index],
+      computed = iteratee ? iteratee(value) : value;
+    value = comparator || value !== 0 ? value : 0;
+    if (isCommon && computed === computed) {
+      var seenIndex = seen.length;
+      while (seenIndex--) {
+        if (seen[seenIndex] === computed) {
+          continue outer;
+        }
+      }
+      if (iteratee) {
+        seen.push(computed);
+      }
+      result.push(value);
+    } else if (!includes(seen, computed, comparator)) {
+      if (seen !== result) {
+        seen.push(computed);
+      }
+      result.push(value);
+    }
+  }
+  return result;
+}
+
+/**
+ * The base implementation of methods like `_.xor`, without support for
+ * iteratee shorthands, that accepts an array of arrays to inspect.
+ *
+ * @private
+ * @param {Array} arrays The arrays to inspect.
+ * @param {Function} [iteratee] The iteratee invoked per element.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of values.
+ */
+function baseXor(arrays, iteratee, comparator) {
+  var length = arrays.length;
+  if (length < 2) {
+    return length ? baseUniq(arrays[0]) : [];
+  }
+  var index = -1,
+    result = Array(length);
+  while (++index < length) {
+    var array = arrays[index],
+      othIndex = -1;
+    while (++othIndex < length) {
+      if (othIndex != index) {
+        result[index] = _baseDifference.baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);
+      }
+    }
+  }
+  return baseUniq(_baseFlatten.baseFlatten(result, 1), iteratee, comparator);
+}
+
+/**
+ * This method is like `_.xor` except that it accepts `comparator` which is
+ * invoked to compare elements of `arrays`. The order of result values is
+ * determined by the order they occur in the arrays. The comparator is invoked
+ * with two arguments: (arrVal, othVal).
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Array
+ * @param {...Array} [arrays] The arrays to inspect.
+ * @param {Function} [comparator] The comparator invoked per element.
+ * @returns {Array} Returns the new array of filtered values.
+ * @example
+ *
+ * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+ * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+ *
+ * _.xorWith(objects, others, _.isEqual);
+ * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
+ */
+var xorWith = isArrayLikeObject.baseRest(function (arrays) {
+  var comparator = last.last(arrays);
+  comparator = typeof comparator == 'function' ? comparator : undefined;
+  return baseXor(_getAllKeys.arrayFilter(arrays, isArrayLikeObject.isArrayLikeObject), undefined, comparator);
+});
+var xorWith$1 = xorWith;
+
+exports.xorWith = xorWith$1;
+//# sourceMappingURL=dep-7b4bf8d5.js.map

package/cjs/_chunks/dep-7b4bf8d5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-7b4bf8d5.js","sources":["../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_createSet.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseUniq.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/_baseXor.js","../../../../node_modules/.pnpm/lodash-es@4.17.21/node_modules/lodash-es/xorWith.js"],"sourcesContent":["import Set from './_Set.js';\nimport noop from './noop.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nexport default createSet;\n","import SetCache from './_SetCache.js';\nimport arrayIncludes from './_arrayIncludes.js';\nimport arrayIncludesWith from './_arrayIncludesWith.js';\nimport cacheHas from './_cacheHas.js';\nimport createSet from './_createSet.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nexport default baseUniq;\n","import baseDifference from './_baseDifference.js';\nimport baseFlatten from './_baseFlatten.js';\nimport baseUniq from './_baseUniq.js';\n\n/**\n * The base implementation of methods like `_.xor`, without support for\n * iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of values.\n */\nfunction baseXor(arrays, iteratee, comparator) {\n  var length = arrays.length;\n  if (length < 2) {\n    return length ? baseUniq(arrays[0]) : [];\n  }\n  var index = -1,\n      result = Array(length);\n\n  while (++index < length) {\n    var array = arrays[index],\n        othIndex = -1;\n\n    while (++othIndex < length) {\n      if (othIndex != index) {\n        result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n      }\n    }\n  }\n  return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n}\n\nexport default baseXor;\n","import arrayFilter from './_arrayFilter.js';\nimport baseRest from './_baseRest.js';\nimport baseXor from './_baseXor.js';\nimport isArrayLikeObject from './isArrayLikeObject.js';\nimport last from './last.js';\n\n/**\n * This method is like `_.xor` except that it accepts `comparator` which is\n * invoked to compare elements of `arrays`. The order of result values is\n * determined by the order they occur in the arrays. The comparator is invoked\n * with two arguments: (arrVal, othVal).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n *\n * _.xorWith(objects, others, _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n */\nvar xorWith = baseRest(function(arrays) {\n  var comparator = last(arrays);\n  comparator = typeof comparator == 'function' ? comparator : undefined;\n  return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n});\n\nexport default xorWith;\n"],"names":["INFINITY","createSet","Set","setToArray","noop","values","LARGE_ARRAY_SIZE","baseUniq","array","iteratee","comparator","index","includes","arrayIncludes","length","isCommon","result","seen","arrayIncludesWith","set","cacheHas","SetCache","outer","value","computed","seenIndex","push","baseXor","arrays","Array","othIndex","baseDifference","baseFlatten","xorWith","baseRest","last","undefined","arrayFilter","isArrayLikeObject"],"mappings":";;;;;;;;;;;;;;;;;;;AAIA;AACA,IAAIA,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAA;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIC,SAAS,GAAG,EAAEC,WAAG,IAAK,CAAC,GAAGC,uBAAU,CAAC,IAAID,WAAG,CAAC,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAKF,QAAQ,CAAC,GAAGI,SAAI,GAAG,UAASC,MAAM,EAAE;AAClG,EAAA,OAAO,IAAIH,WAAG,CAACG,MAAM,CAAC,CAAA;AACxB,CAAC,CAAA;AAED,kBAAeJ,SAAS;;ACXxB;AACA,IAAIK,gBAAgB,GAAG,GAAG,CAAA;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,QAAQA,CAACC,KAAK,EAAEC,QAAQ,EAAEC,UAAU,EAAE;EAC7C,IAAIC,KAAK,GAAG,CAAC,CAAC;AACVC,IAAAA,QAAQ,GAAGC,gCAAa;IACxBC,MAAM,GAAGN,KAAK,CAACM,MAAM;AACrBC,IAAAA,QAAQ,GAAG,IAAI;AACfC,IAAAA,MAAM,GAAG,EAAE;AACXC,IAAAA,IAAI,GAAGD,MAAM,CAAA;AAEjB,EAAA,IAAIN,UAAU,EAAE;AACdK,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAChBH,IAAAA,QAAQ,GAAGM,oCAAiB,CAAA;AAC9B,GAAC,MACI,IAAIJ,MAAM,IAAIR,gBAAgB,EAAE;IACnC,IAAIa,GAAG,GAAGV,QAAQ,GAAG,IAAI,GAAGR,WAAS,CAACO,KAAK,CAAC,CAAA;AAC5C,IAAA,IAAIW,GAAG,EAAE;MACP,OAAOhB,uBAAU,CAACgB,GAAG,CAAC,CAAA;AACxB,KAAA;AACAJ,IAAAA,QAAQ,GAAG,KAAK,CAAA;AAChBH,IAAAA,QAAQ,GAAGQ,kBAAQ,CAAA;AACnBH,IAAAA,IAAI,GAAG,IAAII,kBAAQ,EAAA,CAAA;AACrB,GAAC,MACI;AACHJ,IAAAA,IAAI,GAAGR,QAAQ,GAAG,EAAE,GAAGO,MAAM,CAAA;AAC/B,GAAA;AACAM,EAAAA,KAAK,EACL,OAAO,EAAEX,KAAK,GAAGG,MAAM,EAAE;AACvB,IAAA,IAAIS,KAAK,GAAGf,KAAK,CAACG,KAAK,CAAC;MACpBa,QAAQ,GAAGf,QAAQ,GAAGA,QAAQ,CAACc,KAAK,CAAC,GAAGA,KAAK,CAAA;IAEjDA,KAAK,GAAIb,UAAU,IAAIa,KAAK,KAAK,CAAC,GAAIA,KAAK,GAAG,CAAC,CAAA;AAC/C,IAAA,IAAIR,QAAQ,IAAIS,QAAQ,KAAKA,QAAQ,EAAE;AACrC,MAAA,IAAIC,SAAS,GAAGR,IAAI,CAACH,MAAM,CAAA;MAC3B,OAAOW,SAAS,EAAE,EAAE;AAClB,QAAA,IAAIR,IAAI,CAACQ,SAAS,CAAC,KAAKD,QAAQ,EAAE;AAChC,UAAA,SAASF,KAAK,CAAA;AAChB,SAAA;AACF,OAAA;AACA,MAAA,IAAIb,QAAQ,EAAE;AACZQ,QAAAA,IAAI,CAACS,IAAI,CAACF,QAAQ,CAAC,CAAA;AACrB,OAAA;AACAR,MAAAA,MAAM,CAACU,IAAI,CAACH,KAAK,CAAC,CAAA;KACnB,MACI,IAAI,CAACX,QAAQ,CAACK,IAAI,EAAEO,QAAQ,EAAEd,UAAU,CAAC,EAAE;MAC9C,IAAIO,IAAI,KAAKD,MAAM,EAAE;AACnBC,QAAAA,IAAI,CAACS,IAAI,CAACF,QAAQ,CAAC,CAAA;AACrB,OAAA;AACAR,MAAAA,MAAM,CAACU,IAAI,CAACH,KAAK,CAAC,CAAA;AACpB,KAAA;AACF,GAAA;AACA,EAAA,OAAOP,MAAM,CAAA;AACf;;ACjEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASW,OAAOA,CAACC,MAAM,EAAEnB,QAAQ,EAAEC,UAAU,EAAE;AAC7C,EAAA,IAAII,MAAM,GAAGc,MAAM,CAACd,MAAM,CAAA;EAC1B,IAAIA,MAAM,GAAG,CAAC,EAAE;IACd,OAAOA,MAAM,GAAGP,QAAQ,CAACqB,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAA;AAC1C,GAAA;EACA,IAAIjB,KAAK,GAAG,CAAC,CAAC;AACVK,IAAAA,MAAM,GAAGa,KAAK,CAACf,MAAM,CAAC,CAAA;AAE1B,EAAA,OAAO,EAAEH,KAAK,GAAGG,MAAM,EAAE;AACvB,IAAA,IAAIN,KAAK,GAAGoB,MAAM,CAACjB,KAAK,CAAC;MACrBmB,QAAQ,GAAG,CAAC,CAAC,CAAA;AAEjB,IAAA,OAAO,EAAEA,QAAQ,GAAGhB,MAAM,EAAE;MAC1B,IAAIgB,QAAQ,IAAInB,KAAK,EAAE;QACrBK,MAAM,CAACL,KAAK,CAAC,GAAGoB,8BAAc,CAACf,MAAM,CAACL,KAAK,CAAC,IAAIH,KAAK,EAAEoB,MAAM,CAACE,QAAQ,CAAC,EAAErB,QAAQ,EAAEC,UAAU,CAAC,CAAA;AAChG,OAAA;AACF,KAAA;AACF,GAAA;AACA,EAAA,OAAOH,QAAQ,CAACyB,wBAAW,CAAChB,MAAM,EAAE,CAAC,CAAC,EAAEP,QAAQ,EAAEC,UAAU,CAAC,CAAA;AAC/D;;AC3BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIuB,OAAO,GAAGC,0BAAQ,CAAC,UAASN,MAAM,EAAE;AACtC,EAAA,IAAIlB,UAAU,GAAGyB,SAAI,CAACP,MAAM,CAAC,CAAA;EAC7BlB,UAAU,GAAG,OAAOA,UAAU,IAAI,UAAU,GAAGA,UAAU,GAAG0B,SAAS,CAAA;AACrE,EAAA,OAAOT,OAAO,CAACU,uBAAW,CAACT,MAAM,EAAEU,mCAAiB,CAAC,EAAEF,SAAS,EAAE1B,UAAU,CAAC,CAAA;AAC/E,CAAC,CAAC,CAAA;AAEF,gBAAeuB,OAAO;;;;"}