- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 20 for shift (0.17 sec)
-
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/math/DoubleUtils.java
* top SIGNIFICAND_BITS + 1. * * It helps to consider the real number signif = absX * 2^(SIGNIFICAND_BITS - exponent). */ int shift = exponent - SIGNIFICAND_BITS - 1; long twiceSignifFloor = absX.shiftRight(shift).longValue(); long signifFloor = twiceSignifFloor >> 1; signifFloor &= SIGNIFICAND_MASK; // remove the implied bit /*
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 28 15:37:52 GMT 2021 - 5.1K 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) -
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) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
long result = 0; // Due to the way we shift, we can stop iterating once we've run out of data, the rest // of the result already being filled with zeros. // This loop is critical to performance, so please check HashBenchmark if altering it. int limit = Math.min(length, 8); for (int i = 0; i < limit; i++) { // Shift value left while iterating logically through the array.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 9.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) -
android/guava/src/com/google/common/hash/Fingerprint2011.java
* to unsigned arithmetic in all cases except: * * <ul> * <li>comparisons (signed values can be negative) * <li>division (avoided here) * <li>shifting (right shift must be unsigned) * </ul> * * @author ******@****.*** (Kyle Maddison) * @author ******@****.*** (Geoff Pike) */ @ElementTypesAreNonnullByDefault
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Dec 28 17:50:25 GMT 2021 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/ReaderInputStream.java
// 1) array has space available on right-hand side (between limit and capacity) // 2) array has space available on left-hand side (before position) // 3) array has no space available // // In case 2 we shift the existing chars to the left, and in case 3 we create a bigger // array, then they both become case 1. if (availableCapacity(charBuffer) == 0) { if (charBuffer.position() > 0) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 28 20:13:02 GMT 2023 - 9.3K 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)