package vipQueueArray;

public class vipQueue {

	int size;
	int[] queue;
	int currentIndex; //This keeps track of where the next item should be added
	
	public vipQueue(int size){
		this.size=size;
		this.currentIndex=0;
		this.queue = new int[size];
	}
	
	public void Enqueue(int itemToAdd){ //We assume a non-full queue
		queue[currentIndex]=itemToAdd;
		currentIndex++;
	} 
	
	public void EnqueueVip(int itemToAdd){//We assume a non-full queue
		for(int i=currentIndex-1;i>=0;i--){
			queue[i+1]= queue[i];
		}
		queue[0]=itemToAdd;
		currentIndex++;
		
	}
	
	public int Dequeue(){ //We assume a nonempty queue
		int frontOfQueue = queue[0];
		for(int i=0;i<currentIndex-1;i++){
			queue[i]=queue[i+1];
		}
		currentIndex--;
		return frontOfQueue;
	}
	
	public boolean isFull(){
		if(currentIndex==size){
			return true;
		}else{
			return false;
		}
	}
	
	public boolean isEmpty(){
		if(currentIndex==0){
			return true;
		}else{
			return false;
		}
	}
	
	
}