| /external/chromium_org/cc/test/ |
| pixel_test_utils.h | 25 // true if the comparator returns a match. |ref_img_path| is absolute.
28 const PixelComparator& comparator);
|
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| options.cc | 7 #include "leveldb/comparator.h"
13 : comparator(BytewiseComparator()),
|
| /external/guava/guava/src/com/google/common/collect/ |
| SortedIterable.java | 19 import java.util.Comparator;
23 * An {@code Iterable} whose elements are sorted relative to a {@code Comparator}, typically
31 * Returns the {@code Comparator} by which the elements of this iterable are ordered, or {@code
34 Comparator<? super T> comparator(); method in interface:SortedIterable
38 * nondecreasing order according to the associated {@link #comparator}.
|
| SortedLists.java | 24 import java.util.Comparator;
34 * <i>lesser</i> are considered to refer to the comparator on the elements, and the terms
56 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
66 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
74 int c = comparator.compare(list.get(middle), key);
90 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
99 int c = comparator.compare(list.get(middle), key)
[all...] |
| AbstractSortedMultiset.java | 21 import java.util.Comparator;
36 final Comparator<? super E> comparator; field in class:AbstractSortedMultiset
41 this((Comparator) Ordering.natural());
44 AbstractSortedMultiset(Comparator<? super E> comparator) {
45 this.comparator = checkNotNull(comparator);
64 public Comparator<? super E> comparator() {
[all...] |
| ForwardingSortedMap.java | 22 import java.util.Comparator;
43 * comparator of the map to test equality for both keys and values, unlike
65 public Comparator<? super K> comparator() { method in class:ForwardingSortedMap
66 return delegate().comparator();
97 Comparator<? super K> comparator = comparator(); local
98 if (comparator == null) {
101 return ((Comparator<Object>) comparator).compare(k1, k2)
[all...] |
| ForwardingSortedSet.java | 22 import java.util.Comparator;
43 * comparator (or the natural ordering of the elements, if there is no
44 * comparator) to test element equality. As a result, if the comparator is not
66 public Comparator<? super E> comparator() { method in class:ForwardingSortedSet
67 return delegate().comparator();
98 Comparator<? super E> comparator = comparator(); local
[all...] |
| RegularImmutableSortedSet.java | 31 import java.util.Comparator;
52 ImmutableList<E> elements, Comparator<? super E> comparator) {
53 super(comparator);
87 if (!SortedIterables.hasSameComparator(comparator(), targets)
93 * If targets is a sorted set with the same comparator, containsAll can run
133 // Pretend the comparator can compare anything. If it turns out it can't
137 Comparator<Object> unsafeComparator = (Comparator<Object>) comparator;
[all...] |
| BstNode.java | 24 import java.util.Comparator;
112 * respect to the specified {@code comparator}.
114 protected final boolean orderingInvariantHolds(Comparator<? super K> comparator) {
115 checkNotNull(comparator);
118 result &= comparator.compare(getChild(LEFT).getKey(), key) < 0;
121 result &= comparator.compare(getChild(RIGHT).getKey(), key) > 0;
|
| EmptyImmutableSortedMultiset.java | 19 import java.util.Comparator;
29 EmptyImmutableSortedMultiset(Comparator<? super E> comparator) {
30 super(comparator);
55 return ImmutableSortedSet.emptySet(comparator());
|
| RegularImmutableSortedMultiset.java | 25 import java.util.Comparator;
58 static <E> RegularImmutableSortedMultiset<E> createFromSorted(Comparator<? super E> comparator,
66 return new RegularImmutableSortedMultiset<E>(comparator, ImmutableList.copyOf(newEntries));
72 Comparator<? super E> comparator, ImmutableList<CumulativeCountEntry<E>> entries) {
73 super(comparator);
89 return new RegularImmutableSortedSet<E>(elementList(), comparator());
145 elementList(), (E) element, comparator(), ANY_PRESENT, INVERTED_INSERTION_INDEX);
158 elementList(), checkNotNull(upperBound), comparator(), ANY_PRESENT, NEXT_HIGHER)
[all...] |
| /external/guava/guava-gwt/src/com/google/common/collect/ |
| ImmutableSortedMap_CustomFieldSerializer.java | 24 import java.util.Comparator;
45 Comparator<Object> comparator = (Comparator<Object>) reader.readObject(); local
47 SortedMap<Object, Object> entries = new TreeMap<Object, Object>(comparator);
50 return ImmutableSortedMap.orderedBy(comparator).putAll(entries).build();
55 writer.writeObject(instance.comparator());
|
| RegularImmutableSortedSet_CustomFieldSerializer.java | 25 import java.util.Comparator;
46 Comparator<Object> comparator = (Comparator<Object>) reader.readObject(); local
57 ImmutableSortedSet.copyOf(comparator, elements);
62 writer.writeObject(instance.comparator());
|
| /libcore/luni/src/main/java/java/util/ |
| SortedSet.java | 24 * {@link Comparator} which is passed into a concrete implementation at
28 * @see Comparator
34 * Returns the comparator used to compare elements in this {@code SortedSet}.
36 * @return a comparator or null if the natural ordering is used.
38 public Comparator<? super E> comparator(); method in interface:SortedSet
|
| SortedMap.java | 23 * natural ordering of its keys or the ordering given by a specified comparator.
28 * Returns the comparator used to compare keys in this sorted map, or null if the natural
31 public Comparator<? super K> comparator(); method in interface:SortedMap
|
| PriorityQueue.java | 25 * according to their natural order or according to the comparator specified at
47 private Comparator<? super E> comparator; field in class:PriorityQueue
73 * Constructs a priority queue with the specified capacity and comparator.
77 * @param comparator
78 * the specified comparator. If it is null, the natural ordering
83 public PriorityQueue(int initialCapacity, Comparator<? super E> comparator) {
88 this.comparator = comparator;
229 public Comparator<? super E> comparator() { method in class:PriorityQueue
[all...] |
| /bionic/libc/bionic/ |
| scandir.cpp | 67 void Sort(int (*comparator)(const dirent**, const dirent**)) {
68 // If we have entries and a comparator, sort them.
69 if (size_ > 0 && comparator != NULL) {
70 qsort(names_, size_, sizeof(dirent*), (int (*)(const void*, const void*)) comparator);
94 int (*comparator)(const dirent**, const dirent**)) {
110 names.Sort(comparator);
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| FixedSizeArray.java | 20 import java.util.Comparator;
36 private Comparator<T> mComparator;
51 public FixedSizeArray(int size, Comparator<T> comparator) {
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
[all...] |
| /cts/tools/signature-tools/test/signature/comparator/ |
| AnnotationCompareTest.java | 17 package signature.comparator;
24 import signature.comparator.util.AbstractComparatorTest;
|
| /external/chromium_org/third_party/leveldatabase/src/table/ |
| block.h | 15 class Comparator;
25 Iterator* NewIterator(const Comparator* comparator);
|
| /packages/apps/UnifiedEmail/src/org/apache/commons/io/comparator/ |
| DefaultFileComparator.java | 17 package org.apache.commons.io.comparator;
21 import java.util.Comparator;
26 * This comparator can be used to sort lists or arrays of files
47 public class DefaultFileComparator implements Comparator<File>, Serializable {
49 /** Singleton default comparator instance */
50 public static final Comparator<File> DEFAULT_COMPARATOR = new DefaultFileComparator();
52 /** Singleton reverse default comparator instance */
53 public static final Comparator<File> DEFAULT_REVERSE = new ReverseComparator<File>(DEFAULT_COMPARATOR);
|
| LastModifiedFileComparator.java | 17 package org.apache.commons.io.comparator;
21 import java.util.Comparator;
27 * This comparator can be used to sort lists or arrays of files
48 public class LastModifiedFileComparator implements Comparator<File>, Serializable {
50 /** Last modified comparator instance */
51 public static final Comparator<File> LASTMODIFIED_COMPARATOR = new LastModifiedFileComparator();
53 /** Reverse last modified comparator instance */
54 public static final Comparator<File> LASTMODIFIED_REVERSE = new ReverseComparator<File>(LASTMODIFIED_COMPARATOR);
|
| ReverseComparator.java | 17 package org.apache.commons.io.comparator;
20 import java.util.Comparator;
24 * the delegate {@link Comparator}.
29 class ReverseComparator<T> implements Comparator<T>, Serializable {
31 private final Comparator<T> delegate;
34 * Construct an instance with the sepecified delegate {@link Comparator}.
36 * @param delegate The comparator to delegate to
38 public ReverseComparator(Comparator<T> delegate) {
40 throw new IllegalArgumentException("Delegate comparator is missing");
46 * Compare using the delegate Comparator, but reversing the result.
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/ |
| HttpRetryExceptionTest.java | 34 // comparator for HttpRetryException objects
35 private static final SerializableAssert comparator = new SerializableAssert() { field in class:HttpRetryExceptionTest
53 LOCATION), comparator);
61 100, LOCATION), comparator);
|
| /libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/net/ |
| HttpRetryExceptionTest.java | 34 // comparator for HttpRetryException objects
35 private static final SerializableAssert comparator = new SerializableAssert() { field in class:HttpRetryExceptionTest
53 LOCATION), comparator);
61 100, LOCATION), comparator);
|
