STL Samples : <deque>
両頭キュー
deque
#include <iostream> #include <algorithm> #include <deque> #include "to_string.h" #include "foo.h" using namespace std; void std_deque() { cout << "deque" << endl; deque<Foo> qf; for ( int i = 0; i < 5; i++ ) if ( i % 2 ) qf.push_front(i); else qf.push_back(i); cout << to_string(qf.begin(), qf.end()) << endl; cout << "sort..." << endl; sort(qf.begin(),qf.end()); cout << to_string(qf.begin(), qf.end()) << endl; }