C++_嵌套类

#ifndef QUEUETP_H_
#define QUEUETP_H_

template <class Item>
class QueueTP
{
private:
	enum{ Q_SIZE = 10};

	class Node
	{
	public:
		Item item;
		Node * next;
		Node(const Item &i) :item(i), next(0){}
	};

	Node * front;
	Node * rear;
	int items;				//current number of items in Queue
	const int qsize;		//maximum number of items in Queue

	QueueTP(const QueueTP &q) :qsize(0){}
	QueueTP & operator=(const QueueTP &q){ return *this; }

public:
	QueueTP(int qs = Q_SIZE);
	~QueueTP();
	bool isempty()const{
		return items == 0;
	}
	bool isfull()const{
		return items == qsize;
	}
	int queuecount()const{
		return items;
	}
	bool enqueue(const Item &item);
	bool dequeue(Item &item);
};

template<class Item>
QueueTP<Item>::QueueTP(int qs) :qsize(qs){
	front = rear = 0;
	items = 0;
}

template<class Item>
QueueTP<Item>::~QueueTP(){
	Node * temp;
	while (front != 0){
		temp = front;
		front = front->next;
		delete temp;
	}
}

template<class Item>
bool QueueTP<Item>::enqueue(const Item &item){
	if (isfull())
		return false;
	Node *add = new Node(item);
	if (add == NULL){
		return false;
	}
	items++;
	if (front == 0)
		front = add;
	else
		rear->next = add;
	
	rear = add;
	return true;
}

template<class Item>
bool QueueTP<Item>::dequeue(Item &item){
	if (front == 0)
		return false;
	item = front->item;
	items--;
	Node * temp = front;
	front = front->next;
	delete temp;
	if (items == 0)
		rear = 0;
	return true;
}

#endif

#include <iostream>
#include <string>

#include "Queue.h"

int main(){
	using std::cin;
	using std::cout;
	using std::string;
	using std::endl;

	QueueTP<string> cs(5);
	string temp;

	while (!cs.isfull())
	{
		cout << "Please enter your name. You will be "
			<< "served in the order of arrival.\n"
			"name :";
		getline(cin, temp);
		cs.enqueue(temp);
	}
	cout << "The queue is full. Processing begins!\n";

	while (!cs.isempty())
	{
		cs.dequeue(temp);
		cout << "Now processing " << temp << "...\n";
	}

	return 0;
}