Re: Priority queue question

On Apr 9, 3:11 pm, Kelvin Moss <km_jr_use...@yahoo.com> wrote:


You need to provide the comparison object type as a template
parameter. This is easy though, because the comparison type is the
third template parameter which necessitates to also specify the
implementation type even though one may not know or do not care. :)

vector should work for a priority queue implementation that uses the
heap data structure (g++'s implementation uses vector anyway):

#include <queue>
#include <functional>
#include <vector>
#include <assert.h>

typedef std::priority_queue<int,
                            std::vector<int>,
                            std::greater<int> > MyQueue;
int main()
{
    MyQueue q;
    q.push(2);
    q.push(1);

    assert(q.top() == 1);
}

Ali