Lines Matching refs:one
88 // and v (the input number). They are guaranteed to be precise up to one unit.
89 // In fact the error is guaranteed to be strictly less than one unit.
101 // representations, and one is closer to both w_low and w_high, then we know
129 // representations close to w, but we cannot decide which one is closer.
335 // * if more than one decimal representation gives the minimal number of
336 // decimal digits then the one closest to W (where W is the correct value
362 // low, w and high are imprecise, but by less than one ulp (unit in the last
386 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
387 // Division by one is a shift.
388 uint32_t integrals = static_cast<uint32_t>(too_high.f() >> -one.e());
389 // Modulo by one is an and.
390 uint64_t fractionals = too_high.f() & (one.f() - 1);
393 BiggestPowerTen(integrals, DiyFp::kSignificandSize - (-one.e()), &divisor,
410 (static_cast<uint64_t>(integrals) << -one.e()) + fractionals;
411 // Invariant: too_high = buffer * 10^kappa + DiyFp(rest, one.e())
412 // Reminder: unsafe_interval.e() == one.e()
418 static_cast<uint64_t>(divisor) << -one.e(), unit);
425 // 10 and divide by one. We just need to pay attention to multiply associated
428 // and thus one.e >= -60.
429 DCHECK_GE(one.e(), -60);
430 DCHECK(fractionals < one.f());
431 DCHECK(0xFFFF'FFFF'FFFF'FFFF / 10 >= one.f());
436 // Integer division by one.
437 int digit = static_cast<int>(fractionals >> -one.e());
440 fractionals &= one.f() - 1; // Modulo by one.
444 unsafe_interval.f(), fractionals, one.f(), unit);
489 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
490 // Division by one is a shift.
491 uint32_t integrals = static_cast<uint32_t>(w.f() >> -one.e());
492 // Modulo by one is an and.
493 uint64_t fractionals = w.f() & (one.f() - 1);
496 BiggestPowerTen(integrals, DiyFp::kSignificandSize - (-one.e()), &divisor,
520 (static_cast<uint64_t>(integrals) << -one.e()) + fractionals;
522 static_cast<uint64_t>(divisor) << -one.e(), w_error,
528 // 10 and divide by one. We just need to pay attention to multiply associated
531 // and thus one.e >= -60.
532 DCHECK_GE(one.e(), -60);
533 DCHECK(fractionals < one.f());
534 DCHECK(0xFFFF'FFFF'FFFF'FFFF / 10 >= one.f());
538 // Integer division by one.
539 int digit = static_cast<int>(fractionals >> -one.e());
543 fractionals &= one.f() - 1; // Modulo by one.
547 return RoundWeedCounted(buffer, *length, fractionals, one.f(), w_error,
558 // chosen even if the longer one would be closer to v.