Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 31 - 40 of 116 for nextInt (0.04 seconds)

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

        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}. */
      static int randomExponent() {
        return RANDOM_SOURCE.nextInt(MAX_EXPONENT + 1);
      }
    
      static double randomPositiveDouble() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Aug 10 19:54:19 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  2. android/guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

            }
          } while (!Impl.GUAVA.noMulOverflow(longsToMul[i][0], longsToMul[i][1]));
    
          int k = binomials[i][1] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials.length);
          binomials[i][0] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials[k] - k) + k;
        }
      }
    
      @Benchmark
      long factorialDouble(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Jul 14 14:44:08 GMT 2025
    - 6.9K bytes
    - Click Count (0)
  3. guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

            }
          } while (!Impl.GUAVA.noMulOverflow(longsToMul[i][0], longsToMul[i][1]));
    
          int k = binomials[i][1] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials.length);
          binomials[i][0] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials[k] - k) + k;
        }
      }
    
      @Benchmark
      long factorialDouble(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Jul 14 14:44:08 GMT 2025
    - 6.9K bytes
    - Click Count (0)
  4. android/guava-tests/test/com/google/common/primitives/ImmutableIntArrayTest.java

            int num = random.nextInt(10);
            for (int i = 0; i < num; i++) {
              list.add(counter.getAndIncrement());
            }
            builder.addAll(iterable(list));
          }
        },
        ADD_STREAM {
          @Override
          void doIt(ImmutableIntArray.Builder builder, AtomicInteger counter) {
            int[] array = new int[random.nextInt(10)];
            for (int i = 0; i < array.length; i++) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Aug 07 16:05:33 GMT 2025
    - 20.2K bytes
    - Click Count (0)
  5. guava-tests/benchmark/com/google/common/math/LessThanBenchmark.java

        constant = new int[SAMPLE_SIZE];
        for (int i = 0; i < SAMPLE_SIZE; i++) {
          xInts[i] = random.nextInt(Integer.MAX_VALUE);
          yInts[i] = random.nextInt(Integer.MAX_VALUE);
          xLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK;
          yLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK;
          constant[i] = random.nextInt();
        }
      }
    
      @Benchmark
      int branchFreeLtIntInlined(int reps) {
        int tmp = 0;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 4.1K bytes
    - Click Count (0)
  6. android/guava-tests/benchmark/com/google/common/math/LessThanBenchmark.java

        constant = new int[SAMPLE_SIZE];
        for (int i = 0; i < SAMPLE_SIZE; i++) {
          xInts[i] = random.nextInt(Integer.MAX_VALUE);
          yInts[i] = random.nextInt(Integer.MAX_VALUE);
          xLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK;
          yLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK;
          constant[i] = random.nextInt();
        }
      }
    
      @Benchmark
      int branchFreeLtIntInlined(int reps) {
        int tmp = 0;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 4.1K bytes
    - Click Count (0)
  7. guava-tests/test/com/google/common/primitives/ImmutableDoubleArrayTest.java

            double num = random.nextInt(10);
            for (int i = 0; i < num; i++) {
              list.add((double) counter.getAndIncrement());
            }
            builder.addAll(iterable(list));
          }
        },
        ADD_STREAM {
          @Override
          void doIt(ImmutableDoubleArray.Builder builder, AtomicInteger counter) {
            double[] array = new double[random.nextInt(10)];
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 12 14:49:24 GMT 2025
    - 21.9K bytes
    - Click Count (0)
  8. android/guava-tests/benchmark/com/google/common/base/AsciiBenchmark.java

        char[] array = Chars.toArray(chars);
        this.testString = new String(array);
      }
    
      private char randomAlpha() {
        return ALPHA.charAt(random.nextInt(ALPHA.length()));
      }
    
      private char randomNonAlpha() {
        return NONALPHA.charAt(random.nextInt(NONALPHA.length()));
      }
    
      @Benchmark
      int asciiStringToUpperCase(int reps) {
        String string = noWorkToDo ? Ascii.toUpperCase(testString) : testString;
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 4.8K bytes
    - Click Count (0)
  9. guava-tests/test/com/google/common/util/concurrent/AtomicLongMapBasherTest.java

                    public Long call() {
                      long threadSum = 0;
                      for (int j = 0; j < getsPerTask; j++) {
                        long delta = random.nextInt(deltaRange);
                        int behavior = random.nextInt(10);
                        switch (behavior) {
                          case 0:
                            map.incrementAndGet(key);
                            threadSum++;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Jul 11 18:52:30 GMT 2025
    - 4.2K bytes
    - Click Count (0)
  10. guava-tests/benchmark/com/google/common/collect/ConcurrentHashMultisetBenchmark.java

        Random random = new Random();
        int nKeys = keys.size();
        long blah = 0;
        for (int i = 0; i < reps; i++) {
          Integer key = keys.get(random.nextInt(nKeys));
          int delta = random.nextInt(5);
          blah += delta;
          multiset.add(key, delta);
        }
        return blah;
      }
    
      private long runAddRemoveSingleThread(int reps) {
        Random random = new Random();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Jul 14 14:44:08 GMT 2025
    - 16.6K bytes
    - Click Count (0)
Back to Top