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

Home
C++ Tutorial
1.Language Basics
2.Data Types
3.Operators statements
4.Array
5.Development
6.Exceptions
7.Function
8.Structure
9.Class
10.Operator Overloading
11.Pointer
12.File Stream
13.template
14.STL Introduction
15.string
16.vector
17.list
18.bitset
19.set multiset
20.valarray
21.queue stack
22.deque
23.map multimap
24.STL Algorithms Modifying sequence operations
25.STL Algorithms Non modifying sequence operations
26.STL Algorithms Binary search
27.STL Algorithms Sorting
28.STL Algorithms Merge
29.STL Algorithms Min Max
30.STL Algorithms Iterator
31.STL Algorithms Heap
32.STL Algorithms Helper
C / ANSI-C
C Tutorial
C++
Visual C++ .NET
C++ Tutorial » deque » deque pop 
22.7.2.clear dq by popping elements one at a time
#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(); ++idq[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
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.