Searched refs:comparator (Results 1 - 25 of 39) sorted by relevance

12

/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/ui/table/
H A DSortableTableModel.java40 private TableModelComparator comparator; field in class:SortableTableModel
48 * This comparator must be set.
50 public void setComparator(TableModelComparator comparator) { argument
51 this.comparator = comparator;
55 comparator.addColumn(column);
56 comparator.setAscending(ascending);
58 Collections.sort(elements, comparator);
64 return comparator.isAscending();
68 return comparator
[all...]
/openjdk7/hotspot/src/share/vm/utilities/
H A DquickSort.hpp49 static int find_pivot(T* array, int length, C comparator) { argument
55 if (comparator(array[0], array[middle_index]) == 1) {
58 if (comparator(array[0], array[last_index]) == 1) {
61 if (comparator(array[middle_index], array[last_index]) == 1) {
70 static int partition(T* array, int pivot, int length, C comparator) { argument
78 } while (comparator(array[left_index], pivot_val) == -1);
81 } while (comparator(array[right_index], pivot_val) == 1);
84 if (!idempotent || comparator(array[left_index], array[right_index]) != 0) {
97 static void inner_sort(T* array, int length, C comparator) { argument
101 int pivot = find_pivot(array, length, comparator);
119 sort(T* array, int length, C comparator, bool idempotent) argument
[all...]
H A DquickSort.cpp91 bool QuickSort::sort_and_compare(int* arrayToSort, int* expectedResult, int length, C comparator, bool idempotent) { argument
92 sort<int, C>(arrayToSort, length, comparator, idempotent);
/openjdk7/jdk/src/share/classes/sun/awt/shell/
H A DShellFolderColumnInfo.java41 private Comparator comparator; field in class:ShellFolderColumnInfo
43 * <code>false</code> (default) if the {@link comparator} expects folders as arguments,
46 * ShellFolderManager's inner comparator.
52 SortOrder sortOrder, Comparator comparator,
59 this.comparator = comparator;
65 SortOrder sortOrder, Comparator comparator) {
66 this(title, width, alignment, visible, sortOrder, comparator, false);
119 return comparator;
122 public void setComparator(Comparator comparator) { argument
50 ShellFolderColumnInfo(String title, Integer width, Integer alignment, boolean visible, SortOrder sortOrder, Comparator comparator, boolean compareByColumn) argument
63 ShellFolderColumnInfo(String title, Integer width, Integer alignment, boolean visible, SortOrder sortOrder, Comparator comparator) argument
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/
H A DLayoutFocusTraversalPolicy.java100 Comparator comparator = getComparator();
101 if (comparator instanceof LayoutComparator) {
102 ((LayoutComparator)comparator).
136 Comparator comparator = getComparator();
137 if (comparator instanceof LayoutComparator) {
138 ((LayoutComparator)comparator).
160 Comparator comparator = getComparator();
161 if (comparator instanceof LayoutComparator) {
162 ((LayoutComparator)comparator).
184 Comparator comparator
[all...]
H A DDefaultFocusManager.java55 private final LayoutComparator comparator = field in class:DefaultFocusManager
77 comparator.setComponentOrientation(root.getComponentOrientation());
99 comparator.setComponentOrientation(root.getComponentOrientation());
119 comparator.setComponentOrientation(root.getComponentOrientation());
139 comparator.setComponentOrientation(root.getComponentOrientation());
147 return (comparator.compare(a, b) < 0);
H A DSortingFocusTraversalPolicy.java64 private Comparator<? super Component> comparator; field in class:SortingFocusTraversalPolicy
104 public SortingFocusTraversalPolicy(Comparator<? super Component> comparator) { argument
105 this.comparator = comparator;
116 index = Collections.binarySearch(cycle, aComponent, comparator);
136 Collections.sort(cycle, comparator);
557 * @param comparator the Comparator which will be used for sorting
559 protected void setComparator(Comparator<? super Component> comparator) { argument
560 this.comparator = comparator;
[all...]
/openjdk7/jdk/test/java/util/TreeMap/
H A DEmptyMapAndNulls.java40 // No comparator
68 Map comparator = new TreeMap(String.CASE_INSENSITIVE_ORDER);
72 comparator.put(null, "anything");
80 comparator.put("test", "anything");
88 comparator.put(null, "anything");
94 comparator.clear();
98 comparator.put(new Object(), "anything");
/openjdk7/jdk/src/share/classes/java/util/
H A DSortedSet.java38 * interface (or be accepted by the specified comparator). Furthermore, all
40 * (or <tt>comparator.compare(e1, e2)</tt>) must not throw a
47 * explicit comparator is provided) must be <i>consistent with equals</i> if
64 * sorted set sorted according to the specified comparator. 3) A
110 * Returns the comparator used to order the elements in this set,
114 * @return the comparator used to order the elements in this set,
118 Comparator<? super E> comparator(); method in interface:SortedSet
138 * set's comparator (or, if the set has no comparator, using
167 * with this set's comparator (o
[all...]
H A DPriorityQueue.java90 * priority queue is ordered by comparator, or by the elements'
91 * natural ordering, if comparator is null: For each node n in the
103 * The comparator, or null if priority queue uses elements'
106 private final Comparator<? super E> comparator; field in class:PriorityQueue
138 * that orders its elements according to the specified comparator.
141 * @param comparator the comparator that will be used to order this
148 Comparator<? super E> comparator) {
154 this.comparator = comparator;
147 PriorityQueue(int initialCapacity, Comparator<? super E> comparator) argument
725 public Comparator<? super E> comparator() { method in class:PriorityQueue
[all...]
H A DSortedMap.java39 * interface (or be accepted by the specified comparator). Furthermore, all
41 * {@code comparator.compare(k1, k2)}) must not throw a
48 * explicit comparator is provided) must be <em>consistent with equals</em> if
68 * creates an empty sorted map sorted according to the specified comparator.</li>
115 * Returns the comparator used to order the keys in this map, or
119 * @return the comparator used to order the keys in this map,
123 Comparator<? super K> comparator(); method in interface:SortedMap
142 * cannot be compared to one another using this map's comparator
143 * (or, if the map has no comparator, using natural ordering).
170 * with this map's comparator (o
[all...]
H A DTreeSet.java38 * comparator is provided) must be <i>consistent with equals</i> if it is to
129 * comparator. All elements inserted into the set must be <i>mutually
130 * comparable</i> by the specified comparator: {@code comparator.compare(e1,
136 * @param comparator the comparator that will be used to order this set.
140 public TreeSet(Comparator<? super E> comparator) { argument
141 this(new TreeMap<>(comparator));
171 this(s.comparator());
230 * and this set uses natural ordering, or its comparator
386 public Comparator<? super E> comparator() { method in class:TreeSet
[all...]
/openjdk7/jdk/src/share/classes/com/sun/tools/hat/internal/server/
H A DHistogramQuery.java46 Comparator<JavaClass> comparator;
48 comparator = new Comparator<JavaClass>() {
56 comparator = new Comparator<JavaClass>() {
63 comparator = new Comparator<JavaClass>() {
71 Arrays.sort(classes, comparator);
/openjdk7/jdk/src/share/classes/javax/swing/table/
H A DTableRowSorter.java217 Comparator comparator = super.getComparator(column);
218 if (comparator != null) {
219 return comparator;
237 Comparator comparator = super.getComparator(column);
238 if (comparator != null) {
/openjdk7/jdk/test/javax/management/ObjectName/
H A DComparatorTest.java76 private static boolean compare(char comparator, String on1, String on2) { argument
78 System.out.println("Test " + on1 + " " + comparator + " " + on2);
83 switch (comparator) {
98 "Test incorrect: case: " + comparator);
119 private static int runTest(char comparator, String on1, String on2) { argument
125 switch (comparator) {
140 "Test incorrect: case: " + comparator);
/openjdk7/jdk/src/share/classes/sun/tools/jstat/
H A DJStatLogger.java53 public void printNames(String names, Comparator<Monitor> comparator, argument
59 Collections.sort(items, comparator);
72 public void printSnapShot(String names, Comparator<Monitor> comparator, argument
79 Collections.sort(items, comparator);
H A DArguments.java53 private Comparator<Monitor> comparator; field in class:Arguments
168 comparator = new AscendingMonitorComparator();
170 comparator = new DescendingMonitorComparator();
299 if (comparator == null) {
300 comparator = new AscendingMonitorComparator();
335 public Comparator<Monitor> comparator() { method in class:Arguments
336 return comparator;
H A DJstat.java94 logger.printNames(arguments.counterNames(), arguments.comparator(),
105 logger.printSnapShot(arguments.counterNames(), arguments.comparator(),
125 Collections.sort(logged, arguments.comparator());
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DPriorityBlockingQueue.java134 * priority queue is ordered by comparator, or by the elements'
135 * natural ordering, if comparator is null: For each node n in the
147 * The comparator, or null if priority queue uses elements'
150 private transient Comparator<? super E> comparator; field in class:PriorityBlockingQueue
199 * comparator.
202 * @param comparator the comparator that will be used to order this
209 Comparator<? super E> comparator) {
214 this.comparator = comparator;
208 PriorityBlockingQueue(int initialCapacity, Comparator<? super E> comparator) argument
579 public Comparator<? super E> comparator() { method in class:PriorityBlockingQueue
[all...]
H A DConcurrentSkipListSet.java108 * the specified comparator.
110 * @param comparator the comparator that will be used to order this set.
114 public ConcurrentSkipListSet(Comparator<? super E> comparator) { argument
115 m = new ConcurrentSkipListMap<E,Object>(comparator);
143 m = new ConcurrentSkipListMap<E,Object>(s.comparator());
379 public Comparator<? super E> comparator() { method in class:ConcurrentSkipListSet
380 return m.comparator();
464 * <tt>{@link Collections#reverseOrder(Comparator) Collections.reverseOrder}(comparator())</tt>.
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/objects/
H A DXNodeSet.java445 /** Less than comparator */
448 /** Less than or equal comparator */
451 /** Greater than comparator */
454 /** Greater than or equal comparator */
458 /** Equal comparator */
461 /** Not equal comparator */
468 * @param comparator Comparator to use
474 public boolean compare(XObject obj2, Comparator comparator) argument
513 if (comparator.compareStrings(s1, s2))
532 if (comparator
[all...]
/openjdk7/jdk/test/java/util/Collections/
H A DBigBinarySearch.java72 Comparator<Integer> comparator) {
73 try { equal(i, Collections.binarySearch(l, l.get(i), comparator)); }
71 checkBinarySearch(List<Integer> l, int i, Comparator<Integer> comparator) argument
/openjdk7/langtools/src/share/classes/com/sun/mirror/util/
H A DSourceOrderDeclScanner.java164 final static java.util.Comparator<Declaration> comparator = new SourceOrderComparator(); field in class:SourceOrderDeclScanner
179 TreeSet<Declaration>(SourceOrderDeclScanner.comparator) ;
212 TreeSet<Declaration>(SourceOrderDeclScanner.comparator) ;
244 TreeSet<Declaration>(SourceOrderDeclScanner.comparator) ;
/openjdk7/jdk/test/java/util/NavigableMap/
H A DLockStep.java110 Comparator cmp = m.comparator();
133 Comparator cmp = s.comparator();
192 static Comparator comparator(NavigableSet s) { method in class:LockStep
193 Comparator cmp = s.comparator();
199 static Comparator comparator(NavigableMap m) { method in class:LockStep
200 Comparator cmp = m.comparator();
207 if (s.comparator() == null)
208 check(s.descendingSet().descendingSet().comparator() == null);
213 Comparator cmp = comparator(s);
303 if (s1.comparator() !
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/xsom/impl/
H A DUName.java96 public static final Comparator comparator = new Comparator() { field in class:UName

Completed in 106 milliseconds

12