*** /Users/bchristi/WS/14dualPivot/jdk/open/src/java.base/share/classes/java/util/Arrays.java 2019-08-06 15:51:41.000000000 -0700 --- ./FILES/Arrays.java 2019-08-12 13:32:18.000000000 -0700 *************** *** 173,179 **** */ public static void sort(short[] a) { DualPivotQuicksort.sort(a, 0, a.length); ! } /** * Sorts the specified range of the array into ascending order. The range --- 173,179 ---- */ public static void sort(short[] a) { DualPivotQuicksort.sort(a, 0, a.length); ! } /** * Sorts the specified range of the array into ascending order. The range *************** *** 197,203 **** public static void sort(short[] a, int fromIndex, int toIndex) { rangeCheck(a.length, fromIndex, toIndex); DualPivotQuicksort.sort(a, fromIndex, toIndex); ! } /** * Sorts the specified array into ascending numerical order. --- 197,203 ---- public static void sort(short[] a, int fromIndex, int toIndex) { rangeCheck(a.length, fromIndex, toIndex); DualPivotQuicksort.sort(a, fromIndex, toIndex); ! } /** * Sorts the specified array into ascending numerical order. *************** *** 236,242 **** rangeCheck(a.length, fromIndex, toIndex); DualPivotQuicksort.sort(a, fromIndex, toIndex); } ! /** * Sorts the specified array into ascending numerical order. * --- 236,242 ---- rangeCheck(a.length, fromIndex, toIndex); DualPivotQuicksort.sort(a, fromIndex, toIndex); } ! /** * Sorts the specified array into ascending numerical order. * *************** *** 508,514 **** rangeCheck(a.length, fromIndex, toIndex); DualPivotQuicksort.sort(a, fromIndex, toIndex); } ! /** * Sorts the specified array into ascending numerical order. * --- 508,514 ---- rangeCheck(a.length, fromIndex, toIndex); DualPivotQuicksort.sort(a, fromIndex, toIndex); } ! /** * Sorts the specified array into ascending numerical order. * *************** *** 724,731 **** if (toIndex > arrayLength) { throw new ArrayIndexOutOfBoundsException(toIndex); } ! } ! /** * A comparator that implements the natural ordering of a group of * mutually comparable elements. May be used when a supplied --- 724,731 ---- if (toIndex > arrayLength) { throw new ArrayIndexOutOfBoundsException(toIndex); } ! } ! /** * A comparator that implements the natural ordering of a group of * mutually comparable elements. May be used when a supplied *************** *** 747,753 **** return ((Comparable)first).compareTo(second); } static final NaturalOrder INSTANCE = new NaturalOrder(); ! } /** * The minimum array length below which a parallel sorting --- 747,753 ---- return ((Comparable)first).compareTo(second); } static final NaturalOrder INSTANCE = new NaturalOrder(); ! } /** * The minimum array length below which a parallel sorting