3 * @brief Arbitrary sized integer definitions
5 * @see add_digits_asm.s
6 * @see sub_digits_asm.s
7 * @see mul_digits_asm.s
25 Arbint::Arbint(digit_t i) : m_digits(1), m_sign(i < 0)
27 m_digits[0] = llabs(i);
30 Arbint::Arbint(unsigned n, digit_t d0, ...) : m_digits(n), m_sign(false)
36 for (unsigned i = 1; i < n; ++i)
38 m_digits[i] = va_arg(ap, digit_t);
43 Arbint::Arbint(const Arbint & cpy) : m_digits(cpy.m_digits), m_sign(cpy.m_sign)
48 Arbint::Arbint(const vector<digit_t> & digits) : m_digits(digits), m_sign(false)
53 Arbint & Arbint::operator=(const Arbint & cpy)
55 memmove(m_digits.data(), cpy.m_digits.data(),
56 sizeof(digit_t)*min(m_digits.size(), cpy.m_digits.size()));
57 if (cpy.m_digits.size() > m_digits.size())
59 unsigned old_size = m_digits.size();
60 m_digits.resize(cpy.m_digits.size());
61 memset(m_digits.data()+old_size, 0, sizeof(digit_t)*m_digits.size()-old_size);
68 memset(m_digits.data(), 0, sizeof(digit_t)*m_digits.size());
71 unsigned Arbint::Shrink()
73 if (m_digits.size() <= 1)
76 for (i = m_digits.size()-1; (i > 0 && m_digits[i] != 0L); --i);
77 unsigned result = m_digits.size() - i;
82 Arbint & Arbint::operator*=(const Arbint & mul)
84 vector<digit_t> new_digits(m_digits.size(), 0L);
85 new_digits.reserve(new_digits.size()+mul.m_digits.size());
86 for (unsigned i = 0; i < mul.m_digits.size(); ++i)
88 vector<digit_t> step(m_digits.size()+i, 0L);
89 memcpy(step.data()+i, m_digits.data(), sizeof(digit_t)*m_digits.size());
91 digit_t overflow = mul_digits((digit_t*)step.data()+i, mul.m_digits[i], m_digits.size());
94 step.push_back(overflow);
96 new_digits.resize(max(new_digits.size(), step.size()), 0L);
97 digit_t carry = add_digits((digit_t*)new_digits.data(), step.data(), step.size());
100 new_digits.push_back(carry);
104 m_digits.swap(new_digits);
105 m_sign = !(m_sign == mul.m_sign);
109 void Arbint::Division(const Arbint & div, Arbint & result, Arbint & remainder) const
114 while ((remainder -= div) > Arbint(0L))
116 //Debug("Remainder %c%s", remainder.SignChar(), remainder.DigitStr().c_str());
117 //Debug("Result %c%s + 1", result.SignChar(), result.DigitStr().c_str());
123 Arbint & Arbint::operator+=(const Arbint & add)
125 if (m_sign == add.m_sign)
127 // -a + -b == -(a + b)
128 return AddBasic(add);
133 // -a + b == -(a - b)
146 Arbint & Arbint::operator-=(const Arbint & sub)
148 if (m_sign == sub.m_sign)
149 return SubBasic(sub);
150 return AddBasic(sub);
153 Arbint & Arbint::AddBasic(const Arbint & add)
155 if (add.m_digits.size() >= m_digits.size())
157 m_digits.resize(add.m_digits.size()+1,0L);
160 digit_t carry = add_digits((digit_t*)m_digits.data(),
161 (digit_t*)add.m_digits.data(), add.m_digits.size());
163 m_digits[m_digits.size()-1] = carry;
164 else if (m_digits.back() == 0L)
165 m_digits.resize(m_digits.size()-1);
169 Arbint & Arbint::SubBasic(const Arbint & sub)
171 if (sub.m_digits.size() >= m_digits.size())
173 m_digits.resize(sub.m_digits.size(),0L);
175 digit_t borrow = sub_digits((digit_t*)m_digits.data(),
176 (digit_t*)sub.m_digits.data(), sub.m_digits.size());
179 //TODO: Write ASM to do this bit?
183 for (unsigned i = 0; i < m_digits.size(); ++i)
184 m_digits[i] = -m_digits[i];
190 string Arbint::Str(const string & base) const
193 for (unsigned i = 0; i < m_digits.size(); ++i)
195 digit_t w = m_digits[i];
203 if (i+1 < m_digits.size()) s += ",";
205 reverse(s.begin(), s.end());
209 bool Arbint::IsZero() const
211 for (unsigned i = m_digits.size()-1; i > 0; --i)
213 if (m_digits[i] != 0L) return false;
215 return (m_digits[0] == 0L);
218 bool Arbint::operator==(const Arbint & equ) const
220 if (m_sign != equ.m_sign) return false;
221 unsigned min_size = m_digits.size();
222 const Arbint * larger = &equ;
223 if (m_digits.size() > equ.m_digits.size())
225 min_size = equ.m_digits.size();
229 if (memcmp(m_digits.data(), equ.m_digits.data(), sizeof(digit_t)*min_size) != 0)
232 for (unsigned i = min_size; i < larger->m_digits.size(); ++i)
234 if (larger->m_digits[i] != 0L)
240 bool Arbint::operator<(const Arbint & less) const
244 return (cpy.m_sign && !cpy.IsZero());
247 string Arbint::DigitStr() const
250 ss << std::hex << std::setfill('0');
251 for (unsigned i = 0; i < m_digits.size(); ++i)
253 if (i != 0) ss << ',';
254 ss << std::setw(2*sizeof(digit_t)) << static_cast<digit_t>(m_digits[i]);