queue que; //queue采用模板類實(shí)現(xiàn)，queue對(duì)象的默認(rèn)構(gòu)造形式
queue(const queue &que); //拷貝構(gòu)造函數(shù)

queue& operator=(const queue &que); //重載等號(hào)操作符

push(elem); //往隊(duì)尾添加元素
pop(); //從對(duì)頭移除第一個(gè)元素
back(); //返回最后一個(gè)元素
front(); //返回第一個(gè)元素

empty(); //判斷堆棧是否為空
size(); //返回棧的大小
#include<iostream>
using namespace std;
#include <queue>
#include<string>
 
//隊(duì)列 Queue
class Person
{
public:
    Person(string name, int age)
    {
        this->m_Name = name;
        this->m_Age = age;
    }
    string m_Name;
    int m_Age;
};
 
void test01()
{
    //創(chuàng)建隊(duì)列
    queue<Person>q;
 
    //準(zhǔn)備數(shù)據(jù)
    Person p1("唐僧", 30);
    Person p2("孫悟空", 1000);
    Person p3("豬八戒", 900);
    Person p4("沙僧", 800);
 
    //入隊(duì)
    q.push(p1);
    q.push(p2);
    q.push(p3);
    q.push(p4);
 
    cout << "隊(duì)列大小為：" << q.size() << endl;
 
    //判斷只要隊(duì)列不為空，查看對(duì)頭，查看隊(duì)尾，出對(duì)
    while (!q.empty())
    {
        //查看對(duì)頭
        cout << "對(duì)頭元素 -- 姓名：" << q.front().m_Name << " 年齡：" << q.front().m_Age << endl;
        
        //查看隊(duì)尾
        cout << "隊(duì)尾元素 -- 姓名：" << q.back().m_Name << " 年齡：" << q.back().m_Age << endl;
 
        //出對(duì)
        q.pop();  //出隊(duì)是出對(duì)頭元素
 
    }
    cout << "隊(duì)列大小為：" << q.size() << endl;
}
 
int main() 
{
    test01();
 
    system("pause");
 
    return 0;
 
}