- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 10 for probability (0.29 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
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) -
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) -
RELEASE.md
you will have to set custom session_options in your `RunConfig`. * Moved Distributions and Bijectors from `tf.contrib.distributions` to [Tensorflow Probability (TFP)](https://github.com/tensorflow/probability). `tf.contrib.distributions` is now deprecated and will be removed by the end of 2018. * Adding new endpoints for existing tensorflow symbols. These endpoints areCreated: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Mar 30 18:31:38 GMT 2026 - 746.5K bytes - Click Count (3) -
lib/fips140/v1.26.0.zip
prime by retrying the whole process, since 65537 is // probably only a factor of one of p-1 or q-1, but the probability // of this check failing is only 1/65537, so it doesn't matter. continue } if e.ExpandFor(λ).Mul(d, λ).IsOne() == 0 { return nil, errors.New("rsa: internal error: e*d != 1 mod λ(N)") } // FIPS 186-5, A.1.1(3) requires checking that d > 2^(nlen / 2). // // The probability of this check failing when d is derived from // (e, p, q) is roughly // // 2^(nlen/2) / 2^nlen = 2^(-nlen/2)...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
doc/go_spec.html
</p> <pre class="grammar"> uint either 32 or 64 bits int same size as uint uintptr an unsigned integer large enough to store the uninterpreted bits of a pointer value </pre> <p> To avoid portability issues all numeric types are <a href="#Types">named types</a> and thus distinct except <code>byte</code>, which is an <a href="#Alias_declarations">alias</a> for <code>uint8</code>, and
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Wed Apr 01 23:39:18 GMT 2026 - 287.8K bytes - Click Count (1)