Lines Matching defs:one
93 // and v (the input number). They are guaranteed to be precise up to one unit.
94 // In fact the error is guaranteed to be strictly less than one unit.
106 // representations, and one is closer to both w_low and w_high, then we know
134 // representations close to w, but we cannot decide which one is closer.
340 // * if more than one decimal representation gives the minimal number of
341 // decimal digits then the one closest to W (where W is the correct value
371 // low, w and high are imprecise, but by less than one ulp (unit in the last
395 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
396 // Division by one is a shift.
397 uint32_t integrals = static_cast<uint32_t>(too_high.f() >> -one.e());
398 // Modulo by one is an and.
399 uint64_t fractionals = too_high.f() & (one.f() - 1);
402 BiggestPowerTen(integrals, DiyFp::kSignificandSize - (-one.e()),
419 (static_cast<uint64_t>(integrals) << -one.e()) + fractionals;
420 // Invariant: too_high = buffer * 10^kappa + DiyFp(rest, one.e())
421 // Reminder: unsafe_interval.e() == one.e()
427 static_cast<uint64_t>(divisor) << -one.e(), unit);
434 // 10 and divide by one. We just need to pay attention to multiply associated
437 // and thus one.e >= -60.
438 DCHECK(one.e() >= -60);
439 DCHECK(fractionals < one.f());
440 DCHECK(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF) / 10 >= one.f());
445 // Integer division by one.
446 int digit = static_cast<int>(fractionals >> -one.e());
449 fractionals &= one.f() - 1; // Modulo by one.
453 unsafe_interval.f(), fractionals, one.f(), unit);
503 DiyFp one = DiyFp(static_cast<uint64_t>(1) << -w.e(), w.e());
504 // Division by one is a shift.
505 uint32_t integrals = static_cast<uint32_t>(w.f() >> -one.e());
506 // Modulo by one is an and.
507 uint64_t fractionals = w.f() & (one.f() - 1);
510 BiggestPowerTen(integrals, DiyFp::kSignificandSize - (-one.e()),
534 (static_cast<uint64_t>(integrals) << -one.e()) + fractionals;
536 static_cast<uint64_t>(divisor) << -one.e(), w_error,
542 // 10 and divide by one. We just need to pay attention to multiply associated
545 // and thus one.e >= -60.
546 DCHECK(one.e() >= -60);
547 DCHECK(fractionals < one.f());
548 DCHECK(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF) / 10 >= one.f());
552 // Integer division by one.
553 int digit = static_cast<int>(fractionals >> -one.e());
557 fractionals &= one.f() - 1; // Modulo by one.
561 return RoundWeedCounted(buffer, *length, fractionals, one.f(), w_error,
573 // chosen even if the longer one would be closer to v.
