1 files changed, 9 insertions, 14 deletions

diff --git a/src/hash.h b/src/hash.h
index ff3bafd..6fdf8e1 100644
--- a/src/hash.h
+++ b/src/hash.h
@@ -26,7 +26,7 @@ struct __calcNextTSize_fast
 template<typename key, typename value, typename sizecalc = __calcNextTSize_fast, typename keyalloc = std::allocator<key>, typename valuealloc = std::allocator<value>, typename challoc = std::allocator<uint32_t> >
 class Hash;
 
-template< typename key, typename _value, typename sizecalc, typename keyalloc, typename valuealloc, typename challoc >
+template< typename key, typename _value, typename sizecalc = __calcNextTSize_fast, typename keyalloc = std::allocator<key>, typename valuealloc = std::allocator<_value>, typename challoc = std::allocator<uint32_t> >
 struct HashProxy
 {
         friend class Hash<key, _value, sizecalc, keyalloc, valuealloc, challoc>;
@@ -139,19 +139,6 @@ public:
                 ca.deallocate( aHashCodes, nCapacity );
         }
 
-        void clearBits()
-        {
-                for( uint32_t j = 0; j < nKeysSize; j++ )
-                {
-                        bFilled[j] = bDeleted[j] = 0;
-                }
-        }
-
-        int hasKey( key keyval )
-        {
-                printf("%s\n", keyval );
-        }
-
         uint32_t getCapacity()
         {
                 return nCapacity;
@@ -307,6 +294,14 @@ public:
         }
 
 private:
+        void clearBits()
+        {
+                for( uint32_t j = 0; j < nKeysSize; j++ )
+                {
+                        bFilled[j] = bDeleted[j] = 0;
+                }
+        }
+
         void fill( uint32_t loc, key &k, value &v, uint32_t hash )
         {
                 bFilled[loc/32] |= (1<<(loc%32));