Searched refs:sort (Results 1 - 25 of 29) sorted by relevance

12

/libcore/luni/src/test/java/tests/api/java/util/
H A DArraysTest.java920 * java.util.Arrays#sort(byte[])
923 // Test for method void java.util.Arrays.sort(byte [])
927 Arrays.sort(reversedArray);
934 * java.util.Arrays#sort(byte[], int, int)
937 // Test for method void java.util.Arrays.sort(byte [], int, int)
946 Arrays.sort(reversedArray, startIndex, endIndex);
959 Arrays.sort(reversedArray, startIndex + 1, startIndex);
965 Arrays.sort(reversedArray, -1, startIndex);
971 Arrays.sort(reversedArray, startIndex, reversedArray.length + 1);
978 * java.util.Arrays#sort(cha
1735 private void sort(Object array) { method in class:ArraysTest
[all...]
H A DCollectionsTest.java690 Collections.sort(list2, comp);
824 * java.util.Collections#sort(java.util.List)
827 // Test for method void java.util.Collections.sort(java.util.List)
832 Collections.sort((List)null);
837 Collections.sort(ll);
838 Collections.sort(reversedLinkedList);
858 Collections.sort(al);
870 Collections.sort(mal);
878 * java.util.Collections#sort(java.util.List, java.util.Comparator)
881 // Test for method void java.util.Collections.sort(jav
[all...]
/libcore/
H A Drun-libcore-tests13 xargs grep -h '^package ' | sed 's/^package //' | sed 's/;$//' | sort | uniq | tr "\n" " ")
/libcore/luni/src/main/java/java/util/
H A DArrays.java1702 public static void sort(byte[] array) { method in class:Arrays
1703 DualPivotQuicksort.sort(array);
1712 * the start index to sort.
1714 * the last + 1 index to sort.
1720 public static void sort(byte[] array, int start, int end) { method in class:Arrays
1721 DualPivotQuicksort.sort(array, start, end);
1759 public static void sort(char[] array) { method in class:Arrays
1760 DualPivotQuicksort.sort(array);
1769 * the start index to sort.
1771 * the last + 1 index to sort
1777 public static void sort(char[] array, int start, int end) { method in class:Arrays
1788 public static void sort(double[] array) { method in class:Arrays
1808 public static void sort(double[] array, int start, int end) { method in class:Arrays
1819 public static void sort(float[] array) { method in class:Arrays
1839 public static void sort(float[] array, int start, int end) { method in class:Arrays
1849 public static void sort(int[] array) { method in class:Arrays
1867 public static void sort(int[] array, int start, int end) { method in class:Arrays
1877 public static void sort(long[] array) { method in class:Arrays
1895 public static void sort(long[] array, int start, int end) { method in class:Arrays
1905 public static void sort(short[] array) { method in class:Arrays
1923 public static void sort(short[] array, int start, int end) { method in class:Arrays
1969 public static void sort(Object[] array) { method in class:Arrays
1987 public static void sort(Object[] array, int start, int end) { method in class:Arrays
2010 public static <T> void sort(T[] array, int start, int end, Comparator<? super T> comparator) { method in class:Arrays
2022 public static <T> void sort(T[] array, Comparator<? super T> comparator) { method in class:Arrays
[all...]
H A DDualPivotQuicksort.java46 * 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) { method in class:DualPivotQuicksort
88 public static void sort(int[] a, int fromIndex, int toIndex) { method in class:DualPivotQuicksort
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) { method in class:DualPivotQuicksort
366 public static void sort(long[] a, int fromIndex, int toIndex) { method in class:DualPivotQuicksort
373 * method differs from the public {@code sort} metho
627 public static void sort(short[] a) { method in class:DualPivotQuicksort
644 public static void sort(short[] a, int fromIndex, int toIndex) { method in class:DualPivotQuicksort
922 public static void sort(char[] a) { method in class:DualPivotQuicksort
939 public static void sort(char[] a, int fromIndex, int toIndex) { method in class:DualPivotQuicksort
1215 public static void sort(byte[] a) { method in class:DualPivotQuicksort
1232 public static void sort(byte[] a, int fromIndex, int toIndex) { method in class:DualPivotQuicksort
1518 public static void sort(float[] a) { method in class:DualPivotQuicksort
1543 public static void sort(float[] a, int fromIndex, int toIndex) { method in class:DualPivotQuicksort
1891 public static void sort(double[] a) { method in class:DualPivotQuicksort
1916 public static void sort(double[] a, int fromIndex, int toIndex) { method in class:DualPivotQuicksort
[all...]
H A DTimSort.java23 * on random arrays. Like all proper mergesorts, this sort is stable and
24 * runs O(n log n) time (worst case). In the worst case, this sort requires
28 * This implementation was adapted from Tim Peters's list sort for
47 * sort, assuming the input array is large enough to warrant the full-blown
48 * TimSort. Small arrays are sorted in place, using a binary insertion sort.
76 * The comparator for this sort.
129 * Creates a TimSort instance to maintain the state of an ongoing sort.
132 * @param c the comparator to determine the order of the sort
168 static <T> void sort(T[] a, Comparator<? super T> c) { method in class:TimSort
169 sort(
172 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c) { method in class:TimSort
[all...]
H A DComparableTimSort.java104 * Creates a TimSort instance to maintain the state of an ongoing sort.
141 static void sort(Object[] a) { method in class:ComparableTimSort
142 sort(a, 0, a.length);
145 static void sort(Object[] a, int lo, int hi) { method in class:ComparableTimSort
185 // Merge all remaining runs to complete sort
193 * insertion sort. This is the best method for sorting small numbers
239 * first slot after them -- that's why this sort is stable.
381 * called once, to complete the sort.
/libcore/harmony-tests/src/test/java/org/apache/harmony/annotation/tests/java/lang/annotation/
H A DRetentionPolicyTest.java57 Arrays.sort(values);
H A DElementTypeTest.java62 Arrays.sort(values);
/libcore/luni/src/main/java/org/apache/harmony/luni/util/
H A DDeleteOnExit.java67 * Does the actual work. Note we (a) first sort the files lexicographically
73 Collections.sort(files);
/libcore/luni/src/test/java/libcore/java/util/
H A DOldTreeSetTest.java142 SortedSet sort = ts.headSet(new Integer(100));
144 sort.headSet(new Integer(101));
228 SortedSet sort = ts.tailSet(new Integer(101));
231 sort.tailSet(new Integer(100));
H A DOldTreeMapTest.java218 SortedMap sort = tm.headMap("100");
220 sort.headMap("50");
462 SortedMap sort = tm.tailMap("99");
465 sort.tailMap("101");
H A DOldCollectionsTest.java60 Collections.sort(lst, null);
319 Arrays.sort(numbers, roc);
320 assertTrue("Assert 2: the arrays are not equal, the sort failed",
337 Arrays.sort(numbers, roc);
338 assertTrue("Assert 2: the arrays are not equal, the sort failed",
348 Arrays.sort(numbers, roc);
349 assertTrue("Assert 5: the arrays are not equal, the sort failed",
/libcore/luni/src/main/java/libcore/util/
H A DCollectionUtils.java86 Collections.sort(list, comparator);
/libcore/dalvik/src/main/java/dalvik/system/profiler/
H A DAsciiHprofWriter.java56 Collections.sort(samples, SAMPLE_COMPARATOR);
/libcore/luni/src/test/java/libcore/java/security/
H A DProviderTest.java112 Collections.sort(extra); // sort so that its grouped by type
119 Collections.sort(missing); // sort it for readability
/libcore/luni/src/main/java/org/apache/harmony/security/x501/
H A DName.java177 Collections.sort(atavList, new AttributeTypeAndValueComparator());
/libcore/luni/src/test/java/tests/java/sql/
H A DDatabaseMetaDataTest.java232 Arrays.sort(tablesName);
345 Arrays.sort(tablesName);
346 Arrays.sort(fields);
347 Arrays.sort(nullableInt);
348 Arrays.sort(nullable);
1076 Arrays.sort(tablesName);
1077 Arrays.sort(tablesType);
1176 Arrays.sort(names);
1191 Arrays.sort(types);
2281 Arrays.sort(expecte
[all...]
/libcore/luni/src/main/java/java/io/
H A DObjectStreamClass.java361 Arrays.sort(_fields);
451 // Only attempt to sort if really needed (saves object
458 Arrays.sort(interfaces, interfaceComparator);
469 // Only attempt to sort if really needed (saves object creation,
476 Arrays.sort(fields, fieldComparator);
510 // Only attempt to sort if really needed (saves object creation,
514 // All constructors have same name, so we sort based on
520 Arrays.sort(constructors, constructorComparator);
560 Arrays.sort(methods, methodComparator);
/libcore/crypto/src/main/java/org/conscrypt/
H A DFileClientSessionCache.java86 // Read and sort initial list of files. We defer adding
98 Arrays.sort(initialFiles);
/libcore/dex/src/main/java/com/android/dex/
H A DTableOfContents.java139 Arrays.sort(sections);
/libcore/libart/src/main/java/java/lang/reflect/
H A DProxy.java161 Collections.sort(methods, ORDER_BY_SIGNATURE_AND_SUBTYPE);
/libcore/luni/src/test/java/libcore/java/util/beans/
H A DPropertyChangeSupportTest.java263 Collections.sort(result);
/libcore/luni/src/test/java/libcore/javax/crypto/
H A DECDHKeyAgreementTest.java430 Arrays.sort(providers, new Comparator<Provider>() {
/libcore/support/src/test/java/tests/resources/
H A Djunit4-4.3.1.jarMETA-INF/ META-INF/MANIFEST.MF junit/ junit/extensions/ junit/framework/ junit/runner/ junit/textui/ org/ ...

Completed in 3786 milliseconds

12