//本程序取自Clifford A.Shaffer著張銘等譯“數據結構與算法分析”第 75 頁，例4.3
//基于順序隊列問題解法 
 import java.io.*;
class LQueue 
   { private  Link  front;
     private  Link  rear;                     //
    
     public LQueue() {setup();}
     public LQueue(int sz){ setup();}

     private void setup()
       {front=rear=null;}
    //Remove all Objects from queue

     public void clear()
      {front=rear=null;}
  
      public static void Assert_notFalse(boolean p,String q)
     {if(!p)System.out.println((String)q);}

     //Enqueue Object at rear of queue 
     public void enqueue(Object it)
       {
        if(rear!=null){
          rear.setNext(newLink(it,null));
          rear=rear.next();
          }
        else front=rear=newLink(it,null); 
       }

    public Object dequeue()
       {
        Assert_notFalse(! isEmpty(),"Queue is empty ");
        Object it=front.element();
        front=front.next();
        if(front==null)rear=null;
        return it;
       }

    public Object firstValue()
       {
        Assert_notFalse(! isEmpty(),"Queue is empty ");       
        return front.element();
       }
    public boolean isEmpty()
       { return front==null;}
   }//class LQueue

    public class LQueue1
 {
  public static void main(String args[])
   { 
    
   }
}