Nodejs Array Unique uniq()

Method Source Code

var bubbleSort = function (array)
{
  var sorted = false;

  while (!sorted)
  {//  w ww  .j  av a  2  s. co  m
    sorted = true;
    for (i = 0; i < array.length - 1; i++)
    {
      if (array[i] > array[i + 1])
      {
        var smaller = array[i + 1], larger = array[i];
        array[i] = smaller, array[i + 1] = larger;
        sorted = false;
      }
    }
  }
  return array;
};

var substrings = function(string)
{
  var subs = [];
  for (var i = 0; i < string.length; i++)
  {
    for (var j = i; j < string.length; j++)
    {
      var start = i, end = j;
      possible_sub = "";
      while (start <= end)
      {
        possible_sub += string[start];
        start  = start + 1;
      }
      subs.push(possible_sub);
      subs = subs.uniq();
    }
  }
  return subs;
}

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])
      {
        flag = false;
      }
    }
    if (flag)
    {
      dups.push(this[i]);
    }
  }
  return dups;
}

Related

1. 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;
   };
   ...
   

2. uniq()

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

3. uniq()

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

4. uniq()

   Array.prototype.uniq = function() {
     var dups = {},
         cleanArray = [];
         array = this,
         i = 0,
         len = array.length;
     if(this.constructor !== Array) {
       throw new TypeError ('Can only call this method on an array');
     for(i; i < len; i++) {
       if(!dups[array[i]]) {
         cleanArray.push(array[i]);
         dups[array[i]] = true;
     return cleanArray;
   

5. uniq()

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

6. uniq()

   Array.prototype.uniq = function() {
     let i;
     let uniqArr = [];
     for (i = 0; i < this.length; i++) {
       if (!uniqArr.includes(this[i])) {
         uniqArr.push(this[i]);
     return uniqArr;
   ...
   

7. uniq()

   function uniq(array) {
     let newArray = [];
     for (let i = 0; i < array.length; i++) {
       if (!newArray.includes(array[i])) {
         newArray.push(array[i]);
     return newArray;
   Array.prototype.uniq = function () {
     let newArray = [];
     for (let i = 0; i < this.length; i++) {
       if (!newArray.includes(this[i])) {
         newArray.push(this[i]);
     return newArray;
   };
   Array.prototype.twoSum = function () {
     let positions = [];
     for (let i = 0; i < this.length; i++) {
       for (let j = i + 1; j < this.length; j++) {
         if (this[i] + this[j] === 0) {
           positions.push([i, j]);
     return positions;
   };
   function myTranspose (array) {
     let transposed = [];
     for (let i = 0; i < array.length; i++) {
       let row = [];
       for (let j = 0; j < array.length; j++) {
         row.push(array[j][i]);
       transposed.push(row);
     return transposed;
   console.log(myTranspose([
       [0, 1, 2],
       [3, 4, 5],
       [6, 7, 8]
     ]));
   

8. uniq()

   function uniq(array) {
     const beenSeen = [];
     for (let i = 0; i < array.length; i++) {
       if (!(beenSeen.includes(array[i]))) {
         beenSeen.push(array[i]);
     return beenSeen;
   Array.prototype.uniq = function() {
     const beenSeen = [];
     for (let i = 0; i < this.length; i++) {
       if (!(beenSeen.includes(this[i]))) {
         beenSeen.push(this[i]);
     return beenSeen;
   };
   Array.prototype.two_sum = function() {
     const twoSum = [];
     for (let i = 0; i < this.length - 1 ; i++) {
       for (let j = i + 1; j < this.length; j++) {
         if (this[i] + this[j] === 0) {
           twoSum.push([i , j]);
     return twoSum;
   };
   function myTranspose(matrix) {
     const outLength = matrix[0].length;
     const outWidth = matrix.length;
     const outArray = [];
     for (let i = 0; i < outLength; i++) {
       const row = [];
       for (let j = 0; j < outWidth; j++) {
         row.push(matrix[j][i]);
       outArray.push(row);
     return outArray;
   console.log(myTranspose([
       [0, 1, 2],
       [3, 4, 5],
       [6, 7, 8]
     ]));
   

9. uniq()

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