- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 306 for have (0.15 sec)
-
guava/src/com/google/common/base/FinalizableReferenceQueue.java
* * <p>Keep a strong reference to this object until all of the associated referents have been * finalized. If this object is garbage collected earlier, the backing thread will not invoke {@code * finalizeReferent()} on the remaining references. * * <p>As an example of how this is used, imagine you have a class {@code MyServer} that creates a
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 13.1K bytes - Viewed (0) -
android/guava/src/com/google/common/base/FinalizableReferenceQueue.java
* * <p>Keep a strong reference to this object until all of the associated referents have been * finalized. If this object is garbage collected earlier, the backing thread will not invoke {@code * finalizeReferent()} on the remaining references. * * <p>As an example of how this is used, imagine you have a class {@code MyServer} that creates a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 13.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/PairedStatsAccumulator.java
public void add(double x, double y) { // We extend the recursive expression for the one-variable case at Art of Computer Programming // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i. // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i. // We also define the sum of the products of the differences from the means
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/StandardTable.java
* - columnIterator.remove() succeeded, so it must have returned a value, so it must have been * initialized by next() -- which initializes rowEntry, too. * * - rowEntry isn't cleared except below. If it was cleared below, then either * columnIterator.remove() would have failed above (if the user hasn't called next() since * then) or rowEntry would have been initialized by next() (as discussed above). */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 29.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableBiMap.java
* safe to do so. The exact circumstances under which a copy will or will not be performed are * undocumented and subject to change. * * @throws IllegalArgumentException if two keys have the same value or two values have the same * key * @throws NullPointerException if any key or value in {@code map} is null */ public static <K, V> ImmutableBiMap<K, V> copyOf(Map<? extends K, ? extends V> map) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Oct 31 16:03:42 GMT 2023 - 22.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheBuilderTest.java
} // All of the seed values should have been visible, so we should have gotten removal // notifications for all of them. for (int i = 0; i < nSeededEntries; i++) { assertEquals("b" + i, removalNotifications.get("b" + i)); } // Each of the values added to the map should either still be there, or have seen a removal // notification.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Oct 03 20:10:02 GMT 2023 - 23.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AtomicLongMap.java
} /** * Removes all mappings from this map whose values are zero. * * <p>This method is not atomic: the map may be visible in intermediate states, where some of the * zero values have been removed and others have not. */ public void removeAllZeros() { Iterator<Entry<K, AtomicLong>> entryIterator = map.entrySet().iterator(); while (entryIterator.hasNext()) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
* An enum representing the state of a node during DFS. {@code PENDING} means that the node is on * the stack of the DFS, while {@code COMPLETE} means that the node and all its successors have * been already explored. Any node that has not been explored will not have a state at all. */ private enum NodeVisitState { PENDING, COMPLETE }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
* large that doing the lookup is noticeably slower than redoing the work would be. * * Ideally we'd have a real eviction policy, but until we see a problem in practice, I hope * that this will suffice. I have not even benchmarked with different size limits. */ if (validClasses.size() > 1000) { validClasses.clear(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 10.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
// test whether the hash values have same output bits same |= ~(hash1 ^ hash2); // test whether the hash values have different output bits diff |= (hash1 ^ hash2); count++; // check whether we've exceeded the probabilistically // likely number of trials to have proven no funneling if (count > maxCount) { Assert.fail(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0)