标签：
template <class T, class Container = deque<T> > class queue;
queues是一种容器适配器，用C++中的模板写成，设计的目的在于用来操作先进先出（FIFO）的线性表。它包含了队列的基本操作：
下面给出几个官方示例程序：
// queue::empty #include <iostream> // std::cout #include <queue> // std::queue int main () { std::queue<int> myqueue; int sum (0); for (int i=1;i<=10;i++) myqueue.push(i); while (!myqueue.empty()) { sum += myqueue.front(); myqueue.pop(); } std::cout << "total: " << sum << ‘\n‘; return 0; }
// queue::size #include <iostream> // std::cout #include <queue> // std::queue int main () { std::queue<int> myints; std::cout << "0. size: " << myints.size() << ‘\n‘; for (int i=0; i<5; i++) myints.push(i); std::cout << "1. size: " << myints.size() << ‘\n‘; myints.pop(); std::cout << "2. size: " << myints.size() << ‘\n‘; return 0; }
// queue::front #include <iostream> // std::cout #include <queue> // std::queue int main () { std::queue<int> myqueue; myqueue.push(77); myqueue.push(16); myqueue.front() -= myqueue.back(); // 77-16=61 std::cout << "myqueue.front() is now " << myqueue.front() << ‘\n‘; return 0; }
// queue::back #include <iostream> // std::cout #include <queue> // std::queue int main () { std::queue<int> myqueue; myqueue.push(12); myqueue.push(75); // this is now the back myqueue.back() -= myqueue.front(); std::cout << "myqueue.back() is now " << myqueue.back() << ‘\n‘; return 0; }
// queue::push/pop #include <iostream> // std::cin, std::cout #include <queue> // std::queue int main () { std::queue<int> myqueue; int myint; std::cout << "Please enter some integers (enter 0 to end):\n"; do { std::cin >> myint; myqueue.push (myint); } while (myint); std::cout << "myqueue contains: "; while (!myqueue.empty()) { std::cout << ‘ ‘ << myqueue.front(); myqueue.pop(); } std::cout << ‘\n‘; return 0; }
标签：
原文地址：http://www.cnblogs.com/robothy/p/4931002.html
