Intersection Of Sets (JS Arrays)

Basically, if a value is a member of all the arrays passed to the function, this function will add that value to a response array. The function returns the response array.


/**
* Return an array of members existing in all argument arrays.
*
* @param aSet(n) JSArray.
*/
function getSetIntersection(aSet1, aSet2) {
var temp = [];
var offset = arguments.length - 1;
var response = [];
for (var i = 0; i < arguments.length; i++) {
temp = temp.concat(arguments[i]);
}
temp.sort();
/*
* The goal is to find an ordered sequence of n identical members of temp,
* where n = arguments.length. For this, we just need to check the start
* and end points of the sequence, and if they match, push them on to the
* response array.
*/

for (var i = 0; i < temp.length - offset; i++) {
if (temp[i] == temp[i + offset]) {
response.push(temp[i]);
i += offset;
}
}

return response;
}


The assumption is that no member of the original arrays is repeated. I'd welcome a sanity check for that.