- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for Gump (0.13 sec)
-
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
// False negative should *never* happen. assertThat(bloomFilter.mightContain(key)).isTrue(); // If this check ever fails, that means we need to either bump the // number of expected insertions or don't run the test for so long. // Don't forget, the bloom filter slowly saturates over time and the // expected false positive probability goes up!
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) -
android/guava/src/com/google/common/hash/Hashing.java
checkArgument(buckets > 0, "buckets must be positive: %s", buckets); LinearCongruentialGenerator generator = new LinearCongruentialGenerator(input); int candidate = 0; int next; // Jump from bucket to bucket until we go out of range while (true) { next = (int) ((candidate + 1) / generator.nextDouble()); if (next >= 0 && next < buckets) { candidate = next; } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
return false; } // This implementation is patterned after ConcurrentHashMap, but without the locking. The only // way for it to return a false negative would be for the target value to jump around in the map // such that none of the subsequent iterations observed it, despite the fact that at every point // in time it was present somewhere int the map. This becomes increasingly unlikely as
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/util/concurrent/AbstractFuture.java
if (remainingNanos < SPIN_THRESHOLD_NANOS) { // Remove the waiter, one way or another we are done parking this thread. removeWaiter(node); break long_wait_loop; // jump down to the busy wait loop } } } oldHead = waiters; // re-read and loop. } while (oldHead != Waiter.TOMBSTONE); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
return false; } // This implementation is patterned after ConcurrentHashMap, but without the locking. The only // way for it to return a false negative would be for the target value to jump around in the map // such that none of the subsequent iterations observed it, despite the fact that at every point // in time it was present somewhere int the map. This becomes increasingly unlikely as
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* output array, and may, under certain circumstances, be used to save allocation costs. * * <p>Suppose {@code x} is a queue known to contain only strings. The following code can be used * to dump the queue into a newly allocated array of {@code String}: * * <pre> * String[] y = x.toArray(new String[0]);</pre> *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* output array, and may, under certain circumstances, be used to save allocation costs. * * <p>Suppose {@code x} is a queue known to contain only strings. The following code can be used * to dump the queue into a newly allocated array of {@code String}: * * <pre> * String[] y = x.toArray(new String[0]);</pre> *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
// False negative should *never* happen. assertThat(bloomFilter.mightContain(key)).isTrue(); // If this check ever fails, that means we need to either bump the // number of expected insertions or don't run the test for so long. // Don't forget, the bloom filter slowly saturates over time and the // expected false positive probability goes up!
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
* output array, and may, under certain circumstances, be used to save allocation costs. * * <p>Suppose {@code x} is a queue known to contain only strings. The following code can be used * to dump the queue into a newly allocated array of {@code String}: * * <pre> * String[] y = x.toArray(new String[0]);</pre> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LocalCache.java
return false; } // This implementation is patterned after ConcurrentHashMap, but without the locking. The only // way for it to return a false negative would be for the target value to jump around in the map // such that none of the subsequent iterations observed it, despite the fact that at every point // in time it was present somewhere int the map. This becomes increasingly unlikely as
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 144.7K bytes - Viewed (0)