Thread: Dictionary using Distributed Hash Table and BST Tree

How/where did you get the algorithm for the code in the hash() method?

What are the meanings for the constants: 53 and 96?

It should give me numbers 1-7 and for "g" it gives me 0.

Execute the method with single letters from a to z and see what is returned. The pattern should give you some idea how to fix it.

So: 1. I got it from a friend.
2. constant 53 is: number of small letters + big letters + space.
3. 96 is the code of "`" before "a" in the ASCII code.
4. l is the size of the dictionary.

I noticed it is only good for the lower case letters.
corrected:

public static int hash(String key, int l)
    {
        int value = 0;
 
        for(int j = 0; j < key.length(); j++ ) 
        {
            value = (value * 53 + toDig(key.charAt(j))); 
        }
 
        value = value % l;
 
        return value;
    }
 
    private static int toDig(char a)
    {
        int hMany = 0;
        if(Character.isLowerCase(a))
        {
            hMany = a - ('a' - 1);
        } else if(Character.isUpperCase(a)) {
            hMany = a - ('A' - 27);
        } else if(a == ' '){
            hMany = 53;
        }
        return hMany;
    }

//It works now.

When posting code please wrap your code with
[code=java]
<YOUR CODE HERE>
[/code]
to get highlighting and preserve formatting.

There is a substring() method call on line 39 where the value of the index is out of bounds/past the end of the String.
Look at the code on that line and see why: how long is the String & what is the value of the index.
Use a println to print out those values if you need to see what they are.

One problem with the code is the last else does NOT test the first letter of the function String. It should test for that and there should be an ending else clause that prints an error message if none of the above test were true.