Bu::Heap is a real class, it works great, except it doesn't grow right now.

I'm thinking the heap should add one layer to the binary tree each time it
grows, which means double+1 each time.  The Bu::ItoHeap will be implemented as
soon as the rest of Bu::Heap is done.

Also, I finally added bu/util.h which is mainly handy template functions like
Bu::swap, Bu::min, Bu::max, and Bu::mid.  A few more may be added.

1 files changed, 29 insertions, 0 deletions

diff --git a/src/tests/heap.cpp b/src/tests/heap.cpp
new file mode 100644
index 0000000..e93749f
--- /dev/null
+++ b/src/tests/heap.cpp
@@ -0,0 +1,29 @@
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "bu/heap.h"
+
+int main()
+{
+        Bu::Heap<int> hInt;
+
+        for( int j = 0; j < 15; j++ )
+        {
+                int r = rand()%10;
+                printf("Pushing: %d, top: ", r );
+                hInt.push( r );
+                printf("%d\n", hInt.peek() );
+        }
+
+        for( int j = 0; j < 15; j++ )
+        {
+                printf("%d ", hInt.peek() );
+                hInt.pop();
+        }
+        printf("\n");
+        
+//      hInt.print();
+
+        return 0;
+}
+