Intersection With

Requirements

• Implement intersectionWith(arrays, comparator). arrays is an array of dense arrays, and comparator(left, right) returns a boolean indicating equivalence. Assume it is pure and defines a symmetric, transitive equality relation.
• Return first-array values equivalent to at least one value in every input array. Preserve first-array order and original references. Emit only the earliest representative for each equivalence class.
• Use comparator for both membership and output deduplication. Invoke it with a candidate from the first array as the left argument and a compared item or earlier emitted representative as the right argument.
• With no arrays or an empty array, return a fresh empty array without calling comparator. With one array, deduplicate it using comparator.
• Do not mutate any array or item, stringify values, or substitute reference equality for the comparator. Propagate comparator errors unchanged. Comparator call counts are not fixed; short-circuiting is allowed.

Examples

Input: intersectionWith([[{id:1},{id:2}],[{id:2}]], (a,b) => a.id === b.id)
Output: [{id:2}]

Input: intersectionWith([["A","a","B"],["a","b"]], (a,b) => a.toLowerCase() === b.toLowerCase())
Output: ["A","B"]