BEGIN {
chdir 't' if -d 't';
@INC = '../lib';
+ require './test.pl';
}
-use strict 'vars';
+use strict;
my $max_chain = $ENV{PERL_TEST_NUMCONVERTS} || 2;
my $max_uv1 = ~0;
my $max_uv2 = sprintf "%u", $max_uv1 ** 6; # 6 is an arbitrary number here
my $big_iv = do {use integer; $max_uv1 * 16}; # 16 is an arbitrary number here
+my $max_uv_less3 = $max_uv1 - 3;
print "# max_uv1 = $max_uv1, max_uv2 = $max_uv2, big_iv = $big_iv\n";
-if ($max_uv1 ne $max_uv2 or $big_iv > $max_uv1) {
- print "1..0 # skipped: unsigned perl arithmetic is not sane";
- eval { require Config; import Config };
- use vars qw(%Config);
- if ($Config{d_quad} eq 'define') {
- print " (common in 64-bit platforms)";
- }
- print "\n";
- exit 0;
+print "# max_uv_less3 = $max_uv_less3\n";
+if ($max_uv1 ne $max_uv2 or $big_iv > $max_uv1 or $max_uv1 == $max_uv_less3) {
+ eval { require Config; };
+ my $message = 'unsigned perl arithmetic is not sane';
+ $message .= " (common in 64-bit platforms)" if $Config::Config{d_quad};
+ skip_all($message);
+}
+if ($max_uv_less3 =~ tr/0-9//c) {
+ skip_all('this perl stringifies large unsigned integers using E notation');
}
my $st_t = 4*4; # We try 4 initializers and 4 reporters
my $num = 0;
$num += 10**$_ - 4**$_ for 1.. $max_chain;
$num *= $st_t;
-print "1..$num\n"; # In fact 15 times more subsubtests...
+$num += $::additional_tests;
+plan(tests => $num); # In fact 15 times more subsubtests...
my $max_uv = ~0;
my $max_iv = int($max_uv/2);
unshift @list, (reverse map -$_, @list), 0; # 15 elts
@list = map "$_", @list; # Normalize
-print "# @list\n";
+note("@list");
# need to special case ++ for max_uv, as ++ "magic" on a string gives
# another string, whereas ++ magic on a string used as a number gives
# Also need to cope with %g notation for max_uv_p1 that actually gives an
# integer less than max_uv because of correct rounding for the limited
-# precisision. This bites for 12 byte long doubles and 8 byte UVs
+# precision. This bites for 12 byte long doubles and 8 byte UVs
my $temp = $max_uv_p1;
my $max_uv_p1_as_iv;
# @list = map { 2->($_), 3->($_), 4->($_), 5->($_), } @list; # Prepare input
-#print "@list\n";
-#print "'@ops'\n";
-
my $test = 1;
my $nok;
for my $num_chain (1..$max_chain) {
#@ops = ([]) unless $num_chain;
#@ops = ([6, 4]);
- # print "'@ops'\n";
for my $op (@ops) {
for my $first (2..5) {
for my $last (2..5) {
if ($curop == 5) {
$inpt = "$inpt"; # P 5
} elsif ($curop == 6) {
- $max_uv & $inpt; # u 6
+ my $dummy = $max_uv & $inpt; # u 6
} else {
- use integer; $inpt + $zero;
+ use integer; my $dummy = $inpt + $zero;
}
} elsif ($curop == 8) {
- $inpt + $zero; # n 8
+ my $dummy = $inpt + $zero; # n 8
} else {
- $inpt . ""; # p 9
+ my $dummy = $inpt . ""; # p 9
}
}
push @ans, $inpt;
}
if ($ans[0] ne $ans[1]) {
- print "# '$ans[0]' ne '$ans[1]',\t$num\t=> @opnames[$first,@{$curops[0]},$last] vs @opnames[$first,@{$curops[1]},$last]\n";
+ my $diag = "'$ans[0]' ne '$ans[1]',\t$num\t=> @opnames[$first,@{$curops[0]},$last] vs @opnames[$first,@{$curops[1]},$last]";
+ my $excuse;
# XXX ought to check that "+" was in the list of opnames
if ((($ans[0] eq $max_uv_pp) and ($ans[1] eq $max_uv_p1))
or (($ans[1] eq $max_uv_pp) and ($ans[0] eq $max_uv_p1))) {
# string ++ versus numeric ++. Tolerate this little
# bit of insanity
- print "# ok, as string ++ of max_uv is \"$max_uv_pp\", numeric is $max_uv_p1\n"
+ $excuse = "ok, as string ++ of max_uv is \"$max_uv_pp\", numeric is $max_uv_p1";
} elsif ($opnames[$last] eq 'I' and $ans[1] eq "-1"
and $ans[0] eq $max_uv_p1_as_iv) {
- print "# ok, \"$max_uv_p1\" correctly converts to IV \"$max_uv_p1_as_iv\"\n";
+ # Max UV plus 1 is NV. This NV may stringify in E notation.
+ # And the number of decimal digits shown in E notation will depend
+ # on the binary digits in the mantissa. And it may be that
+ # (say) 18446744073709551616 in E notation is truncated to
+ # (say) 1.8446744073709551e+19 (say) which gets converted back
+ # as 1.8446744073709551000e+19
+ # ie 18446744073709551000
+ # which isn't the integer we first had.
+ # But each step of conversion is correct. So it's not an error.
+ # (Only shows up for 64 bit UVs and NVs with 64 bit mantissas,
+ # and on Crays (64 bit integers, 48 bit mantissas) IIRC)
+ $excuse = "ok, \"$max_uv_p1\" correctly converts to IV \"$max_uv_p1_as_iv\"";
} elsif ($opnames[$last] eq 'U' and $ans[1] eq ~0
and $ans[0] eq $max_uv_p1_as_uv) {
- print "# ok, \"$max_uv_p1\" correctly converts to UV \"$max_uv_p1_as_uv\"\n";
- } elsif (grep {/^N$/} @opnames[@{$curops[0]}]
- and $ans[0] == $ans[1] and $ans[0] <= ~0) {
- print "# ok, numerically equal - notation changed due to adding zero\n";
+ # as aboce
+ $excuse = "ok, \"$max_uv_p1\" correctly converts to UV \"$max_uv_p1_as_uv\"";
+ } elsif (grep {defined $_ && /^N$/} @opnames[@{$curops[0]}]
+ and $ans[0] == $ans[1] and $ans[0] <= ~0
+ # First must be in E notation (ie not just digits) and
+ # second must still be an integer.
+ # eg 1.84467440737095516e+19
+ # 1.84467440737095516e+19 for 64 bit mantissa is in the
+ # integer range, so 1.84467440737095516e+19 + 0 is treated
+ # as integer addition. [should it be?]
+ # and 18446744073709551600 + 0 is 18446744073709551600
+ # Which isn't the string you first thought of.
+ # I can't remember why there isn't symmetry in this
+ # exception, ie why only the first ops are tested for 'N'
+ and $ans[0] != /^-?\d+$/ and $ans[1] !~ /^-?\d+$/) {
+ $excuse = "ok, numerically equal - notation changed due to adding zero";
} else {
$nok++,
+ diag($diag);
+ }
+ if ($excuse) {
+ note($diag);
+ note($excuse);
}
}
}
- print "not " if $nok;
- print "ok $test\n";
- #print $txt if $nok;
- $test++;
+ ok($nok == 0);
}
}
}
}
+
+# Tests that use test.pl start here.
+BEGIN { $::additional_tests = 4 }
+
+ok(-0.0 eq "0", 'negative zero stringifies as 0');
+ok(!-0.0, "neg zero is boolean false");
+my $nz = -0.0;
+{ my $dummy = "$nz"; }
+ok(!$nz, 'previously stringified -0.0 is boolean false');
+$nz = -0.0;
+is sprintf("%+.f", - -$nz), sprintf("%+.f", - -$nz),
+ "negation does not coerce negative zeroes";