npx standard --fix

Data Structures/Queue/Queue.js

@@ -5,80 +5,76 @@
 * implementation uses an array to store the queue.
 */
 
-//Functions: enqueue, dequeue, peek, view, length
+// Functions: enqueue, dequeue, peek, view, length
 
 var Queue = (function () {
-
   // constructor
-  function Queue() {
-
-    //This is the array representation of the queue
-    this.queue = [];
-
+  function Queue () {
+    // This is the array representation of the queue
+    this.queue = []
   }
 
-  // methods 
-  //Add a value to the end of the queue
+  // methods
+  // Add a value to the end of the queue
   Queue.prototype.enqueue = function (item) {
-    this.queue[this.queue.length] = item;
-  };
+    this.queue[this.queue.length] = item
+  }
 
-  //Removes the value at the front of the queue
+  // Removes the value at the front of the queue
   Queue.prototype.dequeue = function () {
     if (this.queue.length === 0) {
-      throw "Queue is Empty";
+      throw 'Queue is Empty'
     }
 
-    var result = this.queue[0];
-    this.queue.splice(0, 1); //remove the item at position 0 from the array
+    var result = this.queue[0]
+    this.queue.splice(0, 1) // remove the item at position 0 from the array
 
-    return result;
-  };
+    return result
+  }
 
-  //Return the length of the queue
+  // Return the length of the queue
   Queue.prototype.length = function () {
-    return this.queue.length;
-  };
+    return this.queue.length
+  }
 
-  //Return the item at the front of the queue
+  // Return the item at the front of the queue
   Queue.prototype.peek = function () {
-    return this.queue[0];
-  };
+    return this.queue[0]
+  }
 
-  //List all the items in the queue
+  // List all the items in the queue
   Queue.prototype.view = function () {
-    console.log(this.queue);
-  };
+    console.log(this.queue)
+  }
 
-  return Queue;
+  return Queue
+}())
 
-}());
+// Implementation
+var myQueue = new Queue()
 
-//Implementation
-var myQueue = new Queue();
+myQueue.enqueue(1)
+myQueue.enqueue(5)
+myQueue.enqueue(76)
+myQueue.enqueue(69)
+myQueue.enqueue(32)
+myQueue.enqueue(54)
 
-myQueue.enqueue(1);
-myQueue.enqueue(5);
-myQueue.enqueue(76);
-myQueue.enqueue(69);
-myQueue.enqueue(32);
-myQueue.enqueue(54);
+myQueue.view()
 
-myQueue.view();
-
-console.log("Length: " + myQueue.length());
-console.log("Front item: " + myQueue.peek());
-console.log("Removed " + myQueue.dequeue() + " from front.");
-console.log("New front item: " + myQueue.peek());
-console.log("Removed " + myQueue.dequeue() + " from front.");
-console.log("New front item: " + myQueue.peek());
-myQueue.enqueue(55);
-console.log("Inserted 55");
-console.log("New front item: " + myQueue.peek());
+console.log('Length: ' + myQueue.length())
+console.log('Front item: ' + myQueue.peek())
+console.log('Removed ' + myQueue.dequeue() + ' from front.')
+console.log('New front item: ' + myQueue.peek())
+console.log('Removed ' + myQueue.dequeue() + ' from front.')
+console.log('New front item: ' + myQueue.peek())
+myQueue.enqueue(55)
+console.log('Inserted 55')
+console.log('New front item: ' + myQueue.peek())
 
 for (var i = 0; i < 5; i++) {
-  myQueue.dequeue();
-  myQueue.view();
+  myQueue.dequeue()
+  myQueue.view()
 }
 
-//console.log(myQueue.dequeue()); // throws exception!
+// console.log(myQueue.dequeue()); // throws exception!