| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | ImmutableSortedSet.java | 61 static <E> ImmutableSortedSet<E> emptySet(Comparator<? super E> comparator) { in emptySet() argument
62 checkNotNull(comparator); in emptySet()
63 if (NATURAL_ORDER.equals(comparator)) { in emptySet()
66 return new RegularImmutableSortedSet<E>(new TreeSet<E>(comparator), false); in emptySet()
71 Comparator<? super E> comparator) { in toImmutableSortedSet() argument
72 return CollectCollectors.toImmutableSortedSet(comparator); in toImmutableSortedSet()
117 Comparator<? super E> comparator, E... elements) { in ofInternal() argument
121 return emptySet(comparator); in ofInternal()
123 SortedSet<E> delegate = new TreeSet<E>(comparator); in ofInternal()
149 Comparator<? super E> comparator, Iterable<? extends E> elements) { in copyOf() argument
[all …]
|
| D | ImmutableSortedMap.java | 61 private final transient Comparator<? super K> comparator; field in ImmutableSortedMap
63 ImmutableSortedMap(SortedMap<K, V> delegate, Comparator<? super K> comparator) { in ImmutableSortedMap() argument
65 this.comparator = comparator; in ImmutableSortedMap()
70 Comparator<? super K> comparator, in toImmutableSortedMap() argument
73 return CollectCollectors.toImmutableSortedMap(comparator, keyFunction, valueFunction); in toImmutableSortedMap()
77 Comparator<? super K> comparator, in toImmutableSortedMap() argument
81 checkNotNull(comparator); in toImmutableSortedMap()
87 keyFunction, valueFunction, mergeFunction, () -> new TreeMap<K, V>(comparator)), in toImmutableSortedMap()
137 Map<? extends K, ? extends V> map, Comparator<? super K> comparator) { in copyOf() argument
138 return copyOfInternal(map, checkNotNull(comparator)); in copyOf()
[all …]
|
| /external/hamcrest/hamcrest-library/src/main/java/org/hamcrest/comparator/ |
| D | ComparatorMatcherBuilder.java | 1 package org.hamcrest.comparator;
13 private final Comparator<T> comparator; field in ComparatorMatcherBuilder
39 public static <T> ComparatorMatcherBuilder<T> comparedBy(Comparator<T> comparator) {
40 return new ComparatorMatcherBuilder<T>(comparator, true);
43 …private ComparatorMatcherBuilder(Comparator<T> comparator, boolean includeComparatorInDescription)…
44 this.comparator = comparator;
53 private final Comparator<T> comparator;
65 …private ComparatorMatcher(Comparator<T> comparator, T expected, int minCompare, int maxCompare, bo…
66 this.comparator = comparator;
76 int compare = signum(comparator.compare(actual, expected));
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ImmutableSortedSet.java | 78 Comparator<? super E> comparator) { in toImmutableSortedSet() argument
79 return CollectCollectors.toImmutableSortedSet(comparator); in toImmutableSortedSet()
82 static <E> RegularImmutableSortedSet<E> emptySet(Comparator<? super E> comparator) { in emptySet() argument
83 if (Ordering.natural().equals(comparator)) { in emptySet()
86 return new RegularImmutableSortedSet<E>(ImmutableList.<E>of(), comparator); in emptySet()
273 Comparator<? super E> comparator, Iterator<? extends E> elements) { in copyOf() argument
274 return new Builder<E>(comparator).addAll(elements).build(); in copyOf()
289 Comparator<? super E> comparator, Iterable<? extends E> elements) { in copyOf() argument
290 checkNotNull(comparator); in copyOf()
291 boolean hasSameComparator = SortedIterables.hasSameComparator(comparator, elements); in copyOf()
[all …]
|
| D | GeneralRange.java | 57 static <T> GeneralRange<T> all(Comparator<? super T> comparator) { in all() argument
58 return new GeneralRange<T>(comparator, false, null, OPEN, false, null, OPEN); in all()
66 Comparator<? super T> comparator, @Nullable T endpoint, BoundType boundType) { in downTo() argument
67 return new GeneralRange<T>(comparator, true, endpoint, boundType, false, null, OPEN); in downTo()
75 Comparator<? super T> comparator, @Nullable T endpoint, BoundType boundType) { in upTo() argument
76 return new GeneralRange<T>(comparator, false, null, OPEN, true, endpoint, boundType); in upTo()
84 Comparator<? super T> comparator, in range() argument
89 return new GeneralRange<T>(comparator, true, lower, lowerType, true, upper, upperType); in range()
92 private final Comparator<? super T> comparator; field in GeneralRange
101 Comparator<? super T> comparator, in GeneralRange() argument
[all …]
|
| D | ImmutableSortedMultiset.java | 65 Comparator<? super E> comparator) { in toImmutableSortedMultiset() argument
66 return toImmutableSortedMultiset(comparator, Function.identity(), e -> 1); in toImmutableSortedMultiset()
81 Comparator<? super E> comparator, in toImmutableSortedMultiset() argument
84 checkNotNull(comparator); in toImmutableSortedMultiset()
88 () -> TreeMultiset.create(comparator), in toImmutableSortedMultiset()
95 (Multiset<E> multiset) -> copyOfSortedEntries(comparator, multiset.entrySet())); in toImmutableSortedMultiset() argument
238 Comparator<? super E> comparator, Iterator<? extends E> elements) { in copyOf() argument
239 checkNotNull(comparator); in copyOf()
240 return new Builder<E>(comparator).addAll(elements).build(); in copyOf()
254 Comparator<? super E> comparator, Iterable<? extends E> elements) { in copyOf() argument
[all …]
|
| D | Comparators.java | 65 public static <T, S extends T> Comparator<Iterable<S>> lexicographical(Comparator<T> comparator) { in lexicographical() argument
66 return new LexicographicalOrdering<S>(checkNotNull(comparator)); in lexicographical()
75 public static <T> boolean isInOrder(Iterable<? extends T> iterable, Comparator<T> comparator) { in isInOrder() argument
76 checkNotNull(comparator); in isInOrder()
82 if (comparator.compare(prev, next) > 0) { in isInOrder()
98 Iterable<? extends T> iterable, Comparator<T> comparator) { in isInStrictOrder() argument
99 checkNotNull(comparator); in isInStrictOrder()
105 if (comparator.compare(prev, next) >= 0) { in isInStrictOrder()
134 public static <T> Collector<T, ?, List<T>> least(int k, Comparator<? super T> comparator) { in least() argument
136 checkNotNull(comparator); in least()
[all …]
|
| D | ImmutableSortedMap.java | 76 Comparator<? super K> comparator, in toImmutableSortedMap() argument
79 return CollectCollectors.toImmutableSortedMap(comparator, keyFunction, valueFunction); in toImmutableSortedMap()
94 Comparator<? super K> comparator, in toImmutableSortedMap() argument
98 checkNotNull(comparator); in toImmutableSortedMap()
104 keyFunction, valueFunction, mergeFunction, () -> new TreeMap<K, V>(comparator)), in toImmutableSortedMap()
118 static <K, V> ImmutableSortedMap<K, V> emptyMap(Comparator<? super K> comparator) { in emptyMap() argument
119 if (Ordering.natural().equals(comparator)) { in emptyMap()
123 ImmutableSortedSet.emptySet(comparator), ImmutableList.<V>of()); in emptyMap()
141 private static <K, V> ImmutableSortedMap<K, V> of(Comparator<? super K> comparator, K k1, V v1) { in of() argument
143 new RegularImmutableSortedSet<K>(ImmutableList.of(k1), checkNotNull(comparator)), in of()
[all …]
|
| D | ComparatorOrdering.java | 29 final Comparator<T> comparator; field in ComparatorOrdering
31 ComparatorOrdering(Comparator<T> comparator) { in ComparatorOrdering() argument
32 this.comparator = checkNotNull(comparator); in ComparatorOrdering()
37 return comparator.compare(a, b); in compare()
47 return this.comparator.equals(that.comparator); in equals()
54 return comparator.hashCode(); in hashCode()
59 return comparator.toString(); in toString()
|
| D | TreeMultiset.java | 90 public static <E> TreeMultiset<E> create(@Nullable Comparator<? super E> comparator) { in create() argument
91 return (comparator == null) in create()
93 : new TreeMultiset<E>(comparator); in create()
116 super(range.comparator()); in TreeMultiset()
122 TreeMultiset(Comparator<? super E> comparator) { in TreeMultiset() argument
123 super(comparator); in TreeMultiset()
124 this.range = GeneralRange.all(comparator); in TreeMultiset()
176 int cmp = comparator().compare(range.getLowerEndpoint(), node.elem); in aggregateBelowRange()
199 int cmp = comparator().compare(range.getUpperEndpoint(), node.elem); in aggregateAboveRange()
241 return root.count(comparator(), e); in count()
[all …]
|
| D | SortedLists.java | 52 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
60 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
68 int c = comparator.compare(list.get(middle), key); in resultIndex()
82 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
91 int c = comparator.compare(list.get(middle), key); in resultIndex()
108 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
109 return LAST_PRESENT.resultIndex(comparator, key, list, foundIndex) + 1; in resultIndex()
119 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
120 return FIRST_PRESENT.resultIndex(comparator, key, list, foundIndex) - 1; in resultIndex()
125 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex); in resultIndex() argument
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | GeneralRange.java | 57 static <T> GeneralRange<T> all(Comparator<? super T> comparator) { in all() argument
58 return new GeneralRange<T>(comparator, false, null, OPEN, false, null, OPEN); in all()
66 Comparator<? super T> comparator, @NullableDecl T endpoint, BoundType boundType) { in downTo() argument
67 return new GeneralRange<T>(comparator, true, endpoint, boundType, false, null, OPEN); in downTo()
75 Comparator<? super T> comparator, @NullableDecl T endpoint, BoundType boundType) { in upTo() argument
76 return new GeneralRange<T>(comparator, false, null, OPEN, true, endpoint, boundType); in upTo()
84 Comparator<? super T> comparator, in range() argument
89 return new GeneralRange<T>(comparator, true, lower, lowerType, true, upper, upperType); in range()
92 private final Comparator<? super T> comparator; field in GeneralRange
101 Comparator<? super T> comparator, in GeneralRange() argument
[all …]
|
| D | ImmutableSortedSet.java | 61 static <E> RegularImmutableSortedSet<E> emptySet(Comparator<? super E> comparator) { in emptySet() argument
62 if (Ordering.natural().equals(comparator)) { in emptySet()
65 return new RegularImmutableSortedSet<E>(ImmutableList.<E>of(), comparator); in emptySet()
252 Comparator<? super E> comparator, Iterator<? extends E> elements) { in copyOf() argument
253 return new Builder<E>(comparator).addAll(elements).build(); in copyOf()
268 Comparator<? super E> comparator, Iterable<? extends E> elements) { in copyOf() argument
269 checkNotNull(comparator); in copyOf()
270 boolean hasSameComparator = SortedIterables.hasSameComparator(comparator, elements); in copyOf()
281 return construct(comparator, array.length, array); in copyOf()
300 Comparator<? super E> comparator, Collection<? extends E> elements) { in copyOf() argument
[all …]
|
| D | ImmutableSortedMap.java | 67 static <K, V> ImmutableSortedMap<K, V> emptyMap(Comparator<? super K> comparator) { in emptyMap() argument
68 if (Ordering.natural().equals(comparator)) { in emptyMap()
72 ImmutableSortedSet.emptySet(comparator), ImmutableList.<V>of()); in emptyMap()
90 private static <K, V> ImmutableSortedMap<K, V> of(Comparator<? super K> comparator, K k1, V v1) { in of() argument
92 new RegularImmutableSortedSet<K>(ImmutableList.of(k1), checkNotNull(comparator)), in of()
185 Map<? extends K, ? extends V> map, Comparator<? super K> comparator) { in copyOf() argument
186 return copyOfInternal(map, checkNotNull(comparator)); in copyOf()
221 Comparator<? super K> comparator) { in copyOf() argument
222 return fromEntries(checkNotNull(comparator), false, entries); in copyOf()
237 Comparator<? super K> comparator = map.comparator(); in copyOfSorted() local
[all …]
|
| D | ImmutableSortedMultiset.java | 194 Comparator<? super E> comparator, Iterator<? extends E> elements) { in copyOf() argument
195 checkNotNull(comparator); in copyOf()
196 return new Builder<E>(comparator).addAll(elements).build(); in copyOf()
211 Comparator<? super E> comparator, Iterable<? extends E> elements) { in copyOf() argument
215 if (comparator.equals(multiset.comparator())) { in copyOf()
217 return copyOfSortedEntries(comparator, multiset.entrySet().asList()); in copyOf()
223 return new ImmutableSortedMultiset.Builder<E>(comparator).addAll(elements).build(); in copyOf()
242 sortedMultiset.comparator(), Lists.newArrayList(sortedMultiset.entrySet())); in copyOfSorted()
246 Comparator<? super E> comparator, Collection<Entry<E>> entries) { in copyOfSortedEntries() argument
248 return emptyMultiset(comparator); in copyOfSortedEntries()
[all …]
|
| D | ComparatorOrdering.java | 29 final Comparator<T> comparator; field in ComparatorOrdering
31 ComparatorOrdering(Comparator<T> comparator) { in ComparatorOrdering() argument
32 this.comparator = checkNotNull(comparator); in ComparatorOrdering()
37 return comparator.compare(a, b); in compare()
47 return this.comparator.equals(that.comparator); in equals()
54 return comparator.hashCode(); in hashCode()
59 return comparator.toString(); in toString()
|
| D | Comparators.java | 61 public static <T, S extends T> Comparator<Iterable<S>> lexicographical(Comparator<T> comparator) { in lexicographical() argument
62 return new LexicographicalOrdering<S>(checkNotNull(comparator)); in lexicographical()
70 public static <T> boolean isInOrder(Iterable<? extends T> iterable, Comparator<T> comparator) { in isInOrder() argument
71 checkNotNull(comparator); in isInOrder()
77 if (comparator.compare(prev, next) > 0) { in isInOrder()
92 Iterable<? extends T> iterable, Comparator<T> comparator) { in isInStrictOrder() argument
93 checkNotNull(comparator); in isInStrictOrder()
99 if (comparator.compare(prev, next) >= 0) { in isInStrictOrder()
142 public static <T> T min(@NullableDecl T a, @NullableDecl T b, Comparator<T> comparator) { in min() argument
143 return (comparator.compare(a, b) <= 0) ? a : b; in min()
[all …]
|
| D | TreeMultiset.java | 88 public static <E> TreeMultiset<E> create(@NullableDecl Comparator<? super E> comparator) { in create() argument
89 return (comparator == null) in create()
91 : new TreeMultiset<E>(comparator); in create()
114 super(range.comparator()); in TreeMultiset()
120 TreeMultiset(Comparator<? super E> comparator) { in TreeMultiset() argument
121 super(comparator); in TreeMultiset()
122 this.range = GeneralRange.all(comparator); in TreeMultiset()
174 int cmp = comparator().compare(range.getLowerEndpoint(), node.elem); in aggregateBelowRange()
197 int cmp = comparator().compare(range.getUpperEndpoint(), node.elem); in aggregateAboveRange()
239 return root.count(comparator(), e); in count()
[all …]
|
| D | SortedLists.java | 52 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
60 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
68 int c = comparator.compare(list.get(middle), key); in resultIndex()
82 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
91 int c = comparator.compare(list.get(middle), key); in resultIndex()
108 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
109 return LAST_PRESENT.resultIndex(comparator, key, list, foundIndex) + 1; in resultIndex()
119 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) { in resultIndex() argument
120 return FIRST_PRESENT.resultIndex(comparator, key, list, foundIndex) - 1; in resultIndex()
125 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex); in resultIndex() argument
[all …]
|
| D | TopKSelector.java | 72 public static <T> TopKSelector<T> least(int k, Comparator<? super T> comparator) { in least() argument
73 return new TopKSelector<T>(comparator, k); in least()
93 public static <T> TopKSelector<T> greatest(int k, Comparator<? super T> comparator) { in greatest() argument
94 return new TopKSelector<T>(Ordering.from(comparator).reverse(), k); in greatest()
98 private final Comparator<? super T> comparator; field in TopKSelector
114 private TopKSelector(Comparator<? super T> comparator, int k) { in TopKSelector() argument
115 this.comparator = checkNotNull(comparator, "comparator"); in TopKSelector()
137 if (comparator.compare(elem, threshold) > 0) { in offer()
140 } else if (comparator.compare(elem, threshold) < 0) { in offer()
179 Arrays.sort(buffer, left, right, comparator); in trim()
[all …]
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | ElementOrder.java | 54 private final Comparator<T> comparator; field in ElementOrder
74 private ElementOrder(Type type, @NullableDecl Comparator<T> comparator) { in ElementOrder() argument
76 this.comparator = comparator; in ElementOrder()
77 checkState((type == Type.SORTED) == (comparator != null)); in ElementOrder()
141 public static <S> ElementOrder<S> sorted(Comparator<S> comparator) { in sorted() argument
142 return new ElementOrder<S>(Type.SORTED, checkNotNull(comparator)); in sorted()
155 public Comparator<T> comparator() { in comparator() method in ElementOrder
156 if (comparator != null) { in comparator()
157 return comparator; in comparator()
172 return (type == other.type) && Objects.equal(comparator, other.comparator); in equals()
[all …]
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | ElementOrder.java | 53 private final @Nullable Comparator<T> comparator; field in ElementOrder
73 private ElementOrder(Type type, @Nullable Comparator<T> comparator) { in ElementOrder() argument
75 this.comparator = comparator; in ElementOrder()
76 checkState((type == Type.SORTED) == (comparator != null)); in ElementOrder()
140 public static <S> ElementOrder<S> sorted(Comparator<S> comparator) { in sorted() argument
141 return new ElementOrder<S>(Type.SORTED, checkNotNull(comparator)); in sorted()
154 public Comparator<T> comparator() { in comparator() method in ElementOrder
155 if (comparator != null) { in comparator()
156 return comparator; in comparator()
171 return (type == other.type) && Objects.equal(comparator, other.comparator); in equals()
[all …]
|
| /external/catch2/include/internal/ |
| D | catch_matchers_vector.h | 23 ContainsElementMatcher(T const &comparator) : m_comparator( comparator) {} in ContainsElementMatcher()
44 ContainsMatcher(std::vector<T> const &comparator) : m_comparator( comparator ) {} in ContainsMatcher()
50 for (auto const& comparator : m_comparator) { in match()
53 if (el == comparator) { in match()
74 EqualsMatcher(std::vector<T> const &comparator) : m_comparator( comparator ) {} in EqualsMatcher()
97 ApproxMatcher(std::vector<T> const& comparator) : m_comparator( comparator ) {} in ApproxMatcher()
155 Vector::ContainsMatcher<T> Contains( std::vector<T> const& comparator ) { in Contains() argument
156 return Vector::ContainsMatcher<T>( comparator ); in Contains()
160 Vector::ContainsElementMatcher<T> VectorContains( T const& comparator ) { in VectorContains() argument
161 return Vector::ContainsElementMatcher<T>( comparator ); in VectorContains()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| D | NelderMead.java | 74 protected void iterateSimplex(final Comparator<RealPointValuePair> comparator) in iterateSimplex() argument
109 if ((comparator.compare(best, reflected) <= 0) && in iterateSimplex()
110 (comparator.compare(reflected, secondBest) < 0)) { in iterateSimplex()
113 replaceWorstPoint(reflected, comparator); in iterateSimplex()
115 } else if (comparator.compare(reflected, best) < 0) { in iterateSimplex()
124 if (comparator.compare(expanded, reflected) < 0) { in iterateSimplex()
126 replaceWorstPoint(expanded, comparator); in iterateSimplex()
129 replaceWorstPoint(reflected, comparator); in iterateSimplex()
134 if (comparator.compare(reflected, worst) < 0) { in iterateSimplex()
143 if (comparator.compare(outContracted, reflected) <= 0) { in iterateSimplex()
[all …]
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| D | QuickSorter.java | 22 public void sort(Type[] array, int count, Comparator<Type> comparator) { in sort() argument
23 quicksort(array, 0, count - 1, comparator); in sort()
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { in quicksort() argument
47 int i = partition(a, left, right, comparator); in quicksort()
48 quicksort(a, left, i - 1, comparator); in quicksort()
49 quicksort(a, i + 1, right, comparator); in quicksort()
53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { in partition() argument
57 while (comparator.compare(a[++i], a[right]) < 0) { // find item on left to swap in partition()
59 while (comparator.compare(a[right], a[--j]) < 0) { // find item on right to swap in partition()
|