1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
#!./perl
sub foo1 {
'true1';
if ($_[0]) { 'true2'; }
}
sub foo2 {
'true1';
if ($_[0]) { return 'true2'; } else { return 'true3'; }
'true0';
}
sub foo3 {
'true1';
unless ($_[0]) { 'true2'; }
}
sub foo4 {
'true1';
unless ($_[0]) { 'true2'; } else { 'true3'; }
}
sub foo5 {
'true1';
'true2' if $_[0];
}
sub foo6 {
'true1';
'true2' unless $_[0];
}
print "1..36\n";
if (&foo1(0) eq '0') {print "ok 1\n";} else {print "not ok 1 $foo\n";}
if (&foo1(1) eq 'true2') {print "ok 2\n";} else {print "not ok 2\n";}
if (&foo2(0) eq 'true3') {print "ok 3\n";} else {print "not ok 3\n";}
if (&foo2(1) eq 'true2') {print "ok 4\n";} else {print "not ok 4\n";}
if (&foo3(0) eq 'true2') {print "ok 5\n";} else {print "not ok 5\n";}
if (&foo3(1) eq '1') {print "ok 6\n";} else {print "not ok 6\n";}
if (&foo4(0) eq 'true2') {print "ok 7\n";} else {print "not ok 7\n";}
if (&foo4(1) eq 'true3') {print "ok 8\n";} else {print "not ok 8\n";}
if (&foo5(0) eq '0') {print "ok 9\n";} else {print "not ok 9\n";}
if (&foo5(1) eq 'true2') {print "ok 10\n";} else {print "not ok 10\n";}
if (&foo6(0) eq 'true2') {print "ok 11\n";} else {print "not ok 11\n";}
if (&foo6(1) eq '1') {print "ok 12\n";} else {print "not ok 12 $x\n";}
# Now test to see that recursion works using a Fibonacci number generator
sub fib {
my($arg) = @_;
my($foo);
$level++;
if ($arg <= 2) {
$foo = 1;
}
else {
$foo = &fib($arg-1) + &fib($arg-2);
}
$level--;
$foo;
}
@good = (0,1,1,2,3,5,8,13,21,34,55,89);
for ($i = 1; $i <= 10; $i++) {
$foo = $i + 12;
if (&fib($i) == $good[$i]) {
print "ok $foo\n";
}
else {
print "not ok $foo\n";
}
}
sub ary1 {
(1,2,3);
}
print &ary1 eq 3 ? "ok 23\n" : "not ok 23\n";
print join(':',&ary1) eq '1:2:3' ? "ok 24\n" : "not ok 24\n";
sub ary2 {
do {
return (1,2,3);
(3,2,1);
};
0;
}
print &ary2 eq 3 ? "ok 25\n" : "not ok 25\n";
$x = join(':',&ary2);
print $x eq '1:2:3' ? "ok 26\n" : "not ok 26 $x\n";
sub somesub {
local($num,$P,$F,$L) = @_;
($p,$f,$l) = caller;
print "$p:$f:$l" eq "$P:$F:$L" ? "ok $num\n" : "not ok $num $p:$f:$l ne $P:$F:$L\n";
}
&somesub(27, 'main', __FILE__, __LINE__);
package foo;
&main'somesub(28, 'foo', __FILE__, __LINE__);
package main;
$i = 28;
open(FOO,">Cmd_subval.tmp");
print FOO "blah blah\n";
close FOO or die "Can't close Cmd_subval.tmp: $!";
&file_main(*F);
close F or die "Can't close: $!";
&info_main;
&file_package(*F);
close F or die "Can't close: $!";
&info_package;
unlink 'Cmd_subval.tmp';
sub file_main {
local(*F) = @_;
open(F, 'Cmd_subval.tmp') || die "can't open: $!\n";
$i++;
eof F ? print "not ok $i\n" : print "ok $i\n";
}
sub info_main {
local(*F);
open(F, 'Cmd_subval.tmp') || die "test: can't open: $!\n";
$i++;
eof F ? print "not ok $i\n" : print "ok $i\n";
&iseof(*F);
close F or die "Can't close: $!";
}
sub iseof {
local(*UNIQ) = @_;
$i++;
eof UNIQ ? print "(not ok $i)\n" : print "ok $i\n";
}
{package foo;
sub main'file_package {
local(*F) = @_;
open(F, 'Cmd_subval.tmp') || die "can't open: $!\n";
$main'i++;
eof F ? print "not ok $main'i\n" : print "ok $main'i\n";
}
sub main'info_package {
local(*F);
open(F, 'Cmd_subval.tmp') || die "can't open: $!\n";
$main'i++;
eof F ? print "not ok $main'i\n" : print "ok $main'i\n";
&iseof(*F);
}
sub iseof {
local(*UNIQ) = @_;
$main'i++;
eof UNIQ ? print "not ok $main'i\n" : print "ok $main'i\n";
}
}
sub autov { $_[0] = 23 };
my $href = {};
print keys %$href ? 'not ' : '', "ok 35\n";
autov($href->{b});
print join(':', %$href) eq 'b:23' ? '' : 'not ', "ok 36\n";
|
