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, 1 deletions

diff --git a/src/tests/heap.cpp b/src/tests/heap.cpp
index e93749f..3217715 100644
--- a/src/tests/heap.cpp
+++ b/src/tests/heap.cpp
@@ -5,7 +5,7 @@
 
 int main()
 {
-        Bu::Heap<int> hInt;
+        Bu::Heap<int, Bu::__basicGTCmp<int> > hInt;
 
         for( int j = 0; j < 15; j++ )
         {