Lines Matching defs:digits
56 // Clear the excess digits (if there were any).
84 uint64_t digits = ReadUInt64(value, pos, kMaxUint64DecimalDigits);
88 AddUInt64(digits);
90 uint64_t digits = ReadUInt64(value, pos, length);
92 AddUInt64(digits);
317 // In the worst case we have to accumulate nb-digits products of digit*digit.
325 // First shift the digits so we don't overwrite them.
453 // Easy case: if we have less digits than the divisor than the result is 0.
464 // number of digits.
479 // Since other has more than 0 digits we know that the access to
498 // No need to even try to subtract. Even if other's remaining digits were 0
593 // The exponent encodes 0-bigits. So if there are more 0-digits in 'a' than
594 // 'b' has digits, then the bigit-length of 'a'+'b' must be equal to the one
601 // Starting at min_exponent all digits are == 0. So no need to compare them.
648 // We replace some of the hidden digits (X) of a with 0 digits.