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

123

/external/guava/src/com/google/common/collect/
H A DComparatorOrdering.java29 /** An ordering for a pre-existing {@code comparator}. */
32 final Comparator<T> comparator; field in class:ComparatorOrdering
34 ComparatorOrdering(Comparator<T> comparator) { argument
35 this.comparator = checkNotNull(comparator);
39 return comparator.compare(a, b);
44 return Collections.binarySearch(sortedList, key, comparator);
50 Collections.sort(list, comparator);
60 return this.comparator.equals(that.comparator);
[all...]
H A DImmutableSortedSet.java37 * Some instances are ordered by an explicit comparator, while others follow the
58 * two elements are equivalent. Instead, with an explicit comparator, the
62 * {(x, y) | comparator.compare(x, y) == 0}}</pre>
101 Comparator<? super E> comparator) {
102 if (NATURAL_ORDER.equals(comparator)) {
105 return new EmptyImmutableSortedSet<E>(comparator);
193 Comparator<? super E> comparator, E... elements) {
197 return emptySet(comparator);
208 sort(array, comparator);
209 array = removeDupes(array, comparator);
100 emptySet( Comparator<? super E> comparator) argument
192 ofInternal( Comparator<? super E> comparator, E... elements) argument
216 sort( Object[] array, Comparator<? super E> comparator) argument
226 removeDupes(Object[] array, Comparator<? super E> comparator) argument
312 copyOf( Comparator<? super E> comparator, Iterable<? extends E> elements) argument
327 copyOf( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
353 copyOfInternal( Comparator<? super E> comparator, Iterable<? extends E> elements, boolean fromSortedSet) argument
390 copyOfInternal( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
412 hasSameComparator( Iterable<?> elements, Comparator<?> comparator) argument
432 orderedBy(Comparator<E> comparator) argument
483 private final Comparator<? super E> comparator; field in class:ImmutableSortedSet.Builder
489 Builder(Comparator<? super E> comparator) argument
560 unsafeCompare( Comparator<?> comparator, Object a, Object b) argument
570 final transient Comparator<? super E> comparator; field in class:ImmutableSortedSet
572 ImmutableSortedSet(Comparator<? super E> comparator) argument
583 public Comparator<? super E> comparator() { method in class:ImmutableSortedSet
660 final Comparator<? super E> comparator; field in class:ImmutableSortedSet.SerializedForm
663 SerializedForm(Comparator<? super E> comparator, Object[] elements) argument
[all...]
H A DImmutableSortedMap.java81 Comparator<? super K> comparator) {
82 if (NATURAL_ORDER.equals(comparator)) {
85 return new ImmutableSortedMap<K, V>(EMPTY_ARRAY, comparator);
177 * keys sorted by the provided comparator.
184 * the comparator
187 Map<? extends K, ? extends V> map, Comparator<? super K> comparator) {
188 return copyOfInternal(map, checkNotNull(comparator));
202 // If map has a null comparator, the keys should have a natural ordering,
205 Comparator<? super K> comparator =
206 (map.comparator()
80 emptyMap( Comparator<? super K> comparator) argument
186 copyOf( Map<? extends K, ? extends V> map, Comparator<? super K> comparator) argument
210 copyOfInternal( Map<? extends K, ? extends V> map, Comparator<? super K> comparator) argument
244 sortEntries(Entry<?, ?>[] entryArray, final Comparator<?> comparator) argument
255 validateEntries(Entry<?, ?>[] entryArray, Comparator<?> comparator) argument
289 orderedBy(Comparator<K> comparator) argument
325 private final Comparator<? super K> comparator; field in class:ImmutableSortedMap.Builder
331 Builder(Comparator<? super K> comparator) argument
375 private final transient Comparator<? super K> comparator; field in class:ImmutableSortedMap
379 ImmutableSortedMap(Entry<?, ?>[] entries, Comparator<? super K> comparator, int fromIndex, int toIndex) argument
390 ImmutableSortedMap(Entry<?, ?>[] entries, Comparator<? super K> comparator) argument
584 public Comparator<? super K> comparator() { method in class:ImmutableSortedMap
676 private final Comparator<Object> comparator; field in class:ImmutableSortedMap.SerializedForm
[all...]
H A DTreeMultiset.java76 * comparator. All elements inserted into the multiset must be <i>mutually
77 * comparable</i> by the specified comparator: {@code comparator.compare(e1,
83 * @param comparator the comparator that will be used to sort this multiset. A
87 public static <E> TreeMultiset<E> create(Comparator<? super E> comparator) { argument
88 return new TreeMultiset<E>(comparator);
111 private TreeMultiset(Comparator<? super E> comparator) { argument
112 super(new TreeMap<E, AtomicInteger>(comparator));
151 public Comparator<? super E> comparator() { method in class:TreeMultiset.SortedMapBasedElementSet
[all...]
H A DForwardingSortedMap.java40 public Comparator<? super K> comparator() { method in class:ForwardingSortedMap
41 return delegate().comparator();
H A DForwardingSortedSet.java40 public Comparator<? super E> comparator() { method in class:ForwardingSortedSet
41 return delegate().comparator();
H A DComparisonChain.java70 @Nullable T left, @Nullable T right, Comparator<T> comparator) {
71 return classify(comparator.compare(left, right));
112 @Nullable T right, @Nullable Comparator<T> comparator) {
144 * Compares two objects using a comparator, <i>if</i> the result of this
148 @Nullable T left, @Nullable T right, Comparator<T> comparator);
111 compare(@ullable T left, @Nullable T right, @Nullable Comparator<T> comparator) argument
147 compare( @ullable T left, @Nullable T right, Comparator<T> comparator) argument
H A DCompoundOrdering.java47 for (Comparator<? super T> comparator : comparators) {
48 int result = comparator.compare(left, right);
H A DEmptyImmutableSortedSet.java36 EmptyImmutableSortedSet(Comparator<? super E> comparator) { argument
37 super(comparator);
H A DRegularImmutableSortedSet.java53 Comparator<? super E> comparator) {
54 super(comparator);
61 Comparator<? super E> comparator, int fromIndex, int toIndex) {
62 super(comparator);
97 if (!hasSameComparator(targets, comparator()) || (targets.size() <= 1)) {
102 * If targets is a sorted set with the same comparator, containsAll can
180 if (hasSameComparator(that, comparator)) {
243 return new RegularImmutableSortedSet<E>(elements, comparator,
246 return emptySet(comparator);
264 // The equals() check is needed when the comparator is
52 RegularImmutableSortedSet(Object[] elements, Comparator<? super E> comparator) argument
60 RegularImmutableSortedSet(Object[] elements, Comparator<? super E> comparator, int fromIndex, int toIndex) argument
[all...]
/external/easymock/src/org/easymock/internal/matchers/
H A DCompare.java30 private Comparator<? super T> comparator; field in class:Compare
34 public Compare(T expected, Comparator<? super T> comparator, LogicalOperator result) { argument
36 this.comparator = comparator;
41 buffer.append(comparator + "(" + expected + ") " + operator.getSymbol()
50 return operator.matchResult(comparator.compare((T) actual, expected));
/external/replicaisland/src/com/replica/replicaisland/
H A DQuickSorter.java22 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument
23 quicksort(array, 0, count - 1, comparator);
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { argument
47 int i = partition(a, left, right, comparator);
48 quicksort(a, left, i - 1, comparator);
49 quicksort(a, i + 1, right, comparator);
53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { argument
57 while (comparator.compare(a[++i], a[right]) < 0) { // find item on left to swap
59 while (comparator.compare(a[right], a[--j]) < 0) { // find item on right to swap
H A DStandardSorter.java25 public void sort(Object[] array, int count, Comparator comparator) { argument
26 Arrays.sort(array, 0, count, comparator);
H A DSorter.java22 public abstract void sort(Type[] array, int count, Comparator<Type> comparator); argument
H A DShellSorter.java30 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument
36 insertionSort(array, count, start, increment, comparator);
44 insertionSort(array, count, 0, 1, comparator );
59 Comparator<Type> comparator) {
67 int delta = comparator.compare(array[j], array[k]);
77 } while ( j != start && comparator.compare(array[k], temp) > 0 );
58 insertionSort(Type[] array, int count, int start, int increment, Comparator<Type> comparator) argument
H A DFixedSizeArray.java51 public FixedSizeArray(int size, Comparator<T> comparator) { argument
56 mComparator = comparator;
79 * Otherwise, the comparator set on this array (if any) will be used to find the object.
185 * binary search will be performed. If a comparator has been specified with setComparator(),
186 * it will be used to perform the search. If not, the default comparator for the object type
189 * performed. Otherwise, the comparator set on this array (if any) will be used to find the
198 final Comparator comparator = mComparator;
201 if (comparator != null) {
202 index = Arrays.binarySearch(contents, object, comparator);
214 if (comparator !
269 setComparator(Comparator<T> comparator) argument
[all...]
/external/emma/core/java12/com/vladium/emma/report/
H A DItemComparator.java45 final Comparator comparator = IItemAttribute.Factory.getAttribute (attributeID, unitsID).comparator ();
46 comparators [a >> 1] = attributeIDsWithDir [a + 1] < 0 ? new ReverseComparator (comparator) : comparator;
70 ReverseComparator (final Comparator comparator) argument
72 m_comparator = comparator;
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/
H A DHttpRetryExceptionTest.java34 // comparator for HttpRetryException objects
35 private static final SerializableAssert comparator = new SerializableAssert() { field in class:HttpRetryExceptionTest
53 LOCATION), comparator);
61 100, LOCATION), comparator);
/external/webkit/Source/WebCore/inspector/front-end/
H A DCookiesTable.js165 var comparator; variable
167 case 0: comparator = localeCompare.bind(this, "name"); break;
168 case 1: comparator = localeCompare.bind(this, "value"); break;
169 case 2: comparator = localeCompare.bind(this, "domain"); break;
170 case 3: comparator = localeCompare.bind(this, "path"); break;
171 case 4: comparator = expiresCompare; break;
172 case 5: comparator = numberCompare.bind(this, "size"); break;
173 case 6: comparator = localeCompare.bind(this, "httpOnly"); break;
174 case 7: comparator = localeCompare.bind(this, "secure"); break;
178 cookies.sort(comparator);
[all...]
H A DProfileDataGridTree.js121 sort: function(/*Function*/ comparator, /*Boolean*/ force)
134 if (!force && (!gridNode.expanded || gridNode.lastComparator === comparator)) {
140 gridNode.lastComparator = comparator;
146 children.sort(comparator);
368 var comparator = this.propertyComparators[(isAscending ? 1 : 0)][property];
370 if (!comparator) {
372 comparator = function(lhs, rhs)
383 comparator = function(lhs, rhs)
395 this.propertyComparators[(isAscending ? 1 : 0)][property] = comparator;
398 return comparator;
371 comparator = function(lhs, rhs) function
[all...]
/external/webkit/Source/WebCore/platform/leveldb/
H A DLevelDBDatabase.cpp34 #include <leveldb/comparator.h>
69 ComparatorAdapter(const LevelDBComparator* comparator) argument
70 : m_comparator(comparator)
99 LevelDBDatabase* LevelDBDatabase::open(const String& fileName, const LevelDBComparator* comparator) argument
101 OwnPtr<ComparatorAdapter> comparatorAdapter(new ComparatorAdapter(comparator));
106 options.comparator = comparatorAdapter.get();
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/serialization/
H A DKeyPairTest.java59 SerializationTest.verifyGolden(this, keyPair, comparator);
67 SerializationTest.verifySelf(keyPair, comparator);
71 // comparator for KeyPair objects
72 private static SerializableAssert comparator = new SerializableAssert(){ field in class:KeyPairTest
/external/emma/core/java12/com/vladium/jcd/cls/
H A DIConstantCollection.java104 * semantics expressed by 'comparator'. This method guarantees that
105 * when comparator.equals(c) is called c.type() is 'type'. The cost is
110 * @param comparator [may not be null]
113 * @throws IllegalArgumentException if 'comparator' is null
115 int find (int type, IConstantComparator comparator); argument
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
H A DRefSortedMap.java88 private final Comparator<? super K> comparator; field in class:RefSortedMap
166 public Comparator<? super K> comparator() { method in class:RefSortedMap.SubMap
167 return RefSortedMap.this.comparator();
246 return comparator != null ? comparator.compare(start, end)
251 public RefSortedMap(Comparator<? super K> comparator) { argument
252 this.comparator = comparator;
262 this(map.comparator());
266 public Comparator<? super K> comparator() { method in class:RefSortedMap
[all...]
H A DPriorityQueueTest.java143 // Try removing an entry that the comparator says is equal
197 assertNull(queue.comparator());
207 assertNull(queue.comparator());
218 assertNull(queue.comparator());
220 MockComparator<Object> comparator = new MockComparator<Object>();
221 queue = new PriorityQueue<Object>(100, comparator);
224 assertEquals(comparator, queue.comparator());
255 assertEquals(objectComparator, integerQueue.comparator());
271 assertNull(integerQueue.comparator());
[all...]

Completed in 2160 milliseconds

123