chdir 't' if -d 't';
@INC = qw(. ../lib);
require "test.pl";
- plan(tests => 26);
+ plan(tests => 28);
}
use strict;
: $_[2];
}
-is(gcd(1147, 1271), 31, "gcd(1147, 1271)");
+is(gcd(1147, 1271), 31, "gcd(1147, 1271) == 31");
-is(gcd(1908, 2016), 36, "gcd(1908, 2016)");
+is(gcd(1908, 2016), 36, "gcd(1908, 2016) == 36");
-is(factorial(10), 3628800, "factorial(10)");
+is(factorial(10), 3628800, "factorial(10) == 3628800");
-is(factorial(factorial(3)), 720, "factorial(factorial(3))");
+is(factorial(factorial(3)), 720, "factorial(factorial(3)) == 720");
-is(fibonacci(10), 89, "fibonacci(10)");
+is(fibonacci(10), 89, "fibonacci(10) == 89");
-is(fibonacci(fibonacci(7)), 17711, "fibonacci(fibonacci(7))");
+is(fibonacci(fibonacci(7)), 17711, "fibonacci(fibonacci(7)) == 17711");
my @ack = qw(1 2 3 4 2 3 4 5 3 5 7 9 5 13 29 61);
for my $x (0..3) {
for my $y (0..3) {
my $a = ackermann($x, $y);
- is($a, shift(@ack), "ackermann($x, y)");
+ is($a, shift(@ack), "ackermann($x, $y) == $a");
}
}
is(sillysum(1000), 1000*1001/2, "recursive sum of 1..1000");
}
-
-
+# check ok for recursion depth > 65536
+{
+ my $r;
+ eval {
+ $r = runperl(
+ nolib => 1,
+ stderr => 1,
+ prog => q{$d=0; $e=1; sub c { ++$d; if ($d > 66000) { $e=0 } else { c(); c() unless $d % 32768 } --$d } c(); exit $e});
+ };
+ SKIP: {
+ skip("Out of memory -- increase your data/heap?", 2)
+ if $r =~ /Out of memory/i;
+ is($r, '', "64K deep recursion - no output expected");
+
+ if ($^O eq 'MacOS') {
+ ok(1, "$^O: \$? is unreliable");
+ } else {
+ is($?, 0, "64K deep recursion - no coredump expected");
+ }
+
+ }
+}