- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 146 for fess (0.12 sec)
-
guava/src/com/google/common/collect/ComparisonChain.java
} ComparisonChain classify(int result) { return (result < 0) ? LESS : (result > 0) ? GREATER : ACTIVE; } @Override public int result() { return 0; } }; private static final ComparisonChain LESS = new InactiveComparisonChain(-1); private static final ComparisonChain GREATER = new InactiveComparisonChain(1);
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Sep 21 17:28:11 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
* until a nonzero result is found; imposes "dictionary order." If the end of one iterable is * reached, but not the other, the shorter iterable is considered to be less than the longer one. * For example, a lexicographical natural ordering over integers considers {@code [] < [1] < [1, * 1] < [1, 2] < [2]}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes * indexes} is generally less than the total time taken to compute each of them separately, and * sometimes much less. For example, on a large enough dataset, computing the 90th and 99th * percentiles together takes about 55% as long as computing them separately. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SettableFuture.java
* task cannot be implemented with {@link ListeningExecutorService}, the various {@link Futures} * utility methods, or {@link ListenableFutureTask}. Those APIs have less opportunity for developer * error. If your needs are more complex than {@code SettableFuture} supports, use {@link * AbstractFuture}, which offers an extensible version of the API. * * @author Sven Mawson
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 2.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* amortized since some operations can trigger a hash table resize. * * <p>This implementation consumes significantly less memory than {@code java.util.LinkedHashSet} or * even {@code java.util.HashSet}, and places considerably less load on the garbage collector. Like * {@code java.util.LinkedHashSet}, it offers insertion-order iteration, with identical behavior. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ReverseNaturalOrdering.java
return NaturalOrdering.INSTANCE.min(iterator); } @Override public <E extends Comparable<?>> E max(Iterable<E> iterable) { return NaturalOrdering.INSTANCE.min(iterable); } // preserving singleton-ness gives equals()/hashCode() for free private Object readResolve() { return INSTANCE; } @Override public String toString() { return "Ordering.natural().reverse()"; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sun Jun 20 14:22:42 GMT 2021 - 2.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/DiscreteDomain.java
@CheckForNull public abstract C next(C value); /** * Returns the unique greatest value of type {@code C} that is less than {@code value}, or {@code * null} if none exists. Inverse operation to {@link #next}. * * @param value any value of type {@code C} * @return the greatest value less than {@code value}, or {@code null} if {@code value} is {@code * minValue()} */ @CheckForNull
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
return CollectCollectors.toImmutableSortedMap( comparator, keyFunction, valueFunction, mergeFunction); } /* * TODO(kevinb): Confirm that ImmutableSortedMap is faster to construct and * uses less memory than TreeMap; then say so in the class Javadoc. */ private static final Comparator<?> NATURAL_ORDER = Ordering.natural(); private static final ImmutableSortedMap<Comparable<?>, Object> NATURAL_EMPTY_MAP =
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultiset.java
* in the other. */ SortedMultiset<E> descendingMultiset(); /** * Returns a view of this multiset restricted to the elements less than {@code upperBound}, * optionally including {@code upperBound} itself. The returned multiset is a view of this * multiset, so changes to one will be reflected in the other. The returned multiset supports all
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0)