A better priority queue class than the STL version. More...
#include <priority_queue2.h>
Inheritance diagram for std::priority_queue2< T, Cmp >:
Public Types | |
| typedef T | value_type |
| typedef Cmp | value_compare |
| typedef vector< T >::const_iterator | const_iterator |
| typedef vector< T >::const_reverse_iterator | const_reverse_iterator |
Public Member Functions | |
| priority_queue2 (const MyT &other) | |
| bool | empty () const |
| void | clear () |
| const T & | top () const |
| const T & | front () const |
| const T & | back () const |
| void | push (const T &obj) |
| void | pop () |
| const_iterator | begin () const |
| const_iterator | end () const |
| void | swap (MyT &other) |
Detailed Description
template<class T, class Cmp = less<T>>
class std::priority_queue2< T, Cmp >
A better priority queue class than the STL version.
Allows iterating and defining new priority orderings (no need to overload <)
The documentation for this class was generated from the following file:
