Main Page | Modules | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Class Members | Related Pages | Examples

OakBinaryMinHeap< E, Comparer > Class Template Reference

Just an ordenary binary min-heap. Well not completely, because this one also has both semaphore and mutex capabilities. Hence a thread will block when trying to get an element from the heap if its empty(semaphore), and only one thread is manipulating the heap at any time (mutex). More...

#include <oakbinheap.h>

List of all members.

Public Member Functions

 OakBinaryMinHeap ()
 ~OakBinaryMinHeap ()
void clear ()
void insert (E *e)
E * getMin ()
E * peek ()
int size () const
void heapify (E *e)


Detailed Description

template<class E, class Comparer>
class OakBinaryMinHeap< E, Comparer >

Just an ordenary binary min-heap. Well not completely, because this one also has both semaphore and mutex capabilities. Hence a thread will block when trying to get an element from the heap if its empty(semaphore), and only one thread is manipulating the heap at any time (mutex).

Author:
Emanuel Greisen

Definition at line 42 of file oakbinheap.h.


The documentation for this class was generated from the following file:
Generated on Mon Feb 6 12:24:52 2006 for Ganef by  doxygen 1.4.4