// Source code example for "A Practical Introduction
// to Data Structures and Algorithm Analysis"
// by Clifford A. Shaffer, Prentice Hall, 1998.
// Copyright 1998 by Clifford A. Shaffer

import java.io.*;

// Hash test driver class.
// Test out some hash functions.
public class Hashmain {

static long ELFhash(String key, int M) {
  long h = 0;
  for (int i=0; i<key.length(); i++) {
    h = (h << 4) + (int) key.charAt(i);
    long g = h & 0xF0000000L;
    if (g != 0) h ^= g >>> 24;
    h &= ~g;
  }
  return h % M;
}
static int h(String x, int M) {
  int i, sum;
  for (sum=0, i=0; i<x.length(); i++)
    sum += (int)x.charAt(i);
  return(sum % M);
}
static int h(int x) {
  return(x % 16);
}
int p(int K, int i) { return i; }

public static void main(String args[]) throws IOException {
  HashTable T = new HashTable(101);

  System.out.println("Hello is " + h("Hello", 101));
  System.out.println("For ELFhash, Hello is " + ELFhash("Hello", 101));
  System.out.println("HelloHello is " + h("HelloHello", 101));
  System.out.println("For ELFhash, Hello is " + ELFhash("HelloHello", 101));
  T.hashInsert(new IElem(10));
  System.out.println("Result of searching for 10 is " + T.hashSearch(10));
  System.out.println("Result of searching for 11 is " + T.hashSearch(11));
  System.in.read();
}

}