/dalvik/dx/src/com/android/dx/cf/direct/ |
H A D | ClassPathOpener.java | 44 * If true, sort such that classes appear before their inner 48 private final boolean sort; field in class:ClassPathOpener 88 * @param sort if true, sort such that classes appear before their inner 93 public ClassPathOpener(String pathname, boolean sort, Consumer consumer) { argument 95 this.sort = sort; 150 // Ensure inner classes sort second 181 if (sort) { 182 Arrays.sort(file [all...] |
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | DualPivotQuicksort.java | 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) { 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 D | Arrays.java | 32 // Replaced Bentely-McIlroy-based sort w/ DualPivotQuicksort 36 /* Specifies when to switch to insertion sort */ 1530 public static void sort(byte[] array) { method in class:Arrays 1531 DualPivotQuicksort.sort(array); 1540 * the start index to sort. 1542 * the last + 1 index to sort. 1548 public static void sort(byte[] array, int start, int end) { method in class:Arrays 1549 DualPivotQuicksort.sort(array, start, end); 1574 public static void sort(char[] array) { method in class:Arrays 1575 DualPivotQuicksort.sort(arra 1592 public static void sort(char[] array, int start, int end) { method in class:Arrays 1603 public static void sort(double[] array) { method in class:Arrays 1623 public static void sort(double[] array, int start, int end) { method in class:Arrays 1634 public static void sort(float[] array) { method in class:Arrays 1654 public static void sort(float[] array, int start, int end) { method in class:Arrays 1664 public static void sort(int[] array) { method in class:Arrays 1682 public static void sort(int[] array, int start, int end) { method in class:Arrays 1692 public static void sort(long[] array) { method in class:Arrays 1710 public static void sort(long[] array, int start, int end) { method in class:Arrays 1720 public static void sort(short[] array) { method in class:Arrays 1738 public static void sort(short[] array, int start, int end) { method in class:Arrays 1789 public static void sort(Object[] array) { method in class:Arrays 1815 public static void sort(Object[] array, int start, int end) { method in class:Arrays 1886 public static <T> void sort(T[] array, int start, int end, method in class:Arrays 1905 public static <T> void sort(T[] array, Comparator<? super T> comparator) { method in class:Arrays [all...] |
H A D | ComparableTimSort.java | 104 * 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.
|
H A D | TimSort.java | 23 * 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 D | Collections.java | 1946 public static <T extends Comparable<? super T>> void sort(List<T> list) { method in class:Collections 1948 Arrays.sort(array); 1970 public static <T> void sort(List<T> list, Comparator<? super T> comparator) { method in class:Collections 1972 Arrays.sort(array, comparator);
|
/dalvik/libcore/xml/src/main/java/org/apache/xalan/transformer/ |
H A D | NodeSorter.java | 35 * This class can sort vectors of DOM nodes according to a select pattern. 65 * Given a vector of nodes, sort each node according to 73 public void sort(DTMIterator v, Vector keys, XPathContext support) method in class:NodeSorter 119 * @param kIndex Index of NodeSortKey to use for sort 283 * sort for our purpose than the Quicksort because it 285 * the order isn't changed by the sort. 424 // must now sort the left partition. 431 // must now sort the right partition. 458 * node against the sort key(s). 477 /** Value from first sort ke [all...] |
/dalvik/dx/src/com/android/dx/dex/file/ |
H A D | MixedItemSection.java | 46 /** sort by type only */ 49 /** sort in class-major order, with instances sorted per-class */ 69 /** {@code non-null;} how to sort the items */ 70 private final SortType sort; field in class:MixedItemSection 86 * @param sort how the items should be sorted in the final output 89 SortType sort) { 94 this.sort = sort; 296 switch (sort) { 298 Collections.sort(item 88 MixedItemSection(String name, DexFile file, int alignment, SortType sort) argument [all...] |
/dalvik/dx/src/com/android/dx/util/ |
H A D | IntList.java | 265 // sort status is unchanged 357 public void sort() { method in class:IntList 361 Arrays.sort(values, 0, size); 444 * @see #sort
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/ |
H A D | ASN1Collection.java | 128 * Sets the element at a given index (used by {@link #sort}). 200 protected void sort() { method in class:ASN1Collection 207 // TODO: This is bubble sort. Probably not the best choice.
|
/dalvik/libcore/xml/src/main/java/org/apache/xml/utils/ |
H A D | NodeVector.java | 640 public void sort(int a[], int lo0, int hi0) throws Exception method in class:NodeVector 655 * sort a two element list by swapping if necessary 726 sort(a, lo0, lo - 1); 727 sort(a, hi + 1, hi0); 735 public void sort() throws Exception method in class:NodeVector 737 sort(m_map, 0, m_firstFree - 1);
|
/dalvik/libcore/luni/src/test/java/tests/api/java/util/ |
H A D | ArraysTest.java | 1147 * @tests java.util.Arrays#sort(byte[]) 1152 method = "sort", 1156 // Test for method void java.util.Arrays.sort(byte []) 1160 Arrays.sort(reversedArray); 1167 * @tests java.util.Arrays#sort(byte[], int, int) 1172 method = "sort", 1176 // Test for method void java.util.Arrays.sort(byte [], int, int) 1185 Arrays.sort(reversedArray, startIndex, endIndex); 1198 Arrays.sort(reversedArray, startIndex + 1, startIndex); 1204 Arrays.sort(reversedArra 2179 private void sort(Object array) { method in class:ArraysTest [all...] |
/dalvik/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/ ... |