- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 13 for probability (0.2 seconds)
-
android/guava/src/com/google/common/hash/BloomFilter.java
* href="http://llimllib.github.io/bloomfilter-tutorial/">tutorial</a> may help you understand how * they work. * * <p>The false positive probability ({@code FPP}) of a Bloom filter is defined as the probability * that {@linkplain #mightContain(Object)} will erroneously return {@code true} for an object that * has not actually been put in the {@code BloomFilter}. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 10 22:28:12 GMT 2026 - 27.6K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
+ count + " trials."); } } } } /** * Test for avalanche. Avalanche means that output bits differ with roughly 1/2 probability on * different input keys. This test verifies that each possible 1-bit key delta achieves avalanche. * * <p>For more information: http://burtleburtle.net/bob/hash/avalanche.html */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 25.6K bytes - Click Count (0) -
guava/src/com/google/common/collect/ImmutableSet.java
* determined experimentally to match our desired probability of false positives. */ // NB: yes, this is surprisingly high, but that's what the experiments said was necessary // Raising this number slows the worst-case contains behavior, speeds up hashFloodingDetected, // and reduces the false-positive probability. static final int MAX_RUN_MULTIPLIER = 13; /**Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Nov 07 16:09:47 GMT 2025 - 35.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/RegularImmutableMultiset.java
* saving space. */ @VisibleForTesting static final double MAX_LOAD_FACTOR = 1.0; /** * Maximum allowed false positive probability of detecting a hash flooding attack given random * input. */ @VisibleForTesting static final double HASH_FLOODING_FPP = 0.001; /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:08:09 GMT 2025 - 6.8K bytes - Click Count (0) -
guava-tests/test/com/google/common/collect/ImmutableSetTest.java
.addEqualityGroup(ImmutableSet.of(1, 2, 1), ImmutableSet.of(2, 1, 1)) .testEquals(); } /** * The maximum allowed probability of falsely detecting a hash flooding attack if the input is * randomly generated. */ private static final double HASH_FLOODING_FPP = 0.001;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 14.2K bytes - Click Count (0) -
guava/src/com/google/common/collect/RegularImmutableMap.java
* saving space. */ @VisibleForTesting static final double MAX_LOAD_FACTOR = 1.2; /** * Maximum allowed false positive probability of detecting a hash flooding attack given random * input. */ @VisibleForTesting static final double HASH_FLOODING_FPP = 0.001; /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:08:09 GMT 2025 - 15.7K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractScheduledServiceTest.java
@SuppressWarnings("ThreadPriorityCheck") // doing our best to test for races protected Schedule getNextSchedule() throws Exception { // Explicitly yield to increase the probability of a pathological scheduling. Thread.yield(); return new Schedule(0, SECONDS); } }; } }; service.useBarriers = false;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 22.8K bytes - Click Count (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractScheduledServiceTest.java
@SuppressWarnings("ThreadPriorityCheck") // doing our best to test for races protected Schedule getNextSchedule() throws Exception { // Explicitly yield to increase the probability of a pathological scheduling. Thread.yield(); return new Schedule(0, SECONDS); } }; } }; service.useBarriers = false;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 22.8K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
// 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! assertThat(bloomFilter.expectedFpp()).isLessThan(safetyFalsePositiveRate); } while (stopwatch.elapsed(SECONDS) < 1); };
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Mar 19 18:53:45 GMT 2026 - 23K bytes - Click Count (0) -
android/guava/src/com/google/common/math/Quantiles.java
* <p>The average time complexity of the computation is O(N) in the size of the dataset. There is a * worst case time complexity of O(N^2). You are extremely unlikely to hit this quadratic case on * 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
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 30.1K bytes - Click Count (0)