Deque in C++ Standard Template Library














































Deque in C++ Standard Template Library



Deque stands for Double ended queue .
Double ended queue are sequence containers with dynamic sizes that can be expanded or
contracted at both ends ( can be front or back ).Specific libraries may implement deques in
different ways , generally as some form of dynamic array.Queus allow the individual elements 
to be accessed directly through access iterators .

Sample example program :-

#include <iostream> #include <deque> using namespace std; void showdq(deque <int> g) { deque <int> :: iterator it; for (it = g.begin(); it != g.end(); ++it) cout << '\t' << *it; cout << '\n'; } int main() { deque <int> gquiz; gquiz.push_back(10); gquiz.push_front(20); gquiz.push_back(30); gquiz.push_front(15); cout << "The deque gquiz is : "; showdq(gquiz); cout << "\ngquiz.size() : " << gquiz.size(); cout << "\ngquiz.max_size() : " << gquiz.max_size(); cout << "\ngquiz.at(2) : " << gquiz.at(2); cout << "\ngquiz.front() : " << gquiz.front(); cout << "\ngquiz.back() : " << gquiz.back(); cout << "\ngquiz.pop_front() : "; gquiz.pop_front(); showdq(gquiz); cout << "\ngquiz.pop_back() : "; gquiz.pop_back(); showdq(gquiz); return 0; }
OUTPUT :-




Comments