/libcore/ojluni/src/main/java/java/util/ |
H A D | DualPivotQuicksort.java | 59 * The maximum number of runs in merge sort. 64 * The maximum length of run in merge sort. 70 * constant, Quicksort is used in preference to merge sort. 76 * constant, insertion sort is used in preference to Quicksort. 82 * constant, counting sort is used in preference to insertion sort. 88 * than this constant, counting sort is used in preference to Quicksort. 107 static void sort(int[] a, int left, int right, method in class:DualPivotQuicksort 111 sort(a, left, right, true); 134 sort( 214 private static void sort(int[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 555 static void sort(long[] a, int left, int right, method in class:DualPivotQuicksort 662 private static void sort(long[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 1003 static void sort(short[] a, int left, int right, method in class:DualPivotQuicksort 1146 private static void sort(short[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 1487 static void sort(char[] a, int left, int right, method in class:DualPivotQuicksort 1630 private static void sort(char[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 1970 static void sort(byte[] a, int left, int right) { method in class:DualPivotQuicksort 2012 static void sort(float[] a, int left, int right, method in class:DualPivotQuicksort 2210 private static void sort(float[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 2551 static void sort(double[] a, int left, int right, method in class:DualPivotQuicksort 2749 private static void sort(double[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort [all...] |
H A D | List.java | 577 * the sort that commonly exist for arrays). Any operation that expects 670 * <pre>Collections.sort(list, c)</pre> 685 default void sort(Comparator<? super E> c) { method in interface:List 686 Collections.sort(this, c);
|
H A D | ComparableTimSort.java | 113 * Creates a TimSort instance to maintain the state of an ongoing sort. 175 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { method in class:ComparableTimSort 216 // Merge all remaining runs to complete sort 224 * insertion sort. This is the best method for sorting small numbers 269 * first slot after them -- that's why this sort is stable. 411 * called once, to complete the sort.
|
H A D | TimSort.java | 33 * on random arrays. Like all proper mergesorts, this sort is stable and 34 * runs O(n log n) time (worst case). In the worst case, this sort requires 38 * This implementation was adapted from Tim Peters's list sort for 57 * sort, assuming the input array is large enough to warrant the full-blown 58 * TimSort. Small arrays are sorted in place, using a binary insertion sort. 88 * The comparator for this sort. 138 * Creates a TimSort instance to maintain the state of an ongoing sort. 141 * @param c the comparator to determine the order of the sort 206 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, method in class:TimSort 248 // Merge all remaining runs to complete sort [all...] |
H A D | ArrayList.java | 958 * the sort that commonly exist for arrays). Any operation that expects 1439 public void sort(Comparator<? super E> c) { method in class:ArrayList 1441 Arrays.sort((E[]) elementData, 0, size, c);
|
H A D | Arrays.java | 60 * example, the algorithm used by {@code sort(Object[])} does not have to be 125 public static void sort(int[] a) { method in class:Arrays 126 DualPivotQuicksort.sort(a, 0, a.length - 1, null, 0, 0); 149 public static void sort(int[] a, int fromIndex, int toIndex) { method in class:Arrays 151 DualPivotQuicksort.sort(a, fromIndex, toIndex - 1, null, 0, 0); 165 public static void sort(long[] a) { method in class:Arrays 166 DualPivotQuicksort.sort(a, 0, a.length - 1, null, 0, 0); 189 public static void sort(long[] a, int fromIndex, int toIndex) { method in class:Arrays 191 DualPivotQuicksort.sort(a, fromIndex, toIndex - 1, null, 0, 0); 205 public static void sort(shor method in class:Arrays 229 public static void sort(short[] a, int fromIndex, int toIndex) { method in class:Arrays 245 public static void sort(char[] a) { method in class:Arrays 269 public static void sort(char[] a, int fromIndex, int toIndex) { method in class:Arrays 285 public static void sort(byte[] a) { method in class:Arrays 309 public static void sort(byte[] a, int fromIndex, int toIndex) { method in class:Arrays 333 public static void sort(float[] a) { method in class:Arrays 365 public static void sort(float[] a, int fromIndex, int toIndex) { method in class:Arrays 389 public static void sort(double[] a) { method in class:Arrays 421 public static void sort(double[] a, int fromIndex, int toIndex) { method in class:Arrays 1255 public static void sort(Object[] a) { method in class:Arrays 1320 public static void sort(Object[] a, int fromIndex, int toIndex) { method in class:Arrays 1443 public static <T> void sort(T[] a, Comparator<? super T> c) { method in class:Arrays 1514 public static <T> void sort(T[] a, int fromIndex, int toIndex, method in class:Arrays [all...] |
H A D | Vector.java | 1012 * the sort that commonly exist for arrays). Any operation that expects 1428 public synchronized void sort(Comparator<? super E> c) { method in class:Vector 1430 Arrays.sort((E[]) elementData, 0, elementCount, c);
|
H A D | Collections.java | 58 * to. (For example, the algorithm used by <tt>sort</tt> does not have to be 67 * example, invoking the <tt>sort</tt> method on an unmodifiable list that is 122 * <p>This sort is guaranteed to be <i>stable</i>: equal elements will 123 * not be reordered as a result of the sort. 141 * simply concatenate the arrays and sort the resulting array. 143 * <p>The implementation was adapted from Tim Peters's list sort for Python 154 * to sort a linked list in place. 167 public static <T extends Comparable<? super T>> void sort(List<T> list) { method in class:Collections 169 Arrays.sort(((ArrayList) list).elementData, 0, list.size()); 174 Arrays.sort( 236 public static <T> void sort(List<T> list, Comparator<? super T> c) { method in class:Collections 1315 public void sort(Comparator<? super E> c) { method in class:Collections.UnmodifiableList 2190 public void sort(Comparator<? super E> c) { method in class:Collections.SynchronizedList 2943 public void sort(Comparator<? super E> c) { method in class:Collections.CheckedList 3719 public void sort(Comparator<? super E> c) { method in class:Collections.EmptyList 4032 public void sort(Comparator<? super E> c) { method in class:Collections.SingletonList [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
H A D | CopyOnWriteArrayList.java | 387 public synchronized void sort(Comparator<? super E> c) { method in class:CopyOnWriteArrayList 395 Arrays.sort((E[])newElements, from, to, c); 713 public synchronized void sort(Comparator<? super E> c) { method in class:CopyOnWriteArrayList.CowSubList
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
H A D | ArraysTest.java | 1024 * java.util.Arrays#sort(byte[]) 1027 // Test for method void java.util.Arrays.sort(byte []) 1031 Arrays.sort(reversedArray); 1038 * java.util.Arrays#sort(byte[], int, int) 1041 // Test for method void java.util.Arrays.sort(byte [], int, int) 1050 Arrays.sort(reversedArray, startIndex, endIndex); 1063 Arrays.sort(reversedArray, startIndex + 1, startIndex); 1069 Arrays.sort(reversedArray, -1, startIndex); 1075 Arrays.sort(reversedArray, startIndex, reversedArray.length + 1); 1082 * java.util.Arrays#sort(cha 1894 private void sort(Object array) { method in class:ArraysTest [all...] |
/libcore/support/src/test/java/tests/resources/ |
H A D | junit4-4.3.1.jar | META-INF/ META-INF/MANIFEST.MF junit/ junit/extensions/ junit/framework/ junit/runner/ junit/textui/ org/ ... |