Ok, no code is left in src, it's all in src/old. We'll gradually move code back

into src as it's fixed and re-org'd.  This includes tests, which, I may write a
unit test system into libbu++ just to make my life easier.

1 files changed, 113 insertions, 0 deletions

diff --git a/src/old/hash.cpp b/src/old/hash.cpp
new file mode 100644
index 0000000..c52e6b1
--- /dev/null
+++ b/src/old/hash.cpp
@@ -0,0 +1,113 @@
+#include "hash.h"
+
+subExceptionDef( HashException )
+
+template<> uint32_t __calcHashCode<int>( const int &k )
+{
+        return k;
+}
+
+template<> bool __cmpHashKeys<int>( const int &a, const int &b )
+{
+        return a == b;
+}
+
+template<> uint32_t __calcHashCode<unsigned int>( const unsigned int &k )
+{
+        return k;
+}
+
+template<> bool __cmpHashKeys<unsigned int>( const unsigned int &a, const unsigned int &b )
+{
+        return a == b;
+}
+
+template<>
+uint32_t __calcHashCode<const char *>( const char * const &k )
+{
+        if (k == NULL)
+        {
+                return 0;
+        }
+        
+        unsigned long int nPos = 0;
+        for( const char *s = k; *s; s++ )
+        {
+                nPos = *s + (nPos << 6) + (nPos << 16) - nPos;
+        }
+
+        return nPos;
+}
+
+template<> bool __cmpHashKeys<const char *>( const char * const &a, const char * const &b )
+{
+        if( a == b )
+                return true;
+
+        for(int j=0; a[j] == b[j]; j++ )
+                if( a[j] == '\0' )
+                        return true;
+
+        return false;
+}
+
+template<>
+uint32_t __calcHashCode<char *>( char * const &k )
+{
+        if (k == NULL)
+        {
+                return 0;
+        }
+        
+        unsigned long int nPos = 0;
+        for( const char *s = k; *s; s++ )
+        {
+                nPos = *s + (nPos << 6) + (nPos << 16) - nPos;
+        }
+
+        return nPos;
+}
+
+template<> bool __cmpHashKeys<char *>( char * const &a, char * const &b )
+{
+        if( a == b )
+                return true;
+
+        for(int j=0; a[j] == b[j]; j++ )
+                if( a[j] == '\0' )
+                        return true;
+
+        return false;
+}
+
+template<> uint32_t __calcHashCode<std::string>( const std::string &k )
+{
+        std::string::size_type j, sz = k.size();
+        const char *s = k.c_str();
+
+        unsigned long int nPos = 0;
+        for( j = 0; j < sz; j++, s++ )
+        {
+                nPos = *s + (nPos << 6) + (nPos << 16) - nPos;
+        }
+
+        return nPos;
+}
+
+template<> bool __cmpHashKeys<std::string>( const std::string &a, const std::string &b )
+{
+        return a == b;
+}
+
+template<> uint32_t __calcHashCode<Hashable>( const Hashable &k )
+{
+        return 0;
+        //return k.getHashCode();
+}
+
+template<> bool __cmpHashKeys<Hashable>( const Hashable &a, const Hashable &b )
+{
+        return false;
+        //return a.compareForHash( b );
+}
+