Lines Matching defs:digit
22 // A different range might be chosen on a different platform, to optimize digit
27 // Adjusts the last digit of the generated number, and screens out generated
176 // Increment the last digit recursively until we find a non '9' digit.
183 // If the first digit is now '0'+ 10 we had a buffer with all '9's. With the
184 // exception of the first digit all digits are now '0'. Simply switch the
185 // first digit to '1' and adjust the kappa. Example: "99" becomes "10" and
332 // * buffer contains the shortest possible decimal digit-sequence
350 // get each digit. Example the first digit after the point would be computed by
402 int digit = integrals / divisor;
403 buffer[*length] = '0' + digit;
437 int digit = static_cast<int>(fractionals >> -one.e());
438 buffer[*length] = '0' + digit;
459 // is, its error must be strictly less than a unit of its last digit.
506 int digit = integrals / divisor;
507 buffer[*length] = '0' + digit;
539 int digit = static_cast<int>(fractionals >> -one.e());
540 buffer[*length] = '0' + digit;
559 // The last digit will be closest to the actual v. That is, even if several