Lines Matching defs:digits
104 int digits = 1;
105 for (uint32_t factor = 10; digits < 10; digits++, factor *= 10) {
108 position_ += digits;
109 for (int i = 1; i <= digits; i++) {
308 // buffer of one-byte digits, along with an optional radix prefix.
545 // The buffer may contain up to kMaxSignificantDigits + 1 digits and a zero
653 // Maximum number of significant digits in decimal representation.
656 // (768 digits). If we parse a number whose first digits are equal to a
657 // mean of 2 adjacent doubles (that could have up to 769 digits) the result
659 // we don't need to preserve all the digits.
662 // The longest form of simplified number is: "-<significant digits>'.1eXXX\0".
667 // Exponent will be adjusted if insignificant digits of the integer part
750 // Copy significant digits of the integer part (if any) to the buffer.
785 // Integer part consists of 0 or is absent. Significant digits start after
803 // Ignore insignificant digits in the fractional part.
815 // Otherwise there are no digits in the string.
933 // one-byte ASCII digits, along with an optional radix prefix.
982 bigint::RWDigits digits(digit_storage.data(), num_digits);
983 processor->FromString(digits, &accumulator_);
984 int num_chars = bigint::ToStringResultLength(digits, 10, false);
986 processor->ToString(out.get(), &num_chars, digits, 10, false);
1140 // If abs_value has more than kMaxDigitsBeforePoint digits before the point
1240 // f corresponds to the digits after the point. There is always one digit
1362 // We only compute fractional digits up to the input double's precision.
1381 // We need to back trace already written digits in case of carry-over.
1404 // Compute integer digits. Fill unrepresented digits with zero.