@Test public void testSort_Random_AboveMergeThreshold() { int[] ints = randomInts(1000); IntTimSort.sort(ints, reverseSort); for (int i = 1; i < ints.length; i++) { assertTrue(ints[i - 1] >= ints[i], "Failed at " + i + ": " + ints[i - 1] + " vs " + ints[i]); } }
public static void sort(int[] a, IntComparator c) { sort(a, 0, a.length, c); }
IntTimSort { public static void sort(int[] a, IntComparator c) { sort(a, 0, a.length, c); } }
IntTimSort { public static void sort(int[] a, IntComparator c) { sort(a, 0, a.length, c); } private  IntTimSort(int[] a, IntComparator c); }
IntTimSort { public static void sort(int[] a, IntComparator c) { sort(a, 0, a.length, c); } private  IntTimSort(int[] a, IntComparator c); static void sort(int[] a, IntComparator c); static void sort(int[] a, int lo, int hi, IntComparator c); }
IntTimSort { public static void sort(int[] a, IntComparator c) { sort(a, 0, a.length, c); } private  IntTimSort(int[] a, IntComparator c); static void sort(int[] a, IntComparator c); static void sort(int[] a, int lo, int hi, IntComparator c);  }