algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 01:18:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

Changed queue from object type to array type and adjusted methods to reflect this change

Browse Source
This commit is contained in:
Josh Vinge
2017-10-01 20:24:25 -04:00
parent 42998ace85
commit 11964de6b0
1 changed files with 7 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files

36
Data Structures/Queue/Queue.js
View File

@ -9,41 +9,29 @@
var Queue = function() {
//This keeps track of where the end of the queue is
this.back = 0;
//This is the array representation of the queue
this.queue = {};
this.queue = [];
//Add a value to the end of the queue
this.enqueue = function(item) {
this.queue[this.back] = item;
this.back++;
this.queue[this.queue.length] = item;
}
//Removes the value at the front of the queue
this.dequeue = function() {
if (this.back === 0) {
if (this.queue.length === 0) {
return "Queue is Empty";
}
var result = this.queue[this.front];
delete this.queue[this.front];
//Shift all the other items forward
for (var i = 1; i < this.back; i++) {
this.queue[i - 1] = this.queue[i];
}
//clean up the leftover duplicated value at the back of the queue
delete this.queue[this.back];
this.back--;
var result = this.queue[0];
this.queue.splice(0, 1); //remove the item at position 0 from the array
return result;
}
//Return the length of the queue
this.length = function() {
return this.back;
return this.queue.length;
}
//Return the item at the front of the queue
@ -53,17 +41,7 @@ var Queue = function() {
//List all the items in the queue
this.view = function() {
var str = "{"
//construct a single string to represent the items in the queue
for (var i = 0; i < this.back; i++) {
str += this.queue[i];
if (i !== this.back - 1) {
str += ", ";
}
}
str += "}";
console.log(str);
console.log(this.queue);
}
}