Dutor

template 
class Queue
{
public:
	Queue(int size = 30);
	~Queue();
	void EnQueue(T value);
	T DeQueue();
	T GetFirst();
	bool IsEmpty();
	bool IsFull();
	void ClearQueue();
private:
	T *queue;
	int front;
	int rare;
	int MaxSize;
	int CurLen;
};
 
template 
Queue::Queue(int size = 30)
{
	queue = new T[size];
	front = 0;
	rare = 0;
	CurLen = 0;
	MaxSize =size;
}
 
template 
Queue::~Queue()
{
	delete queue;
}
 
template
void Queue::EnQueue(T value)
{
	queue[rare] = value;
	rare = (rare + 1)%MaxSize;
	CurLen++;
}
 
template
T Queue::DeQueue()
{
	T value;
	if(IsEmpty())
	{
		cout<<"Empty When Dequeue"<
T Queue::GetFirst()
{
	T value;
	if(IsEmpty())
	{
		cout<<"Empty When GetFirst!"<
bool Queue::IsEmpty()
{
	return (front==rare&&CurLen==0)?true:false;
}
 
template
bool Queue::IsFull()
{
	return (front==rare&&CurLen==MaxSize)?true:false;
}
 
template
void Queue::ClearQueue()
{
	front = 0;
	rare = 0;
	CurLen = 0;
}