Here you can find the source of unique()
Array.prototype.unique = function() { // s.unique() --> // new array with unique elements of s var h = {}; // use a hash-sieve var r = [];//from w ww . j a v a2 s . co m this.forEach(function (item) { h[item] = true; }); for (var item in h) { r.push(item); } return r; }
Array.prototype.unique = function() { var r = []; this.each(function(key, value) { if (!r.contains(value)) { r.push(value); }); return r; }; ...
Array.prototype.unique = function() { var a = []; var l = this.length; for(var i=0; i<l; i++) { for(var j=i+1; j<l; j++) { if (this[i] === this[j]) j = ++i; a.push(this[i]); ...
Array.prototype.unique = function() { var aryToReturn = Array(); for (var i = 0; i < this.length; i++) { var val = this[i]; if (undefined === aryToReturn.findFirst(function() {return this == val})) { aryToReturn.push(val); return aryToReturn; ...
Array.prototype.unique = function(){ var new_array = []; for (var i=0; i < this.length; i++) { if(!new_array.contains(this[i])) new_array.push(this[i]); return new_array;
Array.prototype.unique = function(){ this.sort((x,y) => x-y); for(var i=0; i<this.length-1; ){ if(this[i]==this[i+1]) this.splice(i,1); else i++; return this;
Array.prototype.unique = function() { var uniqueArray = new Array(); for(var i = 0; i < this.length; i++) { for(var j = i+1; j < this.length+1; j++) { if (this[i] !== null && this[i] === this[j]) this[j] = null; for(i = 0; i < this.length; i++) { ...
Array.prototype.unique=function(a){ return function(){return this.filter(a)}}(function(a,b,c){return c.indexOf(a,b+1)<0 });
Array.prototype.unique = function(a) { return function(){return this.filter(a)}}(function(a,b,c){return c.indexOf(a,b+1)<0 });
x = '' Array.prototype.unique=function(a){ return function(){return this.filter(a)}}(function(a,b,c){return c.indexOf(a,b+1)<0 }); function getCombi(vect,res,n,r){ if(n == 0){ x = x + res +":"; }else{ for(var i = 0; i < r; i++){ ...