Queue: push, pop and size

[aruljothi]

#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);
  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;
}