clear dq by popping elements one at a time : deque pop « deque « C++ Tutorial






#include <iostream>
#include <deque>

using namespace std;

void show(const char *msg, deque<int> q);

int main() {

  deque<int> dq(10);

  for(unsigned i=0; i < dq.size(); ++i) dq[i] = i*i;

  show("Contents of dq: ", dq);

  // 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";
}








22.7.deque pop
22.7.1.deque: constructor, size(), push_back(), pop_back(), begin(), end()
22.7.2.clear dq by popping elements one at a time
22.7.3.Remove first and last element