Searched refs:sort (Results 101 - 125 of 296) sorted by relevance

1234567891011>>

/openjdk7/langtools/src/share/classes/com/sun/tools/doclets/internal/toolkit/builders/
H A DMethodBuilder.java101 Collections.sort(
H A DPropertyBuilder.java104 Collections.sort(
H A DConstantsSummaryBuilder.java212 Arrays.sort(classes);
341 Collections.sort(members);
/openjdk7/langtools/src/share/classes/com/sun/tools/doclets/internal/toolkit/util/
H A DDeprecatedAPIListBuilder.java141 Collections.sort(getList(i));
/openjdk7/jdk/test/java/security/cert/pkix/policyChanges/
H A DTestPolicy.java131 Collections.sort(list);
/openjdk7/jdk/test/sun/nio/cs/
H A DFindDecoderBugs.java44 static <T extends Comparable<? super T>> List<T> sort(Collection<T> c) { method in class:FindDecoderBugs
46 Collections.sort(list);
105 for (String key : sort(failureCounts.keySet()))
414 for (Charset cs : sort(Charset.availableCharsets().values())) {
/openjdk7/jdk/src/share/classes/sun/java2d/
H A DSpans.java42 * This class will sort and collapse its span
57 * to this object without a sort
144 Collections.sort(mSpans);
/openjdk7/jdk/make/sun/awt/
H A DDepend.mak27 # ensure consistent sort order
142 fgrep .obj make.tmp | sed -f Depend.sed | sort -f -u | nawk -f CondenseRules.awk > make.depend
/openjdk7/hotspot/src/share/vm/services/
H A DmemPtrArray.hpp58 virtual void sort(FN_SORT fn) = 0;
269 void sort(FN_SORT fn) { function in class:MemPointerArrayImpl
H A DmemBaseline.cpp211 // sort into callsite pc order. Details are aggregated by callsites
212 malloc_data->sort((FN_SORT)malloc_sort_by_pc);
237 malloc_data->sort((FN_SORT)malloc_sort_by_addr);
336 // sort it into callsite pc order. Details are aggregated by callsites
337 _vm_cs->sort((FN_SORT)bl_vm_sort_by_pc);
441 // sort snapshot malloc'd records in callsite pc order
449 // sort baselined malloc'd records in size order
457 // sort baselined malloc'd records in callsite pc order
466 // sort baselined mmap'd records in size (reserved size) order
474 // sort baseline
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/runtime/output/
H A DC14nXmlOutput.java62 * Used to sort namespace declarations. Reused.
159 // sort is expensive even for size 0 array,
162 Arrays.sort(staticAttributes,0,len);
171 // sort all the attributes, not just the other attributes
175 Collections.sort(otherAttributes);
204 // do a bubble sort. Hopefully # of ns decls are small enough to justify bubble sort.
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/policy/
H A DAssertionSet.java200 Collections.sort(result.assertions, ASSERTION_COMPARATOR);
218 Collections.sort(result.assertions, ASSERTION_COMPARATOR);
/openjdk7/jdk/src/share/demo/jfc/TableExample/
H A DTableSorter.java225 public void sort(Object sender) { method in class:TableSorter
322 sort(this);
327 // Add a mouse listener to the Table to trigger a table sort
/openjdk7/jdk/src/share/classes/sun/java2d/loops/
H A DGraphicsPrimitiveMgr.java235 Arrays.sort(primitives, primSorter);
325 Arrays.sort(primitives, primSorter);
/openjdk7/jdk/src/solaris/classes/sun/awt/
H A DX11CustomCursor.java71 java.util.Arrays.sort(tmp);
94 java.util.Arrays.sort(cols, 0, numColors);
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/
H A DPopulationCoding.java148 // Divide the values into cadres, and sort within each.
158 Arrays.sort(fValues, prevLimit, i);
170 Arrays.sort(fValues, prevLimit, high);
173 Arrays.sort(fValues, low, mid);
174 Arrays.sort(fValues, mid, high);
227 Arrays.sort(lsymtab);
/openjdk7/jdk/src/share/classes/javax/naming/ldap/
H A DRdn.java149 sort(); // arrange entries for comparison
242 void sort() { method in class:Rdn
244 Collections.sort(entries);
H A DRfc2253Parser.java124 rdn.sort();
/openjdk7/jdk/src/share/classes/sun/rmi/rmic/newrmic/jrmp/
H A DRemoteClass.java252 Arrays.sort(orderedKeys);
447 Arrays.sort(exceptions, new ClassDocComparator());
525 Arrays.sort(exceptionTypes, new ClassDocComparator());
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/util/
H A DIntegerArray.java156 public void sort() { method in class:IntegerArray
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/interceptors/
H A DInterceptorList.java240 // Let the RuntimeExceptions thrown by sort
243 Collections.sort(sorted);
/openjdk7/jdk/src/share/classes/java/util/
H A DTimSort.java32 * on random arrays. Like all proper mergesorts, this sort is stable and
33 * runs O(n log n) time (worst case). In the worst case, this sort requires
37 * This implementation was adapted from Tim Peters's list sort for
56 * sort, assuming the input array is large enough to warrant the full-blown
57 * TimSort. Small arrays are sorted in place, using a binary insertion sort.
87 * The comparator for this sort.
133 * Creates a TimSort instance to maintain the state of an ongoing sort.
136 * @param c the comparator to determine the order of the sort
172 static <T> void sort(T[] a, Comparator<? super T> c) { method in class:TimSort
173 sort(
176 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c) { method in class:TimSort
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DcollectionSetChooser.cpp132 _regions.sort(order_regions);
/openjdk7/hotspot/src/share/vm/interpreter/
H A DbytecodeHistogram.cpp89 a->sort(HistoEntry::compare);
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/agent/
H A DSnmpMibNode.java247 static public void sort(int array[]) { method in class:SnmpMibNode
312 * must now sort the left partition.
318 * must now sort the right partition.

Completed in 117 milliseconds

1234567891011>>