- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 61 for Odivide (0.19 sec)
-
guava-tests/test/com/google/common/primitives/UnsignedIntegerTest.java
if (b != 0) { UnsignedInteger aUnsigned = UnsignedInteger.fromIntBits(a); UnsignedInteger bUnsigned = UnsignedInteger.fromIntBits(b); int expected = aUnsigned.bigIntegerValue().divide(bUnsigned.bigIntegerValue()).intValue(); UnsignedInteger unsignedDiv = aUnsigned.dividedBy(bUnsigned); assertThat(unsignedDiv.intValue()).isEqualTo(expected); } } } }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Jun 01 09:32:35 GMT 2023 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/AbstractStreamingHasher.java
int bytesToCopy = bufferSize - buffer.position(); for (int i = 0; i < bytesToCopy; i++) { buffer.put(readBuffer.get()); } munch(); // buffer becomes empty here, since chunkSize divides bufferSize // Now process directly from the rest of the input buffer while (readBuffer.remaining() >= chunkSize) { process(readBuffer); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
a >>= aTwos; // divide out all 2s 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.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/LongMathRoundingBenchmark.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/BigDecimalMathTest.java
new RoundToDoubleTester(BigDecimal.ZERO).setExpectation(0.0, values()).test(); } public void testRoundToDouble_oneThird() { new RoundToDoubleTester( BigDecimal.ONE.divide(BigDecimal.valueOf(3), new MathContext(50, HALF_EVEN))) .roundUnnecessaryShouldThrow() .setExpectation(0.33333333333333337, UP, CEILING)
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 10.6K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/primitives/UnsignedLongsBenchmark.java
hexStrings[i] = UnsignedLongs.toString(longs[i], 16); prefixedHexStrings[i] = "0x" + hexStrings[i]; } } @Benchmark long divide(int reps) { long tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += UnsignedLongs.divide(longs[j], divisors[j]); } return tmp; } @Benchmark long remainder(int reps) { long tmp = 0;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.3K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
result *= i; } return BigInteger.valueOf(result); } /* * We want each multiplication to have both sides with approximately the same number of digits. * Currently, we just divide the range in half. */ int mid = (n1 + n2) >>> 1; return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2)); } @Benchmark int slowFactorial(int reps) { int tmp = 0;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TablesTransformValuesColumnTest.java
return Tables.transformValues(table, DIVIDE_BY_2); } @Override protected Map<String, Integer> makePopulatedMap() { Table<String, Character, Integer> table = HashBasedTable.create(); table.put("one", 'a', 1); table.put("two", 'a', 2); table.put("three", 'a', 3); table.put("four", 'b', 4); return Tables.transformValues(table, DIVIDE_BY_2).column('a'); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 1.6K bytes - Viewed (0)