- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for gcd (0.12 sec)
-
guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.2K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java
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) { return LongMath.gcd(a, b); } @Override public long binomialCoefficient(int n, int k) { return LongMath.binomial(n, k); } @Override
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 6.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java
int mod(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.mod(longs[j], positive[j]); } return tmp; } @Benchmark int gCD(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.mod(nonnegative[j], positive[j]); } return tmp; } @Benchmark
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java
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) { return LongMath.gcd(a, b); } @Override public long binomialCoefficient(int n, int k) { return LongMath.binomial(n, k); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 6.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/LongMathBenchmark.java
int mod(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.mod(longs[j], positive[j]); } return tmp; } @Benchmark int gCD(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += LongMath.mod(nonnegative[j], positive[j]); } return tmp; } @Benchmark
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0)