- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for significand (0.17 sec)
-
android/guava/src/com/google/common/math/DoubleUtils.java
} /* * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or * down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and signifFloor the * top SIGNIFICAND_BITS + 1. *
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/math/BigDecimalMath.java
* * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754 * default rounding mode: if the two nearest representable values are equally near, the one with * the least significant bit zero is chosen. (In such cases, both of the nearest representable * values are even integers; this method returns the one that is a multiple of a greater power of * two.) *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 23 18:45:50 GMT 2023 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/io/PatternFilenameFilter.java
* class to begin with but rather something returned from a static factory method whose declared * return type is plain FilenameFilter. If we made such a change, then the annotation we choose * here would have no significance to end users, who would be forced to conform to the signature * used in FilenameFilter.) */ @Override public boolean accept(File dir, String fileName) { return pattern.matcher(fileName).matches(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed May 17 14:35:11 GMT 2023 - 2.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
expectedCrc, actualCrcHasher); } // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41. // We calculate the constant below by: // 1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41 // 2. Flipping the bits of the constant so we can process a byte at a time. => 0x82F63B78 private static final int CRC32C_GENERATOR = 0x1EDC6F41; // 0x11EDC6F41
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Dec 23 18:30:33 GMT 2020 - 6.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Utf8.java
// Three-byte form. if (index + 1 >= end) { return false; } int byte2 = bytes[index++]; if (byte2 > (byte) 0xBF // Overlong? 5 most significant bits must not all be zero. || (byte1 == (byte) 0xE0 && byte2 < (byte) 0xA0) // Check for illegal surrogate codepoints. || (byte1 == (byte) 0xED && (byte) 0xA0 <= byte2)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 10 14:11:51 GMT 2023 - 7K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
expectedCrc, actualCrcHasher); } // From RFC 3720, Section 12.1, the polynomial generator is 0x11EDC6F41. // We calculate the constant below by: // 1. Omitting the most significant bit (because it's always 1). => 0x1EDC6F41 // 2. Flipping the bits of the constant so we can process a byte at a time. => 0x82F63B78 private static final int CRC32C_GENERATOR = 0x1EDC6F41; // 0x11EDC6F41
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Dec 23 18:30:33 GMT 2020 - 6.5K bytes - Viewed (0) -
guava/src/com/google/common/base/Utf8.java
// Three-byte form. if (index + 1 >= end) { return false; } int byte2 = bytes[index++]; if (byte2 > (byte) 0xBF // Overlong? 5 most significant bits must not all be zero. || (byte1 == (byte) 0xE0 && byte2 < (byte) 0xA0) // Check for illegal surrogate codepoints. || (byte1 == (byte) 0xED && (byte) 0xA0 <= byte2)
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 10 14:11:51 GMT 2023 - 7K bytes - Viewed (0)