/* This is an efficient hash function created by Daniel J. Bernstein */
hash_t bernstein_hash(const unsigned char *key)
{
	hash_t h=0;
	while(*key) h=33*h + *key++;
	return h;
}