8 # 2s complement assumption. Won't break test, just makes the internals of
9 # the SVs less interesting if were not on 2s complement system.
11 my $uv_maxm1 = ~0 ^ 1;
13 $uv_big = ($uv_big - 20000) | 1;
14 my ($iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big, $iv_small);
15 $iv_max = $uv_max; # Do copy, *then* divide
25 $iv_big = $iv_max - 3;
26 $iv_small = $iv_min + 2;
28 my $uv_bigi = $iv_big;
31 my @array = qw(perl rules);
33 my @raw, @upgraded, @utf8;
34 foreach ("\x{1F4A9}", chr(163), 'N') {
36 my $temp = $_ . chr 256;
38 push @upgraded, $temp;
40 next if utf8::upgrade($utf8) == length $_;
45 # Seems one needs to perform the maths on 'Inf' to get the NV correctly primed.
46 @FOO = ('s', 'N/A', 'a', 'NaN', -1, undef, 0, 1, 3.14, 1e37, 0.632120558, -.5,
47 'Inf'+1, '-Inf'-1, 0x0, 0x1, 0x5, 0xFFFFFFFF, $uv_max, $uv_maxm1,
48 $uv_big, $uv_bigi, $iv0, $iv1, $ivm1, $iv_min, $iv_max, $iv_big,
49 $iv_small, \$array[0], \$array[0], \$array[1], \$^X, @raw, @upgraded,
52 $expect = 7 * ($#FOO+2) * ($#FOO+1) + 6 * @raw + 6 * @utf8;
56 my ($test, $left, $threeway, $right, $result, $i, $j, $boolean) = @_;
57 $result = defined $result ? "'$result'" : 'undef';
58 print "not ok $test # ($left $threeway $right) gives: $result \$i=$i \$j=$j, $boolean disagrees\n";
62 for my $i (0..$#FOO) {
63 for my $j ($i..$#FOO) {
65 # Comparison routines may convert these internally, which would change
66 # what is used to determine the comparison on later runs. Hence copy
67 my ($i1, $i2, $i3, $i4, $i5, $i6, $i7, $i8, $i9, $i10,
68 $i11, $i12, $i13, $i14, $i15, $i16, $i17) =
69 ($FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i],
70 $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i],
71 $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i], $FOO[$i]);
72 my ($j1, $j2, $j3, $j4, $j5, $j6, $j7, $j8, $j9, $j10,
73 $j11, $j12, $j13, $j14, $j15, $j16, $j17) =
74 ($FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j],
75 $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j],
76 $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j], $FOO[$j]);
77 my $cmp = $i1 <=> $j1;
78 if (!defined($cmp) ? !($i2 < $j2)
79 : ($cmp == -1 && $i2 < $j2 ||
80 $cmp == 0 && !($i2 < $j2) ||
81 $cmp == 1 && !($i2 < $j2)))
86 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<');
89 if (!defined($cmp) ? !($i4 == $j4)
90 : ($cmp == -1 && !($i4 == $j4) ||
91 $cmp == 0 && $i4 == $j4 ||
92 $cmp == 1 && !($i4 == $j4)))
97 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '==');
100 if (!defined($cmp) ? !($i5 > $j5)
101 : ($cmp == -1 && !($i5 > $j5) ||
102 $cmp == 0 && !($i5 > $j5) ||
103 $cmp == 1 && ($i5 > $j5)))
108 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '>');
111 if (!defined($cmp) ? !($i6 >= $j6)
112 : ($cmp == -1 && !($i6 >= $j6) ||
113 $cmp == 0 && $i6 >= $j6 ||
114 $cmp == 1 && $i6 >= $j6))
119 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '>=');
122 # OK, so the docs are wrong it seems. NaN != NaN
123 if (!defined($cmp) ? ($i7 != $j7)
124 : ($cmp == -1 && $i7 != $j7 ||
125 $cmp == 0 && !($i7 != $j7) ||
126 $cmp == 1 && $i7 != $j7))
131 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '!=');
134 if (!defined($cmp) ? !($i8 <= $j8)
135 : ($cmp == -1 && $i8 <= $j8 ||
136 $cmp == 0 && $i8 <= $j8 ||
137 $cmp == 1 && !($i8 <= $j8)))
142 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<=');
145 my $pmc = $j16 <=> $i16; # cmp it in reverse
146 # Should give -ve of other answer, or undef for NaNs
147 # a + -a should be zero. not zero is truth. which avoids using ==
148 if (defined($cmp) ? !($cmp + $pmc) : !defined $pmc)
153 nok ($ok, $i3, '<=>', $j3, $cmp, $i, $j, '<=> transposed');
160 if ($cmp == -1 && $i10 lt $j10 ||
161 $cmp == 0 && !($i10 lt $j10) ||
162 $cmp == 1 && !($i10 lt $j10))
167 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'lt');
170 if ($cmp == -1 && !($i11 eq $j11) ||
171 $cmp == 0 && ($i11 eq $j11) ||
172 $cmp == 1 && !($i11 eq $j11))
177 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'eq');
180 if ($cmp == -1 && !($i12 gt $j12) ||
181 $cmp == 0 && !($i12 gt $j12) ||
182 $cmp == 1 && ($i12 gt $j12))
187 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'gt');
190 if ($cmp == -1 && $i13 le $j13 ||
191 $cmp == 0 && ($i13 le $j13) ||
192 $cmp == 1 && !($i13 le $j13))
197 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'le');
200 if ($cmp == -1 && ($i14 ne $j14) ||
201 $cmp == 0 && !($i14 ne $j14) ||
202 $cmp == 1 && ($i14 ne $j14))
207 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'ne');
210 if ($cmp == -1 && !($i15 ge $j15) ||
211 $cmp == 0 && ($i15 ge $j15) ||
212 $cmp == 1 && ($i15 ge $j15))
217 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'ge');
220 $pmc = $j17 cmp $i17; # cmp it in reverse
221 # Should give -ve of other answer
222 # a + -a should be zero. not zero is truth. which avoids using ==
228 nok ($ok, $i3, 'cmp', $j3, $cmp, $i, $j, 'cmp transposed');
233 # We know the answers for these. We can rely on the consistency checks above
234 # to test the other string comparisons.
236 while (my ($i, $v) = each @raw) {
237 # Copy, to avoid any inadvertent conversion
238 my ($raw, $cooked, $not);
240 $cooked = $upgraded[$i];
241 $not = $raw eq $cooked ? '' : 'not ';
242 printf "%sok %d # eq, chr %d\n", $not, ++$ok, ord $raw;
245 $cooked = $upgraded[$i];
246 $not = $raw ne $cooked ? 'not ' : '';
247 printf "%sok %d # ne, chr %d\n", $not, ++$ok, ord $raw;
250 $cooked = $upgraded[$i];
251 $not = (($raw cmp $cooked) == 0) ? '' : 'not ';
252 printf "%sok %d # cmp, chr %d\n", $not, ++$ok, ord $raw;
254 # And now, transposed.
256 $cooked = $upgraded[$i];
257 $not = $cooked eq $raw ? '' : 'not ';
258 printf "%sok %d # eq, chr %d\n", $not, ++$ok, ord $raw;
261 $cooked = $upgraded[$i];
262 $not = $cooked ne $raw ? 'not ' : '';
263 printf "%sok %d # ne, chr %d\n", $not, ++$ok, ord $raw;
266 $cooked = $upgraded[$i];
267 $not = (($cooked cmp $raw) == 0) ? '' : 'not ';
268 printf "%sok %d # cmp, chr %d\n", $not, ++$ok, ord $raw;
271 while (my ($i, $v) = each @utf8) {
272 # Copy, to avoid any inadvertent conversion
273 my ($raw, $cooked, $not);
276 $not = $raw eq $cooked ? 'not ' : '';
277 printf "%sok %d # eq vs octets, chr %d\n", $not, ++$ok, ord $raw;
281 $not = $raw ne $cooked ? '' : 'not ';
282 printf "%sok %d # ne vs octets, chr %d\n", $not, ++$ok, ord $raw;
286 $not = (($raw cmp $cooked) == 0) ? 'not ' : '';
287 printf "%sok %d # cmp vs octects, chr %d\n", $not, ++$ok, ord $raw;
289 # And now, transposed.
292 $not = $cooked eq $raw ? 'not ' : '';
293 printf "%sok %d # eq vs octets, chr %d\n", $not, ++$ok, ord $raw;
297 $not = $cooked ne $raw? '' : 'not ';
298 printf "%sok %d # ne vs octets, chr %d\n", $not, ++$ok, ord $raw;
302 $not = (($cooked cmp $raw) == 0) ? 'not ' : '';
303 printf "%sok %d # cmp vs octects, chr %d\n", $not, ++$ok, ord $raw;