//文件名：CHAPTER5-12.cpp
#include <list>
#include <iostream>
#include <queue>
#include <deque>
using namespace std ;
// 通過list使用queue 
typedef list<int > INTLIST;
typedef queue<int>  INTQUEUE;
//通過deque使用queue 
typedef deque<char*> CHARDEQUE;
typedef queue<char*> CHARQUEUE;
void main(void)
{
    int size_q;
    INTQUEUE q;
    CHARQUEUE p;
    // Insert items in the queue(uses list)
    q.push(42);
    q.push(100);
    q.push(49);
    q.push(201);
    // Output the size of queue
    size_q = q.size();
    cout << "size of q is:" << size_q << endl;
    // Output items in queue using front()
    // and use pop() to get to next item until
    // queue is empty
    while (!q.empty())    {    cout << q.front() << endl;   q.pop();   }
// Insert items in the queue(uses deque)
    p.push("cat");
    p.push("ape");
    p.push("dog");
    p.push("mouse");
    p.push("horse");
    // Output the item inserted last using back()
    cout << p.back() << endl;
    // Output the size of queue
    size_q = p.size();
    cout << "size of p is:" << size_q << endl;
    // Output items in queue using front()
    // and use pop() to get to next item until
    // queue is empty
    while (!p.empty())  {  cout << p.front() << endl;  p.pop(); }
}