Lines Matching full:fraction
395 fraction := f.mant - (uint64(integer) << shift)
441 // Emit digits for the fractional part. Each time, 10*fraction
444 fraction *= 10
450 digit := fraction >> shift
452 fraction -= digit << shift
464 // (rest<<shift | fraction) / (pow10 << shift)
465 // fraction being known with a ±? uncertainty.
469 // fraction / (1 << shift)
470 // fraction being known with a ±? uncertainty.
474 ok := adjustLastDigitFixed(d, uint64(rest)<<shift|fraction, pow10, shift, ?)
584 fraction := upper.mant - (uint64(integer) << shift)
606 if currentDiff := uint64(integer)<<shift + fraction; currentDiff < allowance {
619 // Compute digits of the fractional part. At each step fraction does not
620 // overflow. The choice of minExp implies that fraction is less than 2^60.
624 fraction *= 10
626 digit = int(fraction >> shift)
629 fraction -= uint64(digit) << shift
630 if fraction < allowance*multiplier {
633 // true due to the limited range of fraction.
635 fraction, targetDiff*multiplier, allowance*multiplier,
