Java Map Implementation not based on HashCode

Question

Is there some implementation of java.util.Map that does not uses HashCode?

I have the following problem:

1. I store an object associated to another object on a HashMap;
2. Change a property from the key object used on step 1;
3. As the hashcode is used to store the keys on the regular implementation of HashMap, when I perform a get() on the HashMap, I get null, because the old object hashCode was different at step 1.

Is there a solution for that? Or should I really use just immutable fields for my equals / hashCode methods?

Answer 1

IdentityHashMap uses the Object identity instead of the hashCode; however that does mean that you require the original object used as key to retrieve the value of the map. Other options would be redefine the hashcode to exclude the mutable parts of the object, or - if you can't redefine the hashCode for some reason - wrap the object in another object which provides a stable hashCode.