Are mutable hashmap keys a dangerous practice?

by

It has been noted by many well respected developers such as Brian Goetz and Josh Bloch that :

If an object’s hashCode() value can change based on its state, then we
must be careful when using such objects as keys in hash-based
collections to ensure that we don’t allow their state to change when
they are being used as hash keys. All hash-based collections assume
that an object’s hash value does not change while it is in use as a
key in the collection. If a key’s hash code were to change while it
was in a collection, some unpredictable and confusing consequences
could follow. This is usually not a problem in practice — it is not
common practice to use a mutable object like a List as a key in a
HashMap.

More Related Contents:

  1. Why are XOR often used in java hashCode() but another bitwise operators are used rarely?
  2. How to create a HashMap with two keys (Key-Pair, Value)?
  3. How can I generate an MD5 hash in Java?
  4. How does a Java HashMap handle different objects with the same hash code?
  5. Understanding the workings of equals and hashCode in a HashMap
  6. Good Hash Function for Strings
  7. Are there any SHA-256 javascript implementations that are generally considered trustworthy? [closed]
  8. How to update a value, given a key in a hashmap?
  9. Quick and Simple Hash Code Combinations
  10. Is there an MD5 Fixed Point where md5(x) == x?
  11. Is a Python dictionary an example of a hash table?
  12. yii CPasswordHelper: hashPassword and verifyPassword
  13. How is a JavaScript hash map implemented?
  14. How come MD5 hash values are not reversible?
  15. How does Java order items in a HashMap or a HashTable?
  16. Is calculating an MD5 hash less CPU intensive than SHA family functions?
  17. When is CRC more appropriate to use than MD5/SHA1?
  18. How long to brute force a salted SHA-512 hash? (salt provided)
  19. Why is ‘397’ used for ReSharper GetHashCode override?
  20. Why does HashMap require that the initial capacity be a power of two?
  21. How can it be impossible to “decrypt” an MD5 hash? [duplicate]
  22. Is it possible to decrypt MD5 hashes?
  23. Why hashmap lookup is O(1) i.e. constant time?
  24. Is there hash code function accepting any object type?
  25. Why are 5381 and 33 so important in the djb2 algorithm?
  26. node.js hash string?
  27. Hashing with SHA1 Algorithm in C#
  28. Which is faster, Hash lookup or Binary search?
  29. how to get hash code of a string in c++
  30. Explanation of HashMap#hash(int) method

Leave a Comment