priority queue in STL

[Solaris]

I have been trying to use priority queue as a min-heap for integers.
I have used something like

Code: Select all

struct RevInt
{
    int value;

    bool operator<(const RevInt &b) const
    {
         return b.value < value;
    }
}

priority_queue<RevInt> pq;

But I was wondering how to use the constructor that overloads the default Compare function for integer. What I mean to say is I want to use something like

Code: Select all

priority_queue<int> pq;

how can I do that ??

[Bj]

Try this:

Code: Select all

// normal priority queue
priority_queue<int> pq1;

// reversed
priority_queue< int, vector<int>, greater<int> > pq2;

The default priority queue looks exactly like the "reversed" one above but uses std::less instead of std::greater as the comparision routine.

[Solaris]

Thank you Bj