1 /* 2 * Copyright (C) 2011 The Guava Authors 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17 package com.google.common.math; 18 19 import static com.google.common.math.MathBenchmarking.ARRAY_MASK; 20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE; 21 import static com.google.common.math.MathBenchmarking.randomNonZeroBigInteger; 22 import static com.google.common.math.MathBenchmarking.randomPositiveBigInteger; 23 24 import com.google.caliper.BeforeExperiment; 25 import com.google.caliper.Benchmark; 26 import com.google.caliper.Param; 27 import java.math.BigInteger; 28 import java.math.RoundingMode; 29 30 /** 31 * Benchmarks for the rounding methods of {@code BigIntegerMath}. 32 * 33 * @author Louis Wasserman 34 */ 35 public class BigIntegerMathRoundingBenchmark { 36 private static final BigInteger[] nonzero1 = new BigInteger[ARRAY_SIZE]; 37 private static final BigInteger[] nonzero2 = new BigInteger[ARRAY_SIZE]; 38 private static final BigInteger[] positive = new BigInteger[ARRAY_SIZE]; 39 40 @Param({"DOWN", "UP", "FLOOR", "CEILING", "HALF_EVEN", "HALF_UP", "HALF_DOWN"}) 41 RoundingMode mode; 42 43 @BeforeExperiment setUp()44 void setUp() { 45 for (int i = 0; i < ARRAY_SIZE; i++) { 46 positive[i] = randomPositiveBigInteger(1024); 47 nonzero1[i] = randomNonZeroBigInteger(1024); 48 nonzero2[i] = randomNonZeroBigInteger(1024); 49 } 50 } 51 52 @Benchmark log2(int reps)53 int log2(int reps) { 54 int tmp = 0; 55 for (int i = 0; i < reps; i++) { 56 int j = i & ARRAY_MASK; 57 tmp += BigIntegerMath.log2(positive[j], mode); 58 } 59 return tmp; 60 } 61 62 @Benchmark log10(int reps)63 int log10(int reps) { 64 int tmp = 0; 65 for (int i = 0; i < reps; i++) { 66 int j = i & ARRAY_MASK; 67 tmp += BigIntegerMath.log10(positive[j], mode); 68 } 69 return tmp; 70 } 71 72 @Benchmark sqrt(int reps)73 int sqrt(int reps) { 74 int tmp = 0; 75 for (int i = 0; i < reps; i++) { 76 int j = i & ARRAY_MASK; 77 tmp += BigIntegerMath.sqrt(positive[j], mode).intValue(); 78 } 79 return tmp; 80 } 81 82 @Benchmark divide(int reps)83 int divide(int reps) { 84 int tmp = 0; 85 for (int i = 0; i < reps; i++) { 86 int j = i & ARRAY_MASK; 87 tmp += BigIntegerMath.divide(nonzero1[j], nonzero2[j], mode).intValue(); 88 } 89 return tmp; 90 } 91 92 @Benchmark roundToDouble(int reps)93 long roundToDouble(int reps) { 94 long tmp = 0; 95 for (int i = 0; i < reps; i++) { 96 int j = i & ARRAY_MASK; 97 tmp += Double.doubleToRawLongBits(BigIntegerMath.roundToDouble(nonzero1[j], mode)); 98 } 99 return tmp; 100 } 101 } 102