| /external/guava/guava/src/com/google/common/collect/ |
| SortedMultisets.java | 22 import java.util.Comparator;
46 @Override public Comparator<? super E> comparator() { method in class:SortedMultisets.ElementSet
47 return multiset().comparator();
88 private transient Comparator<? super E> comparator; field in class:SortedMultisets.DescendingMultiset
90 @Override public Comparator<? super E> comparator() { method in class:SortedMultisets.DescendingMultiset
91 Comparator<? super E> result = comparator;
[all...] |
| ImmutableSortedAsList.java | 19 import java.util.Comparator;
40 @Override public Comparator<? super E> comparator() { method in class:ImmutableSortedAsList
41 return backingSet.comparator();
65 backingList.subList(fromIndex, toIndex), backingSet.comparator())
|
| TreeBasedTable.java | 28 import java.util.Comparator;
76 private final Comparator<? super C> columnComparator;
80 final Comparator<? super C> comparator; field in class:TreeBasedTable.Factory
81 Factory(Comparator<? super C> comparator) {
82 this.comparator = comparator;
86 return new TreeMap<C, V>(comparator);
110 * @param rowComparator the comparator that orders the row key
192 @Override public Comparator<? super C> comparator() { method in class:TreeBasedTable.TreeRow
341 final Comparator<? super C> comparator = columnComparator(); local
[all...] |
| CompoundOrdering.java | 22 import java.util.Comparator;
28 final ImmutableList<Comparator<? super T>> comparators;
30 CompoundOrdering(Comparator<? super T> primary,
31 Comparator<? super T> secondary) {
33 = ImmutableList.<Comparator<? super T>>of(primary, secondary);
36 CompoundOrdering(Iterable<? extends Comparator<? super T>> comparators) {
40 CompoundOrdering(List<? extends Comparator<? super T>> comparators,
41 Comparator<? super T> lastComparator) {
42 this.comparators = new ImmutableList.Builder<Comparator<? super T>>()
47 for (Comparator<? super T> comparator : comparators)
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.equinox.p2.repository.tools_2.0.1.R36x_v20100823.jar | |
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/serialization/ |
| KeyPairTest.java | 59 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
|
| /libcore/luni/src/main/java/libcore/util/ |
| CollectionUtils.java | 22 import java.util.Comparator;
83 * not use {@link Object#equals}: only the comparator defines equality.
85 public static <T> void removeDuplicates(List<T> list, Comparator<? super T> comparator) {
86 Collections.sort(list, comparator);
89 if (comparator.compare(list.get(j - 1), list.get(i)) != 0) {
|
| /cts/tools/signature-tools/test/signature/comparator/ |
| AllDocletTests.java | 17 package signature.comparator;
|
| /external/chromium_org/third_party/leveldatabase/src/include/leveldb/ |
| options.h | 13 class Comparator;
35 // Comparator used to define the order of keys in the table.
36 // Default: a comparator that uses lexicographic byte-wise ordering
38 // REQUIRES: The client must ensure that the comparator supplied
40 // comparator provided to previous open calls on the same DB.
41 const Comparator* comparator; member in struct:leveldb::Options
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SafeTreeMap.java | 21 import java.util.Comparator;
39 private static final Comparator NATURAL_ORDER = new Comparator<Comparable>() {
50 public SafeTreeMap(Comparator<? super K> comparator) {
51 this(new TreeMap<K, V>(comparator));
85 @Override public Comparator<? super K> comparator() { method in class:SafeTreeMap
86 Comparator<? super K> comparator = delegate.comparator() local
[all...] |
| SafeTreeSet.java | 21 import java.util.Comparator;
36 private static final Comparator NATURAL_ORDER = new Comparator<Comparable>() {
51 public SafeTreeSet(Comparator<? super E> comparator) {
52 this(new TreeSet<E>(comparator));
86 @Override public Comparator<? super E> comparator() { method in class:SafeTreeSet
87 Comparator<? super E> comparator = delegate.comparator() local
[all...] |
| Helpers.java | 30 import java.util.Comparator;
164 public static <K, V> Comparator<Entry<K, V>> entryComparator(
165 final Comparator<? super K> keyComparator) {
166 return new Comparator<Entry<K, V>>() {
175 Comparator<? super T> comparator, T... valuesInExpectedOrder) {
176 testComparator(comparator, Arrays.asList(valuesInExpectedOrder));
180 Comparator<? super T> comparator, List<T> valuesInExpectedOrder) {
187 assertTrue(comparator + ".compare(" + lesser + ", " + t + ")"
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| TreeSet.java | 29 * Comparator.
73 * specified comparator.
75 * @param comparator
76 * the comparator to use.
78 public TreeSet(Comparator<? super E> comparator) {
79 backingMap = new TreeMap<E, Object>(comparator);
84 * the specified SortedSet and using the same Comparator.
90 this(set.comparator());
108 * when the object is null and the comparator cannot handl
175 public Comparator<? super E> comparator() { method in class:TreeSet
[all...] |
| /external/chromium_org/cc/test/ |
| pixel_test_utils.cc | 41 const PixelComparator& comparator) {
63 return comparator.Compare(gen_bmp, ref_bmp);
|
| pixel_test.h | 30 const PixelComparator& comparator);
35 const PixelComparator& comparator);
58 const PixelComparator& comparator);
|
| /external/chromium_org/content/browser/indexed_db/leveldb/ |
| leveldb_database.h | 19 class Comparator;
47 const LevelDBComparator* comparator,
51 const LevelDBComparator* comparator);
63 const LevelDBComparator* Comparator() const;
72 scoped_ptr<leveldb::Comparator> comparator_adapter_;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| SortedMapsTest.java | 31 import java.util.Comparator;
103 Comparator<Integer> comparator = Ordering.natural(); local
104 SortedMap<Integer, String> unfiltered = Maps.newTreeMap(comparator);
115 assertSame(comparator, filtered.comparator());
132 Comparator<Integer> comparator = Ordering.natural(); local
133 SortedMap<Integer, String> unfiltered = Maps.newTreeMap(comparator);
144 assertSame(comparator, filtered.comparator())
[all...] |
| /external/guava/guava-tests/test/com/google/common/primitives/ |
| SignedBytesTest.java | 28 import java.util.Comparator;
147 Comparator<byte[]> comparator = SignedBytes.lexicographicalComparator(); local
148 Helpers.testComparator(comparator, ordered);
153 Comparator<byte[]> comparator = SignedBytes.lexicographicalComparator(); local
154 assertSame(comparator, SerializableTester.reserialize(comparator));
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
| CookiesTable.js | 220 var comparator;
222 case "name": comparator = compareTo.bind(null, WebInspector.Cookie.prototype.name); break;
223 case "value": comparator = compareTo.bind(null, WebInspector.Cookie.prototype.value); break;
224 case "domain": comparator = compareTo.bind(null, WebInspector.Cookie.prototype.domain); break;
225 case "path": comparator = compareTo.bind(null, WebInspector.Cookie.prototype.path); break;
226 case "expires": comparator = expiresCompare; break;
227 case "size": comparator = numberCompare.bind(null, WebInspector.Cookie.prototype.size); break;
228 case "httpOnly": comparator = compareTo.bind(null, WebInspector.Cookie.prototype.httpOnly); break;
229 case "secure": comparator = compareTo.bind(null, WebInspector.Cookie.prototype.secure); break;
233 cookies.sort(comparator);
[all...] |
| ProfileDataGridTree.js | 120 * @param {function(Object, Object)} comparator
123 sort: function(comparator, force)
136 if (!force && (!gridNode.expanded || gridNode.lastComparator === comparator)) {
142 gridNode.lastComparator = comparator;
148 children.sort(comparator);
377 var comparator = WebInspector.ProfileDataGridTree.propertyComparators[(isAscending ? 1 : 0)][property];
379 if (!comparator) {
381 comparator = function(lhs, rhs)
392 comparator = function(lhs, rhs)
404 WebInspector.ProfileDataGridTree.propertyComparators[(isAscending ? 1 : 0)][property] = comparator;
380 comparator = function(lhs, rhs) function
[all...] |
| utilities.js | 404 * @param {function(number, number): number} comparator
409 value: function(comparator, left, right, pivotIndex)
422 if (comparator(this[i], pivotValue) < 0) {
436 * @param {function(number, number): number} comparator
443 value: function(comparator, leftBound, rightBound, k)
445 function quickSortFirstK(array, comparator, left, right, k)
450 var pivotNewIndex = array.partition(comparator, left, right, pivotIndex);
451 quickSortFirstK(array, comparator, left, pivotNewIndex - 1, k);
453 quickSortFirstK(array, comparator, pivotNewIndex + 1, right, left + k - 1 - pivotNewIndex);
457 this.sort(comparator);
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeMultiset.java | 26 import java.util.Comparator;
37 * their natural order or an explicit {@link Comparator}. In all cases, this
39 * Comparator#compare} instead of {@link Object#equals} to determine
76 * 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
89 @Nullable Comparator<? super E> comparator) {
362 public Comparator<? super E> comparator() { method
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| PriorityBlockingQueue.java | 106 * priority queue is ordered by comparator, or by the elements'
107 * natural ordering, if comparator is null: For each node n in the
119 * The comparator, or null if priority queue uses elements'
122 private transient Comparator<? super E> comparator; field in class:PriorityBlockingQueue
171 * comparator.
174 * @param comparator the comparator that will be used to order this
181 Comparator<? super E> comparator) {
550 public Comparator<? super E> comparator() { method in class:PriorityBlockingQueue
[all...] |
| /libcore/support/src/test/java/org/apache/harmony/testframework/serialization/ |
| SerializationTest.java | 186 // default comparator for a class that has equals(Object) method
194 * Comparator for verifying that deserialized object is the same as initial.
203 * Comparator for Throwable objects
228 * Comparator for PermissionCollection objects
253 * Returns <code>comparator</code> for provided serializable
256 * The <code>comparator</code> is searched in the following order: <br>
258 * selected as </code>comparator</code>.<br>- if passed <code>object</code>
268 * @return object's comparator
280 // use default comparator
284 // TODO use generics to detect comparator
[all...] |
| /bionic/tests/ |
| stdlib_test.cpp | 116 static int comparator(const void* lhs, const void* rhs) { function in struct:s
125 qsort(entries, 3, sizeof(s), s::comparator);
130 qsort(entries, 3, sizeof(s), s::comparator);
|
