![]() |
Elm
2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
#include <elm/data/BinomialQueue.h>
Public Member Functions | |
BinomialQueue (const C &c=single< C >(), const A &a=single< A >()) | |
bool | isEmpty () const |
const T & | head () const |
T | get () |
void | put (const T &x) |
![]() | |
int | doCompare (const T &v1, const T &v2) const |
![]() | |
t::ptr | allocate (t::size size) const |
void | free (t::ptr p) const |
template<class T > | |
T * | alloc () const |
Additional Inherited Members | |
![]() | |
typedef T | t |
![]() | |
static int | compare (const T &v1, const T &v2) |
Implements the binomial priority queue.
The performance of the queue are:
T | Type of elements in the queue. |
C | Comparator type (default to elm::Comparator). |
A | Allocator type (default to elm::DefaultAllocatorDelegate). |
|
inline |
Build a binomial queue.
c | Comparator instance to use. |
a | Allocator delegate instance. |
|
inline |
References elm::io::p().
|
inline |
|
inline |
|
inline |