- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 29 for Todd (0.21 sec)
-
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 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/BigIntegerMathTest.java
for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) { int halfEven = BigIntegerMath.log2(x, HALF_EVEN); // Now figure out what rounding mode we should behave like (it depends if FLOOR was // odd/even). boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0; assertEquals(BigIntegerMath.log2(x, floorWasEven ? HALF_DOWN : HALF_UP), halfEven); } } @GwtIncompatible // TODO
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 28.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/BigIntegerMathTest.java
for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) { int halfEven = BigIntegerMath.log2(x, HALF_EVEN); // Now figure out what rounding mode we should behave like (it depends if FLOOR was // odd/even). boolean floorWasEven = (BigIntegerMath.log2(x, FLOOR) & 1) == 0; assertEquals(BigIntegerMath.log2(x, floorWasEven ? HALF_DOWN : HALF_UP), halfEven); } } @GwtIncompatible // TODO
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 28.2K bytes - Viewed (0) -
src/cmd/asm/internal/asm/testdata/s390x.s
DIVDU R7, R8, R9 // a7a90000b90400b8b98700a7b904009b DIVWU R1, R2 // a7a90000b90400b2b99700a1b904002b DIVWU R1, R2, R3 // a7a90000b90400b2b99700a1b904003b MODD R1, R2 // b90400b2b90d00a1b904002a MODD R1, R2, R3 // b90400b2b90d00a1b904003a MODW R4, R5 // b90400b5b91d00a4b904005a MODW R4, R5, R6 // b90400b5b91d00a4b904006a
Others - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Nov 22 03:55:32 GMT 2023 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/Escapers.java
return (UnicodeEscaper) escaper; } else if (escaper instanceof CharEscaper) { return wrap((CharEscaper) escaper); } // In practice this shouldn't happen because it would be very odd not to // extend either CharEscaper or UnicodeEscaper for non-trivial cases. throw new IllegalArgumentException( "Cannot create a UnicodeEscaper from: " + escaper.getClass().getName()); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 10.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheEvictionTest.java
public void testEviction_maxWeight_zero() { CountingRemovalListener<Integer, Integer> removalListener = countingRemovalListener(); IdentityLoader<Integer> loader = identityLoader(); // Even numbers are free, odd are too expensive Weigher<Integer, Integer> evensOnly = new Weigher<Integer, Integer>() { @Override public int weigh(Integer k, Integer v) { return k % 2; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 14.9K 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 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http2/Http2Reader.kt
* `promisedStreamId` to which response frames will be delivered. Push promise frames are sent * as a part of the response to `streamId`. * * @param streamId client-initiated stream ID. Must be an odd number. * @param promisedStreamId server-initiated stream ID. Must be an even number. * @param requestHeaders minimally includes `:method`, `:scheme`, `:authority`, and `:path`. */
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 19.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/CacheEvictionTest.java
public void testEviction_maxWeight_zero() { CountingRemovalListener<Integer, Integer> removalListener = countingRemovalListener(); IdentityLoader<Integer> loader = identityLoader(); // Even numbers are free, odd are too expensive Weigher<Integer, Integer> evensOnly = new Weigher<Integer, Integer>() { @Override public int weigh(Integer k, Integer v) { return k % 2; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 14.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFuture.java
*/ if (throwable instanceof Error) { /* * TODO(cpovirk): Do we really want to log this if we called setException(throwable) and it * returned true? This was intentional (CL 46470009), but it seems odd compared to how we * normally handle Error. * * Similarly, do we really want to log the same Error more than once? */ log(throwable); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 15.4K bytes - Viewed (0)