1 files changed, 155 insertions, 0 deletions
diff --git a/Hashes.cpp b/Hashes.cpp
new file mode 100644
index 0000000..36a6c96
--- /dev/null
+++ b/Hashes.cpp
@@ -0,0 +1,155 @@
+#include "Hashes.h"
+
+#include "Random.h"
+
+
+#include <stdlib.h>
+//#include <stdint.h>
+#include <assert.h>
+//#include <emmintrin.h>
+//#include <xmmintrin.h>
+
+//----------------------------------------------------------------------------
+// fake / bad hashes
+
+void BadHash ( const void * key, int len, uint32_t seed, void * out )
+{
+  uint32_t h = seed;
+
+  const uint8_t * data = (const uint8_t*)key;
+
+  for(int i = 0; i < len; i++)
+  {
+    h ^= h >> 3;
+    h ^= h << 5;
+    h ^= data[i];
+  }
+
+  *(uint32_t*)out = h;
+}
+
+void sumhash ( const void * key, int len, uint32_t seed, void * out )
+{
+  uint32_t h = seed;
+
+  const uint8_t * data = (const uint8_t*)key;
+
+  for(int i = 0; i < len; i++)
+  {
+    h += data[i];
+  }
+
+  *(uint32_t*)out = h;
+}
+
+void sumhash32 ( const void * key, int len, uint32_t seed, void * out )
+{
+  uint32_t h = seed;
+
+  const uint32_t * data = (const uint32_t*)key;
+
+  for(int i = 0; i < len/4; i++)
+  {
+    h += data[i];
+  }
+
+  *(uint32_t*)out = h;
+}
+
+void DoNothingHash ( const void *, int, uint32_t, void * )
+{
+}
+
+//-----------------------------------------------------------------------------
+// One-byte-at-a-time hash based on Murmur's mix
+
+uint32_t MurmurOAAT ( const void * key, int len, uint32_t seed )
+{
+  const uint8_t * data = (const uint8_t*)key;
+
+  uint32_t h = seed;
+
+  for(int i = 0; i < len; i++)
+  {
+    h ^= data[i];
+    h *= 0x5bd1e995;
+    h ^= h >> 15;
+  }
+
+  return h;
+}
+
+void MurmurOAAT_test ( const void * key, int len, uint32_t seed, void * out )
+{
+	*(uint32_t*)out = MurmurOAAT(key,len,seed);
+}
+
+//----------------------------------------------------------------------------
+
+void FNV ( const void * key, int len, uint32_t seed, void * out )
+{
+  unsigned int h = seed;
+
+  const uint8_t * data = (const uint8_t*)key;
+
+  h ^= BIG_CONSTANT(2166136261);
+
+  for(int i = 0; i < len; i++)
+  {
+    h ^= data[i];
+    h *= 16777619;
+  }
+
+  *(uint32_t*)out = h;
+}
+
+//-----------------------------------------------------------------------------
+
+uint32_t x17 ( const void * key, int len, uint32_t h ) 
+{
+  const uint8_t * data = (const uint8_t*)key;
+    
+  for(int i = 0; i < len; ++i) 
+  {
+        h = 17 * h + (data[i] - ' ');
+    }
+
+    return h ^ (h >> 16);
+}
+
+//-----------------------------------------------------------------------------
+
+void Bernstein ( const void * key, int len, uint32_t seed, void * out ) 
+{
+  const uint8_t * data = (const uint8_t*)key;
+    
+  for(int i = 0; i < len; ++i) 
+  {
+        seed = 33 * seed + data[i];
+    }
+
+  *(uint32_t*)out = seed;
+}
+
+//-----------------------------------------------------------------------------
+// Crap8 hash from http://www.team5150.com/~andrew/noncryptohashzoo/Crap8.html
+
+uint32_t Crap8( const uint8_t *key, uint32_t len, uint32_t seed ) {
+  #define c8fold( a, b, y, z ) { p = (uint32_t)(a) * (uint64_t)(b); y ^= (uint32_t)p; z ^= (uint32_t)(p >> 32); }
+  #define c8mix( in ) { h *= m; c8fold( in, m, k, h ); }
+
+  const uint32_t m = 0x83d2e73b, n = 0x97e1cc59, *key4 = (const uint32_t *)key;
+  uint32_t h = len + seed, k = n + len;
+  uint64_t p;
+
+  while ( len >= 8 ) { c8mix(key4[0]) c8mix(key4[1]) key4 += 2; len -= 8; }
+  if ( len >= 4 ) { c8mix(key4[0]) key4 += 1; len -= 4; }
+  if ( len ) { c8mix( key4[0] & ( ( 1 << ( len * 8 ) ) - 1 ) ) }
+  c8fold( h ^ k, n, k, k )
+  return k;
+}
+
+void Crap8_test ( const void * key, int len, uint32_t seed, void * out )
+{
+  *(uint32_t*)out = Crap8((const uint8_t*)key,len,seed);
+}