queue

by manappa

JavaScript

function Queue(){
	collection = [];
	this.print = function(){
  	console.log(collection)
  }
  this.enqueue = function(element){
  collection.push(element);
  }
  this.dequeue = function(){
  return collection.shift()
  }
  this.size = function(){
  return collection.length;
  }
}
var q = new Queue();
q.enqueue(2);
q.enqueue(3);
q.enqueue(4);
q.dequeue();
q.print();
console.log("size of q",q.size())
console.log("++++++++end++++++++");

function PriorityQueue(){
  prioritycollection = [];
  this.print = function(){
  	return prioritycollection;
  }
  this.enqueue = function (element){
    if(prioritycollection.length == 0){
      prioritycollection.push(element)
    }else{
    	console.log("prioritycollection",prioritycollection)
    	for(let i=0;i<prioritycollection.length;i++){
      	if(element[1] < prioritycollection[i][1]){
        	prioritycollection.splice(i,0,element);
        }
      }
    }
  }
  
} 

var p = new PriorityQueue();
p.enqueue(["manny2",2]);
p.enqueue(["manny1",1]);
console.log("!!!",p.print());