Method Array.intersect

Get the intersection of n arrays

• Syntax Array Array.intersect([ Array a0 ... an ])
  
  Computes the intersection between the calling array and any number of arrays passed as arguments. Duplicate values are removed from the result.
• Parameters

  Array a0 ... an (Optional)

  The arrays to intersect with.

• Return value A new array holding the intersection of elements
• Examples

  To find the intersection of the arrays (0,2,4,1,8,2), (1,3,5,2,9) and (100,2,9,1)

  // Define array 1
  var a1 = [0,2,4,1,8];
  // Define array 2
  var a2 = [1,3,5,2,9];
  // Define array 3
  var a3 = [100,2,9,1];
  // Output is Array(2,1)
  a1.intersect(a2,a3);

• Download
  Download this function including dependencies
  Source

  Unless otherwise noted all code in the JSLab Standard Library is licensed as GPLv3. See http://www.gnu.org/licenses/gpl.html for the entire license.

  This function has dependencies and will not work stand-alone. Use the download button above instead of copy/paste.

  // ************************************************************************** // Copyright 2007 - 2009 Tavs Dokkedahl // Contact: http://www.jslab.dk/contact.php // // This file is part of the JSLab Standard Library (JSL) Program. // // JSL is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation; either version 3 of the License, or // any later version. // // JSL is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with this program. If not, see <http://www.gnu.org/licenses/>. // *************************************************************************** // Compute the intersection of n arrays Array.prototype.intersect = function() { if (!arguments.length) return []; var a1 = this; var a = a2 = null; var n = 0; while(n < arguments.length) { a = []; a2 = arguments[n]; var l = a1.length; var l2 = a2.length; for(var i=0; i<l; i++) { for(var j=0; j<l2; j++) { if (a1[i] === a2[j]) a.push(a1[i]); } } a1 = a; n++; } return a.unique(); };