Cross Reference: /libcore/luni/src/main/java/java/util/DualPivotQuicksort.java

Lines Matching refs:sort
46      * constant, insertion sort is used in preference to Quicksort.
52      * this constant, counting sort is used in preference to Quicksort.
58      * than this constant, counting sort is used in preference to Quicksort.
71     public static void sort(int[] a) {
88     public static void sort(int[] a, int fromIndex, int toIndex) {
95      * method differs from the public {@code sort} method in that the
104         // Use insertion sort on tiny arrays
349     public static void sort(long[] a) {
366     public static void sort(long[] a, int fromIndex, int toIndex) {
373      * method differs from the public {@code sort} method in that the
382         // Use insertion sort on tiny arrays
627     public static void sort(short[] a) {
644     public static void sort(short[] a, int fromIndex, int toIndex) {
654      * method differs from the public {@code sort} method in that the
663         // Use insertion sort on tiny arrays
674             // Use counting sort on huge arrays
922     public static void sort(char[] a) {
939     public static void sort(char[] a, int fromIndex, int toIndex) {
949      * method differs from the public {@code sort} method in that the
958         // Use insertion sort on tiny arrays
969             // Use counting sort on huge arrays
1215     public static void sort(byte[] a) {
1232     public static void sort(byte[] a, int fromIndex, int toIndex) {
1242      * method differs from the public {@code sort} method in that the
1251         // Use insertion sort on tiny arrays
1262             // Use counting sort on huge arrays
1518     public static void sort(float[] a) {
1543     public static void sort(float[] a, int fromIndex, int toIndex) {
1550      * sort is done in three phases to avoid expensive comparisons in the
1628      * method differs from the public {@code sort} method in three ways:
1638         // Use insertion sort on tiny arrays
1891     public static void sort(double[] a) {
1916     public static void sort(double[] a, int fromIndex, int toIndex) {
1923      * sort is done in three phases to avoid expensive comparisons in the
2001      * method differs from the public {@code sort} method in three ways:
2011         // Use insertion sort on tiny arrays