/openjdk7/jdk/src/share/demo/applets/SortDemo/ |
H A D | SortAlgorithm.java | 43 * A generic sort demonstration algorithm 51 * The sort item. 112 * sort an array of integers. 114 void sort(int a[]) throws Exception { method in class:SortAlgorithm
|
H A D | BidirBubbleSortAlgorithm.java | 43 * A bi-directional bubble sort demonstration algorithm 51 void sort(int a[]) throws Exception { method in class:BidirBubbleSortAlgorithm
|
/openjdk7/langtools/test/tools/javadoc/annotations/elementTypes/ |
H A D | Main.java | 51 Arrays.sort(cds);
|
/openjdk7/langtools/test/tools/javadoc/generics/genericInnerAndOuter/ |
H A D | Main.java | 50 Arrays.sort(cds);
|
/openjdk7/langtools/test/tools/javadoc/generics/genericSuper/ |
H A D | Main.java | 50 Arrays.sort(cds);
|
/openjdk7/jdk/make/java/java/ |
H A D | localelist.sh | 38 LOCALES=`(for I in $LOCALE_LIST; do echo $I;done) | sort | uniq`
|
/openjdk7/langtools/make/test/lib/ |
H A D | classes.sh | 43 LANG=C sort -u expect1.lst expect2.lst > expect.lst
|
H A D | javadoc.sh | 40 ( cd doc ; find . -type f -print | LANG=C sort ) > javadoc.tmp
|
H A D | src.sh | 43 LANG=C sort -u expect1.lst expect2.lst > expect.lst
|
/openjdk7/jdk/src/share/sample/forkjoin/mergesort/ |
H A D | MergeSort.java | 48 * A {@code ForkJoinPool} is used for the parallelism, using the merge sort 54 * and possibly a swap. The tasks then finish by using insert sort to 58 * to implement the best possible parallel merge sort. This version creates 74 * @param array the array to sort 76 * @param high the non-inclusive high element to sort to 87 Arrays.sort(array, low, high); 131 * @param array the array to sort 133 public void sort(int[] array) { method in class:MergeSort
|
/openjdk7/langtools/test/tools/javadoc/generics/supertypes/ |
H A D | Main.java | 50 Arrays.sort(cds); 60 Arrays.sort(interfaces,
|
/openjdk7/jdk/test/sun/nio/cs/ |
H A D | Test4200310.sh | 33 duplicates=`grep '\.class$' class-list | sort | uniq -d`
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | DualPivotQuicksort.java | 54 * The maximum number of runs in merge sort. 59 * The maximum length of run in merge sort. 65 * constant, Quicksort is used in preference to merge sort. 71 * constant, insertion sort is used in preference to Quicksort. 77 * constant, counting sort is used in preference to insertion sort. 83 * than this constant, counting sort is used in preference to Quicksort. 96 public static void sort(int[] a) { method in class:DualPivotQuicksort 97 sort(a, 0, a.length - 1); 107 public static void sort(in method in class:DualPivotQuicksort 201 private static void sort(int[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 536 public static void sort(long[] a) { method in class:DualPivotQuicksort 547 public static void sort(long[] a, int left, int right) { method in class:DualPivotQuicksort 641 private static void sort(long[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 976 public static void sort(short[] a) { method in class:DualPivotQuicksort 987 public static void sort(short[] a, int left, int right) { method in class:DualPivotQuicksort 1113 private static void sort(short[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 1448 public static void sort(char[] a) { method in class:DualPivotQuicksort 1459 public static void sort(char[] a, int left, int right) { method in class:DualPivotQuicksort 1585 private static void sort(char[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 1923 public static void sort(byte[] a) { method in class:DualPivotQuicksort 1934 public static void sort(byte[] a, int left, int right) { method in class:DualPivotQuicksort 1970 public static void sort(float[] a) { method in class:DualPivotQuicksort 1981 public static void sort(float[] a, int left, int right) { method in class:DualPivotQuicksort 2162 private static void sort(float[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort 2497 public static void sort(double[] a) { method in class:DualPivotQuicksort 2508 public static void sort(double[] a, int left, int right) { method in class:DualPivotQuicksort 2689 private static void sort(double[] a, int left, int right, boolean leftmost) { method in class:DualPivotQuicksort [all...] |
H A D | Arrays.java | 43 * example, the algorithm used by {@code sort(Object[])} does not have to be 75 public static void sort(int[] a) { method in class:Arrays 76 DualPivotQuicksort.sort(a); 99 public static void sort(int[] a, int fromIndex, int toIndex) { method in class:Arrays 101 DualPivotQuicksort.sort(a, fromIndex, toIndex - 1); 115 public static void sort(long[] a) { method in class:Arrays 116 DualPivotQuicksort.sort(a); 139 public static void sort(long[] a, int fromIndex, int toIndex) { method in class:Arrays 141 DualPivotQuicksort.sort(a, fromIndex, toIndex - 1); 155 public static void sort(shor method in class:Arrays 179 public static void sort(short[] a, int fromIndex, int toIndex) { method in class:Arrays 195 public static void sort(char[] a) { method in class:Arrays 219 public static void sort(char[] a, int fromIndex, int toIndex) { method in class:Arrays 235 public static void sort(byte[] a) { method in class:Arrays 259 public static void sort(byte[] a, int fromIndex, int toIndex) { method in class:Arrays 283 public static void sort(float[] a) { method in class:Arrays 315 public static void sort(float[] a, int fromIndex, int toIndex) { method in class:Arrays 339 public static void sort(double[] a) { method in class:Arrays 371 public static void sort(double[] a, int fromIndex, int toIndex) { method in class:Arrays 468 public static void sort(Object[] a) { method in class:Arrays 533 public static void sort(Object[] a, int fromIndex, int toIndex) { method in class:Arrays 655 public static <T> void sort(T[] a, Comparator<? super T> c) { method in class:Arrays 722 public static <T> void sort(T[] a, int fromIndex, int toIndex, method in class:Arrays [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/ |
H A D | Sort.java | 135 * Parse the attributes of the xsl:sort element 149 // Get the sort order; default is 'ascending' 154 // Get the sort data type; default is text 181 * which we will use as a sort key 186 // If the sort data-type is not set we use the natural data-type 187 // of the data we will sort 226 * xsl:sort element. The method is called from the static code-generating 244 * and a node sort record producing objects as its parameters. 324 final Sort sort = (Sort) sortObjects.elementAt(i); 325 needsSortRecordFactory |= sort [all...] |
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/ui/ |
H A D | ProcessListPanel.java | 109 sort(els); 153 sort(newEls); 182 private synchronized void sort(java.util.List els) { method in class:ProcessListPanel 205 Collections.sort(els, c);
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | quickSort.cpp | 92 sort<int, C>(arrayToSort, length, comparator, idempotent); 204 // Now sort them once with the test_even_odd_comparator. Then sort the 207 sort(expected_array, length, test_even_odd_comparator, true); 208 sort(test_array, length, test_even_odd_comparator, true); 210 sort(test_array, length, test_even_odd_comparator, true);
|
H A D | array.cpp | 49 void ResourceArray::sort(size_t esize, ftype f) { function in class:ResourceArray 52 template <MEMFLAGS F> void CHeapArray<F>::sort(size_t esize, ftype f) { function in class:CHeapArray
|
/openjdk7/jdk/src/share/native/sun/font/layout/ |
H A D | OpenTypeUtilities.h | 61 static void sort(le_uint16 *array, le_int32 count);
|
/openjdk7/jdk/test/java/util/Collections/ |
H A D | ReverseOrder.java | 37 Collections.sort(list, Collections.reverseOrder());
|
/openjdk7/jdk/src/share/classes/com/sun/tools/hat/internal/util/ |
H A D | ArraySorter.java | 43 * ArraySorter.sort(arr, new Comparer() { 58 static public void sort(Object[] arr, Comparer c) { method in class:ArraySorter 67 sort(arr, new Comparer() { 138 // Now we just need to sort from from..highestBelowPivot
|
H A D | VectorSorter.java | 43 * VectorSorter.sort(v, new Comparer() { 59 static public void sort(Vector<Object> v, Comparer c) { method in class:VectorSorter 68 sort(v, new Comparer() { 139 // Now we just need to sort from from..highestBelowPivot
|
/openjdk7/jdk/test/java/lang/String/ |
H A D | ICCBasher.java | 97 Collections.sort(L3, String.CASE_INSENSITIVE_ORDER); 98 Collections.sort(L4, String.CASE_INSENSITIVE_ORDER);
|
/openjdk7/langtools/test/tools/apt/lib/ |
H A D | TestProcessor.java | 127 Arrays.sort(res); 128 Arrays.sort(expected);
|
/openjdk7/langtools/src/share/classes/com/sun/tools/doclets/internal/toolkit/util/ |
H A D | ClassTree.java | 151 Collections.sort(list); 159 Collections.sort(baseinterfaces); 161 Collections.sort(it.next()); 164 Collections.sort(it.next()); 307 Collections.sort(result); 353 Collections.sort(list);
|