GenericQueue
GenericQueue
//
public GenericQueueCreate(int n) {
QueueData = (T[]) new Object[n];
front=-1;
rear=-1;
}
@Override
public void enqueue(T element) throws QueueFullException {
if(isFull()) {
throw new QueueFullException("Queue is Full ");
}else {
rear++;
QueueData [rear]= element;
}
}
@Override
public T dequeue() throws QueueEmptyException {
if(isEmpty()) {
throw new QueueEmptyException("Queue is Empty");
}
front++;
return QueueData[front];
}
@Override
public boolean isFull() {
if(rear==QueueData.length-1) {
return true;
}else {
return false;
}
}
@Override
public boolean isEmpty() {
if(front==rear) {
return true;
}else {
return false;
}
}
@Override
public T front() {
return QueueData[front+1];
}
}
//
//