- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 16 for gcd (0.14 sec)
-
android/guava-tests/test/com/google/common/math/IntMathTest.java
for (int b : POSITIVE_INTEGER_CANDIDATES) { assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b))); } } } public void testGCDZero() { for (int a : POSITIVE_INTEGER_CANDIDATES) { assertEquals(a, IntMath.gcd(a, 0)); assertEquals(a, IntMath.gcd(0, a)); } assertEquals(0, IntMath.gcd(0, 0)); } public void testGCDNegativePositiveThrows() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
int bTwos = Integer.numberOfTrailingZeros(b); b >>= bTwos; // divide out all 2s while (a != b) { // both a, b are odd // The key to the binary GCD algorithm is as follows: // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b))); } } } @GwtIncompatible // TODO public void testGCDZero() { for (long a : POSITIVE_LONG_CANDIDATES) { assertEquals(a, LongMath.gcd(a, 0)); assertEquals(a, LongMath.gcd(0, a)); } assertEquals(0, LongMath.gcd(0, 0)); } @GwtIncompatible // TODO
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
android/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) -
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) -
docs/distributed/DESIGN.md
1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*. - *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*. In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4...
Plain Text - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Tue Aug 15 23:04:20 GMT 2023 - 8K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/IntMathTest.java
for (int b : POSITIVE_INTEGER_CANDIDATES) { assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b))); } } } public void testGCDZero() { for (int a : POSITIVE_INTEGER_CANDIDATES) { assertEquals(a, IntMath.gcd(a, 0)); assertEquals(a, IntMath.gcd(0, a)); } assertEquals(0, IntMath.gcd(0, 0)); } public void testGCDNegativePositiveThrows() {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 24.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
int bTwos = Long.numberOfTrailingZeros(b); b >>= bTwos; // divide out all 2s while (a != b) { // both a, b are odd // The key to the binary GCD algorithm is as follows: // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b))); } } } @GwtIncompatible // TODO public void testGCDZero() { for (long a : POSITIVE_LONG_CANDIDATES) { assertEquals(a, LongMath.gcd(a, 0)); assertEquals(a, LongMath.gcd(0, a)); } assertEquals(0, LongMath.gcd(0, 0)); } @GwtIncompatible // TODO
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K 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)