/external/guava/guava/src/com/google/common/collect/ |
H A D | ForwardingSortedSet.java | 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(); 99 return (comparator == null) 101 : ((Comparator<Object>) comparator).compare(o1, o2);
|
H A D | RegularImmutableSortedSet.java | 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; 167 if (SortedIterables.hasSameComparator(comparator, that)) { 204 elements, checkNotNull(toElement), comparator(), FIRST_AFTER, NEXT_HIGHER); 207 elements, checkNotNull(toElement), comparator(), FIRST_PRESENT, NEXT_HIGHER); 224 elements, checkNotNull(fromElement), comparator(), FIRST_PRESEN 51 RegularImmutableSortedSet( ImmutableList<E> elements, Comparator<? super E> comparator) argument [all...] |
H A D | BstNode.java | 112 * respect to the specified {@code comparator}. 114 protected final boolean orderingInvariantHolds(Comparator<? super K> comparator) { argument 115 checkNotNull(comparator); 118 result &= comparator.compare(getChild(LEFT).getKey(), key) < 0; 121 result &= comparator.compare(getChild(RIGHT).getKey(), key) > 0;
|
H A D | EmptyImmutableSortedMultiset.java | 29 EmptyImmutableSortedMultiset(Comparator<? super E> comparator) { argument 30 super(comparator); 55 return ImmutableSortedSet.emptySet(comparator());
|
H A D | RegularImmutableSortedMultiset.java | 58 static <E> RegularImmutableSortedMultiset<E> createFromSorted(Comparator<? super E> comparator, argument 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); 162 elementList(), checkNotNull(upperBound), comparator(), ANY_PRESENT, NEXT_LOWER) + 1; 176 elementList(), checkNotNull(lowerBound), comparator(), ANY_PRESENT, NEXT_LOWER) + 1; 180 elementList(), checkNotNull(lowerBound), comparator(), ANY_PRESEN 71 RegularImmutableSortedMultiset( Comparator<? super E> comparator, ImmutableList<CumulativeCountEntry<E>> entries) argument [all...] |
H A D | SortedMultisets.java | 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; 93 return comparator = 94 Ordering.from(forwardMultiset().comparator()).<E>reverse();
|
H A D | ImmutableSortedAsList.java | 40 @Override public Comparator<? super E> comparator() { method in class:ImmutableSortedAsList 41 return backingSet.comparator(); 65 backingList.subList(fromIndex, toIndex), backingSet.comparator())
|
H A D | TreeBasedTable.java | 80 final Comparator<? super C> comparator; field in class:TreeBasedTable.Factory 81 Factory(Comparator<? super C> comparator) { argument 82 this.comparator = comparator; 86 return new TreeMap<C, V>(comparator); 110 * @param rowComparator the comparator that orders the row keys 111 * @param columnComparator the comparator that orders the column keys 144 * Returns the comparator that orders the rows. With natural ordering, 148 return rowKeySet().comparator(); 152 * Returns the comparator tha 192 @Override public Comparator<? super C> comparator() { method in class:TreeBasedTable.TreeRow [all...] |
H A D | CompoundOrdering.java | 47 for (Comparator<? super T> comparator : comparators) { 48 int result = comparator.compare(left, right);
|
H A D | TreeMultiset.java | 80 * comparator. All elements inserted into the multiset must be <i>mutually 81 * comparable</i> by the specified comparator: {@code comparator.compare(e1, 87 * @param comparator the comparator that will be used to sort this multiset. A 93 @Nullable Comparator<? super E> comparator) { 94 return (comparator == null) 96 : new TreeMultiset<E>(comparator); 126 private TreeMultiset(Comparator<? super E> comparator) { argument 127 super(comparator); 92 create( @ullable Comparator<? super E> comparator) argument 366 public Comparator<? super E> comparator() { method in class:TreeMultiset [all...] |
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/net/ |
H A D | 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);
|
/external/guava/guava-gwt/src/com/google/common/collect/ |
H A D | RegularImmutableSortedSet_CustomFieldSerializer.java | 46 Comparator<Object> comparator = (Comparator<Object>) reader.readObject(); 57 ImmutableSortedSet.copyOf(comparator, elements); 62 writer.writeObject(instance.comparator());
|
/external/okhttp/src/main/java/libcore/util/ |
H A D | CollectionUtils.java | 83 * not use {@link Object#equals}: only the comparator defines equality. 85 public static <T> void removeDuplicates(List<T> list, Comparator<? super T> comparator) { argument 86 Collections.sort(list, comparator); 89 if (comparator.compare(list.get(j - 1), list.get(i)) != 0) {
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.equinox.p2.repository.tools_2.0.1.R36x_v20100823.jar | ... equinox/p2/internal/repository/ org/eclipse/equinox/p2/internal/repository/comparator/ org/eclipse/equinox/p2/internal/repository/comparator/JarComparator.class ... |
/external/webkit/Source/WebCore/inspector/front-end/ |
H A D | CookiesTable.js | 165 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 D | ProfileDataGridTree.js | 121 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 D | LevelDBDatabase.cpp | 34 #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 D | 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
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | SafeTreeMap.java | 50 public SafeTreeMap(Comparator<? super K> comparator) { argument 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(); 87 if (comparator == null) { 88 comparator = NATURAL_ORDER; 90 return comparator; 238 comparator().compare(k, k);
|
H A D | SafeTreeSet.java | 51 public SafeTreeSet(Comparator<? super E> comparator) { argument 52 this(new TreeSet<E>(comparator)); 86 @Override public Comparator<? super E> comparator() { method in class:SafeTreeSet 87 Comparator<? super E> comparator = delegate.comparator(); 88 if (comparator == null) { 89 comparator = NATURAL_ORDER; 91 return comparator; 202 comparator().compare(e, e);
|
H A D | Helpers.java | 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 + ")", 188 comparator.compare(lesser, t) < 0); 191 assertEquals(comparator + ".compare(" + t + ", " + t + ")", 192 0, comparator.compare(t, t)); 196 assertTrue(comparator + ".compare(" + greater + ", " + t + ")", 197 comparator.compare(greater, t) > 0); 174 testComparator( Comparator<? super T> comparator, T... valuesInExpectedOrder) argument 179 testComparator( Comparator<? super T> comparator, List<T> valuesInExpectedOrder) argument
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | SortedMapsTest.java | 103 Comparator<Integer> comparator = Ordering.natural(); 104 SortedMap<Integer, String> unfiltered = Maps.newTreeMap(comparator); 115 assertSame(comparator, filtered.comparator()); 132 Comparator<Integer> comparator = Ordering.natural(); 133 SortedMap<Integer, String> unfiltered = Maps.newTreeMap(comparator); 144 assertSame(comparator, filtered.comparator());
|
H A D | OrderingTest.java | 59 Ordering<Integer> comparator = Ordering.natural(); 60 Helpers.testComparator(comparator, 63 comparator.compare(1, null); 67 comparator.compare(null, 2); 71 comparator.compare(null, null); 74 assertSame(comparator, reserialize(comparator)); 75 assertEquals("Ordering.natural()", comparator.toString()); 227 Comparator<String> comparator = Ordering.compound(asList( 230 Helpers.testComparator(comparator, ImmutableLis [all...] |
/external/guava/guava-tests/test/com/google/common/primitives/ |
H A D | SignedBytesTest.java | 147 Comparator<byte[]> comparator = SignedBytes.lexicographicalComparator(); 148 Helpers.testComparator(comparator, ordered); 153 Comparator<byte[]> comparator = SignedBytes.lexicographicalComparator(); 154 assertSame(comparator, SerializableTester.reserialize(comparator));
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | TreeMultiset.java | 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) { 90 return (comparator == null) 92 : new TreeMultiset<E>(comparator); 122 private TreeMultiset(Comparator<? super E> comparator) { argument 123 super(comparator); 88 create( @ullable Comparator<? super E> comparator) argument 362 public Comparator<? super E> comparator() { method in class:TreeMultiset [all...] |