- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 171 for Light (0.14 sec)
-
android/guava/src/com/google/common/collect/Comparators.java
* comparator utilities, see either {@code Comparator} itself (for Java 8+), or {@code * com.google.common.collect.Ordering} (otherwise). * * <h3>Relationship to {@code Ordering}</h3> * * <p>In light of the significant enhancements to {@code Comparator} in Java 8, the overwhelming * majority of usages of {@code Ordering} can be written using only built-in JDK APIs. This class is
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) -
guava/src/com/google/common/collect/Comparators.java
* comparator utilities, see either {@code Comparator} itself (for Java 8+), or {@code * com.google.common.collect.Ordering} (otherwise). * * <h3>Relationship to {@code Ordering}</h3> * * <p>In light of the significant enhancements to {@code Comparator} in Java 8, the overwhelming * majority of usages of {@code Ordering} can be written using only built-in JDK APIs. This class is
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 10.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
* randomly ordered data (the probability decreases faster than exponentially in N), but if you are * passing in unsanitized user data then a malicious user could force it. A light shuffle of the * data using an unpredictable seed should normally be enough to thwart this attack. * * <p>The time taken to compute multiple quantiles on the same dataset using {@link Scale#indexes
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) -
guava/src/com/google/common/collect/ComparisonChain.java
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/TreeMultiset.java
successor(pred(), succ()); if (left == null) { return right; } else if (right == null) { return left; } else if (left.height >= right.height) { AvlNode<E> newTop = pred(); // newTop is the maximum node in my left subtree newTop.left = left.removeMax(newTop); newTop.right = right; newTop.distinctElements = distinctElements - 1;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* known-non-null type? But that particular problem might not arise here, since we're not * actually reading from the fields in any case in which they might be null (as proven by the * requireNonNull checks below). Plus, we're *already* lying here, since newHeader passes a null * key and value, which we pass to the superconstructor, even though the key and value type for
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
// // 1. What about leaving/unlocking? Are you going to do // guard.enter() paired with monitor.leave()? That might get // confusing. It's nice for the finally block to look as close as // possible to the thing right before the try. You could have // guard.leave(), but that's a little odd as well because the // guard doesn't have anything to do with leaving. You can't
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableSortedMapTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 28.1K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/MapInterfaceTest.java
if (supportsRemove) { // We use a copy of "entryToRemove" in the assertion because "entryToRemove" might be // invalidated and have undefined behavior after entrySet.removeAll(entriesToRemove), // for example entryToRemove.getValue() might be null. Entry<K, V> entryToRemoveCopy = Helpers.mapEntry(entryToRemove.getKey(), entryToRemove.getValue());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 45.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
for (int i = 0; i < numInsertions * 2; i += 2) { bf.put(Integer.toString(i)); } assertApproximateElementCountGuess(bf, numInsertions); // Assert that the BF "might" have all of the even numbers. for (int i = 0; i < numInsertions * 2; i += 2) { assertTrue(bf.mightContain(Integer.toString(i))); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0)