HashSet contains duplicate entries

by

The problem is that your Element class has not overridden the equals and hashCode methods or these implementations are broken.

From Object#equals method javadoc:

The equals method implements an equivalence relation on non-null object references:

  • It is reflexive: for any non-null reference value x, x.equals(x) should return true.
  • It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
  • It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
    It is consistent: for any non-null reference values x and y, multiple invocations of -x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
  • For any non-null reference value x, x.equals(null) should return false.

From Object#hashCode method javadoc:

The general contract of hashCode is:

  • Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
  • If two objects are equal according to the equals(Object) method, then calling the hashCode method on each of the two objects must produce the same integer result.
  • It is not required that if two objects are unequal according to the equals(java.lang.Object) method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Make sure the implementations of these methods satisfy these rules and your Set (backed by a HashSet) will work as expected.

More Related Contents:

  1. How to calculate the intersection of two sets? [duplicate]
  2. How to Iterate over a Set/HashSet without an Iterator?
  3. Java HashSet with a custom equality criteria? [duplicate]
  4. Removing duplicates from arraylist using set
  5. Want to generate unique key of 15 chars in java
  6. Hashset vs Treeset
  7. What is the difference between Set and List?
  8. How to convert an Array to a Set in Java
  9. Picking a random element from a set
  10. is the Java HashMap keySet() iteration order consistent?
  11. Different types of thread-safe Sets in Java
  12. Efficiently compute Intersection of two Sets in Java?
  13. When does HashSet ‘add’ method calls equals? [duplicate]
  14. Get unique values from ArrayList in Java
  15. Iteration order of HashSet
  16. Remove Elements from a HashSet while Iterating [duplicate]
  17. Difference between Iterator and Listiterator?
  18. Why doesn’t java.util.Set have get(int index)?
  19. HashSet vs LinkedHashSet
  20. Unique constraint with JPA and Bean Validation
  21. Mutable objects and hashCode
  22. Difference between HashSet and HashMap?
  23. Java HashSet contains duplicates if contained element is modified
  24. Classical set operations for java.util.Collection
  25. Why does TreeSet throw a ClassCastException?
  26. Why does HashSet implementation in Sun Java use HashMap as its backing?
  27. How can I convert a Java HashSet to a primitive int array?
  28. How to set background image in Java?
  29. Cartesian product of streams in Java 8 as stream (using streams only)
  30. Why does my TreeSet not add anything beyond the first element?

Leave a Comment