[ VIGRA Homepage | Function Index | Class Index | Namespaces | File List | Main Page ]
|
PriorityQueue< ValueType, PriorityType, Ascending > Class Template Reference | ![]() |
Heap-based priority queue compatible to BucketQueue. More...
#include <vigra/priority_queue.hxx>
Public Member Functions | |
| bool | empty () const |
Queue contains no elements. Equivalent to size() == 0. | |
| priority_type | maxIndex () const |
Maximum index (i.e. priority) allowed in this queue. Equivalent to bucket_count - 1. | |
| void | pop () |
| Remove the current top element. | |
| PriorityQueue () | |
| Create empty priority queue. | |
| void | push (value_type const &v, priority_type priority) |
| Insert new element. More... | |
| size_type | size () const |
| Number of elements in this queue. | |
| const_reference | top () const |
| The current top element. | |
| priority_type | topPriority () const |
| Priority of the current top element. | |
Heap-based priority queue compatible to BucketQueue.
This template is compatible to vigra::BucketQueue, but accepts arbitrary priority types. Internally, it uses a std::priority_queue, but implements an API where priorities and payload data are separate, like in vigra::BucketQueue.
#include <vigra/priority_queue.hxx>
Namespace: vigra
| void push | ( | value_type const & | v, |
| priority_type | priority | ||
| ) |
Insert new element.
|
© Ullrich Köthe (ullrich.koethe@iwr.uni-heidelberg.de) |
html generated using doxygen and Python
|