Here you can find the source of merge(arr)
Array.prototype.merge = function(arr) { if (arr) {// w ww . ja va 2 s . c o m for (var i = 0; i < arr.length; ++i) { if (!this.contains(arr[i])) this.push(arr[i]); } } }
Array.prototype.merge = function( key, array ){ for( var i = 0; i < this.length; i++) for(var j = 0; j < array.length; j++) if( this[i][key] == array[j][key]) { for( var property in array[j] ) if( array[j].hasOwnProperty( property) && property != key) ...
Array.prototype.merge = function() { var l = this.length, a = []; for (var i=0; i<l; i++) { var k = this[i].length; for (var j=0; j<k; j++) { a.push(this[i][j]); return a; ...
Array.prototype.merge = function (arr) { if (arr == null || typeof(arr) == "undefined") { return this; return this.concat(arr); };
Array.prototype.merge = function(arra){ var oneArra = this; var twoArra = arra; var oneIndex = 0; var twoIndex = 0; var result = []; while(!(oneIndex == oneArra.length && twoIndex == twoArra.length)){ if((oneArra[oneIndex] < twoArra[twoIndex]) || (twoIndex == twoArra.length)){ result[result.length] = oneArra[oneIndex]; ...
Array.prototype.merge = function(arrayB) { var arrayA = this.valueOf(), res = [], bCopy; res = arrayA.unite([]); bCopy = arrayB.unite([]); for (var i = 0; i < res.length; i++) { for (var j = 0; j < arrayB.length; j++) { if (res[i] == bCopy[j]) { delete bCopy[j]; break; ...
Array.prototype.merge = function(list){ var merged = []; function hasnotAdded(element, index, array) { if(merged.some(function(e){ return e.title === element.title;})){ return false; else { merged.push(element); return true; ...