#include <iostream.h>
#include <stdlib.h>
const int MaxQueueSize = 100;

class SeqQueue
{
		private:
			datatype data[MaxQueueSize];		//抽象類型datatype定義的數組
			int front;							//隊頭指示器
			int rear;							//隊尾指示器
			int count;							//元素個數計數器
		public:
			SeqQueue(void)				  		//構造函數
				{front = rear = 0; count = 0;}; 
			~SeqQueue(void){};  					//析構函數
			void QInsert(const datatype& item); //入隊列
			datatype QDelete(void);       		//出隊列
			datatype QFront(void)const; 			//讀隊頭元素值
			int QueueEmpty(void)const  			//判隊列是否為空
        			{return front == rear;};
			void ClearQueue(void)           		//清空隊列
        			{front = rear = 0; count = 0;}
			int GetSize(void)const     			//取隊列元素個數
        			{return count;};
};

//把元素item入隊列
void SeqQueue::QInsert(const datatype& item)
{
   if(count == MaxQueueSize)
   {
      cerr << "隊列已滿!" << endl;
	  exit(1);
   }
   data[rear] = item;						//把元素item加在隊尾
   rear = (rear + 1) % MaxQueueSize;			///隊尾指示器加1
   count++;									//計數器加1
}

//把隊頭元素出隊列，出隊列元素由返回值帶回
datatype SeqQueue::QDelete()
{
   datatype temp;
   if(count == 0)
   {
      cerr << "隊列已空!" << endl;
	  exit(1);
   }
   temp = data[front];						//保存原隊頭元素值
   front = (front + 1) % MaxQueueSize;		//隊頭指示器加1
   count--;									//計數器減1
   return temp;								//返回原隊頭元素
}

//讀隊頭元素，隊頭元素由返回值帶回
datatype SeqQueue::QFront(void)const
{  
   if(count == 0)
   {
      cerr << "隊列空!" << endl;
	  exit(1);
   }
   return data[front];						//返回隊頭元素
}