#include <stdio.h>
#include <iostream>
static const int num_primes = 25;
static const unsigned long prime_list[] =
{
  53,         97,         193,       389,       769,
  1543,       3079,       6151,      12289,     24593,
  49157,      98317,      196613,    393241,    786433,
  1572869,    3145739,    6291469,   12582917,  25165843,
  50331653,   100663319,  201326611, 402653189, 805306457
};
size_t  hash(char const* str,int mult)  {

  size_t  h = 0; 
  for (; *str; ++str)  {
    h = mult * h + *str;
  }
  return  h ;
}

int main(int argc, char *argv[])
{

  cout << " Ken Moore tester for hash concepts... "<< endl<<endl;

  int ha;
  // one of the goals of hashing should be dispersal.  i.e. if 
  // many similar strings are to be hashed, the more far flung the 
  // indicies are, the better.
  cout << " string  hash multiplier   hash    % 128   % 97" << endl<<endl;
  cout << " a1         256            ";
  ha = hash("a1",256);cout << ha << "     " << ha%128 <<"      "<< ha%97<<endl;
  cout << " b1         256            ";
  ha = hash("b1",256);cout << ha << "     " << ha%128 <<"      "<< ha%97<<endl;
  cout << " c1         256            ";
  ha = hash("c1",256);cout << ha << "     " << ha%128 <<"      "<< ha%97<<endl;
  cout << " z1         256            ";
  ha = hash("z1",256);cout << ha << "     " << ha%128 <<"      "<< ha%97<<endl;
  cout << " a1         13            ";
  ha = hash("a1",13);cout << ha << "     " << ha%128 <<"      "<< ha%97<<endl;
  cout << " b1         13            ";
  ha = hash("b1",13);cout << ha << "     " << ha%128 <<"      "<< ha%97<<endl;
  cout << " c1         13            ";
  ha = hash("c1",13);cout << ha << "     " << ha%128 <<"      "<< ha%97<<endl;
  cout << " z1         13            ";
  ha = hash("z1",13);cout << ha << "     " << ha%128 <<"      "<< ha%97<<endl;



  int xyz;
  cin >> xyz;
  return 0;
}