Can you explain this Java hash map key collision?

I strongly suspect you've misdiagnosed the issue. If you aren't overriding equals anywhere (and you're not subclassing anything else that overrides equals ) then you should indeed have "identity" behaviour.

I strongly suspect you've misdiagnosed the issue. If you aren't overriding equals anywhere (and you're not subclassing anything else that overrides equals) then you should indeed have "identity" behaviour. I would be shocked to hear that this was not the case, to be honest.

If you can product a short but complete program which demonstrates the problem, that would make it easier to look into - but for the moment, I'd definitely double-check your suspicions about seeing different objects being treated as equal keys.

The default implementation of equals() is done in java.lang. Object: public boolean equals(Object obj) { return (this == obj); } Other method hashCode(); by default returns some kind of reference to the object. I.e.

Both are unique by default. Equals returns true only for the same object, hashCode() is different for every object. This is exactly what can create some kind of multiple entries.

You can create 2 instances of your class. From your point of view they are equal because they contain identical data. But they are different.So, if you are using these objects as keys of map you are producing 2 entries.

If you want to avoid this implement equals and hashCode for your class. This implementation sometimes is very verbose. HashCodeBuilder and EqualsBuilder from Jakarta project may help you.

Here is an example: @Override public int hashCode() { return HashCodeBuilder. ReflectionHashCode(this); } @Override public boolean equals(Object other) { return EqualsBuilder. ReflectionEquals(this, other); } @Override public String toString() { return ToStringBuilder.

ReflectionToString(this); }.

You need to ensure that your .equals() and your .hashCode() methods are implemented for all objects that you want to store in the HashMap. To not have that invites all sorts of problems.

You must implement the equals() and hashCode() methods of the objects that you use as the keys in the HashMap. Note that HashMap not only uses equals(), it also uses hashCode(). Your hashCode() method must be implemented correctly to match the implementation of the equals() method.

If the implementation of these methods don't match, you can get unpredictable problems. See the description of equals() and hashCode() in the API documentation of class Object for the detailed requirements.

Sorry, but this is wrong. There is no requirement to implement hashCode() and equals(). – wds Dec 2 '10 at 14:02 Strictly it is not required but if you don't implement those methods it will use the default implementations in class Object and those often do not do what you want.

– Jesper Dec 15 '10 at 10:14.

FYI you can have IDE's such as Eclipse generate the hashCode & equals methods for you. They'll probably do a better job than if you try to hand-code them yourself.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.