/openjdk7/jdk/src/solaris/classes/sun/awt/X11/ |
H A D | XFileDialogPeer.java | 480 Arrays.sort(l);
|
/openjdk7/jdk/src/share/classes/sun/awt/datatransfer/ |
H A D | DataTransferer.java | 692 // Maps formats to indices that will be used to sort the formats 2426 Arrays.sort(flavors, comparator); 2444 Arrays.sort(flavors, comparator);
|
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/ |
H A D | PackageReader.java | 1108 Arrays.sort(cpMap, 1, narrowLimit, entryOutputOrder); 1109 Arrays.sort(cpMap, narrowLimit, fillp, entryOutputOrder);
|
H A D | CodingChooser.java | 1255 if (((reorder >>>= 3) & 7) <= 2) Collections.sort(popvals);
|
/openjdk7/jdk/test/java/lang/ProcessBuilder/ |
H A D | Basic.java | 140 Collections.sort(ls, new WindowsComparator()); 682 Arrays.sort(lines, new WindowsComparator()); 1492 // Check for sort order of environment variables on Windows. 1502 // Order is random on Unix, so this test does the sort.
|
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/util/ |
H A D | MethodGenerator.java | 1158 // Get all the best candidates for outlining, and sort them in 1162 Collections.sort(candidateChunks); 2104 // this sort of specific knowledge of an
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/bugspot/ |
H A D | BugSpot.java | 1390 Collections.sort(list, new Comparator() {
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | block.cpp | 1229 edges->sort(edge_order);
|
H A D | node.hpp | 1321 void sort( C_sort_func_t func);
|
H A D | loopnode.cpp | 2698 //------------------------------sort------------------------------------------- 2701 IdealLoopTree *PhaseIdealLoop::sort( IdealLoopTree *loop, IdealLoopTree *innermost ) { function in class:PhaseIdealLoop 2710 while( l ) { // Insertion sort based on pre-order 2734 if( p ) sort( p, innermost ); // Insert my parents into list as well 2762 // loops. This means I need to sort my childrens' loops by pre-order. 2763 // The sort is of size number-of-control-children, which generally limits 2944 // it's children belong to several different loops. The sort call 2947 // belong to different loops, the sort call will properly set the 2951 innermost = sort( l, innermost );
|
H A D | node.cpp | 846 // %%% Temporary, until we sort out CheckCastPP vs. CastPP. 1925 void Node_Array::sort( C_sort_func_t func) { function in class:Node_Array
|
H A D | compile.cpp | 100 // The sort order is by the address of the ciMethod, with is_virtual as minor key. 122 // look at minor sort key 3191 // Too many recompiles globally, and we have seen this sort of trap. 3349 // sort descending 3356 // First, sort the array by frequencies. 3357 _constants.sort(qsort_comparator); 3564 _expensive_nodes->sort(cmp_expensive_nodes); 3596 // Then sort the list so that similar nodes are next to each other
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | fprofiler.cpp | 1332 array->sort(&ProfilerNode::compare); 1554 // Insertion sort the data, if it's relevant.
|
/openjdk7/jdk/src/share/classes/sun/text/bidi/ |
H A D | BidiBase.java | 3229 Arrays.sort(keys);
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/ |
H A D | CommandProcessor.java | 541 Arrays.sort(keys, new Comparator() {
|
/openjdk7/jdk/src/share/classes/com/sun/media/sound/ |
H A D | DLSSoundbank.java | 1221 Arrays.sort(inslist_array, new ModelInstrumentComparator());
|
/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_LinearScan.cpp | 1533 // Re-sort existing interval list because an Interval::from() has changed 1534 _sorted_intervals->sort(interval_cmp); 1584 // Re-sort existing interval list because an Interval::from() has changed 1585 _sorted_intervals->sort(interval_cmp); 1600 // conventional sort-algorithm for new intervals 1601 new_list->sort(interval_cmp); 4696 // sort into active list 4705 // sort into inactive list 5426 // sort register numbers to prevent e.g. a move from eax,ebx to ebx,eax 5578 // sort registe [all...] |
H A D | c1_GraphBuilder.cpp | 453 _blocks.sort(compare_depth_first); 794 // sort block descending into work list
|
/openjdk7/jdk/src/share/classes/javax/swing/ |
H A D | GroupLayout.java | 2056 // First pass, sort the resizable springs into the List resizable 2134 Collections.sort(sorted);
|
/openjdk7/jdk/src/share/classes/sun/tools/javac/ |
H A D | SourceClass.java | 2241 java.util.Arrays.sort(ordered_methods);
|
/openjdk7/jdk/src/share/classes/javax/swing/plaf/basic/ |
H A D | BasicTreeUI.java | 3263 // sort the paths to display order rather than selection order 3268 Collections.sort(selOrder, this);
|