- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 75 for smantissa (0.12 sec)
-
tensorflow/compiler/mlir/quantization/common/quantization_lib/quantization.td
} // Uniform quantized types. Two integers "smantissa" and "sexp" are used to // express the Mantissa and Exponent components of the floating-point scale so // the scale of the quantized type is "smantissa * 10 ^ sexp". class UInt8UniformQuantizedType<int zero_pt, int smantissa, int sexp> : QuantizedType<"Uniform", [8, zero_pt, smantissa, sexp, 0, 255], 0>;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 05 07:39:40 UTC 2024 - 8.3K bytes - Viewed (0) -
src/math/big/floatconv.go
// The number must be of the form: // // number = [ sign ] ( float | "inf" | "Inf" ) . // sign = "+" | "-" . // float = ( mantissa | prefix pmantissa ) [ exponent ] . // prefix = "0" [ "b" | "B" | "o" | "O" | "x" | "X" ] . // mantissa = digits "." [ digits ] | digits | "." digits . // pmantissa = [ "_" ] digits "." [ digits ] | [ "_" ] digits | "." digits . // exponent = ( "e" | "E" | "p" | "P" ) [ sign ] digits .
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 8.3K bytes - Viewed (0) -
test/float_lit2.go
// The next float32 would be f₂ = (1+1)×2¹²⁷ = 1×2¹²⁸, except that exponent is out of range. // Float32 conversion rounds to the nearest float32, rounding to even mantissa: // between f₁ and f₂, values closer to f₁ round to f₁ and values closer to f₂ are rejected as out of range. // f₁ is an odd mantissa, so the halfway point (f₁+f₂)/2 rounds to f₂ and is rejected. // The halfway point is (f₁+f₂)/2 = 2¹²⁸ - 2¹⁰³. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 14 16:39:47 UTC 2016 - 7.9K bytes - Viewed (0) -
src/strconv/ftoaryu.go
v = v1 } if n == d.nd { d.d[n] = byte(v + '0') } d.nd = endindex + 1 d.dp = d.nd + trimmed } // mult64bitPow10 takes a floating-point input with a 25-bit // mantissa and multiplies it with 10^q. The resulting mantissa // is m*P >> 57 where P is a 64-bit element of the detailedPowersOfTen tables. // It is typically 31 or 32-bit wide. // The returned boolean is true if all trimmed bits were zero. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0) -
src/math/big/float.go
) // Float mantissa m is 0.5 <= m < 1.0; compute exponent e for float32 mantissa. e := x.exp - 1 // exponent for normal mantissa m with 1.0 <= m < 2.0 // Compute precision p for float32 mantissa. // If the exponent is too small, we have a denormal number before // rounding and fewer than p mantissa bits of precision available
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 15:46:54 UTC 2024 - 44.5K bytes - Viewed (0) -
src/math/big/rat.go
q, r := q.div(a2, a2, b2) // (recycle a2) mantissa := low32(q) haveRem := len(r) > 0 // mantissa&1 && !haveRem => remainder is exactly half // 3. If quotient didn't fit in Msize2 bits, redo division by b2<<1 // (in effect---we accomplish this incrementally). if mantissa>>Msize2 == 1 { if mantissa&1 == 1 { haveRem = true } mantissa >>= 1 exp++ } if mantissa>>Msize1 != 1 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 13.5K bytes - Viewed (0) -
src/math/big/decimal.go
// with the most-significant mantissa digit at index 0. For the zero decimal, the // mantissa length and exponent are 0. // The zero value for decimal represents a ready-to-use 0.0. type decimal struct { mant []byte // mantissa ASCII digits, big-endian exp int // exponent } // at returns the i'th mantissa digit, starting with the most significant digit at 0.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 29 22:45:29 UTC 2020 - 6.6K bytes - Viewed (0) -
src/strconv/atof.go
mantissa |= 1 } for mantissa>>(1+flt.mantbits+2) != 0 { mantissa = mantissa>>1 | mantissa&1 exp++ } // If exponent is too negative, // denormalize in hopes of making it representable. // (The -2 is for the rounding bits.) for mantissa > 1 && exp < minExp-2 { mantissa = mantissa>>1 | mantissa&1 exp++ } // Round using two bottom bits. round := mantissa & 3 mantissa >>= 2
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 06 18:50:50 UTC 2022 - 15.9K bytes - Viewed (0) -
src/math/big/ftoa.go
// 'x' -0xd.dddddp±dd, hexadecimal mantissa, decimal power of two exponent // 'p' -0x.dddp±dd, hexadecimal mantissa, decimal power of two exponent (non-standard) // 'b' -ddddddp±dd, decimal mantissa, decimal power of two exponent (non-standard) // // For the power-of-two exponent formats, the mantissa is printed in normalized form: // // 'x' hexadecimal mantissa in [1, 2), or 0 // 'p' hexadecimal mantissa in [½, 1), or 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 13.5K bytes - Viewed (0) -
src/math/fma.go
// split splits b into sign, biased exponent, and mantissa. // It adds the implicit 1 bit to the mantissa for normal values, // and normalizes subnormal values. func split(b uint64) (sign uint32, exp int32, mantissa uint64) { sign = uint32(b >> 63) exp = int32(b>>52) & mask mantissa = b & fracMask if exp == 0 { // Normalize value if subnormal. shift := uint(bits.LeadingZeros64(mantissa) - 11) mantissa <<= shift
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 05 22:05:30 UTC 2023 - 4.6K bytes - Viewed (0)