Search Options

Results per page
Sort
Preferred Languages
Advance

Results 21 - 30 of 62 for factories (0.12 sec)

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

          tmp += Double.doubleToRawLongBits(DoubleMath.log2(positiveDoubles[j]));
        }
        return tmp;
      }
    
      @Benchmark
      long factorial(int reps) {
        long tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += Double.doubleToRawLongBits(DoubleMath.factorial(factorials[j]));
        }
        return tmp;
      }
    
      @Benchmark
      int isMathematicalInteger(int reps) {
        int tmp = 0;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 2.5K bytes
    - Viewed (0)
  2. android/guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java

     *
     * @author Louis Wasserman
     */
    public class ApacheBenchmark {
      private enum Impl {
        GUAVA {
          @Override
          public double factorialDouble(int n) {
            return DoubleMath.factorial(n);
          }
    
          @Override
          public int gcdInt(int a, int b) {
            return IntMath.gcd(a, b);
          }
    
          @Override
          public long gcdLong(long a, long b) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 6.9K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/BigIntegerMath.java

       * <p>This uses an efficient binary recursive algorithm to compute the factorial with balanced
       * multiplies. It also removes all the 2s from the intermediate products (shifting them back in at
       * the end).
       *
       * @throws IllegalArgumentException if {@code n < 0}
       */
      public static BigInteger factorial(int n) {
        checkNonNegative("n", n);
    
        // If the factorial is small enough, just use LongMath to do it.
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 16 17:21:56 UTC 2024
    - 18.8K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/math/LongMathTest.java

        long expected = 1;
        for (int i = 0; i < LongMath.factorials.length; i++, expected *= i) {
          assertEquals(expected, LongMath.factorials[i]);
        }
        assertThrows(
            ArithmeticException.class,
            () ->
                LongMath.checkedMultiply(
                    LongMath.factorials[LongMath.factorials.length - 1], LongMath.factorials.length));
      }
    
      @GwtIncompatible // TODO
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 15:00:32 UTC 2024
    - 30.6K bytes
    - Viewed (0)
  5. guava/src/com/google/common/math/LongMath.java

       *
       * @throws IllegalArgumentException if {@code n < 0}
       */
      @GwtIncompatible // TODO
      public static long factorial(int n) {
        checkNonNegative("n", n);
        return (n < factorials.length) ? factorials[n] : Long.MAX_VALUE;
      }
    
      static final long[] factorials = {
        1L,
        1L,
        1L * 2,
        1L * 2 * 3,
        1L * 2 * 3 * 4,
        1L * 2 * 3 * 4 * 5,
        1L * 2 * 3 * 4 * 5 * 6,
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/math/LongMath.java

       *
       * @throws IllegalArgumentException if {@code n < 0}
       */
      @GwtIncompatible // TODO
      public static long factorial(int n) {
        checkNonNegative("n", n);
        return (n < factorials.length) ? factorials[n] : Long.MAX_VALUE;
      }
    
      static final long[] factorials = {
        1L,
        1L,
        1L * 2,
        1L * 2 * 3,
        1L * 2 * 3 * 4,
        1L * 2 * 3 * 4 * 5,
        1L * 2 * 3 * 4 * 5 * 6,
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  7. guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java

      }
    
      @Benchmark
      int factorial(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += IntMath.factorial(factorial[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int binomial(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += IntMath.binomial(factorial[j], binomial[j]);
        }
        return tmp;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.2K bytes
    - Viewed (0)
  8. guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

          int j = i & ARRAY_MASK;
          tmp += LongMath.mod(nonnegative[j], positive[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int factorial(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += LongMath.factorial(factorialArguments[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int binomial(int reps) {
        int tmp = 0;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.5K bytes
    - Viewed (0)
  9. android/guava-tests/test/com/google/common/math/DoubleMathTest.java

          double actual = BigIntegerMath.factorial(i).doubleValue();
          double result = DoubleMath.factorial(i);
          assertThat(result).isWithin(Math.ulp(actual)).of(actual);
        }
      }
    
      public void testFactorialTooHigh() {
        assertThat(DoubleMath.factorial(DoubleMath.MAX_FACTORIAL + 1)).isPositiveInfinity();
        assertThat(DoubleMath.factorial(DoubleMath.MAX_FACTORIAL + 20)).isPositiveInfinity();
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 15:00:32 UTC 2024
    - 27.3K bytes
    - Viewed (0)
  10. android/guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java

          int j = i & ARRAY_MASK;
          tmp += LongMath.mod(nonnegative[j], positive[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int factorial(int reps) {
        int tmp = 0;
        for (int i = 0; i < reps; i++) {
          int j = i & ARRAY_MASK;
          tmp += LongMath.factorial(factorialArguments[j]);
        }
        return tmp;
      }
    
      @Benchmark
      int binomial(int reps) {
        int tmp = 0;
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Dec 04 17:37:03 UTC 2017
    - 3.5K bytes
    - Viewed (0)
Back to top