[mgrex]

An identical code of the following was able to work successfully work with a <stack> container; except line 22 would use .top() , instead of .front() member function.

Error message reads: pop_front is not member of std::vector<_Ty>'

#include <iostream>
#include <queue>
#include <vector>
using namespace std;

int main()
{
	
	vector <int> vecOfInts;

	vecOfInts.push_back(4);
	vecOfInts.push_back(8);
	vecOfInts.push_back(3);
	vecOfInts.push_back(5);
	vecOfInts.push_back(0);
	vecOfInts.push_back(8);

	queue < int, vector<int> > qOfInts(vecOfInts);

	for (int i = 0; i < vecOfInts.size(); i++)
	{
		cout << "Front: " << qOfInts.front() << "  ";
		qOfInts.pop();		// pop value from front.
	}

	cout << endl;

	system("pause");
	return 0;
}

[mojo666]

Vector does not have a pop_front method. Only a list or a dequeue can be used as the underlying structure for a queue. Cite. If you look at stack, vectors do support the operations for it, so vectors can be the underlying structure for stacks.

This post has been edited by mojo666: 20 November 2012 - 09:41 PM

[ishkabible]

queue requires that there be a pop_front and push_back member for the implementing class hence a deque is the default container used.

the following works just fine.

#include <iostream>
#include <queue>
#include <deque>
using namespace std;

int main()
{

	deque <int> vecOfInts;

	vecOfInts.push_back(4);
	vecOfInts.push_back(8);
	vecOfInts.push_back(3);
	vecOfInts.push_back(5);
	vecOfInts.push_back(0);
	vecOfInts.push_back(8);

	queue < int, deque<int> > qOfInts(vecOfInts);

	for (int i = 0; i < vecOfInts.size(); i++)
	{
		cout << "Front: " << qOfInts.front() << "  ";
		qOfInts.pop();		// pop value from front.
	}

	cout << endl;
	return 0;
}

luckily however deque is the default so we can do the following as well

queue <int> qOfInts(vecOfInts);

and the program is equivalent(I bet the compiled binaries are even the same if you did a checksum of them)