Clear deque by popping elements one at a time. - C++ STL

C++ examples for STL:deque

Description

Clear deque by popping elements one at a time.

Demo Code

#include <iostream>
#include <deque>
using namespace std;
void show(const char *msg, deque<int> q);
int main() {//from ww  w .j ava2s. c  o  m
   //Declare a deque that has an initial capacity of 10.
   deque<int> dq(10);
   for(unsigned i=0; i < dq.size(); ++i)
      dq[i] = i*i;
   // Now, clear dq by popping elements one at a time.
   cout << "Front popping elements from dq.\n";
   while(dq.size() > 0) {
      cout << "Popping: " << dq.front() << endl;
      dq.pop_front();
   }
   if(dq.empty()) cout << "dq is now empty.\n";
   return 0;
}
// Display the contents of a deque<int>.
void show(const char *msg, deque<int> q) {
   cout << msg;
   for(unsigned i=0; i < q.size(); ++i)
      cout << q[i] << " ";
   cout << "\n";
}

Result


Related Tutorials