The first batch seem to have made it alright. Unfortunately the Archive class

isn't done yet, I'm going to make it rely on streams, so those will be next,
then we can make it work all sortsa' well.

1 files changed, 101 insertions, 0 deletions

diff --git a/src/hash.cpp b/src/hash.cpp
new file mode 100644
index 0000000..a207c29
--- /dev/null
+++ b/src/hash.cpp
@@ -0,0 +1,101 @@
+#include "hash.h"
+
+namespace Bu { subExceptionDef( HashException ) }
+
+template<> uint32_t Bu::__calcHashCode<int>( const int &k )
+{
+        return k;
+}
+
+template<> bool Bu::__cmpHashKeys<int>( const int &a, const int &b )
+{
+        return a == b;
+}
+
+template<> uint32_t Bu::__calcHashCode<unsigned int>( const unsigned int &k )
+{
+        return k;
+}
+
+template<> bool Bu::__cmpHashKeys<unsigned int>( const unsigned int &a, const unsigned int &b )
+{
+        return a == b;
+}
+
+template<>
+uint32_t Bu::__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 Bu::__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 Bu::__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 Bu::__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 Bu::__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 Bu::__cmpHashKeys<std::string>( const std::string &a, const std::string &b )
+{
+        return a == b;
+}
+