#include <stdio.h>
#include <string.h>
#define HASH_FUNC_NUM 2
#define BLOND_NUM (10000*8)
unsigned int SDBMHash(const char *str);
unsigned int RSHash(const char *str);
unsigned int JSHash(const char *str);
unsigned int PJWHash(const char *str);
unsigned int ELFHash(const char *str);
unsigned int BKDRHash(const char *str);
unsigned int DJBHash(const char *str);
unsigned int APHash(const char *str);
typedef unsigned int Hash(const char* str);
static Hash* g_hash[HASH_FUNC_NUM];
static char g_blond_data[BLOND_NUM/8];
void blond_init()
{
memset(g_blond_data,0,sizeof(g_blond_data)*sizeof(char));
g_hash[0] = SDBMHash;
g_hash[1] = RSHash;
// g_hash[2] = JSHash;
// g_hash[3] = PJWHash;
// g_hash[4] = ELFHash;
// g_hash[5] = BKDRHash;
}
void blond_add(const char* str)
{
for(int i=0;i<HASH_FUNC_NUM;i++)
{
unsigned int tmp = g_hash[i](str);
int n = tmp%BLOND_NUM;
int a = n/8;
int b = n%8;
g_blond_data[a] |= (1<<b);
}
}
bool blond_is_exist(const char* str)
{
for(int i=0;i<HASH_FUNC_NUM;i++)
{
unsigned int tmp = g_hash[i](str);
int n = tmp%BLOND_NUM;
int a = n/8;
int b = n%8;
if((g_blond_data[a] & (1<<b)) == 0)
{
return false;
}
}
return true;
}
int main()
{
blond_init();
for(int i=0;i<10000;i++)
{
char buf[10];
sprintf(buf,"ab%d",i);
blond_add(buf);
}
printf("ab999 is exists = %d\n",blond_is_exist("ab999"));
printf("abddf is exists = %d\n",blond_is_exist("abddf"));
return 0;
}
unsigned int SDBMHash(const char *str)
{
unsigned int hash = 0;
while (*str)
{
// equivalent to: hash = 65599*hash + (*str++);
hash = (*str++) + (hash << 6) + (hash << 16) - hash;
}
return (hash & 0x7FFFFFFF);
}
// RS Hash Function
unsigned int RSHash(const char *str)
{
unsigned int b = 378551;
unsigned int a = 63689;
unsigned int hash = 0;
while (*str)
{
hash = hash * a + (*str++);
a *= b;
}
return (hash & 0x7FFFFFFF);
}
// JS Hash Function
unsigned int JSHash(const char *str)
{
unsigned int hash = 1315423911;
while (*str)
{
hash ^= ((hash << 5) + (*str++) + (hash >> 2));
}
return (hash & 0x7FFFFFFF);
}
// P. J. Weinberger Hash Function
unsigned int PJWHash(const char *str)
{
unsigned int BitsInUnignedInt = (unsigned int)(sizeof(unsigned int) * 8);
unsigned int ThreeQuarters = (unsigned int)((BitsInUnignedInt * 3) / 4);
unsigned int OneEighth = (unsigned int)(BitsInUnignedInt / 8);
unsigned int HighBits = (unsigned int)(0xFFFFFFFF) << (BitsInUnignedInt - OneEighth);
unsigned int hash = 0;
unsigned int test = 0;
while (*str)
{
hash = (hash << OneEighth) + (*str++);
if ((test = hash & HighBits) != 0)
{
hash = ((hash ^ (test >> ThreeQuarters)) & (~HighBits));
}
}
return (hash & 0x7FFFFFFF);
}
// ELF Hash Function
unsigned int ELFHash(const char *str)
{
unsigned int hash = 0;
unsigned int x = 0;
while (*str)
{
hash = (hash << 4) + (*str++);
if ((x = hash & 0xF0000000L) != 0)
{
hash ^= (x >> 24);
hash &= ~x;
}
}
return (hash & 0x7FFFFFFF);
}
// BKDR Hash Function
unsigned int BKDRHash(const char *str)
{
unsigned int seed = 131; // 31 131 1313 13131 131313 etc..
unsigned int hash = 0;
while (*str)
{
hash = hash * seed + (*str++);
}
return (hash & 0x7FFFFFFF);
}
// DJB Hash Function
unsigned int DJBHash(const char *str)
{
unsigned int hash = 5381;
while (*str)
{
hash += (hash << 5) + (*str++);
}
return (hash & 0x7FFFFFFF);
}
// AP Hash Function
unsigned int APHash(const char *str)
{
unsigned int hash = 0;
int i;
for (i=0; *str; i++)
{
if ((i & 1) == 0)
{
hash ^= ((hash << 7) ^ (*str++) ^ (hash >> 3));
}
else
{
hash ^= (~((hash << 11) ^ (*str++) ^ (hash >> 5)));
}
}
return (hash & 0x7FFFFFFF);
}