C++关于简单队列的几点知识

C++关于简单队列的几点知识

1.入队（此方法引用于C++ Primer Plus）

思路：
（1）如果队列已满，则结束。（队列的最大长度可以通过构造函数实现）
（2）创建新节点。
（3）在节点中放入正确的值，并将节点的next指针设置为NULL（本人现在用的vs2015，编译器只能识别0或者c++11提供的nullptr）。
（4）将项计数+1。
（5）将节点附加到队尾。
其中，将节点附加到队尾具体实现：
1）将节点与另列表中的另一个节点连接起来。
方法：通过将当前队尾节点的next指针指向新队尾节点来完成。
2）将队列类中尾部成员指针rear设置为新节点，使队列可以直接访问最后一个节点
注意：如果只有一个节点 ，则它既是队首节点也是队尾节点。
实现：

bool Queue::enqueue(const Item & item) {

	if (isfull())
		return false;
	Node * add = new Node;

	add->item = item;
	add->next = nullptr;

	items++;

	if (front == nullptr)
		front = add;
	else
		rear->next = add;

	rear = add;
	return true;

}

2.出队

思路：
（1）如果队列为空，则结束。
（2）将队列的第一个项目提供给调用函数。
方法：通过将当前的front节点中的数据部分赋值到传递给方法的引用变量来实现。
（3）将项目计数-1。
（4）保存front节点的位置，供以后删除。
（5）让节点出队。
方法：通过成员指针front设置为下一个节点来完成。该节点的位置由佛front->next提供。
（6）为节省内存，删除以前的节点。
（7）如果链表为空，则rear设置为NULL。

实现：

bool Queue::dequeue(Item & item) {

	if (front == nullptr)
		return false;
	item = front->item;

	items--;

	Node *temp = front;
	front = front->next;
	delete temp;

	if (items == 0)
		rear = nullptr;
	return true;

}

注：给出示例为书本C++ Primer Plus的示例

//queue1.h
#ifndef QUEUE1_H_
#define QUEUE1_H_

class Customer
{
public:
	Customer() { arrive = processtime = 0; }

	void set(long when);
	long when()const { return arrive; }
	int ptime()const { return processtime; }

private:
	long arrive;
	int processtime;

};


#endif // !QUEUE_H_
#pragma once

//queue2.h
#pragma once
#ifndef QUEUE2_H_
#define QUEUE2_H_
#include"queue1.h"

typedef Customer Item;

class Queue
{
public:
	Queue(int qs = Q_SIZE);
	~Queue();

	bool isempty()const;
	bool isfull()const;
	int queuecount();
	bool dequeue(Item & item);
	bool enqueue(const Item & item);

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; }
};


#endif // !QUEUE2_H_
#pragma once

//queue1.cpp
#include<cstdlib>
#include"queue1.h"

void Customer::set(long when) {

	processtime = std::rand() % 3 + 1;
	arrive = when;

}

//queue2.cpp
#include"queue2.h"

Queue::Queue(int qs) :qsize(qs) {

	front = rear = nullptr;
	items = 0;

}

Queue::~Queue() {

	Node * temp;
	while (front != nullptr)
	{
		temp = front;
		front = front->next;
		delete temp;
	}

}

bool Queue::isempty()const {

	return items == 0;

}
bool Queue::isfull()const {

	return items == Q_SIZE;
}
int Queue::queuecount() {

	return items;

}


bool Queue::dequeue(Item & item) {

	if (front == nullptr)
		return false;
	item = front->item;

	items--;

	Node *temp = front;
	front = front->next;
	delete temp;

	if (items == 0)
		rear = nullptr;
	return true;

}

bool Queue::enqueue(const Item & item) {

	if (isfull())
		return false;
	Node * add = new Node;

	add->item = item;
	add->next = nullptr;

	items++;

	if (front == nullptr)
		front = add;
	else
		rear->next = add;

	rear = add;
	return true;

}

