tdesign-react 1.3.1-alpha.1 → 1.3.1-alpha.2

package/cjs/_chunks/dep-8b40066e.js

@@ -0,0 +1,173 @@
+/**
+ * tdesign v1.3.1-alpha.2
+ * (c) 2023 tdesign
+ * @license MIT
+ */
+
+'use strict';
+
+var _baseGet = require('./dep-a48dc8c8.js');
+var _baseSet = require('./dep-c4b19828.js');
+var isTypedArray = require('./dep-fc5bf5aa.js');
+var isArray$1 = require('./dep-267cf8ed.js');
+var _isIndex = require('./dep-be1ed8f9.js');
+var isArrayLike = require('./dep-fea607da.js');
+var _flatRest = require('./dep-468dfb0d.js');
+
+var baseGet = _baseGet._baseGet,
+  baseSet = _baseSet._baseSet,
+  castPath$1 = _baseGet._castPath;
+
+/**
+ * The base implementation of  `_.pickBy` without support for iteratee shorthands.
+ *
+ * @private
+ * @param {Object} object The source object.
+ * @param {string[]} paths The property paths to pick.
+ * @param {Function} predicate The function invoked per property.
+ * @returns {Object} Returns the new object.
+ */
+function basePickBy$1(object, paths, predicate) {
+  var index = -1,
+    length = paths.length,
+    result = {};
+  while (++index < length) {
+    var path = paths[index],
+      value = baseGet(object, path);
+    if (predicate(value, path)) {
+      baseSet(result, castPath$1(path, object), value);
+    }
+  }
+  return result;
+}
+var _basePickBy = basePickBy$1;
+
+/**
+ * The base implementation of `_.hasIn` without support for deep paths.
+ *
+ * @private
+ * @param {Object} [object] The object to query.
+ * @param {Array|string} key The key to check.
+ * @returns {boolean} Returns `true` if `key` exists, else `false`.
+ */
+function baseHasIn$1(object, key) {
+  return object != null && key in Object(object);
+}
+var _baseHasIn = baseHasIn$1;
+
+var castPath = _baseGet._castPath,
+  isArguments = isTypedArray.isArguments_1,
+  isArray = isArray$1.isArray_1,
+  isIndex = _isIndex._isIndex,
+  isLength = isArrayLike.isLength_1,
+  toKey = _baseGet._toKey;
+
+/**
+ * Checks if `path` exists on `object`.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {Array|string} path The path to check.
+ * @param {Function} hasFunc The function to check properties.
+ * @returns {boolean} Returns `true` if `path` exists, else `false`.
+ */
+function hasPath$1(object, path, hasFunc) {
+  path = castPath(path, object);
+  var index = -1,
+    length = path.length,
+    result = false;
+  while (++index < length) {
+    var key = toKey(path[index]);
+    if (!(result = object != null && hasFunc(object, key))) {
+      break;
+    }
+    object = object[key];
+  }
+  if (result || ++index != length) {
+    return result;
+  }
+  length = object == null ? 0 : object.length;
+  return !!length && isLength(length) && isIndex(key, length) && (isArray(object) || isArguments(object));
+}
+var _hasPath = hasPath$1;
+
+var baseHasIn = _baseHasIn,
+  hasPath = _hasPath;
+
+/**
+ * Checks if `path` is a direct or inherited property of `object`.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Object
+ * @param {Object} object The object to query.
+ * @param {Array|string} path The path to check.
+ * @returns {boolean} Returns `true` if `path` exists, else `false`.
+ * @example
+ *
+ * var object = _.create({ 'a': _.create({ 'b': 2 }) });
+ *
+ * _.hasIn(object, 'a');
+ * // => true
+ *
+ * _.hasIn(object, 'a.b');
+ * // => true
+ *
+ * _.hasIn(object, ['a', 'b']);
+ * // => true
+ *
+ * _.hasIn(object, 'b');
+ * // => false
+ */
+function hasIn$1(object, path) {
+  return object != null && hasPath(object, path, baseHasIn);
+}
+var hasIn_1 = hasIn$1;
+
+var basePickBy = _basePickBy,
+  hasIn = hasIn_1;
+
+/**
+ * The base implementation of `_.pick` without support for individual
+ * property identifiers.
+ *
+ * @private
+ * @param {Object} object The source object.
+ * @param {string[]} paths The property paths to pick.
+ * @returns {Object} Returns the new object.
+ */
+function basePick$1(object, paths) {
+  return basePickBy(object, paths, function (value, path) {
+    return hasIn(object, path);
+  });
+}
+var _basePick = basePick$1;
+
+var basePick = _basePick,
+  flatRest = _flatRest._flatRest;
+
+/**
+ * Creates an object composed of the picked `object` properties.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The source object.
+ * @param {...(string|string[])} [paths] The property paths to pick.
+ * @returns {Object} Returns the new object.
+ * @example
+ *
+ * var object = { 'a': 1, 'b': '2', 'c': 3 };
+ *
+ * _.pick(object, ['a', 'c']);
+ * // => { 'a': 1, 'c': 3 }
+ */
+var pick = flatRest(function (object, paths) {
+  return object == null ? {} : basePick(object, paths);
+});
+var pick_1 = pick;
+
+exports.pick_1 = pick_1;
+//# sourceMappingURL=dep-8b40066e.js.map

