Math::BigInt::Lib - virtual parent class for Math::BigInt libraries
This module provides support for big integer calculations. It is not intended to be used directly, but rather as a parent class for backend libraries used by Math::BigInt, Math::BigFloat, Math::BigRat, and related modules. Backend libraries include Math::BigInt::Calc, Math::BigInt::FastCalc, Math::BigInt::GMP, Math::BigInt::Pari and others.
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
_dec()) nor about division by zero (e.g., in
_div()) or similar cases.
Some libraries use methods that don't modify their argument, and some libraries don't even use objects. Because of this, liberary methods are always called as class methods, not instance methods:
$x = Class -> method($x, $y); # like this $x = $x -> method($y); # not like this ... $x -> method($y); # ... or like this
And with boolean methods
$bool = Class -> method($x, $y); # like this $bool = $x -> method($y); # not like this ...
Return values are always objects, strings, Perl scalars, or true/false for comparison routines.
Return API version as a Perl scalar, 1 for Math::BigInt v1.70, 2 for Math::BigInt v1.83.
This method is no longer used. Methods that are not implemented by a subclass will be inherited from this class.
The following methods are mandatory: _new(), _str(), _add(), and _sub(). However, computations will be very slow without _mul() and _div().
Convert a string representing an unsigned decimal number to an object representing the same number. The input is normalize, i.e., it matches
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
Return an object given a string representing an octal number. The input has a '0' prefix and matches the regular expression
Return an object given a string representing a hexadecimal number. The input has a '0x' prefix and matches the regular expression
Returns an object given a byte string representing the number. The byte string is in big endian byte order, so the two-byte input string "\x01\x00" should give an output value representing the number 256.
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 % OBJ2
The 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.
Return the least common multiple 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.
Returns a true value if OBJ is zero, and false value otherwise.
Returns a true value if OBJ is one, and false value otherwise.
Returns a true value if OBJ is two, and false value otherwise.
Returns a true value if OBJ is ten, and false value otherwise.
Return a true value if OBJ is an even integer, and a false value otherwise.
Return a true value if OBJ is an even integer, and a false value otherwise.
Compare OBJ1 and OBJ2 and return -1, 0, or 1, if OBJ1 is less than, equal to, or larger than OBJ2, respectively.
Return a string representing the object. The returned string should have no leading zeros, i.e., it should match
Return the binary string representation of the number. The string must have a '0b' prefix.
Return the octal string representation of the number. The string must have a '0x' prefix.
Note: This method was required from Math::BigInt version 1.78, but the required API version number was not incremented, so there are older libraries that support API version 1, but do not support
Return the hexadecimal string representation of the number. The string must have a '0x' prefix.
Return a byte string representation of the number. The byte string is in big endian byte order, so if the object represents the number 256, the output should be the two-byte string "\x01\x00".
Given an object, return a Perl scalar number (int/float) representing this number.
Return a true copy of the object.
Returns the number of the decimal digits in the number. The output is a Perl scalar.
Return the number of trailing decimal zeros. The output is a Perl scalar.
Return the Nth digit as a Perl scalar. N is a Perl scalar, where zero refers to the rightmost (least significant) digit, and negative values count from the left (most significant digit). If $obj represents the number 123, then $obj-_digit(0)> is 3 and _digit(123, -1) is 1.
Return true if the object is invalid and false otherwise. Preferably, the true value is a string describing the problem with the object. This is a check routine to test the internal state of the object for corruption.
The following methods are required for an API version of 2 or greater.
Return an object representing the number 10**N where N >= 0 is a Perl scalar.
Return the binomial coefficient OBJ1 over OBJ1.
Return the approximate number of decimal digits of the object. The output is a Perl scalar.
The following methods are optional, and can be defined if the underlying lib has a fast way to do them. If undefined, Math::BigInt will use pure Perl (hence slow) fallback routines to emulate these:
Return the signed bitwise or.
Return the signed bitwise and.
Return the signed bitwise exclusive or.
If you want to port your own favourite C library for big numbers to the Math::BigInt interface, you can take any of the already existing modules as a rough guideline. You should really wrap up the latest Math::BigInt and Math::BigFloat testsuites with your module, and replace in them any of the following:
use Math::BigInt lib => 'yourlib';
This way you ensure that your library really works 100% within Math::BigInt.
Please report any bugs or feature requests to
bug-math-bigint at rt.cpan.org, or through the web interface at https://rt.cpan.org/Ticket/Create.html?Queue=Math-BigInt (requires login). We will be notified, and then you'll automatically be notified of progress on your bug as I make changes.
You can find documentation for this module with the perldoc command.
You can also look for information at:
RT: CPAN's request tracker
AnnoCPAN: Annotated CPAN documentation
CPAN Testers Matrix
The Bignum mailing list
Post to mailing list
bignum at lists.scsys.co.uk
View mailing list
This program is free software; you may redistribute it and/or modify it under the same terms as Perl itself.
Peter John Acklam, <firstname.lastname@example.org>
Code and documentation based on the Math::BigInt::Calc module by Tels <email@example.com>
Math::BigInt, Math::BigInt::Calc, Math::BigInt::GMP, Math::BigInt::FastCalc and Math::BigInt::Pari.