int search(String s) {
	int hash = s.hashCode();
	// System.out.printf( "hash: %s %d\n", s, hash );
	int n = 0;
	nsearch++;

	while (n < M) {
	    // int x = hash & (M-1);
	    int x = index(hash, n);
	    // System.out.printf( "entry: %d %s\n", x, strings[x] );
	    // if( !ht[x] ) {
	    nhops++;

	    if (!ht.get(x)) {
		// System.out.printf( "empty: %d\n", x );
		break;
	    } else if (strings[x].equals(s)) {

		return x;
	    }
	    n += 1;
	    // hash+=probe + PROBE;
	    // probe*=2;
	}