package/cjs/_chunks/dep-8b40066e.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-8b40066e.js","sources":["../../node_modules/lodash/_basePickBy.js","../../node_modules/lodash/_baseHasIn.js","../../node_modules/lodash/_hasPath.js","../../node_modules/lodash/hasIn.js","../../node_modules/lodash/_basePick.js","../../node_modules/lodash/pick.js"],"sourcesContent":["var baseGet = require('./_baseGet'),\n    baseSet = require('./_baseSet'),\n    castPath = require('./_castPath');\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = basePickBy;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","var basePickBy = require('./_basePickBy'),\n    hasIn = require('./hasIn');\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nmodule.exports = basePick;\n","var basePick = require('./_basePick'),\n    flatRest = require('./_flatRest');\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n"],"names":["baseGet","require$$0","baseSet","require$$1","castPath","require$$2","basePickBy","object","paths","predicate","index","length","result","path","value","_basePickBy","baseHasIn","key","Object","_baseHasIn","isArguments","isArray","isIndex","require$$3","isLength","require$$4","toKey","require$$5","hasPath","hasFunc","_hasPath","hasIn","hasIn_1","basePick","_basePick","flatRest","pick","pick_1"],"mappings":";;;;;;;;;;;;;;;;AAAA,IAAIA,OAAO,GAAGC,iBAAqB;AAC/BC,EAAAA,OAAO,GAAGC,iBAAqB;AAC/BC,EAAAA,UAAQ,GAAGC,kBAAsB,CAAA;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,YAAUA,CAACC,MAAM,EAAEC,KAAK,EAAEC,SAAS,EAAE;EAC5C,IAAIC,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGH,KAAK,CAACG,MAAM;IACrBC,MAAM,GAAG,EAAE,CAAA;AAEf,EAAA,OAAO,EAAEF,KAAK,GAAGC,MAAM,EAAE;AACvB,IAAA,IAAIE,IAAI,GAAGL,KAAK,CAACE,KAAK,CAAC;AACnBI,MAAAA,KAAK,GAAGd,OAAO,CAACO,MAAM,EAAEM,IAAI,CAAC,CAAA;AAEjC,IAAA,IAAIJ,SAAS,CAACK,KAAK,EAAED,IAAI,CAAC,EAAE;MAC1BX,OAAO,CAACU,MAAM,EAAER,UAAQ,CAACS,IAAI,EAAEN,MAAM,CAAC,EAAEO,KAAK,CAAC,CAAA;AAC/C,KAAA;AACF,GAAA;AACD,EAAA,OAAOF,MAAM,CAAA;AACf,CAAA;AAEA,IAAAG,WAAc,GAAGT,YAAU;;;;;;;;;;ACrB3B,SAASU,WAASA,CAACT,MAAM,EAAEU,GAAG,EAAE;EAC9B,OAAOV,MAAM,IAAI,IAAI,IAAIU,GAAG,IAAIC,MAAM,CAACX,MAAM,CAAC,CAAA;AAChD,CAAA;AAEA,IAAAY,UAAc,GAAGH,WAAS;;ACZ1B,IAAIZ,QAAQ,GAAGH,kBAAsB;AACjCmB,EAAAA,WAAW,GAAGjB,0BAAwB;AACtCkB,EAAAA,OAAO,GAAGhB,mBAAoB;AAC9BiB,EAAAA,OAAO,GAAGC,iBAAqB;AAC/BC,EAAAA,QAAQ,GAAGC,sBAAqB;AAChCC,EAAAA,KAAK,GAAGC,eAAmB,CAAA;;AAE/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,SAAOA,CAACrB,MAAM,EAAEM,IAAI,EAAEgB,OAAO,EAAE;AACtChB,EAAAA,IAAI,GAAGT,QAAQ,CAACS,IAAI,EAAEN,MAAM,CAAC,CAAA;EAE7B,IAAIG,KAAK,GAAG,CAAC,CAAC;IACVC,MAAM,GAAGE,IAAI,CAACF,MAAM;AACpBC,IAAAA,MAAM,GAAG,KAAK,CAAA;AAElB,EAAA,OAAO,EAAEF,KAAK,GAAGC,MAAM,EAAE;IACvB,IAAIM,GAAG,GAAGS,KAAK,CAACb,IAAI,CAACH,KAAK,CAAC,CAAC,CAAA;AAC5B,IAAA,IAAI,EAAEE,MAAM,GAAGL,MAAM,IAAI,IAAI,IAAIsB,OAAO,CAACtB,MAAM,EAAEU,GAAG,CAAC,CAAC,EAAE;AACtD,MAAA,MAAA;AACD,KAAA;AACDV,IAAAA,MAAM,GAAGA,MAAM,CAACU,GAAG,CAAC,CAAA;AACrB,GAAA;AACD,EAAA,IAAIL,MAAM,IAAI,EAAEF,KAAK,IAAIC,MAAM,EAAE;AAC/B,IAAA,OAAOC,MAAM,CAAA;AACd,GAAA;EACDD,MAAM,GAAGJ,MAAM,IAAI,IAAI,GAAG,CAAC,GAAGA,MAAM,CAACI,MAAM,CAAA;EAC3C,OAAO,CAAC,CAACA,MAAM,IAAIa,QAAQ,CAACb,MAAM,CAAC,IAAIW,OAAO,CAACL,GAAG,EAAEN,MAAM,CAAC,KACxDU,OAAO,CAACd,MAAM,CAAC,IAAIa,WAAW,CAACb,MAAM,CAAC,CAAC,CAAA;AAC5C,CAAA;AAEA,IAAAuB,QAAc,GAAGF,SAAO;;ACtCxB,IAAIZ,SAAS,GAAGf,UAAuB;AACnC2B,EAAAA,OAAO,GAAGzB,QAAqB,CAAA;;AAEnC;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,SAAS4B,OAAKA,CAACxB,MAAM,EAAEM,IAAI,EAAE;EAC3B,OAAON,MAAM,IAAI,IAAI,IAAIqB,OAAO,CAACrB,MAAM,EAAEM,IAAI,EAAEG,SAAS,CAAC,CAAA;AAC3D,CAAA;AAEA,IAAAgB,OAAc,GAAGD,OAAK;;ACjCtB,IAAIzB,UAAU,GAAGL,WAAwB;AACrC8B,EAAAA,KAAK,GAAG5B,OAAkB,CAAA;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS8B,UAAQA,CAAC1B,MAAM,EAAEC,KAAK,EAAE;EAC/B,OAAOF,UAAU,CAACC,MAAM,EAAEC,KAAK,EAAE,UAASM,KAAK,EAAED,IAAI,EAAE;AACrD,IAAA,OAAOkB,KAAK,CAACxB,MAAM,EAAEM,IAAI,CAAC,CAAA;AAC9B,GAAG,CAAC,CAAA;AACJ,CAAA;AAEA,IAAAqB,SAAc,GAAGD,UAAQ;;AClBzB,IAAIA,QAAQ,GAAGhC,SAAsB;AACjCkC,EAAAA,QAAQ,GAAGhC,mBAAsB,CAAA;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAIiC,IAAI,GAAGD,QAAQ,CAAC,UAAS5B,MAAM,EAAEC,KAAK,EAAE;AAC1C,EAAA,OAAOD,MAAM,IAAI,IAAI,GAAG,EAAE,GAAG0B,QAAQ,CAAC1B,MAAM,EAAEC,KAAK,CAAC,CAAA;AACtD,CAAC,CAAC,CAAA;AAEF6B,IAAAA,MAAc,GAAGD;;;;"}

