Pyrogenesis
13997
|
Priority queue implemented as a binary heap. More...
#include <PriorityQueue.h>
Classes | |
struct | Item |
Public Member Functions | |
void | push (const Item &item) |
Item * | find (ID id) |
void | promote (ID id, R newrank) |
Item | pop () |
bool | empty () |
size_t | size () |
Public Attributes | |
std::vector< Item > | m_Heap |
Priority queue implemented as a binary heap.
This is quite dreadfully slow in MSVC's debug STL implementation, so we shouldn't use it unless we reimplement the heap functions more efficiently.
Definition at line 61 of file PriorityQueue.h.
|
inline |
Definition at line 113 of file PriorityQueue.h.
|
inline |
Definition at line 76 of file PriorityQueue.h.
|
inline |
Definition at line 102 of file PriorityQueue.h.
|
inline |
Definition at line 86 of file PriorityQueue.h.
|
inline |
Definition at line 70 of file PriorityQueue.h.
|
inline |
Definition at line 118 of file PriorityQueue.h.
std::vector<Item> PriorityQueueHeap< ID, R, CMP >::m_Heap |
Definition at line 123 of file PriorityQueue.h.