Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 11 - 20 of 22 for probability (0.14 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. 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)
  2. internal/etag/etag.go

    // in case of SSE-S3. However, storing the ETag of an encrypted
    // object in plaintext may reveal some information about the object.
    // For example, two objects with the same ETag are identical with
    // a very high probability.
    //
    // Therefore, an S3 implementation may encrypt an ETag before storing
    // it. In this case, the stored ETag may not be a well-formed S3 ETag.
    // For example, it can be larger due to a checksum added by authenticated
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri May 16 14:27:42 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/CompactHashSet.java

      public static <E extends @Nullable Object> CompactHashSet<E> createWithExpectedSize(
          int expectedSize) {
        return new CompactHashSet<>(expectedSize);
      }
    
      /**
       * 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: Tue Jul 08 18:32:10 GMT 2025
    - 23.9K bytes
    - Click Count (0)
  4. 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)
  5. cmd/data-scanner.go

    	dataScannerStartDelay            = 1 * time.Minute                  // Time to wait on startup and between cycles.
    
    	healDeleteDangling   = true
    	healObjectSelectProb = 1024 // Overall probability of a file being scanned; one in n.
    )
    
    var (
    	globalHealConfig heal.Config
    
    	// Sleeper values are updated when config is loaded.
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 45.5K bytes
    - Click Count (0)
  6. guava/src/com/google/common/collect/CompactHashSet.java

      public static <E extends @Nullable Object> CompactHashSet<E> createWithExpectedSize(
          int expectedSize) {
        return new CompactHashSet<>(expectedSize);
      }
    
      /**
       * 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: Tue Jul 08 18:32:10 GMT 2025
    - 24.7K bytes
    - Click Count (0)
  7. guava/src/com/google/common/collect/CompactHashMap.java

        return new CompactHashMap<>(expectedSize);
      }
    
      private static final Object NOT_FOUND = new Object();
    
      /**
       * 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: Tue Jul 08 18:32:10 GMT 2025
    - 39.6K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/collect/CompactHashMap.java

        return new CompactHashMap<>(expectedSize);
      }
    
      private static final Object NOT_FOUND = new Object();
    
      /**
       * 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: Sat Aug 09 01:14:59 GMT 2025
    - 35.7K bytes
    - Click Count (0)
  9. 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 are
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Mar 30 18:31:38 GMT 2026
    - 746.5K bytes
    - Click Count (3)
  10. lib/fips140/v1.0.0-c2097c7c.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 Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
Back to Top