Arbitrary-precision ('bignum') arithmetic.
Performance is optimized for numbers below ~1000 decimal digits. For X86 machines, highly optimised assembly routines are used.
The following algorithms are currently implemented:
- Karatsuba multiplication
- Squaring is optimized independently of multiplication
- Divide-and-conquer division
- Binary exponentiation
For very large numbers, consider using the GMP library instead.
||Returns the absolute value of x converted to the corresponding unsigned type.|
||Finds the quotient and remainder for the given dividend and divisor in one operation.|
||A struct representing an arbitrary precision integer.|