队列模拟（C++）

Queue.h

#pragma once
class Customer 
{
private:
	long arrive;
	int processtime;
public:
	Customer() { arrive = processtime = 0; }
	void set(long when);
	long when() const { return arrive; }
	int ptime() const { return processtime; }
};

typedef Customer Item;

class Queue
{
private:
	struct Node
	{
		Item item;
		struct Node *next;
	};
	enum{Q_SIZE=10};
	Node *front;
	Node *rear;
	int items;
	const int qsize;
	Queue(const Queue &q) :qsize(0) { }
	Queue &operator=(const Queue &q) { return *this; }
public:
	Queue(int qs=Q_SIZE);
	~Queue();
	bool isempty() const;
	bool isfull() const;
	int queuecount() const;
	bool enqueue(const Item &item);
	bool dequeue(Item &item);
};

Queue.cpp

#include "Queue.h"
#include<cstdlib>


Queue::Queue(int qs) :qsize(qs)
{
	front = NULL;
	rear = NULL;
	items = 0;
}


Queue::~Queue()
{
	Node *temp;
	while (fro