There aren't any. However, feel free to volunteer for this task.

I'm not a programmer by profession. My knowledge in the areas relating
to reflection and related were very minimal a few days ago before I had
started working on this. Thank you for the idea though, I'll have to
look into this.

Now that you mention it, it seems that was/is my problem to. I'm glad you
said this as it presents me with a new view of this whole thing. My
initial goal was to simply make TableSorter work and compile without
warnings. Since it turned out to be reasonably presentable, I decided to
post it.

I did this for an older project, and I vaguely remember that the basic
design idea was to have a comparator maintained a linked list of other
comparators. The class  would delegate to the first element in its list, and
upon ties, go down the list.

<UntestedCode strictnessLevel="off the top of my head">
public class MultiComparator implements Compatator<T> {
 private List<Compatator<? super T>> myDelegates = new
LinkedList<Compatator<? super T>>();

 /*Put various methods to manipulate the "myDelegates" list here.*/

 public int compareTo(T a, T b) {
   for(Comparator<? super T> c : myDelegates) {
     int returnValue = c.compareTo(a, b);
     if (returnValue != 0) {
       return returnValue;
     }
   }
   return 0;
 }
}
</UntestedCode>

   - Oliver