Re: hash collision and the HashMap
Wojtek wrote:
If I have a HashMap<String,MyObject>, then the HashMap uses the hash of
the String to place MyObject in its internal storage. If the hash for a
String is the same as another String, then what?
There are several ways of dealing with collisions in hashing structures.
The one the Java developers choose to use for HashMap is to have buckets
that can each contain multiple entries.
Equal hash code entries go in the same bucket, just as they would if
they had different hash codes that mapped to the same bucket.
Each bucket contains zero or more entries. Each entry contains both key
and value, so that equals() can be used to distinguish unequal keys with
equal hash codes.
I assume that the hash collision mechanism uses toString() to resolve
which String you are specifying.
You lost me at this point. Why do you think toString() would be any use
for hash collision resolution?
In any case, take a look in your JDK install directory. There should be
a file there called "src.zip". Read java/util/HashMap.java in that zip.
Patricia