Searched refs:sorted (Results 1 - 15 of 15) sorted by relevance

/openjdk7/jdk/test/java/util/PriorityQueue/
H A DPriorityQueueSort.java37 * @summary Checks that a priority queue returns elements in sorted order across various operations
59 List<Integer> sorted = new ArrayList<Integer>(n);
61 sorted.add(new Integer(i));
62 List<Integer> shuffled = new ArrayList<Integer>(sorted);
72 if (!recons.equals(sorted))
79 if (!recons.equals(sorted))
91 for (Iterator<Integer> i = sorted.iterator(); i.hasNext(); )
95 if (!recons.equals(sorted))
/openjdk7/jdk/test/java/util/Collections/
H A DNullComparator.java37 List sorted = new ArrayList(list);
42 if (!Arrays.asList(a).equals(sorted))
46 if (!Arrays.asList(a).equals(sorted))
53 if (!tmp.equals(sorted))
/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/interceptors/
H A DInterceptorList.java219 List sorted = null;
228 sorted = new ArrayList(); // not synchronized like we want.
234 sorted.add(interceptor);
239 if (numInterceptors > 0 && sorted.size() > 0) {
243 Collections.sort(sorted);
244 Iterator sortedIterator = sorted.iterator();
/openjdk7/jdk/test/com/sun/jdi/
H A DInstancesTest.java235 // Create a list of ReferenceTypes sorted by instance count
237 List<ToSort> sorted = new ArrayList(allClasses.size());
242 sorted.add(tos);
253 Collections.sort(sorted);
254 for (int ii = sorted.size() - 1; ii >= 0 ; ii--) {
255 ToSort xxx = sorted.get(ii);
277 // Instances, one class at a time, in sorted order, printing each line
280 "at a time (limited) in sorted order");
286 for (int ii = sorted.size() - 1; ii >= 0 ; ii--) {
287 ToSort xxx = sorted
[all...]
H A DReferrersTest.java234 // Create a list of ReferenceTypes sorted by instance count
236 List<ToSort> sorted = new ArrayList(allClasses.size());
240 sorted.add(tos);
251 Collections.sort(sorted);
252 for (int ii = sorted.size() - 1; ii >= 0 ; ii--) {
253 ToSort xxx = sorted.get(ii);
275 // Instances, one class at a time, in sorted order, printing each line
278 "at a time (limited) in sorted order");
284 for (int ii = sorted.size() - 1; ii >= 0 ; ii--) {
285 ToSort xxx = sorted
[all...]
/openjdk7/jdk/src/share/classes/com/sun/jmx/mbeanserver/
H A DMBeanAnalyzer.java195 * The methods are sorted in such a way that methods which
244 final Method[] sorted = startMethods.toArray(new Method[len]);
245 Arrays.sort(sorted,MethodOrder.instance);
248 final Method m0 = sorted[i-1];
249 final Method m1 = sorted[i];
256 // due to the way we have sorted them in MethodOrder.
/openjdk7/jdk/src/share/demo/java2d/J2DBench/src/j2dbench/report/
H A DHTMLSeriesReporter.java292 // get sorted list of variable options for this test
294 // sorted depending on the value type (numeric or string). it maps
403 ResultHolder[] sorted = new ResultHolder[resultList.size()];
404 sorted = (ResultHolder[])resultList.toArray(sorted);
405 Arrays.sort(sorted, c);
406 for (int k = 0; k < sorted.length; ++k) {
407 ResultHolder holder = sorted[k];
/openjdk7/jdk/test/java/beans/XMLEncoder/
H A DBeanValidator.java183 private void validate(Collection c1, Collection c2, boolean sorted) { argument
187 if (sorted) {
220 private void validate(Map map1, Map map2, boolean sorted) { argument
221 validate(map1.entrySet(), map2.entrySet(), sorted);
/openjdk7/jdk/src/macosx/native/jobjc/src/generator/java/com/apple/internal/jobjc/generator/
H A DUtils.java135 final List<Framework> sorted = new ArrayList<Framework>(frameworks.size());
142 sorted.add(fw);
147 frameworks.addAll(sorted);
/openjdk7/jdk/src/share/classes/javax/swing/text/
H A DGapContent.java55 * The marks are stored sorted so they can be located quickly
564 * Remove all unused marks out of the sorted collection
783 Object[] sorted = new Object[endIndex - startIndex];
793 sorted[addIndex++] = mark;
799 sorted[addIndex++] = mark;
807 sorted[addIndex++] = mark;
813 sorted[addIndex++] = mark;
818 marks.replaceRange(startIndex, endIndex, sorted);
H A DStyleContext.java1062 * Initialize with a set of already sorted
1065 private void initialize(Object[] sorted) { argument
1068 int n = sorted.length;
1070 keys.addElement(sorted[i]);
1071 data.addElement(sorted[i+1]);
1076 * Creates a table of sorted key/value entries
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/xpath/regex/
H A DRangeToken.java34 boolean sorted; field in class:RangeToken
77 if (!this.sorted)
83 return this.sorted;
86 this.sorted = sort;
124 * this.ranges is sorted.
318 // this.ranges is sorted and compacted.
408 // this.ranges is sorted and compacted.
/openjdk7/jdk/src/share/classes/javax/swing/
H A DDefaultRowSorter.java62 * <code>ClassCastException</code> will be thrown when the data is sorted.
170 * Indicates the contents are sorted. This is used if
173 private boolean sorted; field in class:DefaultRowSorter
201 * Sets the model wrapper providing the data that is being sorted and
205 * data that gets sorted and filtered
226 * Returns the model wrapper providing the data that is being sorted and
230 * gets sorted and filtered
344 * sorted based on the items in column 1. Next, the user clicks
345 * the header for column 2, causing the table to be sorted based
349 * sorted o
[all...]
H A DGroupLayout.java2111 * Returns the sorted list of SpringDelta's for the current set of
2119 List<SpringDelta> sorted = new ArrayList<SpringDelta>(size);
2131 sorted.add(new SpringDelta(counter, sDelta));
2134 Collections.sort(sorted);
2135 return sorted;
/openjdk7/hotspot/src/share/vm/memory/
H A DgenCollectedHeap.cpp1123 ScratchBlock* sorted = NULL; local
1127 smallest->next = sorted;
1128 sorted = smallest;
1130 list = sorted;

Completed in 101 milliseconds