Can Java’s hashCode produce same value for different strings?

by

A Java hash code is 32bits. The number of possible strings it hashes is infinite.

So yes, there will be collisions. The percentage is meaningless – there is an infinite number of items (strings) and a finite number of possible hashes.

More Related Contents:

  1. How can I generate an MD5 hash in Java?
  2. Best implementation for hashCode method for a collection
  3. Why use a prime number in hashCode?
  4. Memory address of variables in Java
  5. What is an object’s hash code if hashCode() is not overridden?
  6. Understanding the workings of equals and hashCode in a HashMap
  7. What is the use of hashCode in Java?
  8. Good Hash Function for Strings
  9. How should equals and hashcode be implemented when using JPA and Hibernate
  10. How is hashCode() calculated in Java
  11. How to ensure hashCode() is consistent with equals()?
  12. How do you get the “object reference” of an object in java when toString() and hashCode() have been overridden?
  13. Why doesn’t String’s hashCode() cache 0?
  14. How does Java order items in a HashMap or a HashTable?
  15. How to get the unique ID of an object which overrides hashCode()?
  16. Hashcode and Equals for Hashset [duplicate]
  17. Why should I override hashCode() when I override equals() method?
  18. What is an “internal address” in Java?
  19. Double in HashMap
  20. what is the difference between == operator and equals()? (with hashcode() ???)
  21. Should I write equals() and hashCode() methods in JPA entities?
  22. What is a sensible prime for hashcode calculation?
  23. What exactly is bucket in hashmap?
  24. Mutable objects and hashCode
  25. Hashcode and equals
  26. Is it possible in java make something like Comparator but for implementing custom equals() and hashCode()
  27. How default .equals and .hashCode will work for my classes?
  28. hashCode uniqueness
  29. Java: Use hashCode() inside of equals() for convenience?
  30. Bit-shifting in Effective Java hashCode() implementation

Leave a Comment