public class CircularArray {
private int[] data;
private int cs;//countsize
private int ms;//maxsize
private int front;
private int rear;
private int item;
private static final int default_capacity = 10;
public CircularArray() {
this(default_capacity);
}
public CircularArray(int capacity) {
this.data = new int[capacity];
this.cs=0;
this.ms=capacity;
this.front=this.rear=0;
}
public boolean isFull(){
return this.cs==this.ms;
}
public boolean isEmpty(){
return this.cs==0;
}
public void front(int value){
if(!this.isFull()){
this.data[this.rear]=value;
this.rear+=1;
cs+=1;
}
else {
System.out.println("queue is full");
this.rear=(this.rear+1)%ms;
}
}
public void deque(){
if(!this.isEmpty()){
this.item=this.data[this.front];
this.data[this.front]=0;
this.front+=1;
this.cs-=1;}
else{
System.out.println("there is no element present in the queue");
this.front=(this.front+1)%ms;
}
}
public int getFront(){
return this.item;
}
}