Std::priority_queue< T, Container, Comparitor > Class Template Reference

#include <queue.h>

Public Member Functions
bool	empty () const
const T &	top () const
void	push (const T &item)
void	pop ()

Detailed Description

template<class T, class Container = vector<T>, class Comparitor = typename Common::Less<T>>
class Std::priority_queue< T, Container, Comparitor >

FIXME: The current implementation requires the reverse greater/lesser comparitor than the original does. If this is fixed, also change the router finder's use

---

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

• common/std/queue.h