package/cjs/_chunks/dep-8d69b441.js

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

package/cjs/_chunks/dep-8d69b441.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dep-8d69b441.js","sources":["../../node_modules/lodash/_baseIntersection.js","../../node_modules/lodash/_castArrayLikeObject.js","../../node_modules/lodash/intersection.js"],"sourcesContent":["var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    arrayMap = require('./_arrayMap'),\n    baseUnary = require('./_baseUnary'),\n    cacheHas = require('./_cacheHas');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMin = Math.min;\n\n/**\n * The base implementation of methods like `_.intersection`, without support\n * for iteratee shorthands, that accepts an array of arrays to inspect.\n *\n * @private\n * @param {Array} arrays The arrays to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of shared values.\n */\nfunction baseIntersection(arrays, iteratee, comparator) {\n  var includes = comparator ? arrayIncludesWith : arrayIncludes,\n      length = arrays[0].length,\n      othLength = arrays.length,\n      othIndex = othLength,\n      caches = Array(othLength),\n      maxLength = Infinity,\n      result = [];\n\n  while (othIndex--) {\n    var array = arrays[othIndex];\n    if (othIndex && iteratee) {\n      array = arrayMap(array, baseUnary(iteratee));\n    }\n    maxLength = nativeMin(array.length, maxLength);\n    caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n      ? new SetCache(othIndex && array)\n      : undefined;\n  }\n  array = arrays[0];\n\n  var index = -1,\n      seen = caches[0];\n\n  outer:\n  while (++index < length && result.length < maxLength) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (!(seen\n          ? cacheHas(seen, computed)\n          : includes(result, computed, comparator)\n        )) {\n      othIndex = othLength;\n      while (--othIndex) {\n        var cache = caches[othIndex];\n        if (!(cache\n              ? cacheHas(cache, computed)\n              : includes(arrays[othIndex], computed, comparator))\n            ) {\n          continue outer;\n        }\n      }\n      if (seen) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseIntersection;\n","var isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Casts `value` to an empty array if it's not an array like object.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Array|Object} Returns the cast array-like object.\n */\nfunction castArrayLikeObject(value) {\n  return isArrayLikeObject(value) ? value : [];\n}\n\nmodule.exports = castArrayLikeObject;\n","var arrayMap = require('./_arrayMap'),\n    baseIntersection = require('./_baseIntersection'),\n    baseRest = require('./_baseRest'),\n    castArrayLikeObject = require('./_castArrayLikeObject');\n\n/**\n * Creates an array of unique values that are included in all given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order and references of result values are\n * determined by the first array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of intersecting values.\n * @example\n *\n * _.intersection([2, 1], [2, 3]);\n * // => [2]\n */\nvar intersection = baseRest(function(arrays) {\n  var mapped = arrayMap(arrays, castArrayLikeObject);\n  return (mapped.length && mapped[0] === arrays[0])\n    ? baseIntersection(mapped)\n    : [];\n});\n\nmodule.exports = intersection;\n"],"names":["SetCache","require$$0","arrayIncludes","require$$1","arrayIncludesWith","require$$2","arrayMap","require$$3","baseUnary","require$$4","cacheHas","require$$5","nativeMin","Math","min","baseIntersection","arrays","iteratee","comparator","includes","length","othLength","othIndex","caches","Array","maxLength","Infinity","result","array","undefined","index","seen","outer","value","computed","cache","push","_baseIntersection","isArrayLikeObject","castArrayLikeObject","_castArrayLikeObject","baseRest","intersection","mapped","intersection_1"],"mappings":";;;;;;;;;;;;;AAAA,IAAIA,QAAQ,GAAGC,mBAAsB;AACjCC,EAAAA,aAAa,GAAGC,wBAA2B;AAC3CC,EAAAA,iBAAiB,GAAGC,4BAA+B;AACnDC,EAAAA,UAAQ,GAAGC,kBAAsB;AACjCC,EAAAA,SAAS,GAAGC,qBAAuB;AACnCC,EAAAA,QAAQ,GAAGC,mBAAsB,CAAA;;AAErC;AACA,IAAIC,SAAS,GAAGC,IAAI,CAACC,GAAG,CAAA;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,kBAAgBA,CAACC,MAAM,EAAEC,QAAQ,EAAEC,UAAU,EAAE;AACtD,EAAA,IAAIC,QAAQ,GAAGD,UAAU,GAAGd,iBAAiB,GAAGF,aAAa;AACzDkB,IAAAA,MAAM,GAAGJ,MAAM,CAAC,CAAC,CAAC,CAACI,MAAM;IACzBC,SAAS,GAAGL,MAAM,CAACI,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,GAAGZ,MAAM,CAACM,QAAQ,CAAC,CAAA;IAC5B,IAAIA,QAAQ,IAAIL,QAAQ,EAAE;MACxBW,KAAK,GAAGtB,UAAQ,CAACsB,KAAK,EAAEpB,SAAS,CAACS,QAAQ,CAAC,CAAC,CAAA;AAC7C,KAAA;IACDQ,SAAS,GAAGb,SAAS,CAACgB,KAAK,CAACR,MAAM,EAAEK,SAAS,CAAC,CAAA;AAC9CF,IAAAA,MAAM,CAACD,QAAQ,CAAC,GAAG,CAACJ,UAAU,KAAKD,QAAQ,IAAKG,MAAM,IAAI,GAAG,IAAIQ,KAAK,CAACR,MAAM,IAAI,GAAI,CAAC,GAClF,IAAIpB,QAAQ,CAACsB,QAAQ,IAAIM,KAAK,CAAC,GAC/BC,SAAS,CAAA;AACd,GAAA;AACDD,EAAAA,KAAK,GAAGZ,MAAM,CAAC,CAAC,CAAC,CAAA;EAEjB,IAAIc,KAAK,GAAG,CAAC,CAAC;AACVC,IAAAA,IAAI,GAAGR,MAAM,CAAC,CAAC,CAAC,CAAA;AAEpBS,EAAAA,KAAK,EACL,OAAO,EAAEF,KAAK,GAAGV,MAAM,IAAIO,MAAM,CAACP,MAAM,GAAGK,SAAS,EAAE;AACpD,IAAA,IAAIQ,KAAK,GAAGL,KAAK,CAACE,KAAK,CAAC;MACpBI,QAAQ,GAAGjB,QAAQ,GAAGA,QAAQ,CAACgB,KAAK,CAAC,GAAGA,KAAK,CAAA;IAEjDA,KAAK,GAAIf,UAAU,IAAIe,KAAK,KAAK,CAAC,GAAIA,KAAK,GAAG,CAAC,CAAA;AAC/C,IAAA,IAAI,EAAEF,IAAI,GACFrB,QAAQ,CAACqB,IAAI,EAAEG,QAAQ,CAAC,GACxBf,QAAQ,CAACQ,MAAM,EAAEO,QAAQ,EAAEhB,UAAU,CAAC,CACzC,EAAE;AACLI,MAAAA,QAAQ,GAAGD,SAAS,CAAA;MACpB,OAAO,EAAEC,QAAQ,EAAE;AACjB,QAAA,IAAIa,KAAK,GAAGZ,MAAM,CAACD,QAAQ,CAAC,CAAA;QAC5B,IAAI,EAAEa,KAAK,GACHzB,QAAQ,CAACyB,KAAK,EAAED,QAAQ,CAAC,GACzBf,QAAQ,CAACH,MAAM,CAACM,QAAQ,CAAC,EAAEY,QAAQ,EAAEhB,UAAU,CAAC,CAAC,EACnD;AACJ,UAAA,SAASc,KAAK,CAAA;AACf,SAAA;AACF,OAAA;AACD,MAAA,IAAID,IAAI,EAAE;AACRA,QAAAA,IAAI,CAACK,IAAI,CAACF,QAAQ,CAAC,CAAA;AACpB,OAAA;AACDP,MAAAA,MAAM,CAACS,IAAI,CAACH,KAAK,CAAC,CAAA;AACnB,KAAA;AACF,GAAA;AACD,EAAA,OAAON,MAAM,CAAA;AACf,CAAA;AAEA,IAAAU,iBAAc,GAAGtB,kBAAgB;;ACzEjC,IAAIuB,iBAAiB,GAAGrC,6BAA8B,CAAA;;AAEtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASsC,qBAAmBA,CAACN,KAAK,EAAE;AAClC,EAAA,OAAOK,iBAAiB,CAACL,KAAK,CAAC,GAAGA,KAAK,GAAG,EAAE,CAAA;AAC9C,CAAA;AAEA,IAAAO,oBAAc,GAAGD,qBAAmB;;ACbpC,IAAIjC,QAAQ,GAAGL,kBAAsB;AACjCc,EAAAA,gBAAgB,GAAGZ,iBAA8B;AACjDsC,EAAAA,QAAQ,GAAGpC,mBAAsB;AACjCkC,EAAAA,mBAAmB,GAAGhC,oBAAiC,CAAA;;AAE3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAImC,YAAY,GAAGD,QAAQ,CAAC,UAASzB,MAAM,EAAE;AAC3C,EAAA,IAAI2B,MAAM,GAAGrC,QAAQ,CAACU,MAAM,EAAEuB,mBAAmB,CAAC,CAAA;AAClD,EAAA,OAAQI,MAAM,CAACvB,MAAM,IAAIuB,MAAM,CAAC,CAAC,CAAC,KAAK3B,MAAM,CAAC,CAAC,CAAC,GAC5CD,gBAAgB,CAAC4B,MAAM,CAAC,GACxB,EAAE,CAAA;AACR,CAAC,CAAC,CAAA;AAEFC,IAAAA,cAAc,GAAGF;;;;"}