//main.cpp
#include<iostream>
#include<cstdlib>//rand() and srand()
#include<ctime>//time()
#include"queue1.h"
#include"queue2.h"


const int MIN_PER_HR = 60;

bool newcustomer(double x);

int main(void)
{
	using std::cin;
	using std::cout;
	using std::endl;
	using std::ios_base;
	// setting things up
	std::srand(std::time(0)); // random initializing of rand()
	cout << "Case Study: Bank of Heather Automatic Teller\n";
	cout << "Enter maximum size of each queue: ";
	int qs;
	cin >> qs;
	Queue line1(qs); // line queue holds up to qs people
	Queue line2(qs); // second queue
	cout << "Enter the number of simulation hours: ";
	int hours; // hours of simulation
	cin >> hours;
	// simulation will run 1 cycle per minute
	long cyclelimit = MIN_PER_HR * hours; // # of cycles
	Item temp; // new customer data
	long turnaways; // turned away by full queue
	long customers; // joined the queue
	long served; // served during the simulation
	long sum_line; // cumulative line length
	int wait_time1; // time until autoteller1 is free
	int wait_time2; // time until autoteller2 is free
	long line_wait; // cumulative time in line
	double min_per_cust; // average time between arrivals
	cout << "Enter the average number of customers per hour: ";
	double perhour; // average # of arrival per hour
	cin >> perhour;
	while (perhour > 0) // begin new loop
	{
		min_per_cust = MIN_PER_HR / perhour;
		turnaways = 0;
		customers = 0;
		served = 0;
		sum_line = 0;
		wait_time1 = wait_time2 = 0;
		line_wait = 0;
		// running the simulation
		for (long cycle = 0; cycle < cyclelimit; cycle++)
		{
			if (newcustomer(min_per_cust)) // have newcomer
			{
				if (line1.isfull() && line2.isfull())
					turnaways++;
				else // at least one line is not full
				{
					customers++;
					temp.set(cycle); // cycle = time of arrival
									 // add customer to shorter line
					if (line1.queuecount() <= line2.queuecount())
						line1.enqueue(temp); // add newcomer to line1
					else
						line2.enqueue(temp); // add newcomer to line2
				}
			}
			// process customers in first queue
			if (wait_time1 <= 0 && !line1.isempty())
			{
				line1.dequeue(temp); // attend next customer
				wait_time1 = temp.ptime(); // for wait_time minutes
				line_wait += cycle - temp.when();
				served++;
			}
			if (wait_time1 > 0)
				wait_time1--;
			sum_line += line1.queuecount();
			// process customers in second queue
			if (wait_time2 <= 0 && !line2.isempty())
			{
				line2.dequeue(temp); // attend next customer
				wait_time2 = temp.ptime(); // for wait_time minutes
				line_wait += cycle - temp.when();
				served++;
			}
			if (wait_time2 > 0)
				wait_time2--;
			sum_line += line2.queuecount();
		}
		// reporting results
		if (customers > 0)
		{
			cout << "customers accepted: " << customers << '\n';
			cout << " customers served: " << served << '\n';
			cout << " turnaways: " << turnaways << '\n';
			cout << "average queue size: ";
			cout.precision(2);
			cout.setf(ios_base::fixed, ios_base::floatfield);
			cout.setf(ios_base::showpoint);
			cout << (double)sum_line / cyclelimit << '\n';
			cout << " average wait time: "
				<< (double)line_wait / served << " minutes\n";
		}
		else
			cout << "No customers!\n";
		// clear queues
		while (!line1.isempty())
			line1.dequeue(temp);
		while (!line2.isempty())
			line2.dequeue(temp);
		cout << "Enter new value for customers per hour (0 to quit): ";
		cin >> perhour;
	} // end of new loop
	cout << "Bye\n";
	//cin.get();
	//cin.get();
	system("pause");
	return 0;
}

bool newcustomer(double x) {

	return (std::rand() * x / RAND_MAX < 1);

}