- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for shifty (0.79 sec)
-
android/guava-tests/test/com/google/common/cache/CacheExpirationTest.java
assertEquals(0, removalListener.getCount()); int shift2 = shift1 + 10; loader.setValuePrefix(shift2); // fill with new data - has to live for 20 ms more for (int i = 0; i < 10; i++) { cache.invalidate(keyPrefix + i); assertEquals( "key: " + keyPrefix + i, Integer.valueOf(i + shift2), cache.getUnchecked(keyPrefix + i)); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Aug 05 17:21:46 GMT 2022 - 18.7K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Ascii.java
*/ public static final byte CR = 13; /** * Shift Out: A control character indicating that the code combinations which follow shall be * interpreted as outside of the character set of the standard code table until a Shift In * character is reached. * * @since 8.0 */ public static final byte SO = 14; /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
int remainingPowersOf2 = 32; do { int shift = min(remainingPowersOf2, Long.numberOfLeadingZeros(a)); // shift is either the number of powers of 2 left to multiply a by, or the biggest shift // possible while keeping a in an unsigned long. a = UnsignedLongs.remainder(a << shift, m); remainingPowersOf2 -= shift; } while (remainingPowersOf2 > 0); return a;
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) -
guava-tests/test/com/google/common/cache/CacheExpirationTest.java
assertEquals(0, removalListener.getCount()); int shift2 = shift1 + 10; loader.setValuePrefix(shift2); // fill with new data - has to live for 20 ms more for (int i = 0; i < 10; i++) { cache.invalidate(keyPrefix + i); assertEquals( "key: " + keyPrefix + i, Integer.valueOf(i + shift2), cache.getUnchecked(keyPrefix + i)); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Fri Aug 05 17:21:46 GMT 2022 - 18.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ImmutableSortedMapTest.java
ImmutableMap.of( new IntegerDiv10(3), "three", new IntegerDiv10(20), "twenty", new IntegerDiv10(11), "eleven", new IntegerDiv10(35), "thirty five", new IntegerDiv10(12), "twelve"); try { ImmutableSortedMap.copyOf(original); fail("Expected IllegalArgumentException"); } catch (IllegalArgumentException expected) { }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 28.1K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
* little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get * that least significant nonzero byte. */ int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 18.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
sqrt0 = sqrtApproxWithDoubles(x); } else { int shift = (log2 - DoubleUtils.SIGNIFICAND_BITS) & ~1; // even! /* * We have that x / 2^shift < 2^54. Our initial approximation to sqrtFloor(x) will be * 2^(shift/2) * sqrtApproxWithDoubles(x / 2^shift). */ sqrt0 = sqrtApproxWithDoubles(x.shiftRight(shift)).shiftLeft(shift >> 1); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/base/Ascii.java
*/ public static final byte CR = 13; /** * Shift Out: A control character indicating that the code combinations which follow shall be * interpreted as outside of the character set of the standard code table until a Shift In * character is reached. * * @since 8.0 */ public static final byte SO = 14; /**
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Murmur3_32HashFunction.java
} } long buffer = 0; int shift = 0; for (; i < utf16Length; i++) { char c = input.charAt(i); if (c < 0x80) { buffer |= (long) c << shift; shift += 8; len++; } else if (c < 0x800) { buffer |= charToTwoUtf8Bytes(c) << shift; shift += 16; len += 2;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 11.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedLongs.java
if ((radix & (radix - 1)) == 0) { // Radix is a power of two so we can avoid division. int shift = Integer.numberOfTrailingZeros(radix); int mask = radix - 1; do { buf[--i] = Character.forDigit(((int) x) & mask, radix); x >>>= shift; } while (x != 0); } else { // Separate off the last digit using unsigned division. That will leave
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 17.6K bytes - Viewed (0)