#include <OSG/Utils/HeapT.hh>
Public Member Functions | |
HeapT () | |
Constructor. | |
HeapT (const HeapInterface &_interface) | |
Construct with a given HeapIterface . | |
~HeapT () | |
Destructor. | |
void | clear () |
clear the heap | |
bool | empty () |
is heap empty? | |
unsigned int | size () |
returns the size of heap | |
void | reserve (unsigned int _n) |
reserve space for _n entries | |
void | reset_heap_position (HeapEntry _h) |
reset heap position to -1 (not in heap) | |
bool | is_stored (HeapEntry _h) |
is an entry in the heap? | |
void | insert (HeapEntry _h) |
insert the entry _h | |
HeapEntry | front () |
get the first entry | |
void | pop_front () |
delete the first entry | |
void | remove (HeapEntry _h) |
remove an entry | |
void | update (HeapEntry _h) |
update an entry: change the key and update the position to reestablish the heap property. | |
bool | check () |
check heap condition |
The main difference (and performace boost) of this heap compared to e.g. the heap of the STL is that here to positions of the heap's elements are accessible from the elements themself. Therefore if one changes the priority of an element one does not have to remove and re-insert this element, but can just call the update(HeapEntry) method.
This heap class is parameterized by two template arguments:
HeapEntry
, that will be stored in the heap