- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for shiest (0.65 sec)
-
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/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) -
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/primitives/UnsignedLong.java
return (double) value; } // The top bit is set, which means that the double value is going to come from the top 53 bits. // So we can ignore the bottom 11, except for rounding. We can unsigned-shift right 1, aka // unsigned-divide by 2, and convert that. Then we'll get exactly half of the desired double // value. But in the specific case where the bottom two bits of the original number are 01, we
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 22 13:09:25 GMT 2021 - 8.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/FarmHashFingerprint64.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 final class FarmHashFingerprint64 extends AbstractNonStreamingHashFunction {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Apr 01 22:39:48 GMT 2022 - 7.6K bytes - Viewed (0)