23 #ifndef AlpsPriorityQueue_h_
24 #define AlpsPriorityQueue_h_
91 class Container = std::vector<T>,
92 class Compare = std::less<typename Container::value_type> >
AlpsPriorityQueue(AlpsSearchStrategy< T > &compare)
const std::vector< T > & getContainer() const
Return a const reference to the container.
void push(T x)
Add a element to the heap.
void setComparison(AlpsSearchStrategy< T > &c)
Set comparison function and resort heap.
void pop()
Remove the top element from the heap.
bool empty() const
Return true for an empty vector.
AlpsCompare< T > comparison_
size_t size() const
Return the size of the vector.
void clear()
Remove all elements from the vector.
T top() const
Return the top element of the heap.
AlpsPriorityQueue & operator=(const AlpsPriorityQueue &)