| /openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/runtime/ |
| H A D | ClassBeanInfoImpl.java | 236 Collections.sort(attProps);
|
| /openjdk7/jdk/src/windows/classes/sun/awt/shell/ |
| H A D | Win32ShellFolderManager2.java | 272 Arrays.sort(secondLevelFolders);
443 // Non-file shellfolders sort before files
|
| /openjdk7/jdk/test/com/sun/jdi/ |
| H A D | ReferrersTest.java | 125 * Used to sort a list of ReferenceTypes by
251 Collections.sort(sorted);
|
| /openjdk7/jdk/test/java/beans/Introspector/ |
| H A D | TestTypeResolver.java | 72 Arrays.sort(nested, classNameComparator);
|
| /openjdk7/langtools/make/tools/CompileProperties/ |
| H A D | CompileProperties.java | 224 Collections.sort(sortedKeys);
|
| /openjdk7/langtools/src/share/classes/com/sun/tools/doclets/internal/toolkit/ |
| H A D | Configuration.java | 350 Collections.sort(results);
732 * Return the comparator that will be used to sort member documentation.
735 * @return the {@link java.util.Comparator} used to sort members.
|
| /openjdk7/jdk/src/share/classes/sun/security/krb5/internal/ktab/ |
| H A D | KeyTab.java | 313 Arrays.sort(retVal, new Comparator<EncryptionKey>() {
|
| /openjdk7/jdk/src/share/classes/sun/swing/ |
| H A D | FilePane.java | 923 public void sort() { method in class:FilePane.DetailsTableRowSorter
926 DetailsTableRowSorter.super.sort();
1522 Arrays.sort(files);
1523 Arrays.sort(selectedObjects);
|
| /openjdk7/jdk/src/share/demo/java2d/J2DBench/src/j2dbench/report/ |
| H A D | HTMLSeriesReporter.java | 316 // determine how to sort
377 // sort the result list in order of the sets the results come from
378 // we count on this being a stable sort, otherwise we'd have to also sort
405 Arrays.sort(sorted, c);
|
| /openjdk7/jdk/src/share/demo/jfc/SampleTree/ |
| H A D | SampleTree.java | 518 Collections.sort(toRemove, new PositionComparator());
|
| /openjdk7/jdk/src/share/sample/scripting/scriptpad/src/resources/ |
| H A D | scriptpad.js | 403 java.util.Collections.sort(names);
|
| /openjdk7/jdk/src/solaris/classes/sun/awt/X11/ |
| H A D | MotifDnDConstants.java | 440 Arrays.sort(formats);
|
| /openjdk7/jdk/src/share/classes/javax/swing/plaf/basic/ |
| H A D | BasicFileChooserUI.java | 880 Arrays.sort(files);
890 Arrays.sort(children);
|
| /openjdk7/jdk/src/share/classes/com/sun/tools/hat/resources/ |
| H A D | hat.js | 1377 * sort function sorts the input array. optionally accepts
1379 * numerical sort is done.
1391 function sort(array, code) { function
1392 // we need an array to sort, so convert non-arrays
1402 return array.sort(func);
|
| /openjdk7/jdk/test/tools/pack200/pack200-verifier/src/xmlkit/ |
| H A D | ClassReader.java | 389 methods.sort();
547 y.sort();
|
| /openjdk7/jdk/make/common/shared/ |
| H A D | Defs.gmk | 639 REPO_LIST = $(patsubst ./%,%,$(patsubst %/,%,$(sort $(dir \
|
| /openjdk7/jdk/src/share/classes/sun/java2d/loops/ |
| H A D | ProcessPath.java | 1304 Arrays.sort(params, 0, cnt);
1846 * We could not use O(N) Radix sort here because in most cases list of
1847 * edges almost sorted. So, bubble sort (O(N^2)) is working much
1848 * better. Note, in case of array of edges Shell sort is more
1851 public void sort() { method in class:ProcessPath.ActiveEdgeList
1980 activeList.sort();
|
| /openjdk7/make/scripts/ |
| H A D | webrev.ksh | 1399 sort -r -k 1,1 -u | sort > $FLIST
2245 ALL_CREV=`hg outgoing -q --template '{rev}\n' $OUTPWS | sort -n`
|
| /openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/oops/ |
| H A D | ObjectHeap.java | 644 // Now sort live regions
655 Collections.sort(liveRegions, new Comparator() {
|
| /openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/runtime/ |
| H A D | VM.java | 832 // sort flags by name
833 Arrays.sort(commandLineFlags, new Comparator() {
|
| /openjdk7/jdk/src/share/classes/java/util/ |
| H A D | Collections.java | 46 * to. (For example, the algorithm used by <tt>sort</tt> does not have to be
55 * example, invoking the <tt>sort</tt> method on an unmodifiable list that is
110 * <p>This sort is guaranteed to be <i>stable</i>: equal elements will
111 * not be reordered as a result of the sort.
129 * simply concatenate the arrays and sort the resulting array.
131 * <p>The implementation was adapted from Tim Peters's list sort for Python
142 * to sort a linked list in place.
153 public static <T extends Comparable<? super T>> void sort(List<T> list) { method in class:Collections
155 Arrays.sort(a);
170 * <p>This sort i
215 public static <T> void sort(List<T> list, Comparator<? super T> c) { method in class:Collections
[all...] |
| /openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/ |
| H A D | ServerCompilerScheduler.java | 582 Collections.sort(list, edgeComparator);
|
| /openjdk7/hotspot/src/share/tools/LogCompilation/src/com/sun/hotspot/tools/compiler/ |
| H A D | LogParser.java | 204 Collections.sort(log.events, sortByStart);
|
| /openjdk7/langtools/src/share/classes/com/sun/tools/doclets/formats/html/ |
| H A D | ClassUseWriter.java | 173 Collections.sort(list);
|
| /openjdk7/jdk/src/share/classes/sun/security/provider/certpath/ |
| H A D | SunCertPathBuilder.java | 176 Collections.sort(orderedCertStores, new CertStoreComparator());
|