- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for MulByLog2Log10 (0.1 sec)
-
src/strconv/ftoaryu.go
// Because mant >= 2^54, it is enough to choose: // 2^(e2+54) >= 10^(-q+prec-1) // or q = -mulByLog2Log10(e2+54) + prec - 1 // // The minimal required exponent is -mulByLog2Log10(1025)+18 = -291 // The maximal required exponent is mulByLog2Log10(1074)+18 = 342 q := -mulByLog2Log10(e2+54) + prec - 1 // Now compute mant*(2^e2)*(10^q). // Is it an exact computation?
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0)