internal::BigInteger Class Reference

#include <biginteger.h>

Public Types
typedef uint64_t	Type

Public Member Functions
	BigInteger (const BigInteger &rhs)
	BigInteger (uint64_t u)
	BigInteger (const char *decimals, size_t length)
BigInteger &	operator= (uint64_t u)
BigInteger &	operator+= (uint64_t u)
BigInteger &	operator*= (uint64_t u)
BigInteger &	operator*= (uint32_t u)
BigInteger &	operator<<= (size_t shift)
bool	operator== (const BigInteger &rhs) const
bool	operator== (const Type rhs) const
BigInteger &	MultiplyPow5 (unsigned exp)
bool	Difference (const BigInteger &rhs, BigInteger *out) const
int	Compare (const BigInteger &rhs) const
size_t	GetCount () const
Type	GetDigit (size_t index) const
bool	IsZero () const

Private Member Functions
void	AppendDecimal64 (const char *begin, const char *end)
void	PushBack (Type digit)

Static Private Member Functions
static uint64_t	ParseUint64 (const char *begin, const char *end)
static uint64_t	MulAdd64 (uint64_t a, uint64_t b, uint64_t k, uint64_t *outHigh)

Private Attributes
Type	digits_ [kCapacity]
size_t	count_

Static Private Attributes
static const size_t	kBitCount = 3328
static const size_t	kCapacity = kBitCount / sizeof(Type)
static const size_t	kTypeBit = sizeof(Type) * 8

Member Typedef Documentation

typedef uint64_t internal::BigInteger::Type

Constructor & Destructor Documentation

internal::BigInteger::BigInteger ( const BigInteger &  rhs )

inline

 : count_(rhs.count_) {
 std::memcpy(digits_, rhs.digits_, count_ * sizeof(Type));
 }

internal::BigInteger::BigInteger ( uint64_t  u )

inlineexplicit

 : count_(1) {
 digits_[0] = u;
 }

internal::BigInteger::BigInteger ( const char *  decimals, size_t  length  )

inline

 : count_(1) {
 RAPIDJSON_ASSERT(length > 0);
 digits_[0] = 0;
 size_t i = 0;
 const size_t kMaxDigitPerIteration = 19; // 2^64 = 18446744073709551616 > 10^19
 while (length >= kMaxDigitPerIteration) {
 AppendDecimal64(decimals + i, decimals + i + kMaxDigitPerIteration);
 length -= kMaxDigitPerIteration;
 i += kMaxDigitPerIteration;
 }

 if (length > 0)
 AppendDecimal64(decimals + i, decimals + i + length);
 }

Here is the call graph for this function:

Member Function Documentation

void internal::BigInteger::AppendDecimal64 ( const char *  begin, const char *  end  )

