Searched refs:comparator (Results 1 - 25 of 296) sorted by relevance

1234567891011>>

/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/
H A DTableItemComparator.java23 private final Comparator<ICoverageNode> comparator; field in class:TableItemComparator
25 TableItemComparator(final Comparator<ICoverageNode> comparator) { argument
26 this.comparator = comparator;
30 return comparator.compare(i1.getNode(), i2.getNode());
/external/junit/src/main/java/org/junit/runners/
H A DMethodSorters.java32 private final Comparator<Method> comparator; field in class:MethodSorters
34 private MethodSorters(Comparator<Method> comparator) { argument
35 this.comparator = comparator;
39 return comparator;
/external/guava/guava/src/com/google/common/collect/
H A DComparatorOrdering.java28 /** An ordering for a pre-existing comparator. */
31 final Comparator<T> comparator; field in class:ComparatorOrdering
33 ComparatorOrdering(Comparator<T> comparator) { argument
34 this.comparator = checkNotNull(comparator);
38 return comparator.compare(a, b);
47 return this.comparator.equals(that.comparator);
53 return comparator.hashCode();
57 return comparator
[all...]
H A DSortedIterables.java35 * to {@code comparator}.
37 public static boolean hasSameComparator(Comparator<?> comparator, Iterable<?> elements) { argument
38 checkNotNull(comparator);
42 comparator2 = comparator((SortedSet<?>) elements);
44 comparator2 = ((SortedIterable<?>) elements).comparator();
48 return comparator.equals(comparator2);
52 // if sortedSet.comparator() is null, the set must be naturally ordered
53 public static <E> Comparator<? super E> comparator(SortedSet<E> sortedSet) { method in class:SortedIterables
54 Comparator<? super E> result = sortedSet.comparator();
H A DImmutableSortedSet.java41 * Some instances are ordered by an explicit comparator, while others follow the
62 * two elements are equivalent. Instead, with an explicit comparator, the
66 * {(x, y) | comparator.compare(x, y) == 0}}</pre>
109 Comparator<? super E> comparator) {
110 if (NATURAL_ORDER.equals(comparator)) {
113 return new EmptyImmutableSortedSet<E>(comparator);
226 * copy of a {@code SortedSet} that preserves the comparator, call {@link
261 * copy of a {@code SortedSet} that preserves the comparator, call
321 * @throws NullPointerException if {@code comparator} or any of
325 Comparator<? super E> comparator, Iterato
108 emptySet( Comparator<? super E> comparator) argument
324 copyOf( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
342 copyOf( Comparator<? super E> comparator, Iterable<? extends E> elements) argument
378 copyOf( Comparator<? super E> comparator, Collection<? extends E> elements) argument
422 construct( Comparator<? super E> comparator, int n, E... contents) argument
450 orderedBy(Comparator<E> comparator) argument
491 private final Comparator<? super E> comparator; field in class:ImmutableSortedSet.Builder
497 Builder(Comparator<? super E> comparator) argument
572 unsafeCompare( Comparator<?> comparator, Object a, Object b) argument
582 final transient Comparator<? super E> comparator; field in class:ImmutableSortedSet
584 ImmutableSortedSet(Comparator<? super E> comparator) argument
596 public Comparator<? super E> comparator() { method in class:ImmutableSortedSet
811 final Comparator<? super E> comparator; field in class:ImmutableSortedSet.SerializedForm
814 SerializedForm(Comparator<? super E> comparator, Object[] elements) argument
[all...]
H A DGeneralRange.java32 * {@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...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DEmptyImmutableSortedMap.java28 private EmptyImmutableSortedMap(Comparator<? super K> comparator) { argument
29 super(new TreeMap<K, V>(comparator), comparator);
36 static <K, V> ImmutableSortedMap<K, V> forComparator(Comparator<? super K> comparator) { argument
37 if (comparator == NATURAL_ORDER) {
40 return new EmptyImmutableSortedMap<K, V>(comparator);
H A DEmptyImmutableSortedSet.java27 EmptyImmutableSortedSet(Comparator<? super E> comparator) { argument
28 super(Sets.newTreeSet(comparator));
H A DRegularImmutableSortedMap.java28 RegularImmutableSortedMap(SortedMap<K, V> delegate, Comparator<? super K> comparator) { argument
29 super(delegate, comparator);
H A DImmutableSortedSet.java66 Comparator<? super E> comparator) {
67 checkNotNull(comparator);
68 if (NATURAL_ORDER.equals(comparator)) {
71 return new EmptyImmutableSortedSet<E>(comparator);
120 Comparator<? super E> comparator, E... elements) {
124 return emptySet(comparator);
126 SortedSet<E> delegate = new TreeSet<E>(comparator);
153 Comparator<? super E> comparator, Iterable<? extends E> elements) {
154 checkNotNull(comparator);
155 return copyOfInternal(comparator, element
65 emptySet( Comparator<? super E> comparator) argument
119 ofInternal( Comparator<? super E> comparator, E... elements) argument
152 copyOf( Comparator<? super E> comparator, Iterable<? extends E> elements) argument
158 copyOf( Comparator<? super E> comparator, Collection<? extends E> elements) argument
164 copyOf( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
179 copyOfInternal( Comparator<? super E> comparator, Iterable<? extends E> elements, boolean fromSortedSet) argument
200 copyOfInternal( Comparator<? super E> comparator, Iterator<? extends E> elements) argument
215 hasSameComparator( Iterable<?> elements, Comparator<?> comparator) argument
255 ImmutableSortedSet(Comparator<? super E> comparator) argument
264 public Comparator<? super E> comparator() { method in class:ImmutableSortedSet
386 orderedBy(Comparator<E> comparator) argument
399 private final Comparator<? super E> comparator; field in class:ImmutableSortedSet.Builder
401 Builder(Comparator<? super E> comparator) argument
[all...]
H A DImmutableSortedMap.java51 // The comparator used by this map. It's the same as that of sortedDelegate,
52 // except that when sortedDelegate's comparator is null, it points to a
54 // (cpovirk: Is sortedDelegate's comparator really ever null?)
55 // The comparator will likely also differ because of our nullAccepting hack.
57 private final transient Comparator<? super K> comparator; field in class:ImmutableSortedMap
59 ImmutableSortedMap(SortedMap<K, V> delegate, Comparator<? super K> comparator) { argument
61 this.comparator = comparator;
66 Comparator<? super K> comparator,
68 checkNotNull(comparator);
65 create( Comparator<? super K> comparator, Entry<? extends K, ? extends V>... entries) argument
116 copyOf( Map<? extends K, ? extends V> map, Comparator<? super K> comparator) argument
131 copyOfInternal( Map<? extends K, ? extends V> map, Comparator<? super K> comparator) argument
176 orderedBy(Comparator<K> comparator) argument
185 private final Comparator<? super K> comparator; field in class:ImmutableSortedMap.Builder
187 Builder(Comparator<? super K> comparator) argument
234 public Comparator<? super K> comparator() { method in class:ImmutableSortedMap
308 newView( SortedMap<K, V> delegate, Comparator<? super K> comparator) argument
329 newModifiableDelegate(Comparator<? super K> comparator) argument
333 nullAccepting(Comparator<E> comparator) argument
[all...]
/external/junit/src/main/java/org/junit/internal/requests/
H A DSortingRequest.java12 private final Comparator<Description> comparator; field in class:SortingRequest
14 public SortingRequest(Request request, Comparator<Description> comparator) { argument
16 this.comparator = comparator;
22 new Sorter(comparator).apply(runner);
/external/junit/src/main/java/org/junit/runner/manipulation/
H A DSorter.java23 private final Comparator<Description> comparator; field in class:Sorter
26 * Creates a <code>Sorter</code> that uses <code>comparator</code>
29 * @param comparator the {@link Comparator} to use when sorting tests
31 public Sorter(Comparator<Description> comparator) { argument
32 this.comparator = comparator;
36 * Sorts the test in <code>runner</code> using <code>comparator</code>
46 return comparator.compare(o1, o2);
/external/easymock/src/org/easymock/internal/matchers/
H A DCompare.java30 private Comparator<? super T> comparator; field in class:Compare
34 public Compare(T expected, Comparator<? super T> comparator, LogicalOperator result) { argument
36 this.comparator = comparator;
41 buffer.append(comparator + "(" + expected + ") " + operator.getSymbol()
50 return operator.matchResult(comparator.compare((T) actual, expected));
/external/replicaisland/src/com/replica/replicaisland/
H A DQuickSorter.java22 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument
23 quicksort(array, 0, count - 1, comparator);
45 public void quicksort(Type[] a, int left, int right, Comparator<Type> comparator) { argument
47 int i = partition(a, left, right, comparator);
48 quicksort(a, left, i - 1, comparator);
49 quicksort(a, i + 1, right, comparator);
53 private int partition(Type[] a, int left, int right, Comparator<Type> comparator) { argument
57 while (comparator.compare(a[++i], a[right]) < 0) { // find item on left to swap
59 while (comparator.compare(a[right], a[--j]) < 0) { // find item on right to swap
H A DStandardSorter.java25 public void sort(Object[] array, int count, Comparator comparator) { argument
26 Arrays.sort(array, 0, count, comparator);
H A DSorter.java22 public abstract void sort(Type[] array, int count, Comparator<Type> comparator); argument
H A DShellSorter.java30 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument
36 insertionSort(array, count, start, increment, comparator);
44 insertionSort(array, count, 0, 1, comparator );
59 Comparator<Type> comparator) {
67 int delta = comparator.compare(array[j], array[k]);
77 } while ( j != start && comparator.compare(array[k], temp) > 0 );
58 insertionSort(Type[] array, int count, int start, int increment, Comparator<Type> comparator) argument
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DIterableComparator.java21 private final Comparator<T> comparator; field in class:IterableComparator
28 public IterableComparator(Comparator<T> comparator) { argument
29 this(comparator, true);
32 public IterableComparator(Comparator<T> comparator, boolean shorterFirst) { argument
33 this.comparator = comparator;
56 int result = comparator != null ? comparator.compare(aItem, bItem) : ((Comparable<T>)aItem).compareTo(bItem);
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DIterableComparator.java19 private final Comparator<T> comparator; field in class:IterableComparator
26 public IterableComparator(Comparator<T> comparator) { argument
27 this(comparator, true);
30 public IterableComparator(Comparator<T> comparator, boolean shorterFirst) { argument
31 this.comparator = comparator;
54 int result = comparator != null ? comparator.compare(aItem, bItem) : ((Comparable<T>)aItem).compareTo(bItem);
/external/hamcrest/hamcrest-library/src/main/java/org/hamcrest/comparator/
H A DComparatorMatcherBuilder.java1 package org.hamcrest.comparator;
13 private final Comparator<T> comparator; field in class:ComparatorMatcherBuilder
39 public static <T> ComparatorMatcherBuilder<T> comparedBy(Comparator<T> comparator) { argument
40 return new ComparatorMatcherBuilder<T>(comparator, true);
43 private ComparatorMatcherBuilder(Comparator<T> comparator, boolean includeComparatorInDescription) { argument
44 this.comparator = comparator;
53 private final Comparator<T> comparator; field in class:ComparatorMatcherBuilder.ComparatorMatcher
65 private ComparatorMatcher(Comparator<T> comparator, T expected, int minCompare, int maxCompare, boolean includeComparatorInDescription) { argument
66 this.comparator
[all...]
/external/smali/util/src/main/java/org/jf/util/
H A DLinearSearch.java42 * @param comparator The comparator to use
48 public static <T> int linearSearch(List<? extends T> list, Comparator<T> comparator, T key, int initialGuess) { argument
53 int comparison = comparator.compare(list.get(guess), key);
60 comparison = comparator.compare(list.get(guess), key);
73 comparison = comparator.compare(list.get(guess), key);
/external/emma/core/java12/com/vladium/emma/report/
H A DItemComparator.java45 final Comparator comparator = IItemAttribute.Factory.getAttribute (attributeID, unitsID).comparator ();
46 comparators [a >> 1] = attributeIDsWithDir [a + 1] < 0 ? new ReverseComparator (comparator) : comparator;
70 ReverseComparator (final Comparator comparator) argument
72 m_comparator = comparator;
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/
H A DNelderMead.java74 protected void iterateSimplex(final Comparator<RealPointValuePair> comparator) argument
109 if ((comparator.compare(best, reflected) <= 0) &&
110 (comparator.compare(reflected, secondBest) < 0)) {
113 replaceWorstPoint(reflected, comparator);
115 } else if (comparator.compare(reflected, best) < 0) {
124 if (comparator.compare(expanded, reflected) < 0) {
126 replaceWorstPoint(expanded, comparator);
129 replaceWorstPoint(reflected, comparator);
134 if (comparator.compare(reflected, worst) < 0) {
143 if (comparator
[all...]
H A DMultiDirectional.java61 protected void iterateSimplex(final Comparator<RealPointValuePair> comparator) argument
74 final RealPointValuePair reflected = evaluateNewSimplex(original, 1.0, comparator);
75 if (comparator.compare(reflected, best) < 0) {
79 final RealPointValuePair expanded = evaluateNewSimplex(original, khi, comparator);
80 if (comparator.compare(reflected, expanded) <= 0) {
90 final RealPointValuePair contracted = evaluateNewSimplex(original, gamma, comparator);
91 if (comparator.compare(contracted, best) < 0) {
113 * @param comparator comparator to use to sort simplex vertices from best to poorest
120 final Comparator<RealPointValuePair> comparator)
118 evaluateNewSimplex(final RealPointValuePair[] original, final double coeff, final Comparator<RealPointValuePair> comparator) argument
[all...]

Completed in 784 milliseconds

1234567891011>>