- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 27 for probability (0.27 sec)
-
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}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (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 */
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) -
android/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 */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/MathBenchmarking.java
} else { return new BigInteger(digits, RANDOM_SOURCE).setBit(digits); } } /** * Equivalent to calling randomPositiveBigInteger(numBits) and then flipping the sign with 50% * probability. */ static BigInteger randomNonZeroBigInteger(int numBits) { BigInteger result = randomPositiveBigInteger(numBits); return RANDOM_SOURCE.nextBoolean() ? result : result.negate(); } /**
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathBenchmarking.java
} else { return new BigInteger(digits, RANDOM_SOURCE).setBit(digits); } } /** * Equivalent to calling randomPositiveBigInteger(numBits) and then flipping the sign with 50% * probability. */ static BigInteger randomNonZeroBigInteger(int numBits) { BigInteger result = randomPositiveBigInteger(numBits); return RANDOM_SOURCE.nextBoolean() ? result : result.negate(); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* that minimizes the need for remapping as {@code buckets} grows. That is, {@code * consistentHash(h, n)} equals: * * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n} * <li>{@code consistentHash(h, n - 1)}, otherwise (probability {@code 1 - 1/n}) * </ul> * * <p>This method is suitable for the common use case of dividing work among buckets that meet the * following conditions: *
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) -
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; /**
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Striped.java
* striped.get(key1) != striped.get(key2)}; the elements might nevertheless be mapped to the same * lock. The lower the number of stripes, the higher the probability of this happening. * * <p>There are three flavors of this class: {@code Striped<Lock>}, {@code Striped<Semaphore>}, and * {@code Striped<ReadWriteLock>}. For each type, two implementations are offered: {@linkplain
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 10 20:55:18 GMT 2023 - 20.3K bytes - Viewed (1) -
misc/cgo/gmp/gmp.go
a.doinit() b.doinit() C.mpz_gcdext(&d.i[0], &x.i[0], &y.i[0], &a.i[0], &b.i[0]) } // ProbablyPrime performs n Miller-Rabin tests to check whether z is prime. // If it returns true, z is prime with probability 1 - 1/4^n. // If it returns false, z is not prime. func (z *Int) ProbablyPrime(n int) bool { z.doinit() return int(C.mpz_probab_prime_p(&z.i[0], C.int(n))) > 0
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Apr 11 16:34:30 GMT 2022 - 9.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractScheduledServiceTest.java
return new AbstractScheduledService.CustomScheduler() { @Override 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;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 22.5K bytes - Viewed (0)