package com.util;
import java.lang.*;

public class Queue //動(dòng)態(tài)鏈表隊(duì)列類
{
	class QueueNode //鏈表節(jié)點(diǎn)類
	{
		private Object tData;
		private QueueNode next;
		public QueueNode(Object tData,QueueNode next)
		{this.tData=tData;this.next=next;};
	};

	private QueueNode front = null;
	private QueueNode rear = null;
	private int count = 0 ;

	public Queue(){};
	public boolean IsEmpty()
	{return (front==null);}

	public void EnQueue(Object tItem) //進(jìn)隊(duì)
	{
		count++;
		if(front==null)
		{
			rear = new QueueNode(tItem,null);
			front = rear;
			return;
		}

		QueueNode tp = rear;
		rear = new QueueNode(tItem,null);
		tp.next = rear;
		return;
	}

	public Object DeQueue() //出隊(duì)
	{
		if(front==null)
			return null;
		
		count--;
		QueueNode tp = front;
		front = front.next;
		tp.next = null;
		if(front==null)
			rear = null;
		return tp.tData;
	}

	public Object GetFront() //取出隊(duì)頭元素
	{
		if(front==null)
			return null;
		return front.tData;
	}

	public void EmptyQueue() //清空隊(duì)
	{
		count = 0 ;
		if(front==null)
			return;
		QueueNode tp = front;
		while(front!=null)
		{
			tp.next = null;
			front = front.next;
			tp = front;
		}
		rear = null;
	}

	public int getCount ( )
	{
		return count ;
	}

	public static void main(String args[])
	{
		Queue q = new Queue();
		q.EnQueue("abd");
		q.EnQueue("dtagda");
		q.EnQueue("4523");
		//q.EmptyQueue();
		com.parser.Configuration.QUEUE.EnQueue("ggg");
		com.parser.Configuration.QUEUE.EnQueue("ttt");
System.out.println(com.parser.Configuration.QUEUE.getCount());
		while ( !q.IsEmpty ( ) )
		{
			System.out.println ( "\r\n    [" + q.DeQueue ( ) + "]" ) ;
		}
	}
}