Queue - Java

Queue - Java

Java Programming

Queue Class

The class of Queue with initialization max size, queue array for making an array, front of data value, rear of data value and more items in queue array .
public class Queue { private int maxSize; private long[] queArray; private int front; private int rear; private int nItems;

Queue Method

It's make an array with queue mode. This method used a FIFO (First in First out) mode with -1 every inserted a value in queue array.
public Queue(int size) { this.maxSize = size; queArray = new long[maxSize]; front = 0; rear = -1; nItems = 0; }

Insert Method

This method used for inserting value for queue array and rear declared with max size - 1 and the items of queue array will be increased.
public void insert(long value) { if (rear == maxSize - 1) { rear = -1; } queArray[++rear] = value; nItems++; }

Remove Method

Remove method is used for removing value in the queue array and moving forward n queue elements to value that removed.
public long remove() { long temp = queArray[front++]; if (front == maxSize) { front = 0; } nItems--; return temp; }

Peek Method

This method used to retrieve or fetch the first element of the queue array or the element present at the top of queue array.
public long peekFront() { return queArray[front]; }

Is Empty Method

This method is for checking an array and operating an array with no items in array.
public boolean isEmpty() { return (nItems == 0); }

Is Full Method

This method is for checking an array and operating an array with items in array. So it's same with max size an queue array
public boolean isFull() { return (nItems == maxSize); }

Size Method

Size method is used for how many value can inserted in queue array
public int size() { return nItems; }

Main Method

Main method used for operating this queue array like inserting value and removing value in queue array
public static void main(String[] args) { Queue theQueue = new Queue(5); theQueue.insert(10); theQueue.insert(20); theQueue.insert(30); theQueue.insert(40); theQueue.remove(); theQueue.remove(); theQueue.remove(); theQueue.insert(50); theQueue.insert(60); theQueue.insert(70); theQueue.insert(80); while (!theQueue.isEmpty()) { long n = theQueue.remove(); System.out.print(n); System.out.println(""); } System.out.println(""); } } //End of Class