About intersection

[dgilperez]

I was playing with intersection to see if that would allow us to find the elements in common in two arrays, but I am confused to see it does the opposite: it merges the two collections by applying a union function ... so my questions / comments:

• I think current implementation is actually an union or join, not an intersection, in Venn's terms. If I'm not mistaken, I'd suggest a rename ... although that'd be a breaking change. Moreover when I'd suggest to add a different intersection function ...
• Can intersection or other function in m be use to obtain that the elements in common in two lists? Would you accept a PR for that? What name would you give it?

[dgilperez]

About the latter, I think this will to the job arrA.filter(x => arrB.includes(x)). Happy to contribute this in any case.

[dgilperez]

This will also work on objects, for what I see:

const _intersection = (aList, bList) => {
  if (bList.length === 0) {
    return []
  }

  return filter(source => any(isDeepEqual(source), bList), aList)
}