- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for compact (0.34 sec)
-
android/guava/src/com/google/common/base/Preconditions.java
* if (value < 0) { * throw new IllegalArgumentException("input is negative: " + value); * } * // calculate square root * } * }</pre> * * <p>to be replaced with the more compact * * <pre>{@code * public static double sqrt(double value) { * checkArgument(value >= 0, "input is negative: %s", value); * // calculate square root * } * }</pre> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0) -
guava/src/com/google/common/base/Preconditions.java
* if (value < 0) { * throw new IllegalArgumentException("input is negative: " + value); * } * // calculate square root * } * }</pre> * * <p>to be replaced with the more compact * * <pre>{@code * public static double sqrt(double value) { * checkArgument(value >= 0, "input is negative: %s", value); * // calculate square root * } * }</pre> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Feb 14 15:46:55 GMT 2024 - 52.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
WEAK { @Override Equivalence<Object> defaultEquivalence() { return Equivalence.identity(); } }; /** * Returns the default equivalence strategy used to compare and hash keys or values referenced * at this strength. This strategy will be used unless the user explicitly specifies an * alternate strategy. */ abstract Equivalence<Object> defaultEquivalence(); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
if (set.comparator() != null && set.comparator() != Ordering.natural() && range.hasLowerBound() && range.hasUpperBound()) { checkArgument( set.comparator().compare(range.lowerEndpoint(), range.upperEndpoint()) <= 0, "set is using a custom comparator which is inconsistent with the natural ordering."); } if (range.hasLowerBound() && range.hasUpperBound()) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
* Comparator} or {@link Comparable} type whose comparison behavior is <i>inconsistent with * equals</i>. That is, {@code a.compareTo(b)} or {@code comparator.compare(a, b)} should equal zero * <i>if and only if</i> {@code a.equals(b)}. If this advice is not followed, the resulting map will * not correctly obey its specification. * * <p>See the Guava User Guide article on <a href=
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) -
guava/src/com/google/common/collect/ImmutableSortedMap.java
* Comparator} or {@link Comparable} type whose comparison behavior is <i>inconsistent with * equals</i>. That is, {@code a.compareTo(b)} or {@code comparator.compare(a, b)} should equal zero * <i>if and only if</i> {@code a.equals(b)}. If this advice is not followed, the resulting map will * not correctly obey its specification. * * <p>See the Guava User Guide article on <a href=
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 50.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
// to be sorted based on the top of each iterator. Comparator<PeekingIterator<T>> heapComparator = (PeekingIterator<T> o1, PeekingIterator<T> o2) -> itemComparator.compare(o1.peek(), o2.peek()); queue = new PriorityQueue<>(2, heapComparator); for (Iterator<? extends T> iterator : iterators) { if (iterator.hasNext()) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Jan 30 00:14:39 GMT 2024 - 50.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
// to be sorted based on the top of each iterator. Comparator<PeekingIterator<T>> heapComparator = (PeekingIterator<T> o1, PeekingIterator<T> o2) -> itemComparator.compare(o1.peek(), o2.peek()); queue = new PriorityQueue<>(2, heapComparator); for (Iterator<? extends T> iterator : iterators) { if (iterator.hasNext()) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Apr 30 18:43:01 GMT 2024 - 51.1K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultModelValidator.java
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu May 02 13:13:07 GMT 2024 - 73.1K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheBuilder.java
* higher value than you need can waste space and time, and a significantly lower value can lead * to thread contention. But overestimates and underestimates within an order of magnitude do not * usually have much noticeable impact. A value of one permits only one thread to modify the cache * at a time, but since read operations and cache loading computations can proceed concurrently, * this still yields higher concurrency than full synchronization.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 51.3K bytes - Viewed (0)