inlineprivate

 {
 uint64_t u = ParseUint64(begin, end);
 if (IsZero())
 *this = u;
 else {
 unsigned exp = static_cast<unsigned>(end - begin);
 (MultiplyPow5(exp) <<= exp) += u; // *this = *this * 10^exp + u
 }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int internal::BigInteger::Compare ( const BigInteger &  rhs ) const

inline

 {
 if (count_ != rhs.count_)
 return count_ < rhs.count_ ? -1 : 1;

 for (size_t i = count_; i-- > 0;)
 if (digits_[i] != rhs.digits_[i])
 return digits_[i] < rhs.digits_[i] ? -1 : 1;

 return 0;
 }

Here is the caller graph for this function:

bool internal::BigInteger::Difference ( const BigInteger &  rhs, BigInteger *  out  ) const

inline

 {
 int cmp = Compare(rhs);
 RAPIDJSON_ASSERT(cmp != 0);
 const BigInteger *a, *b; // Makes a > b
 bool ret;
 if (cmp < 0) { a = &rhs; b = this; ret = true; }
 else { a = this; b = &rhs; ret = false; }

 Type borrow = 0;
 for (size_t i = 0; i < a->count_; i++) {
 Type d = a->digits_[i] - borrow;
 if (i < b->count_)
 d -= b->digits_[i];
 borrow = (d > a->digits_[i]) ? 1 : 0;
 out->digits_[i] = d;
 if (d != 0)
 out->count_ = i + 1;
 }

 return ret;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

size_t internal::BigInteger::GetCount ( ) const

inline

{ return count_; }

Type internal::BigInteger::GetDigit ( size_t  index ) const

inline

{ RAPIDJSON_ASSERT(index < count_); return digits_[index]; }

bool internal::BigInteger::IsZero ( ) const

inline

{ return count_ == 1 && digits_[0] == 0; }

Here is the caller graph for this function:

static uint64_t internal::BigInteger::MulAdd64 ( uint64_t  a, uint64_t  b, uint64_t  k, uint64_t *  outHigh  )

inlinestaticprivate

 {
#if defined(_MSC_VER) && defined(_M_AMD64)
 uint64_t low = _umul128(a, b, outHigh) + k;
 if (low < k)
 (*outHigh)++;
 return low;
#elif (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6)) && defined(__x86_64__)
 __extension__ typedef unsigned __int128 uint128;
 uint128 p = static_cast<uint128>(a) * static_cast<uint128>(b);
 p += k;
 *outHigh = static_cast<uint64_t>(p >> 64);
 return static_cast<uint64_t>(p);
#else
 const uint64_t a0 = a & 0xFFFFFFFF, a1 = a >> 32, b0 = b & 0xFFFFFFFF, b1 = b >> 32;
 uint64_t x0 = a0 * b0, x1 = a0 * b1, x2 = a1 * b0, x3 = a1 * b1;
 x1 += (x0 >> 32); // can't give carry
 x1 += x2;
 if (x1 < x2)
 x3 += (static_cast<uint64_t>(1) << 32);
 uint64_t lo = (x1 << 32) + (x0 & 0xFFFFFFFF);
 uint64_t hi = x3 + (x1 >> 32);

 lo += k;
 if (lo < k)
 hi++;
 *outHigh = hi;
 return lo;
#endif
 }

Here is the caller graph for this function:

BigInteger& internal::BigInteger::MultiplyPow5 ( unsigned  exp )

inline

 {
 static const uint32_t kPow5[12] = {
 5,
 5 * 5,
 5 * 5 * 5,
 5 * 5 * 5 * 5,
 5 * 5 * 5 * 5 * 5,
 5 * 5 * 5 * 5 * 5 * 5,
 5 * 5 * 5 * 5 * 5 * 5 * 5,
 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5,
 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5 * 5
 };
 if (exp == 0) return *this;
 for (; exp >= 27; exp -= 27) *this *= RAPIDJSON_UINT64_C2(0X6765C793, 0XFA10079D); // 5^27
 for (; exp >= 13; exp -= 13) *this *= static_cast<uint32_t>(1220703125u); // 5^13
 if (exp > 0) *this *= kPow5[exp - 1];
 return *this;
 }

Here is the caller graph for this function:

BigInteger& internal::BigInteger::operator*= ( uint64_t  u )

inline

 {
 if (u == 0) return *this = 0;
 if (u == 1) return *this;
 if (*this == 1) return *this = u;

 uint64_t k = 0;
 for (size_t i = 0; i < count_; i++) {
 uint64_t hi;
 digits_[i] = MulAdd64(digits_[i], u, k, &hi);
 k = hi;
 }
 
 if (k > 0)
 PushBack(k);

 return *this;
 }

Here is the call graph for this function:

BigInteger& internal::BigInteger::operator*= ( uint32_t  u )

inline

 {
 if (u == 0) return *this = 0;
 if (u == 1) return *this;
 if (*this == 1) return *this = u;

 uint64_t k = 0;
 for (size_t i = 0; i < count_; i++) {
 const uint64_t c = digits_[i] >> 32;
 const uint64_t d = digits_[i] & 0xFFFFFFFF;
 const uint64_t uc = u * c;
 const uint64_t ud = u * d;
 const uint64_t p0 = ud + k;
 const uint64_t p1 = uc + (p0 >> 32);
 digits_[i] = (p0 & 0xFFFFFFFF) | (p1 << 32);
 k = p1 >> 32;
 }
 
 if (k > 0)
 PushBack(k);

 return *this;
 }

Here is the call graph for this function:

BigInteger& internal::BigInteger::operator+= ( uint64_t  u )

inline

 {
 Type backup = digits_[0];
 digits_[0] += u;
 for (size_t i = 0; i < count_ - 1; i++) {
 if (digits_[i] >= backup)
 return *this; // no carry
 backup = digits_[i + 1];
 digits_[i + 1] += 1;
 }

 // Last carry
 if (digits_[count_ - 1] < backup)
 PushBack(1);

 return *this;
 }

Here is the call graph for this function:

BigInteger& internal::BigInteger::operator<<= ( size_t  shift )

inline

 {
 if (IsZero() || shift == 0) return *this;

 size_t offset = shift / kTypeBit;
 size_t interShift = shift % kTypeBit;
 RAPIDJSON_ASSERT(count_ + offset <= kCapacity);

 if (interShift == 0) {
 std::memmove(&digits_[count_ - 1 + offset], &digits_[count_ - 1], count_ * sizeof(Type));
 count_ += offset;
 }
 else {
 digits_[count_] = 0;
 for (size_t i = count_; i > 0; i--)
 digits_[i + offset] = (digits_[i] << interShift) | (digits_[i - 1] >> (kTypeBit - interShift));
 digits_[offset] = digits_[0] << interShift;
 count_ += offset;
 if (digits_[count_])
 count_++;
 }

 std::memset(digits_, 0, offset * sizeof(Type));

 return *this;
 }

Here is the call graph for this function:

BigInteger& internal::BigInteger::operator= ( uint64_t  u )

inline

 {
 digits_[0] = u; 
 count_ = 1;
 return *this;
 }

bool internal::BigInteger::operator== ( const BigInteger &  rhs ) const

inline

 {
 return count_ == rhs.count_ && std::memcmp(digits_, rhs.digits_, count_ * sizeof(Type)) == 0;
 }

bool internal::BigInteger::operator== ( const Type  rhs ) const

inline

 {
 return count_ == 1 && digits_[0] == rhs;
 }

static uint64_t internal::BigInteger::ParseUint64 ( const char *  begin, const char *  end  )

inlinestaticprivate

 {
 uint64_t r = 0;
 for (const char* p = begin; p != end; ++p) {
 RAPIDJSON_ASSERT(*p >= '0' && *p <= '9');
 r = r * 10 + (*p - '0');
 }
 return r;
 }

Here is the caller graph for this function:

void internal::BigInteger::PushBack ( Type  digit )

inlineprivate

 {
 RAPIDJSON_ASSERT(count_ < kCapacity);
 digits_[count_++] = digit;
 }

Here is the caller graph for this function:

Member Data Documentation

size_t internal::BigInteger::count_

private

Type internal::BigInteger::digits_[kCapacity]

private

const size_t internal::BigInteger::kBitCount = 3328

staticprivate

const size_t internal::BigInteger::kCapacity = kBitCount / sizeof(Type)

staticprivate

const size_t internal::BigInteger::kTypeBit = sizeof(Type) * 8

staticprivate

---

The documentation for this class was generated from the following file:

• dep/rapidjson/rapidjson/internal/biginteger.h