So I'm using the STL priority_queue<> with pointers... I don't want to use value types because it will be incredibly wasteful to create a bunch of new objects just for use in the priority queue. So... I'm trying to do this:
class Int { public: Int(int val) : m_val(val) {} int getVal() { return m_val; } private: int m_val; } priority_queue<Int*> myQ; myQ.push(new Int(5)); myQ.push(new Int(6)); myQ.push(new Int(3)); Now how can I write a comparison function to get those to be ordered correctly in the Q? Or, can someone suggest an alternate strategy? I really need the priority_queue interface and would like to not use copy constructors (because of massive amounts of data). Thanks
EDIT: Int is just a placeholder/example... I know I can just use int in C/C++ lol...