heapset< T, Compare > Class Template Reference

A heap+set data structure to maintain priority queue while also enabling fast set membership tests.

#include <EventManager.hpp>

Public Member Functions
	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

Private Attributes
std::priority_queue< T, std::vector< T >, Compare >	priq
std::set< T >	priset

Member Function Documentation

contains()

template<class T , class Compare >

bool heapset< T, Compare >::contains ( T &  val )

inline

Parameters

val

empty()

template<class T , class Compare >

bool heapset< T, Compare >::empty ( )

inline

Returns

bool

push()

template<class T , class Compare >

void heapset< T, Compare >::push ( T &  value )

inline

Parameters

value

top()

template<class T , class Compare >

const T & heapset< T, Compare >::top ( )

inline

Returns

const T&

---

The documentation for this class was generated from the following file:

• Modules/Core/EventManager/EventManager.hpp