/external/guava/guava/src/com/google/common/collect/ |
H A D | SortedIterable.java | 34 Comparator<? super T> comparator(); method in interface:SortedIterable 38 * nondecreasing order according to the associated {@link #comparator}.
|
H A D | SortedIterables.java | 35 * 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 D | ComparatorOrdering.java | 28 /** 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 D | ImmutableSortedAsList.java | 44 @Override public Comparator<? super E> comparator() { method in class:ImmutableSortedAsList 45 return delegateCollection().comparator(); 58 // The equals() check is needed when the comparator isn't compatible with 83 super.subListUnchecked(fromIndex, toIndex), comparator())
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | EmptyImmutableSortedSet.java | 27 EmptyImmutableSortedSet(Comparator<? super E> comparator) { argument 28 super(Sets.newTreeSet(comparator));
|
H A D | RegularImmutableSortedMap.java | 28 RegularImmutableSortedMap(SortedMap<K, V> delegate, Comparator<? super K> comparator) { argument 29 super(delegate, comparator);
|
H A D | EmptyImmutableSortedMap.java | 28 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 D | ImmutableSortedAsList.java | 41 @Override public Comparator<? super E> comparator() { method in class:ImmutableSortedAsList 42 return delegateCollection().comparator();
|
/external/junit/src/org/junit/internal/requests/ |
H A D | SortingRequest.java | 14 public SortingRequest(Request request, Comparator<Description> comparator) { argument 16 fComparator= comparator;
|
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | Sorter.java | 22 public abstract void sort(Type[] array, int count, Comparator<Type> comparator); argument
|
H A D | StandardSorter.java | 25 public void sort(Object[] array, int count, Comparator comparator) { argument 26 Arrays.sort(array, 0, count, comparator);
|
H A D | QuickSorter.java | 22 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 D | ShellSorter.java | 30 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/smali/util/src/main/java/org/jf/util/ |
H A D | LinearSearch.java | 42 * @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);
|
H A D | ImmutableConverter.java | 111 public ImmutableSortedSet<ImmutableItem> toSortedSet(@Nonnull Comparator<? super ImmutableItem> comparator, argument 119 ((ImmutableSortedSet)iterable).comparator().equals(comparator)) { 137 return ImmutableSortedSet.copyOf(comparator, new Iterator<ImmutableItem>() { 145 public SortedSet<ImmutableItem> toSortedSet(@Nonnull Comparator<? super ImmutableItem> comparator, argument 158 return ArraySortedSet.of(comparator, newItems);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
H A D | MultiDirectional.java | 61 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...] |
H A D | NelderMead.java | 74 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...] |
/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/easymock/src/org/easymock/internal/matchers/ |
H A D | Compare.java | 30 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/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | IterableComparator.java | 19 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; 53 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 D | IterableComparator.java | 17 private final Comparator<T> comparator; field in class:IterableComparator 24 public IterableComparator(Comparator<T> comparator) { argument 25 this(comparator, true); 28 public IterableComparator(Comparator<T> comparator, boolean shorterFirst) { argument 29 this.comparator = comparator; 51 int result = comparator != null ? comparator.compare(aItem, bItem) : ((Comparable<T>)aItem).compareTo(bItem);
|
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/ |
H A D | TableItemComparator.java | 23 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/org/junit/runner/manipulation/ |
H A D | Sorter.java | 24 * Creates a <code>Sorter</code> that uses <code>comparator</code> 26 * @param comparator the {@link Comparator} to use when sorting tests 28 public Sorter(Comparator<Description> comparator) { argument 29 fComparator= comparator; 33 * Sorts the test in <code>runner</code> using <code>comparator</code>
|
/external/apache-harmony/beans/src/test/java/org/apache/harmony/beans/tests/java/beans/ |
H A D | PropertyChangeEventTest.java | 144 // comparator for PropertyChangeEvent objects 145 public static final SerializableAssert comparator = new SerializableAssert() { field in class:PropertyChangeEventTest 167 "myPropName", "oldValue", "newValue"), comparator); 177 "myPropName", "oldValue", "newValue"), comparator);
|
/external/doclava/src/com/google/doclava/ |
H A D | AttributeInfo.java | 25 public static final Comparator<AttributeInfo> comparator = new Comparator<AttributeInfo>() { field in class:AttributeInfo
|