- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 1,081 for nbits (0.12 sec)
-
guava/src/com/google/common/primitives/UnsignedLong.java
* interpreted as an unsigned 64-bit value. Specifically, the sign bit of {@code bits} is * interpreted as a normal bit, and all other bits are treated as usual. * * <p>If the argument is nonnegative, the returned result will be equal to {@code bits}, * otherwise, the result will be equal to {@code 2^64 + bits}. * * <p>To represent decimal constants less than {@code 2^63}, consider {@link #valueOf(long)}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Apr 22 13:09:25 UTC 2021 - 8.9K bytes - Viewed (0) -
src/math/cbrt.go
x = -x sign = true } // rough cbrt to 5 bits t := Float64frombits(Float64bits(x)/3 + B1<<32) if x < SmallestNormal { // subnormal number t = float64(1 << 54) // set t= 2**54 t *= x t = Float64frombits(Float64bits(t)/3 + B2<<32) } // new cbrt to 23 bits r := t * t / x s := C + r*t t *= G + F/(s+E+D/s) // chop to 22 bits, make larger than cbrt(x)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 2.3K bytes - Viewed (0) -
testing/performance/src/templates/native-dependents-resources/googleTest/libs/googleTest/1.7.0/include/gtest/internal/gtest-internal.h
// The mask for the sign bit. static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1); // The mask for the fraction bits. static const Bits kFractionBitMask = ~static_cast<Bits>(0) >> (kExponentBitCount + 1); // The mask for the exponent bits. static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask); // How many ULP's (Units in the Last Place) we want to tolerate when
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 43.1K bytes - Viewed (0) -
platforms/documentation/docs/src/snippets/native-binaries/google-test/groovy/libs/googleTest/1.7.0/include/gtest/internal/gtest-internal.h
// The mask for the sign bit. static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1); // The mask for the fraction bits. static const Bits kFractionBitMask = ~static_cast<Bits>(0) >> (kExponentBitCount + 1); // The mask for the exponent bits. static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask); // How many ULP's (Units in the Last Place) we want to tolerate when
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 43.1K bytes - Viewed (0) -
src/runtime/tagptr_64bit.go
package runtime import ( "internal/goarch" "internal/goos" "unsafe" ) const ( // addrBits is the number of bits needed to represent a virtual address. // // See heapAddrBits for a table of address space sizes on // various architectures. 48 bits is enough for all // architectures except s390x. // // On AMD64, virtual addresses are 48-bit (or 57-bit) numbers sign extended to 64.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 18 20:22:50 UTC 2023 - 3.2K bytes - Viewed (0) -
src/math/fma.go
if ps == zs { // Adding (pm1:pm2) + (zm1:zm2) pm2, c = bits.Add64(pm2, zm2, 0) pm1, _ = bits.Add64(pm1, zm1, c) pe -= int32(^pm1 >> 63) pm1, m = shrcompress(pm1, pm2, uint(64+pm1>>63)) } else { // Subtracting (pm1:pm2) - (zm1:zm2) // TODO: should we special-case cancellation? pm2, c = bits.Sub64(pm2, zm2, 0) pm1, _ = bits.Sub64(pm1, zm1, c) nz := lz(pm1, pm2) pe -= nz
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 05 22:05:30 UTC 2023 - 4.6K bytes - Viewed (0) -
test/fixedbugs/issue14553.go
{8e-45, 0x00000006}, {9e-45, 0x00000006}, {1.0e-44, 0x00000007}, {1.1e-44, 0x00000008}, {1.2e-44, 0x00000009}, } { got := math.Float32bits(t.value) want := t.bits if got != want { panic(fmt.Sprintf("bits(%g) = 0x%08x; want 0x%08x", t.value, got, want)) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 22 17:09:29 UTC 2016 - 940 bytes - Viewed (0) -
src/cmd/compile/internal/ir/bitset.go
*(*uint8)(f) &^= mask } } func (f bitset8) get2(shift uint8) uint8 { return uint8(f>>shift) & 3 } // set2 sets two bits in f using the bottom two bits of b. func (f *bitset8) set2(shift uint8, b uint8) { // Clear old bits. *(*uint8)(f) &^= 3 << shift // Set new bits. *(*uint8)(f) |= uint8(b&3) << shift } type bitset16 uint16 func (f *bitset16) set(mask uint16, b bool) { if b {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 29 22:03:56 UTC 2022 - 734 bytes - Viewed (0) -
src/strconv/ftoaryu.go
// Only small positive powers of 10 are exact (5^28 has 66 bits). exact := q <= 27 && q >= 0 di, dexp2, d0 := mult64bitPow10(mant, e2, q) if dexp2 >= 0 { panic("not enough significant bits after mult64bitPow10") } // As a special case, computation might still be exact, if exponent // was negative and if it amounts to computing an exact division. // In that case, we ignore all lower bits.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0) -
tensorflow/c/tf_datatype.h
TF_BFLOAT16 = 14, // Float32 truncated to 16 bits. TF_QINT16 = 15, // Quantized int16 TF_QUINT16 = 16, // Quantized uint16 TF_UINT16 = 17, TF_COMPLEX128 = 18, // Double-precision complex TF_HALF = 19, TF_RESOURCE = 20, TF_VARIANT = 21, TF_UINT32 = 22, TF_UINT64 = 23, TF_FLOAT8_E5M2 = 24, // 5 exponent bits, 2 mantissa bits. TF_FLOAT8_E4M3FN = 25, // 4 exponent bits, 3 mantissa bits, finite-only, with
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Sep 08 20:13:32 UTC 2023 - 2.5K bytes - Viewed (0)