Searched refs:digit_ (Results 1 – 3 of 3) sorted by relevance
120 digit_[j] = that.digit_[j];127 if (digit_[j] != 0) { in IsZero()139 return digits_ == digitLimit_ && digit_[digits_ - 1] >= radix / 10; in IsFull()158 digit_[digits_++] = n; in SetTo()164 digit_[digits_++] = static_cast<Digit>(n - q * radix); in SetTo()173 if (digits_ > 0 && digit_[0] == 0) { in RemoveLeastOrderZeroDigits()174 while (remove < digits_ && digit_[remove] == 0) { in RemoveLeastOrderZeroDigits()187 digit_[j] = digit_[j + remove]; in RemoveLeastOrderZeroDigits()196 while (digits_ > 0 && digit_[digits_ - 1] == 0) { in RemoveLeastOrderZeroDigits()210 return digits_ == 0 || (digit_[0] % N) == 0; in RemoveLeastOrderZeroDigits()[all …]
104 Digit dig{digit_[digits_ - 1]}; in ConvertToDecimal()122 Digit dig{digit_[j]}; in ConvertToDecimal()190 digit_[digits_++] = 0; in Mean()194 Digit v{digit_[j] + that.digit_[j] + carry}; in Mean()196 digit_[j] = v - radix; in Mean()199 digit_[j] = v; in Mean()238 less.digit_[less.digits_++] = 0; in Minimize()241 more.digit_[more.digits_++] = 0; in Minimize()246 less.digit_[digits - 1 - same] == more.digit_[digits - 1 - same]) { in Minimize()256 digit_[j] = more.digit_[j + offset]; in Minimize()[all …]
90 digit_[digits_++] = *q - '0'; in ParseNumber()93 digit_[digits_ - 1] += times * (*q - '0'); in ParseNumber()145 Digit LSD{digit_[0]}; in LoseLeastSignificantDigit()147 digit_[j] = digit_[j + 1]; in LoseLeastSignificantDigit()149 digit_[digits_ - 1] = 0; in LoseLeastSignificantDigit()153 incr = LSD > radix / 2 || (LSD == radix / 2 && digit_[0] % 2 != 0); in LoseLeastSignificantDigit()167 for (int j{0}; (digit_[j] += incr) == radix; ++j) { in LoseLeastSignificantDigit()168 digit_[j] = 0; in LoseLeastSignificantDigit()364 int guardShift{f.SetTo(digit_[--digits_])}; in ConvertToBinary()