// We could do that by doubling _W * n times, or with a square-and-double // chain log2(_W * n) long. Turns out the fastest thing is to start out with // doublings, and switch to square-and-double once the exponent is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with...

pkg math, func Atanh(float64) float64
pkg math, func Cbrt(float64) float64
pkg math, func Ceil(float64) float64
pkg math, func Copysign(float64, float64) float64
pkg math, func Cos(float64) float64
pkg math, func Cosh(float64) float64
pkg math, func Dim(float64, float64) float64
pkg math, func Erf(float64) float64
pkg math, func Erfc(float64) float64
pkg math, func Exp(float64) float64