Java Reference
In-Depth Information
head = (head+1)%elements.length;
return element;
}
boolean isEmpty()
{
return head == tail;
}
boolean isFull()
{
return (tail+1)%elements.length == head;
}
public static void main(String[] args)
throws QueueFullException, QueueEmptyException
{
Queue<String> queue = new Queue<>(6);
System.out.println("Empty: "+queue.isEmpty());
System.out.println("Full: "+queue.isFull());
System.out.println("Adding A");
queue.insert("A");
System.out.println("Adding B");
queue.insert("B");
System.out.println("Adding C");
queue.insert("C");
System.out.println("Adding D");
queue.insert("D");
System.out.println("Adding E");
queue.insert("E");
System.out.println("Empty: "+queue.isEmpty());
System.out.println("Full: "+queue.isFull());
System.out.println("Removing "+queue.remove());
System.out.println("Empty: "+queue.isEmpty());
System.out.println("Full: "+queue.isFull());
System.out.println("Adding F");
queue.insert("F");
while (!queue.isEmpty())
System.out.println("Removing "+queue.remove());
Search WWH ::




Custom Search