1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
var SetCache = require('./_SetCache'),    arrayIncludes = require('./_arrayIncludes'),    arrayIncludesWith = require('./_arrayIncludesWith'),    arrayMap = require('./_arrayMap'),    baseUnary = require('./_baseUnary'),    cacheHas = require('./_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(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(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;}
module.exports = baseIntersection;