Making a generic comparator class [closed]

Answer 1

The closest thing you can do to this is a Comparator that can compare any objects that implement the Comparable interface:

class NaturalComparator<T extends Comparable<T>> implements Comparator<T> {
  public int compare(T a, T b) {
    return a.compareTo(b);
  }
}

That's really the closest you can do: only Comparable objects have the "natural ordering" you're trying to model here. But generally, once you have Comparable objects, you don't necessarily need a Comparator: for example, Collections.sort can take either a List with a Comparator, or a List with Comparable elements.

Answer 2

1. You can't write a single comparator for everything without some assumptions on what the types will be. What do you do with custom classes? How can you decide which one is greater than the other? For more classes in the wild, a comparator does not make sense.

2. On the other hand, if you restrict yourself to String, Integer, Double, then they are Comparable and you can simply write the comparator with the compareTo() method:

   public int compare(T element1,T element2)
   {
       return element1.compareTo(element2);
   }
   

but then you would simply use the natural order of elements, and it would defeat the purpose of using a comparator. You usually don't need one in these cases.

Answer 3

I don't know if this is necessarily useful, but it isn't possible to implement a meaningful generic comparator.

Thanks to the reflection interface, you could, for example, order objects by their classname. Or perhaps even in some manner by their class hierarchy. Children after parents, for example.

Or you could sort them based on what their toString() method produces. Or hashCode(). Every object has them, after all.

Whatever you do, remember to consider that either element could be null.

I think we need to know what you need this generic comparator for.