队列容器 queue容器

#include<iostream>
using namespace std;
#include<queue>
class person
{
public:
	person(string name, int age)
	{
		this->m_name = name;
		this->m_age = age;
	}
	string m_name;
	int m_age;
};
//ostream operator<<(person& p)
//{
//
//}
void test01()
{
	person p1("御坂美琴", 18);
	person p2("艾米莉亚", 20);
	person p3("岩永琴子", 15);
	person p4("伊蕾娜", 18);
	//创建queue容器
	queue<person>q;
	//入队
	q.push(p1);
	q.push(p2);
	q.push(p3);
	q.push(p4);
	cout << "队列的大小：" << q.size() << endl;
	//判断队列是否为空  如果不为空 就查看对头查看队尾  出队
	while (!q.empty())
	{
		cout << " 队头的姓名：" << q.front().m_name << " 队头的年龄：" << q.front().m_age << endl;
		cout << " 队尾的姓名:" << q.back().m_name << " 队尾的年龄：" << q.back().m_age << endl;
		//出队操作
		q.pop();
	}

	cout << "队列的大小：" << q.size() << endl;

}
int main()
{
	test01();
}