A heap+set data structure to maintain priority queue while also enabling fast set membership tests.
#include <EventManager.hpp>
|
|
| heapset (Compare comp) |
| |
| void | push (T &value) |
| | add item to container More...
|
| |
|
void | pop () |
| | remove item from the top of the container
|
| |
| bool | empty () |
| | check if the container is empty More...
|
| |
| const T & | top () |
| | return element at top More...
|
| |
| bool | contains (T &val) |
| | Check if container contains the given element. More...
|
| |
|
void | clear () |
| | clear the container
|
| |
|
|
std::priority_queue< T, std::vector< T >, Compare > | priq |
| |
|
std::set< T > | priset |
| |
◆ contains()
template<class T , class Compare >
| bool heapset< T, Compare >::contains |
( |
T & |
val | ) |
|
|
inline |
◆ empty()
template<class T , class Compare >
| bool heapset< T, Compare >::empty |
( |
| ) |
|
|
inline |
◆ push()
template<class T , class Compare >
| void heapset< T, Compare >::push |
( |
T & |
value | ) |
|
|
inline |
◆ top()
template<class T , class Compare >
| const T & heapset< T, Compare >::top |
( |
| ) |
|
|
inline |
The documentation for this class was generated from the following file:
