Is it possible in java make something like Comparator but for implementing custom equals() and hashCode()

by

Yes it is possible to do such a thing. (And people have done it.) But it won’t allow you to put your objects into a HashMap, HashSet, etc. That is because the standard collection classes expect the key objects themselves to provide the equals and hashCode methods. (That is the way they are designed to work …)

Alternatives:

  1. Implement a wrapper class that holds an instance of the real class, and provides its own implementation of equals and hashCode.

  2. Implement your own hashtable-based classes which can use a “hashable” object to provide equals and hashcode functionality.

  3. Bite the bullet and implement equals and hashCode overrides on the relevant classes.

In fact, the 3rd option is probably the best, because your codebase most likely needs to to be using a consistent notion of what it means for these objects to be equal. There are other things that suggest that your code needs an overhaul. For instance, the fact that it is currently using an array of objects instead of a Set implementation to represent what is apparently supposed to be a set.

On the other hand, maybe there was/is some real (or imagined) performance reason for the current implementation; e.g. reduction of memory usage. In that case, you should probably write a bunch of helper methods for doing operations like concatenating 2 sets represented as arrays.

More Related Contents:

  1. What issues should be considered when overriding equals and hashCode in Java?
  2. Why do I need to override the equals and hashCode methods in Java?
  3. Best implementation for hashCode method for a collection
  4. Understanding the workings of equals and hashCode in a HashMap
  5. How should equals and hashcode be implemented when using JPA and Hibernate
  6. Getting an element from a Set
  7. How to ensure hashCode() is consistent with equals()?
  8. Apache Commons equals/hashCode builder [closed]
  9. Hashcode and Equals for Hashset [duplicate]
  10. Why should I override hashCode() when I override equals() method?
  11. what is the difference between == operator and equals()? (with hashcode() ???)
  12. Should I write equals() and hashCode() methods in JPA entities?
  13. How to implement hashCode and equals method
  14. How default .equals and .hashCode will work for my classes?
  15. Is there a way to check if two Collections contain the same elements, independent of order?
  16. Java: Use hashCode() inside of equals() for convenience?
  17. What is the difference between "collection" ,"Collection" and "Collections"? [duplicate]
  18. Overriding the java equals() method – not working?
  19. Properly removing an Integer from a List
  20. Java Array HashCode implementation
  21. Consistency of hashCode() on a Java string
  22. Define a fixed-size list in Java
  23. Maximum size of HashSet, Vector, LinkedList
  24. How to shuffle an ArrayList [duplicate]
  25. How can I generate a list or array of sequential integers in Java?
  26. What exactly is bucket in hashmap?
  27. Comparing two hashmaps for equal values and same key sets?
  28. When should I return the Interface and when the concrete class?
  29. Are they any decent on-disk implementations of Java’s Map?
  30. Hashmap implementation to count the occurrences of each character

Leave a Comment