Searched defs:sort (Results 26 - 50 of 58) sorted by relevance

123

/openjdk7/jdk/src/share/classes/java/util/
H A DArrays.java43 * 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...]
H A DComparableTimSort.java108 * Creates a TimSort instance to maintain the state of an ongoing sort.
145 static void sort(Object[] a) { method in class:ComparableTimSort
146 sort(a, 0, a.length);
149 static void sort(Object[] a, int lo, int hi) { method in class:ComparableTimSort
189 // Merge all remaining runs to complete sort
197 * insertion sort. This is the best method for sorting small numbers
243 * first slot after them -- that's why this sort is stable.
385 * called once, to complete the sort.
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/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);
/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.
/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 DmemRecorder.hpp111 void sort(FN_SORT fn) { function in class:FixedSizeMemPointerArray
261 // sorting function, sort records into following order
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/org/objectweb/asm/
H A DType.java75 * The sort of the <tt>void</tt> type. See {@link #getSort getSort}.
80 * The sort of the <tt>boolean</tt> type. See {@link #getSort getSort}.
85 * The sort of the <tt>char</tt> type. See {@link #getSort getSort}.
90 * The sort of the <tt>byte</tt> type. See {@link #getSort getSort}.
95 * The sort of the <tt>short</tt> type. See {@link #getSort getSort}.
100 * The sort of the <tt>int</tt> type. See {@link #getSort getSort}.
105 * The sort of the <tt>float</tt> type. See {@link #getSort getSort}.
110 * The sort of the <tt>long</tt> type. See {@link #getSort getSort}.
115 * The sort of the <tt>double</tt> type. See {@link #getSort getSort}.
120 * The sort o
181 private final int sort; field in class:Type
210 Type(final int sort) argument
222 Type(final int sort, final char[] buf, final int off, final int len) argument
[all...]
/openjdk7/jdk/src/share/classes/sun/tools/jconsole/inspector/
H A DTableSorter.java69 sort(this.sortColumn, this.ascending);
114 private void sort(int column, boolean isAscending) { method in class:TableSorter
120 // We cannot sort rows when a cell is being
136 // do the sort
206 * must now sort the left partition.
213 * must now sort the right partition.
246 sort(column,ascending);
253 // Add a mouse listener to the Table to trigger a table sort
/openjdk7/jdk/src/share/classes/sun/awt/shell/
H A DShellFolder.java289 public static void sort(final List<? extends File> files) { method in class:ShellFolder
295 // synchronize the whole code of the sort method once
326 Collections.sort(files, FILE_COMPARATOR);
336 // synchronize the whole code of the sort method once
339 Collections.sort(files, FILE_COMPARATOR);
595 // Non-file shellfolders sort before files
/openjdk7/hotspot/src/share/vm/memory/
H A DheapInspection.cpp197 void KlassInfoHisto::sort() { function in class:KlassInfoHisto
198 elements()->sort(KlassInfoHisto::sort_helper);
328 histo.sort();
/openjdk7/jdk/src/share/classes/com/sun/tools/hat/resources/
H A Dhat.js1377 * 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/src/macosx/classes/com/apple/laf/
H A DAquaFileSystemModel.java251 protected void sort(final Vector<Object> v) { method in class:AquaFileSystemModel
288 // to copy the vectors into arrays and sort the arrays?
308 // must now sort the left partition.
314 // must now sort the right partition.
396 sort(acceptsList);
/openjdk7/hotspot/src/share/vm/utilities/
H A DgrowableArray.hpp343 void sort(int f(E*,E*)) { function in class:GrowableArray
346 // sort by fixed-stride sub arrays:
347 void sort(int f(E*,E*), int stride) { function in class:GrowableArray
/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())) {
H A DFindEncoderBugs.java44 static <T extends Comparable<? super T>> List<T> sort(Collection<T> c) { method in class:FindEncoderBugs
46 Collections.sort(list);
105 for (String key : sort(failureCounts.keySet()))
495 for (Charset cs : sort(Charset.availableCharsets().values())) {
/openjdk7/jaxp/src/com/sun/org/apache/bcel/internal/generic/
H A DMethodGen.java365 private static final void sort(LocalVariableGen[] vars, int l, int r) { method in class:MethodGen
380 if(l < j) sort(vars, l, j);
381 if(i < r) sort(vars, i, r);
404 sort(lg, 0, size - 1);
/openjdk7/jdk/src/share/classes/javax/swing/
H A DDefaultRowSorter.java78 * column, current sort order, and whether each column is sortable. To
82 * sort order is unsorted (the same as the model), and columns are
88 * current sort order and whether a column is sortable.
139 * Cached SortKeys for the current sort.
144 * Cached comparators for the current sort
160 * The sort keys.
176 * Maximum number of sort keys.
248 * It is still possible to sort on a column that has been marked as
249 * unsortable by directly setting the sort keys. The default is
286 * Sets the sort key
570 public void sort() { method in class:DefaultRowSorter
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/jxc/model/nav/
H A DAPTNavigator.java115 return sort(l);
128 return sort(l);
131 private <A extends Declaration> List<A> sort(List<A> l) { method in class:APTNavigator
136 // use that as a key to sort them correctly. This isn't "correct" in
141 Collections.sort(l,SOURCE_POS_COMPARATOR);
/openjdk7/langtools/src/share/classes/com/sun/tools/doclets/internal/toolkit/util/
H A DUtil.java96 Collections.sort(list);
446 * @param sort if true, return list of interfaces sorted alphabetically.
450 Configuration configuration, boolean sort) {
451 Map<ClassDoc,Type> results = sort ? new TreeMap<ClassDoc,Type>() : new LinkedHashMap<ClassDoc,Type>();
474 List<Type> superInterfaces = getAllInterfaces(interfaceType, configuration, sort);
490 if (sort) {
491 Collections.sort(resultsList, new TypeComparator());
449 getAllInterfaces(Type type, Configuration configuration, boolean sort) argument
H A DVisibleMemberMap.java129 sort(visibleClasses);
212 * classes followed by interfaces traversed. Don't sort alphabetically.
214 private void sort(List<ClassDoc> list) { method in class:VisibleMemberMap
/openjdk7/jdk/src/share/demo/java2d/J2DBench/src/j2dbench/report/
H A DJ2DAnalyzer.java171 sort(keys);
656 sort(keys);
814 public static void sort(String strs[]) { method in class:J2DAnalyzer
/openjdk7/corba/src/share/classes/sun/rmi/rmic/iiop/
H A DStubGenerator.java758 // Get imports into an array and sort them...
769 Arrays.sort(names,new StringComparator());
2095 ValueType[] getStubExceptions (CompoundType.Method method, boolean sort) { argument
2104 if (sort) {
2105 Arrays.sort(list,new UserExceptionComparator());
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/
H A DConstantPool.java908 void sort(Index ix) { method in class:ConstantPool
911 Arrays.sort(ix.cpMap);
/openjdk7/jdk/test/java/util/Arrays/
H A DSorting.java27 * @summary Exercise Arrays.sort
100 Arrays.sort(new int[] {});
101 Arrays.sort(new int[] {}, 0, 0);
104 Arrays.sort((int[]) null);
107 Arrays.sort((int[]) null, 0, 0);
111 failed("Arrays.sort(int[],fromIndex,toIndex) shouldn't " +
114 failed("Arrays.sort(int[]) shouldn't catch null array");
119 Arrays.sort(new long[] {});
120 Arrays.sort(new long[] {}, 0, 0);
123 Arrays.sort((lon
1502 private static void sort(Object object) { method in class:Sorting
[all...]

Completed in 101 milliseconds

123