Lines Matching full:have
84 // Once 'count' digits have been produced rounds the result depending on the
111 // Note that it should not have any effect anyways since the string is
130 // We now have v = (numerator / denominator) * 10^estimated_power.
134 // We now have v = (numerator / denominator) * 10^(decimal_point-1), and
228 // loop would have stopped earlier.
229 // We still have an assert here in case the preconditions were not
252 // Note again that the last digit could not be '9' since this would have
254 // We still have an ASSERT here, in case the preconditions were not
266 // from left to right. Once 'count' digits have been produced we decide wether
315 // Note that we have to look at more than just the requested_digits, since
322 // Note that it should not have any effect anyways since the string is
335 // If the fraction is >= 0.5 then we have to include the rounded
435 // have to test it in the other function where exponent < 0).
456 // This means that e is close to 0 (have a look at how estimated_power is
484 // (otherwise estimated_power would have been negative) this cannot happen
539 // With this shift the boundaries have their correct value, since
542 // These assignments have been done earlier.
545 // This time we have to look out for the exception too.
589 // we then have 0.1 <= numerator/denominator < 1
619 // range 1-10. That is after a call to this function we have:
642 // Since numerator + delta_plus >= denominator we already have
