第十四章编程练习(3)

最新推荐文章于 2024-08-12 16:30:33 发布

Maninblack_C

最新推荐文章于 2024-08-12 16:30:33 发布

阅读量595

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ Primer Plus

本文链接：https://blog.youkuaiyun.com/Maninblack_C/article/details/50805341

C++ Primer Plus 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一个使用模板类实现的队列容器，并通过一个名为Worker的类实例化来展示其应用。通过实现队列操作如入队、出队、判断队列是否为空或满等功能，以及Worker类的属性设置和显示，详细阐述了如何将队列容器应用于工作员管理场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

建立一个容器类模板，然后使用Worker作为容器类参数

QUEUETP.h

#pragma once
#ifndef WORKERMI_H_
#define WORKERMI_H_
#include<string>
template<class T>//创建一个容器类模板
class QueueTP{
private:
	struct Node { T item; Node * next; };
	Node * front;
	Node * rear;
	int items;
	const int qsize;
	QueueTP(const QueueTP & q) :qsize(0) {};
	QueueTP & operator=(const QueueTP & q) { return *this; };
public:
	QueueTP(int qs = 10);
	~QueueTP();
	bool isempty()const;
	bool isfull()const;
	int queuecount()const;
	bool enqueue(const T & item);
	bool dequeue(T & item);
};
class Worker
{
private:
	std::string fullname;
	long id;
public:
	Worker() : fullname("no one"), id(0L) { }
	Worker(const std::string & s, long n)
		: fullname(s), id(n) { }
	~Worker() {};
	 void Set();
	 void Show()const;
};
template <class T>
QueueTP<T>::QueueTP(int qs):qsize(qs)
{
	front = rear = nullptr;
	items = 0;
}
template<class T>
inline QueueTP<T>::~QueueTP()
{
	Node * temp;
	while (front != nullptr)
	{
		temp = front;
		front = front->next;
		delete temp;
	}
	}
template<class T>
inline bool QueueTP<T>::isempty() const
{
	return items ==0;
}
template<class T>
inline bool QueueTP<T>::isfull() const
{
	return items == qsize;
}
template<class T>
inline int QueueTP<T>::queuecount() const
{
	return items;
}
template<class T>
inline bool QueueTP<T>::enqueue(const T & 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;
}
template<class T>
inline bool QueueTP<T>::dequeue(T & 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;
};
;
#endif

QUEUETP.cpp

#include "QUEUETP.h"
#include <iostream>
void Worker::Set()
{
	using namespace std;
	cout << "Enter worker's name: ";
	getline(cin, fullname);
	cout << "Enter worker's ID: ";
	cin >> id;//获取换行符，不然会影响下一次输入
	while (cin.get() != '\n')
			continue;
}

void Worker::Show() const
{
	using std::cout;
	using std::endl;
	cout << "Name: " << fullname << endl;
	cout << "Employee ID: " << id << endl;
}

#include <iostream>
#include "QUEUETP.h"
const int Size = 5;
int main()
{
	using std::cout;
	using std::cin;
	using std::endl;
	QueueTP<Worker*>lolas(Size);
	Worker *temp;
	int n;
	char ch;
	cout << "Enter the command:\n"
		<< "A or a enter queue, "
		<< "P or p delete queue, "
		<< "Q or q quit.\n";
	while ((cin >> ch)&&ch != 'q' && ch != 'Q')
	{
		while (strchr("apqAPQ", ch) == nullptr)
		{
			cout << "Please enter a p or q: ";
			cin >> ch;
		}
		switch (ch)
		{
		case 'a':
		case 'A':
			temp = new Worker;
			cin.get();
			temp->Set();
			if(lolas.isfull())
				cout<< "Queue already full\n";
			else
				lolas.enqueue(temp);
			break;
		case'p':
		case'P':
			if (lolas.isempty())
				cout << "Queue already empty\n";
			else
				lolas.dequeue(temp);
			break;
		}
		cout << "Please enter a p or q: ";
	}
	cout << "\nHere the total count: ";
	cout << lolas.queuecount();
	cout << "\nDone\n"
		<< "Bye";
	cin.get();
	cin.get();
	return 0;
}