/external/chromium_org/third_party/leveldatabase/src/include/leveldb/ |
H A D | options.h | 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/emma/core/java12/com/vladium/jcd/cls/ |
H A D | IConstantCollection.java | 104 * 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
|
H A D | ConstantCollection.java | 46 public int find (final int type, final IConstantComparator comparator) argument 48 if (comparator == null) 49 throw new IllegalArgumentException ("null input: comparator"); 55 if ((constant != null) && (constant.tag () == type) && comparator.equals (constant))
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | AbstractSortedMultiset.java | 36 final Comparator<? super E> comparator; field in class:AbstractSortedMultiset 44 AbstractSortedMultiset(Comparator<? super E> comparator) { argument 45 this.comparator = checkNotNull(comparator); 64 public Comparator<? super E> comparator() { method in class:AbstractSortedMultiset 65 return comparator;
|
H A D | BstOperations.java | 41 Comparator<? super K> comparator, @Nullable N tree, @Nullable K key) { 42 checkNotNull(comparator); 46 int cmp = comparator.compare(key, tree.getKey()); 51 return seek(comparator, tree.childOrNull(side), key); 69 Comparator<? super K> comparator, BstMutationRule<K, N> mutationRule, @Nullable N tree, 71 checkNotNull(comparator); 75 int cmp = comparator.compare(key, tree.getKey()); 79 mutate(comparator, mutationRule, tree.childOrNull(side), key); 40 seek( Comparator<? super K> comparator, @Nullable N tree, @Nullable K key) argument 68 mutate( Comparator<? super K> comparator, BstMutationRule<K, N> mutationRule, @Nullable N tree, @Nullable K key) argument
|
H A D | EmptyImmutableSortedMultiset.java | 29 EmptyImmutableSortedMultiset(Comparator<? super E> comparator) { argument 30 super(comparator); 55 return ImmutableSortedSet.emptySet(comparator());
|
H A D | ForwardingSortedMap.java | 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(); 98 if (comparator == null) { 101 return ((Comparator<Object>) comparator).compare(k1, k2);
|
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 | 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 | SortedLists.java | 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); 116 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { 117 return LAST_PRESENT.resultIndex(comparator, key, list, foundIndex) + 1; 127 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { 128 return FIRST_PRESENT.resultIndex(comparator, ke 131 resultIndex( Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) argument 255 binarySearch(List<? extends E> list, @Nullable E key, Comparator<? super E> comparator, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument [all...] |
H A D | SortedMultiset.java | 46 * Returns the comparator that orders this multiset, or 49 Comparator<? super E> comparator(); method in interface:SortedMultiset 84 * multiset's comparator.
|
H A D | EmptyImmutableSortedSet.java | 36 EmptyImmutableSortedSet(Comparator<? super E> comparator) { argument 37 super(comparator);
|
H A D | GeneralRange.java | 32 * {@link Range}, this allows the use of an arbitrary comparator. This is designed for use in the 57 * Returns the whole range relative to the specified comparator. 59 static <T> GeneralRange<T> all(Comparator<? super T> comparator) { argument 60 return new GeneralRange<T>(comparator, false, null, OPEN, false, null, OPEN); 64 * Returns everything above the endpoint relative to the specified comparator, with the specified 67 static <T> GeneralRange<T> downTo(Comparator<? super T> comparator, @Nullable T endpoint, argument 69 return new GeneralRange<T>(comparator, true, endpoint, boundType, false, null, OPEN); 73 * Returns everything below the endpoint relative to the specified comparator, with the specified 76 static <T> GeneralRange<T> upTo(Comparator<? super T> comparator, @Nullable T endpoint, argument 78 return new GeneralRange<T>(comparator, fals 85 range(Comparator<? super T> comparator, @Nullable T lower, BoundType lowerType, @Nullable T upper, BoundType upperType) argument 90 private final Comparator<? super T> comparator; field in class:GeneralRange 100 GeneralRange(Comparator<? super T> comparator, boolean hasLowerBound, @Nullable T lowerEndpoint, BoundType lowerBoundType, boolean hasUpperBound, @Nullable T upperEndpoint, BoundType upperBoundType) argument 128 Comparator<? super T> comparator() { method in class:GeneralRange [all...] |
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 | 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 | SortedMaps.java | 153 * Computes the difference between two sorted maps, using the comparator of 160 * the right map must all compare as distinct according to the comparator 177 * Returns the specified comparator if not null; otherwise returns {@code 183 @Nullable Comparator<? super E> comparator) { 184 if (comparator != null) { // can't use ? : because of javac bug 5080917 185 return comparator; 339 @Override public Comparator<? super K> comparator() { method in class:SortedMaps.FilteredSortedMap 340 return sortedMap().comparator(); 182 orNaturalOrder( @ullable Comparator<? super E> comparator) argument
|
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 | StandardRowSortedTable.java | 32 * sorted by their natural ordering or by a supplied comparator. Note that 81 public Comparator<? super R> comparator() { method in class:StandardRowSortedTable.RowKeySortedSet 82 return sortedBackingMap().comparator(); 134 public Comparator<? super R> comparator() { method in class:StandardRowSortedTable.RowSortedMap 135 return sortedBackingMap().comparator();
|
/external/junit/src/org/junit/runner/ |
H A D | Request.java | 137 * <code>comparator</code> 155 * @param comparator definition of the order of the tests in this Request 158 public Request sortWith(Comparator<Description> comparator) { argument 159 return new SortingRequest(this, comparator);
|
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/mdat/ |
H A D | DummyMap.java | 21 public Comparator<? super K> comparator() { method in class:DummyMap
|
/external/smali/util/src/main/java/org/jf/util/ |
H A D | CollectionUtils.java | 75 public static <T> int compareAsIterable(@Nonnull Comparator<? super T> comparator, argument 86 int res = comparator.compare(element1, element2); 141 Comparator<?> comparator = sortedSet.comparator(); 142 return (comparator == null) || comparator.equals(Ordering.natural()); 151 Comparator<?> comparator = sortedSet.comparator(); 152 if (comparator == null) { 155 return elementComparator.equals(comparator); [all...] |
/external/chromium_org/cc/test/ |
H A D | pixel_test.cc | 45 const PixelComparator& comparator) { 49 comparator); 56 const PixelComparator& comparator) { 82 return PixelsMatchReference(ref_file, comparator); 93 const PixelComparator& comparator) { 107 *result_bitmap_, test_data_dir.Append(ref_file), comparator); 43 RunPixelTest(RenderPassList* pass_list, const base::FilePath& ref_file, const PixelComparator& comparator) argument 52 RunPixelTestWithReadbackTarget( RenderPassList* pass_list, RenderPass* target, const base::FilePath& ref_file, const PixelComparator& comparator) argument 92 PixelsMatchReference(const base::FilePath& ref_file, const PixelComparator& comparator) argument
|
/external/chromium_org/content/browser/indexed_db/leveldb/ |
H A D | leveldb_transaction.h | 58 explicit Comparator(const LevelDBComparator* comparator) argument 59 : comparator_(comparator) {}
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
H A D | CanvasReplayStateView.js | 240 function comparator(arg1, arg2) function 246 collectedResources.sort(comparator); 343 function comparator(d1, d2) 360 descriptors.sort(comparator);
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | merger.cc | 7 #include "leveldb/comparator.h" 16 MergingIterator(const Comparator* comparator, Iterator** children, int n) argument 17 : comparator_(comparator),
|