Math::BigInt::Calc - Pure Perl module to support Math::BigInt
This library provides support for big integer calculations. It is not intended to be used by other modules. Other modules which support the same API (see below) can also be used to support Math::BigInt, like Math::BigInt::GMP and Math::BigInt::Pari.
In this library, the numbers are represented in base B = 10**N, where N is the largest possible value that does not cause overflow in the intermediate computations. The base B elements are stored in an array, with the least significant element stored in array element zero. There are no leading zero elements, except a single zero element when the number is zero.
For instance, if B = 10000, the number 1234567890 is represented internally as [3456, 7890, 12].
In order to allow for multiple big integer libraries, Math::BigInt was rewritten to use a plug-in library for core math routines. Any module which conforms to the API can be used by Math::BigInt by using this in your program:
use Math::BigInt lib => 'libname';'libname' is either the long name, like 'Math::BigInt::Pari', or only the short version, like 'Pari'.
A library only needs to deal with unsigned big integers. Testing of input parameter validity is done by the caller, so there is no need to worry about underflow (e.g., in _sub() and _dec()) nor about division by zero (e.g., in _div()) or similar cases.
For some methods, the first parameter can be modified. That includes the possibility that you return a reference to a completely different object instead. Although keeping the reference and just changing its contents is preferred over creating and returning a different reference.
Return values are always objects, strings, Perl scalars, or true/false for comparison routines.
The following methods must be defined in order to support the use by Math::BigInt v1.70 or later.
Return API version as a Perl scalar, 1 for Math::BigInt v1.70, 2 for Math::BigInt v1.83.
Convert a string representing an unsigned decimal number to an object representing the same number. The input is normalize, i.e., it matches ^(0|[1-9]\d*)$.
Return an object representing the number zero.
Return an object representing the number one.
Return an object representing the number two.
Return an object representing the number ten.
Return an object given a string representing a binary number. The input has a '0b' prefix and matches the regular expression ^0[bB](0|1[01]*)$.
Return an object given a string representing an octal number. The input has a '0' prefix and matches the regular expression ^0[1-7]*$.
Return an object given a string representing a hexadecimal number. The input has a '0x' prefix and matches the regular expression ^0x(0|[1-9a-fA-F][\da-fA-F]*)$.
Each of these methods may modify the first input argument, except _bgcd(), which shall not modify any input argument, and _sub() which may modify the second input argument.
Returns the result of adding OBJ2 to OBJ1.
Returns the result of multiplying OBJ2 and OBJ1.
Returns the result of dividing OBJ1 by OBJ2 and truncating the result to an integer.
Returns the result of subtracting OBJ2 by OBJ1. If flag is false or omitted, OBJ1 might be modified. If flag is true, OBJ2 might be modified.
Decrement OBJ by one.
Increment OBJ by one.
Return OBJ1 modulo OBJ2, i.e., the remainder after dividing OBJ1 by OBJ2.
Return the square root of the object, truncated to integer.
Return Nth root of the object, truncated to int. N is >= 3.
Return factorial of object (1*2*3*4*...).
Return OBJ1 to the power of OBJ2. By convention, 0**0 = 1.
Return modular multiplicative inverse, i.e., return OBJ3 so that
(OBJ3 * OBJ1) % OBJ2 = 1 % OBJ2The result is returned as two arguments. If the modular multiplicative inverse does not exist, both arguments are undefined. Otherwise, the arguments are a number (object) and its sign ("+" or "-").
The output value, with its sign, must either be a positive value in the range 1,2,...,OBJ2-1 or the same value subtracted OBJ2. For instance, if the input arguments are objects representing the numbers 7 and 5, the method must either return an object representing the number 3 and a "+" sign, since (3*7) % 5 = 1 % 5, or an object representing the number 2 and "-" sign, since (-2*7) % 5 = 1 % 5.
Return modular exponentiation, (OBJ1 ** OBJ2) % OBJ3.
Shift object N digits right in base B and return the resulting object. This is equivalent to performing integer division by B**N and discarding the remainder, except that it might be much faster, depending on how the number is represented internally.
For instance, if the object $obj represents the hexadecimal number 0xabcde, then _rsft($obj, 2, 16) returns an object representing the number 0xabc. The "remainer", 0xde, is discarded and not returned.
Shift the object N digits left in base B. This is equivalent to multiplying by B**N, except that it might be much faster, depending on how the number is represented internally.
Return integer log of OBJ to base BASE. This method has two output arguments, the OBJECT and a STATUS. The STATUS is Perl scalar; it is 1 if OBJ is the exact result, 0 if the result was truncted to give OBJ, and undef if it is unknown whether OBJ is the exact result.
Return the greatest common divisor of OBJ1 and OBJ2.
Each of these methods may modify the first input argument.
Return bitwise and. If necessary, the smallest number is padded with leading zeros.
Return bitwise or. If necessary, the smallest number is padded with leading zeros.
Return bitwise exclusive or. If necessary, the smallest number is padded with leading zeros.