Here you can find the source of intersect(b)
Array.prototype.intersect = function(b) { var array = new Array(); var ua = this.uniquelize(); var length = ua.length; for (var i = 0; i < length; i++) { if (b.inArray(ua[i])) { array.push(ua[i]);/*from w ww. ja v a2s . c o m*/ } } return array; };
Array.prototype.intersect = function (array) { array = Array.isArray(array) ? array : []; return this.filter(function (n) { return array.indexOf(n) != -1; }); };
Array.prototype.intersect = function(array){ return(this.filter(function(n){ return array.include(n); })); };
Array.prototype.intersect = function(array) { return this.filter((x) => array.indexOf(x) != -1); };
Array.prototype.intersect = function(array){ if(this.length>array.length) return ''; var equals = true, concat = ''; for(var i = 0; i < this.length-1; i++){ if(this[i+1] != array[i]){ equals = false; break; if(equals){ concat = this.reduce((acc,k,i) => acc + (i<this.length?k:''), ''); concat = array.reduce((acc,k,i) => acc + (i>=this.length-1?k:''), concat); return concat; return '';
Array.prototype.intersect = function (ary) { return this.union(ary).filter(x => this.contains(x) && ary.contains(x)); };
Array.prototype.intersect = function(b) { var flip = {}, res = []; for (var i = 0; i < b.length; i++) flip[b[i]] = i; for (i = 0; i < this.length; i++) if (flip[this[i]] != undefined) res.push(this[i]); return res;
Array.prototype.intersect = function(tab){ var temp = []; for(var i = 0; i < this.length; i++){ for(var k = 0; k < tab.length; k++){ if(this[i] == tab[k]){ temp.push( this[i]); break; return temp; };
Array.prototype.intersect = function intersect(otherArray) { return this.filter(function(item) { return otherArray.has(item); }); };
Array.prototype.intersection = function(arr){ return this.filter(function(n){ return arr.indexOf(n) != -1; });