#include <AlpsPriorityQueue.h>
|
| AlpsPriorityQueue () |
|
| AlpsPriorityQueue (AlpsSearchStrategy< T > &compare) |
|
const std::vector< T > & | getContainer () const |
| Return a const reference to the container.
|
|
void | setComparison (AlpsSearchStrategy< T > &c) |
| Set comparison function and resort heap.
|
|
T | top () const |
| Return the top element of the heap.
|
|
void | push (T x) |
| Add a element to the heap.
|
|
void | pop () |
| Remove the top element from the heap.
|
|
bool | empty () const |
| Return true for an empty vector.
|
|
size_t | size () const |
| Return the size of the vector.
|
|
void | clear () |
| Remove all elements from the vector.
|
|
template<class T>
class AlpsPriorityQueue< T >
Definition at line 34 of file AlpsPriorityQueue.h.
◆ AlpsPriorityQueue() [1/3]
◆ AlpsPriorityQueue() [2/3]
◆ AlpsPriorityQueue() [3/3]
◆ operator=()
◆ getContainer()
◆ setComparison()
◆ top()
◆ push()
◆ pop()
◆ empty()
◆ size()
◆ clear()
Remove all elements from the vector.
But not delete them.
Definition at line 84 of file AlpsPriorityQueue.h.
◆ vec_
◆ comparison_
The documentation for this class was generated from the following file: