11 unshift @INC, '../lib'; # for running manually
12 my $location = $0; $location =~ s/mbi_rand.t//;
13 unshift @INC, $location; # to locate the testing files
16 plan tests => $count*2;
20 my $c = 'Math::BigInt';
24 # If you get a failure here, please re-run the test with the printed seed
25 # value as input: perl t/mbi_rand.t seed
27 my $seed = int(rand(65537)); print "# seed: $seed\n"; srand($seed);
29 my ($A,$B,$ADB,$AMB,$la,$lb);
30 for (my $i = 0; $i < $count; $i++)
33 $la = int(rand($length)+1); $lb = int(rand($length)+1);
35 # we create the numbers from "patterns", e.g. get a random number and a
36 # random count and string them together. This means things like
37 # "100000999999999999911122222222" are much more likely. If we just strung
38 # together digits, we would end up with "1272398823211223" etc.
39 while (length($A) < $la) { $A .= int(rand(100)) x int(rand(16)); }
40 while (length($B) < $lb) { $B .= int(rand(100)) x int(rand(16)); }
41 $A = $c->new($A); $B = $c->new($B);
42 # print "# A $A\n# B $B\n";
43 if ($A->is_zero() || $B->is_zero())
45 ok (1,1); ok (1,1); next;
47 # check that int(A/B)*B + A % B == A holds for all inputs
48 # $X = ($A/$B)*$B + 2 * ($A % $B) - ($A % $B);
49 ($ADB,$AMB) = $A->copy()->bdiv($B);
50 print "# ". join(' ',Math::BigInt::Calc->_base_len()),"\n"
51 unless ok ($ADB*$B+2*$AMB-$AMB,$A);
52 # swap 'em and try this, too
53 # $X = ($B/$A)*$A + $B % $A;
54 ($ADB,$AMB) = $B->copy()->bdiv($A);
55 print "# ". join(' ',Math::BigInt::Calc->_base_len()),"\n"
56 unless ok ($ADB*$A+2*$AMB-$AMB,$B);