Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 1 of 1 for slowFactorials (0.05 seconds)

  1. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      private static final int[] slowFactorials = new int[ARRAY_SIZE];
      private static final int[] binomials = new int[ARRAY_SIZE];
    
      @Param({"50", "1000", "10000"})
      int factorialBound;
    
      @BeforeExperiment
      void setUp() {
        for (int i = 0; i < ARRAY_SIZE; i++) {
          factorials[i] = RANDOM_SOURCE.nextInt(factorialBound);
          slowFactorials[i] = RANDOM_SOURCE.nextInt(factorialBound);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Dec 19 18:03:30 GMT 2024
    - 3.5K bytes
    - Click Count (0)
Back to Top