I believe this will do the trick. The Bu::Heap class now uses the appropriate

allocators for all work, every data type used in a Bu::Heap must support the
equals operator and <= or >=, or you need to write your own comparison functor.

The heap works as both a min-heap and max-heap, just change out the functor used
for camparison, kinda' cool.

The print function I'll leave in for a little while, but not in the long run, it
just prints a dot graph to stdout.

Next up, the Ito version.

1 files changed, 1 insertions, 0 deletions

diff --git a/src/heap.cpp b/src/heap.cpp
index 00a5d5d..01a5f50 100644
--- a/src/heap.cpp
+++ b/src/heap.cpp
@@ -7,3 +7,4 @@
 
 #include "heap.h"
 
+namespace Bu { subExceptionDef( HeapException ) }