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, 40 insertions, 0 deletions

diff --git a/src/util.h b/src/util.h
new file mode 100644
index 0000000..977645c
--- /dev/null
+++ b/src/util.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (C) 2007-2008 Xagasoft, All rights reserved.
+ *
+ * This file is part of the libbu++ library and is released under the
+ * terms of the license contained in the file LICENSE.
+ */
+
+#ifndef BU_UTIL_H
+#define BU_UTIL_H
+
+namespace Bu
+{
+        template<typename item>
+        void swap( item &a, item &b )
+        {
+                item tmp = a;
+                a = b;
+                b = tmp;
+        }
+
+        template<typename item>
+        item &min( item &a, item &b )
+        {
+                return a<b?a:b;
+        }
+        
+        template<typename item>
+        item &max( item &a, item &b )
+        {
+                return a>b?a:b;
+        }
+        
+        template<typename item>
+        item &mid( item &a, item &b, item &c )
+        {
+                return min( max( a, b ), c );
+        }
+};
+
+#endif