Nodejs Array Unique uniq()

Method Source Code

Array.prototype.uniq = function(){
  var uniqArray = [];
  for (var i = 0; i < this.length; i++){
    if (uniqArray.indexOf(this[i]) === -1)
    {/*from ww w .j a  v a2s .c  o  m*/
      uniqArray.push(this[i])
    }
  }
  return uniqArray
};

console.log([1,2,2,3,2,54].uniq())

Array.prototype.twoSum = function(){
  var out = []
  for (var i = 0; i < (this.length-1); i++){
    for (var j = i+1; j < this.length; j++){
      if (this[i] + this[j] === 0)
      {
        out.push([i, j])
      }
    }
  }
  return out;
}

console.log([-1, 0, 2, -2, 1].twoSum())


Array.prototype.myTranspose = function(){
  var out = [];
  for (var row = 0; row < this.length; row++){
    var thisout = [];
    for (var col = 0; col < this.length; col++){
      thisout.push(this[col][row]);
    }
    out.push(thisout);
  }
  return out;
}

console.log([[0, 1, 2], [3, 4, 5], [6, 7, 8]].myTranspose())

// module.exports =

Related

1. uniq()

   Array.prototype.uniq = function() {
     var results = [];
     for (var i = 0, len = this.length; i < len; i++) {
       var found = false;
       for (var j = 0, len2 = results.length; j < len2; j++) {
         if (this[i] === results[j]) {
           found = true;
           break;
       if (!found) {
         results.push(this[i]);
     return results;
   };
   Array.prototype.uniq = function() {
     var results = [];
     for (var i = 0, len = this.length; i < len; i++) {
       if (results.indexOf(this[i]) < 0) {
         results.push(this[i]);
     return results;
   };
   Array.prototype.uniq = function(sorted) {
     return this.inject([], function(array, value, index) {
       if (0 == index || (sorted ? array.last() != value : !array.include(value))) {
         array.push(value);
       return array;
     });
   };
   

2. uniq()

   Array.prototype.uniq = function () {
     var occurrenceHash = {};
     var result = [];
     for (var i = 0; i < this.length; i++) {
       if (!occurrenceHash[this[i]]) {
           occurrenceHash[this[i]] = true;
           result.push(this[i]);
     return result;
   

3. uniq()

   Array.prototype.uniq = function () {
     var results = [];
     for (var i = 0; i < this.length; i++) {
       var includes = false;
       for (var j = 0; j < results.length; j++) {
         if (results[j] === this[i]) {
           includes = true;
       };
   ...
   

4. uniq()

   Array.prototype.uniq = function ()
     var dups = [];
     for (var i = 0; i < this.length; i++)
       var flag = true;
       for (var j = 0; j < dups.length; j++)
         if (this[i] === dups[j])
   ...
   

5. uniq()

   Array.prototype.uniq = function () {
       var flag = false;
       var result = [];
       for(var i=0;i<this.length;i++) {
           if(result.indexOf(this[i]) == -1) {
               if(this[i]==this[i]) {
                   result.push(this[i]);
               else if(!flag) {
   ...
   

6. uniq()

   Array.prototype.uniq = function() {  
       var temp = {};
       for(var i=0; i<this.length; i++)  {  
               temp[this[i]] = 1;
       this.length = 0;
       for(var e in temp) {  
           this.push(e);
       this.sort()
       return this;  
   function xmlencode(string) {
       return string.replace(/\&/g,'&'+'amp;').replace(/</g,'&'+'lt;')
           .replace(/>/g,'&'+'gt;').replace(/\'/g,'&'+'apos;').replace(/\"/g,'&'+'quot;');
   

7. uniq()

   Array.prototype.uniq = function () {
     var uniq_arr = [];
     for (var i = 0; i < this.length; i++) {
       var included = false;
       for (var j = 0; j < uniq_arr.length; j++) {
         if (uniq_arr[j] === this[i]) {
           included = true;
           break;
         };
   ...
   

8. uniq()

   Array.prototype.uniq = function() {
     let res = [];
     for(let i=0; i < this.length; i++) {
       let value = this[i];
       if (!res.includes(value)) res.push(value);
     return res;
   };
   console.log([1,2,2,1,1,3].uniq());
   ...
   

9. uniq()

   Array.prototype.uniq = function () {
     var uniqueArray = [];
     for (var i = 0; i < this.length; i++) {
       if (uniqueArray.indexOf(this[i]) === -1) {
         uniqueArray.push(this[i]);
     return uniqueArray;
   };
   ...