Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 2 of 2 for 10000 (0.12 sec)

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

      private static final int[] factorials = new int[ARRAY_SIZE];
      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);
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Dec 04 17:37:03 GMT 2017
    - 3.3K bytes
    - Viewed (0)
  2. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

      private static final int[] factorials = new int[ARRAY_SIZE];
      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);
    Java
    - Registered: Fri Apr 19 12:43:09 GMT 2024
    - Last Modified: Mon Dec 04 17:37:03 GMT 2017
    - 3.3K bytes
    - Viewed (0)
Back to top