|
Packit |
dcde0c |
#!perl
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
use strict;
|
|
Packit |
dcde0c |
use warnings;
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
use Test::More;
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
my $count = 128;
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
plan(($^O eq 'os390') ? (skip_all => 'takes too long on os390')
|
|
Packit |
dcde0c |
: (tests => $count*4));
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
use Math::BigInt only => 'FastCalc';
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
my $length = 128;
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
# If you get a failure here, please re-run the test with the printed seed
|
|
Packit |
dcde0c |
# value as input "perl t/mbi_rand.t seed" and send me the output
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
my $seed = @ARGV == 1 ? $ARGV[0] : int(rand(1165537));
|
|
Packit |
dcde0c |
#diag(" seed: $seed\n");
|
|
Packit |
dcde0c |
srand($seed);
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
my $_base_len;
|
|
Packit |
dcde0c |
my @_base_len;
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
#diag(" lib: ", Math::BigInt->config('lib'));
|
|
Packit |
dcde0c |
if (Math::BigInt->config('lib') =~ /::Calc/) {
|
|
Packit |
dcde0c |
$_base_len = Math::BigInt::Calc->_base_len();
|
|
Packit |
dcde0c |
@_base_len = Math::BigInt::Calc->_base_len();
|
|
Packit |
dcde0c |
#diag("base len: $_base_len (scalar context)");
|
|
Packit |
dcde0c |
#diag("base len: @_base_len (list contex)");
|
|
Packit |
dcde0c |
}
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
my ($A, $B, $A_str, $B_str, $AdivB, $AmodB, $A_len, $B_len);
|
|
Packit |
dcde0c |
my $two = Math::BigInt->new(2);
|
|
Packit |
dcde0c |
for (my $i = 0; $i < $count; $i++) {
|
|
Packit |
dcde0c |
#diag("");
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
# length of A and B
|
|
Packit |
dcde0c |
$A_len = int(rand($length) + 1);
|
|
Packit |
dcde0c |
$B_len = int(rand($length) + 1);
|
|
Packit |
dcde0c |
$A_str = '';
|
|
Packit |
dcde0c |
$B_str = '';
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
# We create the numbers from "patterns", e.g. get a random number and a
|
|
Packit |
dcde0c |
# random count and string them together. This means things like
|
|
Packit |
dcde0c |
# "100000999999999999911122222222" are much more likely. If we just strung
|
|
Packit |
dcde0c |
# together digits, we would end up with "1272398823211223" etc. It also
|
|
Packit |
dcde0c |
# means that we get more frequently equal numbers or other special cases.
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
while (length($A_str) < $A_len) {
|
|
Packit |
dcde0c |
$A_str .= int(rand(100)) x int(rand(16));
|
|
Packit |
dcde0c |
}
|
|
Packit |
dcde0c |
while (length($B_str) < $B_len) {
|
|
Packit |
dcde0c |
$B_str .= int(rand(100)) x int(rand(16));
|
|
Packit |
dcde0c |
}
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
$A_str =~ s/^0+(?=\d)//;
|
|
Packit |
dcde0c |
$B_str =~ s/^0+(?=\d)//;
|
|
Packit |
dcde0c |
#diag(" As: $A_str");
|
|
Packit |
dcde0c |
#diag(" Bs: $B_str");
|
|
Packit |
dcde0c |
$A = Math::BigInt->new($A_str);
|
|
Packit |
dcde0c |
$B = Math::BigInt->new($B_str);
|
|
Packit |
dcde0c |
#diag(" A: $A");
|
|
Packit |
dcde0c |
#diag(" B: $B");
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
SKIP: {
|
|
Packit |
dcde0c |
skip '$A and/or $B are zero.', 4 if $A->is_zero() || $B->is_zero();
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
# check that int(A / B) * B + A % B == A holds for all inputs
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
# $X = ($A / $B) * $B + 2 * ($A % $B) - ($A % $B);
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
($AdivB, $AmodB) = $A->copy()->bdiv($B);
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
#diag(" A / B: $AdivB");
|
|
Packit |
dcde0c |
#diag(" A % B: $AmodB");
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
is($AdivB * $B + $two * $AmodB - $AmodB, $A_str,
|
|
Packit |
dcde0c |
"AdivB * B + 2 * AmodB - AmodB == A");
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
if (is($AdivB * $B / $B, $AdivB, "AdivB * B / B == AdivB")) {
|
|
Packit |
dcde0c |
if (Math::BigInt->config('lib') =~ /::Calc/) {
|
|
Packit |
dcde0c |
#diag("AdivB->[-1]: ", $AdivB->{value}->[-1]);
|
|
Packit |
dcde0c |
#diag(" B->[-1]: ", $B->{value}->[-1]);
|
|
Packit |
dcde0c |
}
|
|
Packit |
dcde0c |
}
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
# swap 'em and try this, too
|
|
Packit |
dcde0c |
# $X = ($B/$A)*$A + $B % $A;
|
|
Packit |
dcde0c |
($AdivB, $AmodB) = $B->copy()->bdiv($A);
|
|
Packit |
dcde0c |
# print "check: $AdivB $AmodB";
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
is($AdivB * $A + $two * $AmodB - $AmodB, $B_str,
|
|
Packit |
dcde0c |
"AdivB * A + 2 * AmodB - AmodB == B");
|
|
Packit |
dcde0c |
|
|
Packit |
dcde0c |
is($AdivB * $A / $A, $AdivB, "AdivB * A / A == AdivB");
|
|
Packit |
dcde0c |
}
|
|
Packit |
dcde0c |
}
|