- Sort Score
- Result 10 results
- Languages All
Results 11 - 16 of 16 for gcd (0.16 sec)
-
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) -
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) -
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) -
cmd/endpoint-ellipses.go
// all the ellipses sizes. func getDivisibleSize(totalSizes []uint64) (result uint64) { gcd := func(x, y uint64) uint64 { for y != 0 { x, y = y, x%y } return x } result = totalSizes[0] for i := 1; i < len(totalSizes); i++ { result = gcd(result, totalSizes[i]) } return result } // isValidSetSize - checks whether given count is a valid set size for erasure coding.
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 11 21:22:47 GMT 2024 - 14.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// moved at that point. Otherwise, we can rotate the cycle a[1], a[1 + d], a[1 + 2d], etc, // then a[2] etc, and so on until we have rotated all elements. There are gcd(d, n) cycles // in all. // (3) "Successive". We can consider that we are exchanging a block of size d (a[0..d-1]) with a // block of size n-d (a[d..n-1]), where in general these blocks have different sizes. If we
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
api/go1.txt
pkg math/big, method (*Int) DivMod(*Int, *Int, *Int) (*Int, *Int) pkg math/big, method (*Int) Exp(*Int, *Int, *Int) *Int pkg math/big, method (*Int) Format(fmt.State, int32) pkg math/big, method (*Int) GCD(*Int, *Int, *Int, *Int) *Int pkg math/big, method (*Int) GobDecode([]uint8) error pkg math/big, method (*Int) GobEncode() ([]uint8, error) pkg math/big, method (*Int) Int64() int64
Plain Text - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Aug 14 18:58:28 GMT 2013 - 1.7M bytes - Viewed (1)