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

diff --git a/src/old/hash.cpp b/src/old/hash.cpp
deleted file mode 100644
index c52e6b1..0000000
--- a/src/old/hash.cpp
+++ /dev/null
@@ -1,113 +0,0 @@
-#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 );
-}
-