Upgraded Guava to unmodified jdk-backport-v14.0.1-post

This simply copies the Guava source for jdk5-backport-v14.0.1
straight from the code.google.com repository into this one.

See https://code.google.com/p/guava-libraries.jdk5backport/

Additional commits will be made which will allow this to compile
on Android.

Change-Id: I4f02d6182d25e4e636ac64d48647a395a9874296

1 files changed, 103 insertions, 0 deletions

diff --git a/guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java b/guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java
new file mode 100644
index 0000000..9f439b4
--- /dev/null
+++ b/guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java
@@ -0,0 +1,103 @@
+/*
+ * Copyright (C) 2011 The Guava Authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package com.google.common.math;
+
+import static com.google.common.math.MathBenchmarking.ARRAY_MASK;
+import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
+import static com.google.common.math.MathBenchmarking.RANDOM_SOURCE;
+import static com.google.common.math.MathBenchmarking.randomExponent;
+import static com.google.common.math.MathBenchmarking.randomNonNegativeBigInteger;
+import static com.google.common.math.MathBenchmarking.randomPositiveBigInteger;
+
+import com.google.caliper.Runner;
+import com.google.caliper.SimpleBenchmark;
+import com.google.common.math.IntMath;
+
+/**
+ * Benchmarks for the non-rounding methods of {@code IntMath}.
+ *
+ * @author Louis Wasserman
+ */
+public class IntMathBenchmark extends SimpleBenchmark {
+  private static int[] exponent = new int[ARRAY_SIZE];
+  private static int[] factorial = new int[ARRAY_SIZE];
+  private static int[] binomial = new int[ARRAY_SIZE];
+  private static final int[] positive = new int[ARRAY_SIZE];
+  private static final int[] nonnegative = new int[ARRAY_SIZE];
+  private static final int[] ints = new int[ARRAY_SIZE];
+
+  @Override
+  protected void setUp() {
+    for (int i = 0; i < ARRAY_SIZE; i++) {
+      exponent[i] = randomExponent();
+      factorial[i] = RANDOM_SOURCE.nextInt(50);
+      binomial[i] = RANDOM_SOURCE.nextInt(factorial[i] + 1);
+      positive[i] = randomPositiveBigInteger(Integer.SIZE - 2).intValue();
+      nonnegative[i] = randomNonNegativeBigInteger(Integer.SIZE - 2).intValue();
+      ints[i] = RANDOM_SOURCE.nextInt();
+    }
+  }
+
+  public int timePow(int reps) {
+    int tmp = 0;
+    for (int i = 0; i < reps; i++) {
+      int j = i & ARRAY_MASK;
+      tmp += IntMath.pow(positive[j], exponent[j]);
+    }
+    return tmp;
+  }
+
+  public int timeMod(int reps) {
+    int tmp = 0;
+    for (int i = 0; i < reps; i++) {
+      int j = i & ARRAY_MASK;
+      tmp += IntMath.mod(ints[j], positive[j]);
+    }
+    return tmp;
+  }
+
+  public int timeGCD(int reps) {
+    int tmp = 0;
+    for (int i = 0; i < reps; i++) {
+      int j = i & ARRAY_MASK;
+      tmp += IntMath.gcd(nonnegative[j], positive[j]);
+    }
+    return tmp;
+  }
+
+  public int timeFactorial(int reps){
+    int tmp = 0;
+    for (int i = 0; i < reps; i++) {
+      int j = i & ARRAY_MASK;
+      tmp += IntMath.factorial(factorial[j]);
+    }
+    return tmp;
+  }
+
+  public int timeBinomial(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;
+  }
+  
+  public static void main(String[] args) {
+    Runner.main(IntMathBenchmark.class, args);
+  }
+}