Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for nextDouble (0.05 sec)

  1. android/guava-tests/test/com/google/common/math/MathBenchmarking.java

       * result is chosen from those possibilities uniformly at random.
       *
       * <p>Zero is treated as having log2 == 0.
       */
      static double randomDouble(int maxExponent) {
        double result = RANDOM_SOURCE.nextDouble();
        result = Math.scalb(result, RANDOM_SOURCE.nextInt(maxExponent + 1));
        return RANDOM_SOURCE.nextBoolean() ? result : -result;
      }
    
      /** Returns a random integer between zero and {@code MAX_EXPONENT}. */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  2. android/guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java

      void setUp() {
        Random rng = new Random();
        for (int i = 0; i < 0x100; i++) {
          datasets[i] = new double[datasetSize];
          for (int j = 0; j < datasetSize; j++) {
            datasets[i][j] = rng.nextDouble();
          }
        }
      }
    
      private double[] dataset(int i) {
        // We must test on a fresh clone of the dataset each time. Doing sorts and quickselects on a
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed May 14 19:40:47 UTC 2025
    - 3.2K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/math/QuantilesAlgorithmTest.java

              .immutableCopy();
    
      private double[] dataset;
    
      @Override
      protected void setUp() {
        dataset = new double[DATASET_SIZE];
        for (int i = 0; i < DATASET_SIZE; i++) {
          dataset[i] = rng.nextDouble();
        }
      }
    
      public void testSingleQuantile_median() {
        double referenceValue = REFERENCE_ALGORITHM.singleQuantile(1, 2, dataset.clone());
        for (QuantilesAlgorithm algorithm : NON_REFERENCE_ALGORITHMS) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Dec 28 01:26:26 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  4. guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

        System.out.println("hit rate: " + hit / req);
      }
    
      // for proper distributions later:
      // import JSci.maths.statistics.ProbabilityDistribution;
      // int key = (int) dist.inverse(random.nextDouble());
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  5. android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java

        System.out.println("hit rate: " + hit / req);
      }
    
      // for proper distributions later:
      // import JSci.maths.statistics.ProbabilityDistribution;
      // int key = (int) dist.inverse(random.nextDouble());
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Dec 19 18:03:30 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  6. guava-tests/test/com/google/common/math/MathBenchmarking.java

       * result is chosen from those possibilities uniformly at random.
       *
       * <p>Zero is treated as having log2 == 0.
       */
      static double randomDouble(int maxExponent) {
        double result = RANDOM_SOURCE.nextDouble();
        result = Math.scalb(result, RANDOM_SOURCE.nextInt(maxExponent + 1));
        return RANDOM_SOURCE.nextBoolean() ? result : -result;
      }
    
      /** Returns a random integer between zero and {@code MAX_EXPONENT}. */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Aug 10 19:54:19 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  7. android/guava-tests/benchmark/com/google/common/math/StatsBenchmark.java

      @BeforeExperiment
      void setUp() {
        Random rng = new Random();
        for (int i = 0; i < 0x100; i++) {
          values[i] = new double[n];
          for (int j = 0; j < n; j++) {
            values[i][j] = rng.nextDouble();
          }
        }
      }
    
      @Benchmark
      int meanAndVariance(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed May 14 19:40:47 UTC 2025
    - 4.7K bytes
    - Viewed (0)
Back to top