Home » openjdk-7 » java » util » [javadoc | source]
class: ComparableTimSort [javadoc | source]
This is a near duplicate of TimSort , modified for use with arrays of objects that implement Comparable , instead of using explicit comparators.

If you are using an optimizing VM, you may find that ComparableTimSort offers no performance benefit over TimSort in conjunction with a comparator that simply returns {@code ((Comparable)first).compareTo(Second)}. If this is the case, you are better off deleting ComparableTimSort to eliminate the code duplication. (See Arrays.java for details.)

Method from java.util.ComparableTimSort Summary:
sort,   sort
Methods from java.lang.Object:
clone,   equals,   finalize,   getClass,   hashCode,   notify,   notifyAll,   toString,   wait,   wait,   wait
Method from java.util.ComparableTimSort Detail:
 static  void sort(Object[] a) 
 static  void sort(Object[] a,
    int lo,
    int hi)