seqcircularqueueapp.java

来自「基本数据结构」· Java 代码 · 共 54 行

package circularQueue;

import circularQueue.SeqCircularQueue.EmptyQueueException;
import circularQueue.SeqCircularQueue.FullQueueException;

public class SeqCircularQueueApp 
{
	public static void main(String[] args) 
	{
		System.out.println ("SeqCircularQueue Demo");
	    System.out.println ("---------------------");
	    seqcircularqueueApp (new SeqCircularQueue(6));
	}
	static void seqcircularqueueApp (Queue q)
	{
		System.out.println ("Is empty = " + q.isEmpty ());
		System.out.println ("Is full = " + q.isFull ());
	    System.out.println ("Inserting \"This\"");
	    q.insert ("This");
	    System.out.println ("Inserting \"is\"");
	    q.insert ("is");
	    System.out.println ("Inserting \"a\"");
	    q.insert ("a");
	    System.out.println ("Inserting \"sentence\"");
	    q.insert ("sentence");
	    System.out.println ("Inserting \".\"");
	    q.insert (".");
	    try
	    {
	    	System.out.println ("Inserting \"One last item\"");
	        q.insert ("One last item");
	    }catch (FullQueueException e)
	    {
	    	System.out.println ("One insert too many");
	        System.out.println ("Is empty = " + q.isEmpty ());
	        System.out.println ("Is full = " + q.isFull ());
	    }
	    System.out.println ();
	    while (!q.isEmpty ())
	    System.out.println (q.remove () + " [Is empty = " + q.isEmpty () +
	                             ", Is full = " + q.isFull () + "]");
	    try
	      {
	          q.remove ();
	      }
	      catch (EmptyQueueException e)
	      {
	          System.out.println ("One remove too many");
	      }

	      System.out.println ();
	}
}