Queue: push, pop and size : queue « queue stack « C++ Tutorial






  1. C++ Tutorial
  2. queue stack
  3. queue
#include <iostream>
#include <queue> 
#include <list>
using namespace std;

int main()
{

  int thedata[] = {45, 34, 56, 27, 71, 50, 62};
  queue<int, list<int> > q;  
  cout << "The queue size is now " << q.size() << endl;

  cout << "Pushing 4 elements " << endl;
  for (int i = 0; i < 4; ++i)
    q.push(thedata[i]);
  cout << "The queue size is now " << q.size() << endl;

  cout << "Popping 3 elements " << endl;
  for (int i = 0; i < 3; ++i) {
    cout << q.front() << endl;
    q.pop();
  }
  cout << "The queue size is now " << q.size() << endl;

  return 0;
}

The queue size is now 0
Pushing 4 elements
The queue size is now 4
Popping 3 elements
45
34
56
The queue size is now 1




21.2.queue
21.2.1.Instantiating an STL Queue
21.2.2.Working with a Queue of Integers
21.2.3.A queue for strings: push, empty, front, pop
21.2.4.queue with doubles
21.2.5.queue: push, pop, front and size
21.2.6.queue.front()
21.2.7.Queue buffer
21.2.8.Using a queue to store user-defined object
21.2.9.Queue: push, pop and size