This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
Remove some empty lines in a code example
[perl5.git] / pod / perlsyn.pod
CommitLineData
a0d0e21e 1=head1 NAME
d74e8afc 2X<syntax>
a0d0e21e
LW
3
4perlsyn - Perl syntax
5
6=head1 DESCRIPTION
7
6014d0cb
MS
8A Perl program consists of a sequence of declarations and statements
9which run from the top to the bottom. Loops, subroutines and other
10control structures allow you to jump around within the code.
11
12Perl is a B<free-form> language, you can format and indent it however
13you like. Whitespace mostly serves to separate tokens, unlike
14languages like Python where it is an important part of the syntax.
15
16Many of Perl's syntactic elements are B<optional>. Rather than
110b9c83 17requiring you to put parentheses around every function call and
6014d0cb
MS
18declare every variable, you can often leave such explicit elements off
19and Perl will figure out what you meant. This is known as B<Do What I
20Mean>, abbreviated B<DWIM>. It allows programmers to be B<lazy> and to
110b9c83 21code in a style with which they are comfortable.
6014d0cb
MS
22
23Perl B<borrows syntax> and concepts from many languages: awk, sed, C,
24Bourne Shell, Smalltalk, Lisp and even English. Other
25languages have borrowed syntax from Perl, particularly its regular
26expression extensions. So if you have programmed in another language
27you will see familiar pieces in Perl. They often work the same, but
28see L<perltrap> for information about how they differ.
a0d0e21e 29
0b8d69e9 30=head2 Declarations
d74e8afc 31X<declaration> X<undef> X<undefined> X<uninitialized>
0b8d69e9 32
cf48932e
SF
33The only things you need to declare in Perl are report formats and
34subroutines (and sometimes not even subroutines). A variable holds
35the undefined value (C<undef>) until it has been assigned a defined
36value, which is anything other than C<undef>. When used as a number,
37C<undef> is treated as C<0>; when used as a string, it is treated as
38the empty string, C<"">; and when used as a reference that isn't being
39assigned to, it is treated as an error. If you enable warnings,
40you'll be notified of an uninitialized value whenever you treat
41C<undef> as a string or a number. Well, usually. Boolean contexts,
42such as:
7bd1983c
EM
43
44 my $a;
45 if ($a) {}
46
a6b1f6d8
RGS
47are exempt from warnings (because they care about truth rather than
48definedness). Operators such as C<++>, C<-->, C<+=>,
7bd1983c
EM
49C<-=>, and C<.=>, that operate on undefined left values such as:
50
51 my $a;
52 $a++;
53
54are also always exempt from such warnings.
0b8d69e9 55
a0d0e21e
LW
56A declaration can be put anywhere a statement can, but has no effect on
57the execution of the primary sequence of statements--declarations all
58take effect at compile time. Typically all the declarations are put at
54310121 59the beginning or the end of the script. However, if you're using
0b8d69e9
GS
60lexically-scoped private variables created with C<my()>, you'll
61have to make sure
4633a7c4 62your format or subroutine definition is within the same block scope
5f05dabc 63as the my if you expect to be able to access those private variables.
a0d0e21e 64
4633a7c4
LW
65Declaring a subroutine allows a subroutine name to be used as if it were a
66list operator from that point forward in the program. You can declare a
54310121 67subroutine without defining it by saying C<sub name>, thus:
d74e8afc 68X<subroutine, declaration>
a0d0e21e 69
54310121 70 sub myname;
a0d0e21e
LW
71 $me = myname $0 or die "can't get myname";
72
1f950eb4
JB
73Note that myname() functions as a list operator, not as a unary operator;
74so be careful to use C<or> instead of C<||> in this case. However, if
54310121 75you were to declare the subroutine as C<sub myname ($)>, then
02c45c47 76C<myname> would function as a unary operator, so either C<or> or
54310121 77C<||> would work.
a0d0e21e 78
4633a7c4
LW
79Subroutines declarations can also be loaded up with the C<require> statement
80or both loaded and imported into your namespace with a C<use> statement.
81See L<perlmod> for details on this.
a0d0e21e 82
4633a7c4
LW
83A statement sequence may contain declarations of lexically-scoped
84variables, but apart from declaring a variable name, the declaration acts
85like an ordinary statement, and is elaborated within the sequence of
86statements as if it were an ordinary statement. That means it actually
87has both compile-time and run-time effects.
a0d0e21e 88
6014d0cb 89=head2 Comments
d74e8afc 90X<comment> X<#>
6014d0cb
MS
91
92Text from a C<"#"> character until the end of the line is a comment,
93and is ignored. Exceptions include C<"#"> inside a string or regular
94expression.
95
6ec4bd10 96=head2 Simple Statements
d74e8afc 97X<statement> X<semicolon> X<expression> X<;>
a0d0e21e
LW
98
99The only kind of simple statement is an expression evaluated for its
100side effects. Every simple statement must be terminated with a
101semicolon, unless it is the final statement in a block, in which case
f386e492
AMS
102the semicolon is optional. (A semicolon is still encouraged if the
103block takes up more than one line, because you may eventually add
cf48932e
SF
104another line.) Note that there are some operators like C<eval {}> and
105C<do {}> that look like compound statements, but aren't (they're just
106TERMs in an expression), and thus need an explicit termination if used
107as the last item in a statement.
108
109=head2 Truth and Falsehood
d74e8afc 110X<truth> X<falsehood> X<true> X<false> X<!> X<not> X<negation> X<0>
cf48932e 111
f92061c1
AMS
112The number 0, the strings C<'0'> and C<''>, the empty list C<()>, and
113C<undef> are all false in a boolean context. All other values are true.
52ea55c9
SP
114Negation of a true value by C<!> or C<not> returns a special false value.
115When evaluated as a string it is treated as C<''>, but as a number, it
116is treated as 0.
cf48932e 117
cf48932e 118=head2 Statement Modifiers
d74e8afc
ITB
119X<statement modifier> X<modifier> X<if> X<unless> X<while>
120X<until> X<foreach> X<for>
a0d0e21e
LW
121
122Any simple statement may optionally be followed by a I<SINGLE> modifier,
123just before the terminating semicolon (or block ending). The possible
124modifiers are:
125
126 if EXPR
127 unless EXPR
128 while EXPR
129 until EXPR
cf48932e
SF
130 foreach LIST
131
132The C<EXPR> following the modifier is referred to as the "condition".
133Its truth or falsehood determines how the modifier will behave.
134
135C<if> executes the statement once I<if> and only if the condition is
136true. C<unless> is the opposite, it executes the statement I<unless>
137the condition is true (i.e., if the condition is false).
138
139 print "Basset hounds got long ears" if length $ear >= 10;
140 go_outside() and play() unless $is_raining;
141
142The C<foreach> modifier is an iterator: it executes the statement once
143for each item in the LIST (with C<$_> aliased to each item in turn).
144
145 print "Hello $_!\n" foreach qw(world Dolly nurse);
146
147C<while> repeats the statement I<while> the condition is true.
148C<until> does the opposite, it repeats the statement I<until> the
149condition is true (or while the condition is false):
150
151 # Both of these count from 0 to 10.
152 print $i++ while $i <= 10;
153 print $j++ until $j > 10;
154
155The C<while> and C<until> modifiers have the usual "C<while> loop"
156semantics (conditional evaluated first), except when applied to a
157C<do>-BLOCK (or to the deprecated C<do>-SUBROUTINE statement), in
158which case the block executes once before the conditional is
159evaluated. This is so that you can write loops like:
a0d0e21e
LW
160
161 do {
4633a7c4 162 $line = <STDIN>;
a0d0e21e 163 ...
4633a7c4 164 } until $line eq ".\n";
a0d0e21e 165
5a964f20
TC
166See L<perlfunc/do>. Note also that the loop control statements described
167later will I<NOT> work in this construct, because modifiers don't take
168loop labels. Sorry. You can always put another block inside of it
169(for C<next>) or around it (for C<last>) to do that sort of thing.
f86cebdf 170For C<next>, just double the braces:
d74e8afc 171X<next> X<last> X<redo>
5a964f20
TC
172
173 do {{
174 next if $x == $y;
175 # do something here
176 }} until $x++ > $z;
177
f86cebdf 178For C<last>, you have to be more elaborate:
d74e8afc 179X<last>
5a964f20
TC
180
181 LOOP: {
182 do {
183 last if $x = $y**2;
184 # do something here
185 } while $x++ <= $z;
186 }
a0d0e21e 187
457b36cb
MV
188B<NOTE:> The behaviour of a C<my> statement modified with a statement
189modifier conditional or loop construct (e.g. C<my $x if ...>) is
190B<undefined>. The value of the C<my> variable may be C<undef>, any
191previously assigned value, or possibly anything else. Don't rely on
192it. Future versions of perl might do something different from the
193version of perl you try it out on. Here be dragons.
d74e8afc 194X<my>
457b36cb 195
6ec4bd10 196=head2 Compound Statements
d74e8afc
ITB
197X<statement, compound> X<block> X<bracket, curly> X<curly bracket> X<brace>
198X<{> X<}> X<if> X<unless> X<while> X<until> X<foreach> X<for> X<continue>
a0d0e21e
LW
199
200In Perl, a sequence of statements that defines a scope is called a block.
201Sometimes a block is delimited by the file containing it (in the case
202of a required file, or the program as a whole), and sometimes a block
203is delimited by the extent of a string (in the case of an eval).
204
205But generally, a block is delimited by curly brackets, also known as braces.
206We will call this syntactic construct a BLOCK.
207
208The following compound statements may be used to control flow:
209
210 if (EXPR) BLOCK
211 if (EXPR) BLOCK else BLOCK
212 if (EXPR) BLOCK elsif (EXPR) BLOCK ... else BLOCK
213 LABEL while (EXPR) BLOCK
214 LABEL while (EXPR) BLOCK continue BLOCK
5ec6d87f
EA
215 LABEL until (EXPR) BLOCK
216 LABEL until (EXPR) BLOCK continue BLOCK
a0d0e21e 217 LABEL for (EXPR; EXPR; EXPR) BLOCK
748a9306 218 LABEL foreach VAR (LIST) BLOCK
b303ae78 219 LABEL foreach VAR (LIST) BLOCK continue BLOCK
a0d0e21e
LW
220 LABEL BLOCK continue BLOCK
221
222Note that, unlike C and Pascal, these are defined in terms of BLOCKs,
223not statements. This means that the curly brackets are I<required>--no
224dangling statements allowed. If you want to write conditionals without
225curly brackets there are several other ways to do it. The following
226all do the same thing:
227
228 if (!open(FOO)) { die "Can't open $FOO: $!"; }
229 die "Can't open $FOO: $!" unless open(FOO);
230 open(FOO) or die "Can't open $FOO: $!"; # FOO or bust!
231 open(FOO) ? 'hi mom' : die "Can't open $FOO: $!";
232 # a bit exotic, that last one
233
5f05dabc 234The C<if> statement is straightforward. Because BLOCKs are always
a0d0e21e
LW
235bounded by curly brackets, there is never any ambiguity about which
236C<if> an C<else> goes with. If you use C<unless> in place of C<if>,
237the sense of the test is reversed.
238
239The C<while> statement executes the block as long as the expression is
e17b7802 240L<true|/"Truth and Falsehood">.
1d5653dd
RGS
241The C<until> statement executes the block as long as the expression is
242false.
b78218b7
GS
243The LABEL is optional, and if present, consists of an identifier followed
244by a colon. The LABEL identifies the loop for the loop control
245statements C<next>, C<last>, and C<redo>.
246If the LABEL is omitted, the loop control statement
4633a7c4
LW
247refers to the innermost enclosing loop. This may include dynamically
248looking back your call-stack at run time to find the LABEL. Such
9f1b1f2d 249desperate behavior triggers a warning if you use the C<use warnings>
a2293a43 250pragma or the B<-w> flag.
4633a7c4
LW
251
252If there is a C<continue> BLOCK, it is always executed just before the
6ec4bd10
MS
253conditional is about to be evaluated again. Thus it can be used to
254increment a loop variable, even when the loop has been continued via
255the C<next> statement.
4633a7c4
LW
256
257=head2 Loop Control
d74e8afc 258X<loop control> X<loop, control> X<next> X<last> X<redo> X<continue>
4633a7c4 259
6ec4bd10 260The C<next> command starts the next iteration of the loop:
4633a7c4
LW
261
262 LINE: while (<STDIN>) {
263 next LINE if /^#/; # discard comments
264 ...
265 }
266
6ec4bd10 267The C<last> command immediately exits the loop in question. The
4633a7c4
LW
268C<continue> block, if any, is not executed:
269
270 LINE: while (<STDIN>) {
271 last LINE if /^$/; # exit when done with header
272 ...
273 }
274
275The C<redo> command restarts the loop block without evaluating the
276conditional again. The C<continue> block, if any, is I<not> executed.
277This command is normally used by programs that want to lie to themselves
278about what was just input.
279
280For example, when processing a file like F</etc/termcap>.
281If your input lines might end in backslashes to indicate continuation, you
282want to skip ahead and get the next record.
283
284 while (<>) {
285 chomp;
54310121 286 if (s/\\$//) {
287 $_ .= <>;
4633a7c4
LW
288 redo unless eof();
289 }
290 # now process $_
54310121 291 }
4633a7c4
LW
292
293which is Perl short-hand for the more explicitly written version:
294
54310121 295 LINE: while (defined($line = <ARGV>)) {
4633a7c4 296 chomp($line);
54310121 297 if ($line =~ s/\\$//) {
298 $line .= <ARGV>;
4633a7c4
LW
299 redo LINE unless eof(); # not eof(ARGV)!
300 }
301 # now process $line
54310121 302 }
4633a7c4 303
36e7a065
AMS
304Note that if there were a C<continue> block on the above code, it would
305get executed only on lines discarded by the regex (since redo skips the
306continue block). A continue block is often used to reset line counters
307or C<?pat?> one-time matches:
4633a7c4 308
5a964f20
TC
309 # inspired by :1,$g/fred/s//WILMA/
310 while (<>) {
311 ?(fred)? && s//WILMA $1 WILMA/;
312 ?(barney)? && s//BETTY $1 BETTY/;
313 ?(homer)? && s//MARGE $1 MARGE/;
314 } continue {
315 print "$ARGV $.: $_";
316 close ARGV if eof(); # reset $.
317 reset if eof(); # reset ?pat?
4633a7c4
LW
318 }
319
a0d0e21e
LW
320If the word C<while> is replaced by the word C<until>, the sense of the
321test is reversed, but the conditional is still tested before the first
322iteration.
323
5a964f20
TC
324The loop control statements don't work in an C<if> or C<unless>, since
325they aren't loops. You can double the braces to make them such, though.
326
327 if (/pattern/) {{
7bd1983c
EM
328 last if /fred/;
329 next if /barney/; # same effect as "last", but doesn't document as well
330 # do something here
5a964f20
TC
331 }}
332
7bd1983c 333This is caused by the fact that a block by itself acts as a loop that
27cec4bd 334executes once, see L<"Basic BLOCKs">.
7bd1983c 335
5b23ba8b
MG
336The form C<while/if BLOCK BLOCK>, available in Perl 4, is no longer
337available. Replace any occurrence of C<if BLOCK> by C<if (do BLOCK)>.
4633a7c4 338
cb1a09d0 339=head2 For Loops
d74e8afc 340X<for> X<foreach>
a0d0e21e 341
b78df5de 342Perl's C-style C<for> loop works like the corresponding C<while> loop;
cb1a09d0 343that means that this:
a0d0e21e
LW
344
345 for ($i = 1; $i < 10; $i++) {
346 ...
347 }
348
cb1a09d0 349is the same as this:
a0d0e21e
LW
350
351 $i = 1;
352 while ($i < 10) {
353 ...
354 } continue {
355 $i++;
356 }
357
b78df5de
JA
358There is one minor difference: if variables are declared with C<my>
359in the initialization section of the C<for>, the lexical scope of
360those variables is exactly the C<for> loop (the body of the loop
361and the control sections).
d74e8afc 362X<my>
55497cff 363
cb1a09d0
AD
364Besides the normal array index looping, C<for> can lend itself
365to many other interesting applications. Here's one that avoids the
54310121 366problem you get into if you explicitly test for end-of-file on
367an interactive file descriptor causing your program to appear to
cb1a09d0 368hang.
d74e8afc 369X<eof> X<end-of-file> X<end of file>
cb1a09d0
AD
370
371 $on_a_tty = -t STDIN && -t STDOUT;
372 sub prompt { print "yes? " if $on_a_tty }
373 for ( prompt(); <STDIN>; prompt() ) {
374 # do something
54310121 375 }
cb1a09d0 376
00cb5da1
CW
377Using C<readline> (or the operator form, C<< <EXPR> >>) as the
378conditional of a C<for> loop is shorthand for the following. This
379behaviour is the same as a C<while> loop conditional.
d74e8afc 380X<readline> X<< <> >>
00cb5da1
CW
381
382 for ( prompt(); defined( $_ = <STDIN> ); prompt() ) {
383 # do something
384 }
385
cb1a09d0 386=head2 Foreach Loops
d74e8afc 387X<for> X<foreach>
cb1a09d0 388
4633a7c4 389The C<foreach> loop iterates over a normal list value and sets the
55497cff 390variable VAR to be each element of the list in turn. If the variable
391is preceded with the keyword C<my>, then it is lexically scoped, and
392is therefore visible only within the loop. Otherwise, the variable is
393implicitly local to the loop and regains its former value upon exiting
394the loop. If the variable was previously declared with C<my>, it uses
395that variable instead of the global one, but it's still localized to
5c502d37
MV
396the loop. This implicit localisation occurs I<only> in a C<foreach>
397loop.
d74e8afc 398X<my> X<local>
4633a7c4
LW
399
400The C<foreach> keyword is actually a synonym for the C<for> keyword, so
5a964f20
TC
401you can use C<foreach> for readability or C<for> for brevity. (Or because
402the Bourne shell is more familiar to you than I<csh>, so writing C<for>
f86cebdf 403comes more naturally.) If VAR is omitted, C<$_> is set to each value.
d74e8afc 404X<$_>
c5674021
PDF
405
406If any element of LIST is an lvalue, you can modify it by modifying
407VAR inside the loop. Conversely, if any element of LIST is NOT an
408lvalue, any attempt to modify that element will fail. In other words,
409the C<foreach> loop index variable is an implicit alias for each item
410in the list that you're looping over.
d74e8afc 411X<alias>
302617ea
MG
412
413If any part of LIST is an array, C<foreach> will get very confused if
414you add or remove elements within the loop body, for example with
415C<splice>. So don't do that.
d74e8afc 416X<splice>
302617ea
MG
417
418C<foreach> probably won't do what you expect if VAR is a tied or other
419special variable. Don't do that either.
4633a7c4 420
748a9306 421Examples:
a0d0e21e 422
4633a7c4 423 for (@ary) { s/foo/bar/ }
a0d0e21e 424
96f2dc66 425 for my $elem (@elements) {
a0d0e21e
LW
426 $elem *= 2;
427 }
428
4633a7c4
LW
429 for $count (10,9,8,7,6,5,4,3,2,1,'BOOM') {
430 print $count, "\n"; sleep(1);
a0d0e21e
LW
431 }
432
433 for (1..15) { print "Merry Christmas\n"; }
434
4633a7c4 435 foreach $item (split(/:[\\\n:]*/, $ENV{TERMCAP})) {
a0d0e21e
LW
436 print "Item: $item\n";
437 }
438
4633a7c4
LW
439Here's how a C programmer might code up a particular algorithm in Perl:
440
55497cff 441 for (my $i = 0; $i < @ary1; $i++) {
442 for (my $j = 0; $j < @ary2; $j++) {
4633a7c4
LW
443 if ($ary1[$i] > $ary2[$j]) {
444 last; # can't go to outer :-(
445 }
446 $ary1[$i] += $ary2[$j];
447 }
cb1a09d0 448 # this is where that last takes me
4633a7c4
LW
449 }
450
184e9718 451Whereas here's how a Perl programmer more comfortable with the idiom might
cb1a09d0 452do it:
4633a7c4 453
96f2dc66
GS
454 OUTER: for my $wid (@ary1) {
455 INNER: for my $jet (@ary2) {
cb1a09d0
AD
456 next OUTER if $wid > $jet;
457 $wid += $jet;
54310121 458 }
459 }
4633a7c4 460
cb1a09d0
AD
461See how much easier this is? It's cleaner, safer, and faster. It's
462cleaner because it's less noisy. It's safer because if code gets added
c07a80fd 463between the inner and outer loops later on, the new code won't be
5f05dabc 464accidentally executed. The C<next> explicitly iterates the other loop
c07a80fd 465rather than merely terminating the inner one. And it's faster because
466Perl executes a C<foreach> statement more rapidly than it would the
467equivalent C<for> loop.
4633a7c4 468
0d863452
RH
469=head2 Basic BLOCKs
470X<block>
4633a7c4 471
55497cff 472A BLOCK by itself (labeled or not) is semantically equivalent to a
473loop that executes once. Thus you can use any of the loop control
474statements in it to leave or restart the block. (Note that this is
475I<NOT> true in C<eval{}>, C<sub{}>, or contrary to popular belief
476C<do{}> blocks, which do I<NOT> count as loops.) The C<continue>
477block is optional.
4633a7c4 478
27cec4bd 479The BLOCK construct can be used to emulate case structures.
a0d0e21e
LW
480
481 SWITCH: {
482 if (/^abc/) { $abc = 1; last SWITCH; }
483 if (/^def/) { $def = 1; last SWITCH; }
484 if (/^xyz/) { $xyz = 1; last SWITCH; }
485 $nothing = 1;
486 }
487
0d863452
RH
488Such constructs are quite frequently used, because older versions
489of Perl had no official C<switch> statement.
83df6a1d 490
0d863452
RH
491=head2 Switch statements
492X<switch> X<case> X<given> X<when> X<default>
83df6a1d 493
27cec4bd 494Starting from Perl 5.10, you can say
83df6a1d 495
27cec4bd 496 use feature "switch";
a0d0e21e 497
0d863452
RH
498which enables a switch feature that is closely based on the
499Perl 6 proposal.
500
501The keywords C<given> and C<when> are analogous
502to C<switch> and C<case> in other languages, so the code
503above could be written as
504
27cec4bd
RGS
505 given($_) {
506 when (/^abc/) { $abc = 1; }
507 when (/^def/) { $def = 1; }
508 when (/^xyz/) { $xyz = 1; }
509 default { $nothing = 1; }
a0d0e21e
LW
510 }
511
0d863452 512This construct is very flexible and powerful. For example:
a0d0e21e 513
4b7b0ae4
RH
514 use feature ":5.10";
515 given($foo) {
516 when (undef) {
517 say '$foo is undefined';
518 }
4b7b0ae4
RH
519 when ("foo") {
520 say '$foo is the string "foo"';
521 }
4b7b0ae4
RH
522 when ([1,3,5,7,9]) {
523 say '$foo is an odd digit';
524 continue; # Fall through
9f435386 525 }
4b7b0ae4
RH
526 when ($_ < 100) {
527 say '$foo is numerically less than 100';
528 }
4b7b0ae4 529 when (\&complicated_check) {
f92e1a16 530 say 'a complicated check for $foo is true';
4b7b0ae4 531 }
4b7b0ae4
RH
532 default {
533 die q(I don't know what to do with $foo);
534 }
535 }
536
537C<given(EXPR)> will assign the value of EXPR to C<$_>
538within the lexical scope of the block, so it's similar to
539
540 do { my $_ = EXPR; ... }
541
542except that the block is automatically broken out of by a
543successful C<when> or an explicit C<break>.
544
545Most of the power comes from implicit smart matching:
a0d0e21e 546
4b7b0ae4 547 when($foo)
a0d0e21e 548
0d863452 549is exactly equivalent to
a0d0e21e 550
4b7b0ae4 551 when($_ ~~ $foo)
a0d0e21e 552
8c02634d
RGS
553In fact C<when(EXPR)> is treated as an implicit smart match most of the
554time. The exceptions are that when EXPR is:
0d863452
RH
555
556=over 4
557
d991eed6 558=item *
0d863452
RH
559
560a subroutine or method call
561
d991eed6 562=item *
0d863452
RH
563
564a regular expression match, i.e. C</REGEX/> or C<$foo =~ /REGEX/>,
f92e1a16 565or a negated regular expression match (C<!/REGEX/> or C<$foo !~ /REGEX/>).
0d863452 566
d991eed6 567=item *
0d863452 568
4b7b0ae4
RH
569a comparison such as C<$_ E<lt> 10> or C<$x eq "abc">
570(or of course C<$_ ~~ $c>)
0d863452 571
d991eed6 572=item *
0d863452
RH
573
574C<defined(...)>, C<exists(...)>, or C<eof(...)>
575
d991eed6 576=item *
4633a7c4 577
f92e1a16 578a negated expression C<!(...)> or C<not (...)>, or a logical
0d863452 579exclusive-or C<(...) xor (...)>.
cb1a09d0 580
516817b4
RGS
581=item *
582
583a filetest operator, with the exception of C<-s>, C<-M>, C<-A>, and C<-C>,
584that return numerical values, not boolean ones.
585
202d7cbd
RGS
586=item *
587
588the C<...> flip-flop operator (but B<not> the two-dot version C<..>, which
589is used to construct and test against numerical or string ranges).
590
0d863452
RH
591=back
592
f92e1a16
RGS
593In those cases the value of EXPR is used directly as a boolean.
594
0d863452
RH
595Furthermore:
596
597=over 4
598
f92e1a16 599=item *
0d863452
RH
600
601If EXPR is C<... && ...> or C<... and ...>, the test
602is applied recursively to both arguments. If I<both>
603arguments pass the test, then the argument is treated
604as boolean.
605
f92e1a16 606=item *
0d863452 607
f92e1a16 608If EXPR is C<... || ...>, C<... // ...> or C<... or ...>, the test
0d863452
RH
609is applied recursively to the first argument.
610
611=back
612
613These rules look complicated, but usually they will do what
614you want. For example you could write:
615
f849b90f 616 when (/^\d+$/ && $_ < 75) { ... }
0d863452 617
4b7b0ae4
RH
618Another useful shortcut is that, if you use a literal array
619or hash as the argument to C<when>, it is turned into a
620reference. So C<given(@foo)> is the same as C<given(\@foo)>,
621for example.
622
0d863452
RH
623C<default> behaves exactly like C<when(1 == 1)>, which is
624to say that it always matches.
625
626See L</"Smart matching in detail"> for more information
627on smart matching.
628
4b7b0ae4
RH
629=head3 Breaking out
630
631You can use the C<break> keyword to break out of the enclosing
632C<given> block. Every C<when> block is implicitly ended with
633a C<break>.
634
0d863452
RH
635=head3 Fall-through
636
637You can use the C<continue> keyword to fall through from one
638case to the next:
639
27cec4bd 640 given($foo) {
4b7b0ae4
RH
641 when (/x/) { say '$foo contains an x'; continue }
642 when (/y/) { say '$foo contains a y' }
02e7afe2 643 default { say '$foo does not contain a y' }
27cec4bd 644 }
0d863452
RH
645
646=head3 Switching in a loop
647
648Instead of using C<given()>, you can use a C<foreach()> loop.
649For example, here's one way to count how many times a particular
650string occurs in an array:
651
27cec4bd
RGS
652 my $count = 0;
653 for (@array) {
654 when ("foo") { ++$count }
5a964f20 655 }
27cec4bd 656 print "\@array contains $count copies of 'foo'\n";
0d863452
RH
657
658On exit from the C<when> block, there is an implicit C<next>.
659You can override that with an explicit C<last> if you're only
660interested in the first match.
661
662This doesn't work if you explicitly specify a loop variable,
663as in C<for $item (@array)>. You have to use the default
664variable C<$_>. (You can use C<for my $_ (@array)>.)
665
666=head3 Smart matching in detail
667
202d7cbd
RGS
668The behaviour of a smart match depends on what type of thing its arguments
669are. The behaviour is determined by the following table: the first row
670that applies determines the match behaviour (which is thus mostly
671determined by the type of the right operand). Note that the smart match
672implicitly dereferences any hash or array ref, so the "Hash" and "Array"
673entries apply in those cases.
4b7b0ae4
RH
674
675 $a $b Type of Match Implied Matching Code
676 ====== ===== ===================== =============
202d7cbd
RGS
677 Any undef undefined !defined $a
678
2da5311b 679 Any Object invokes ~~ overloading on $object, or dies
4b7b0ae4 680
168ff818
RGS
681 Hash CodeRef sub truth for each key[1] !grep { !$b->($_) } keys %$a
682 Array CodeRef sub truth for each elt[1] !grep { !$b->($_) } @$a
683 Any CodeRef scalar sub truth $b->($a)
4b7b0ae4
RH
684
685 Hash Hash hash keys identical [sort keys %$a]~~[sort keys %$b]
c3886e8b 686 Array Hash hash slice existence grep { exists $b->{$_} } @$a
07edf497 687 Regex Hash hash key grep grep /$a/, keys %$b
202d7cbd
RGS
688 undef Hash always false (undef can't be a key)
689 Any Hash hash entry existence exists $b->{$a}
690
c3886e8b 691 Hash Array hash slice existence grep { exists $a->{$_} } @$b
168ff818 692 Array Array arrays are comparable[2]
c3886e8b
RGS
693 Regex Array array grep grep /$a/, @$b
694 undef Array array contains undef grep !defined, @$b
168ff818 695 Any Array match against an array element[3]
c3886e8b 696 grep $a ~~ $_, @$b
4b7b0ae4 697
202d7cbd 698 Hash Regex hash key grep grep /$b/, keys %$a
4b7b0ae4 699 Array Regex array grep grep /$b/, @$a
4b7b0ae4 700 Any Regex pattern match $a =~ /$b/
202d7cbd 701
168ff818 702 undef Range[4] always false
da9849c5 703 Any Range[4] in range
202d7cbd 704
4b7b0ae4 705 Any Num numeric equality $a == $b
33ed63a2 706 Num numish[5] numeric equality $a == $b
4b7b0ae4
RH
707 Any Any string equality $a eq $b
708
709
07edf497 710 1 - empty hashes or arrays will match.
168ff818
RGS
711 2 - that is, each element matches the element of same index in the other
712 array. [3]
713 3 - If a circular reference is found, we fall back to referential equality.
714 4 - a range is written EXPR..EXPR (using the C<..> range operator, but
202d7cbd 715 NOT the three-dot version C<...>, which will be treated as a boolean
da9849c5
RGS
716 operator). Numeric ranges will use numeric comparison: that is,
717 "4.5 ~~ 3..5" will be true.
168ff818 718 5 - either a real number, or a string that looks like a number
0d863452 719
4b7b0ae4
RH
720The "matching code" doesn't represent the I<real> matching code,
721of course: it's just there to explain the intended meaning. Unlike
722C<grep>, the smart match operator will short-circuit whenever it can.
5a964f20 723
0d863452 724=head3 Custom matching via overloading
5a964f20 725
0d863452 726You can change the way that an object is matched by overloading
4b7b0ae4 727the C<~~> operator. This trumps the usual smart match semantics.
2da5311b
RGS
728See L<overload>. Since smart matching dispatch is driven by the
729right hand side argument, overloading applies only when the object
730is on the right of C<~~>.
5a964f20 731
202d7cbd
RGS
732It should be noted that C<~~> will refuse to work on objects that
733don't overload it (in order to avoid relying on the object's
2da5311b 734underlying structure).
202d7cbd 735
54a85b95
RH
736=head3 Differences from Perl 6
737
738The Perl 5 smart match and C<given>/C<when> constructs are not
739absolutely identical to their Perl 6 analogues. The most visible
740difference is that, in Perl 5, parentheses are required around
741the argument to C<given()> and C<when()>. Parentheses in Perl 6
742are always optional in a control construct such as C<if()>,
743C<while()>, or C<when()>; they can't be made optional in Perl
7445 without a great deal of potential confusion, because Perl 5
745would parse the expression
746
747 given $foo {
748 ...
749 }
750
751as though the argument to C<given> were an element of the hash
752C<%foo>, interpreting the braces as hash-element syntax.
753
ccc668fa
RGS
754The table of smart matches is not identical to that proposed by the
755Perl 6 specification, mainly due to the differences between Perl 6's
756and Perl 5's data models.
54a85b95
RH
757
758In Perl 6, C<when()> will always do an implicit smart match
759with its argument, whilst it is convenient in Perl 5 to
760suppress this implicit smart match in certain situations,
761as documented above. (The difference is largely because Perl 5
762does not, even internally, have a boolean type.)
763
4633a7c4 764=head2 Goto
d74e8afc 765X<goto>
4633a7c4 766
19799a22
GS
767Although not for the faint of heart, Perl does support a C<goto>
768statement. There are three forms: C<goto>-LABEL, C<goto>-EXPR, and
769C<goto>-&NAME. A loop's LABEL is not actually a valid target for
770a C<goto>; it's just the name of the loop.
4633a7c4 771
f86cebdf 772The C<goto>-LABEL form finds the statement labeled with LABEL and resumes
4633a7c4 773execution there. It may not be used to go into any construct that
f86cebdf 774requires initialization, such as a subroutine or a C<foreach> loop. It
4633a7c4
LW
775also can't be used to go into a construct that is optimized away. It
776can be used to go almost anywhere else within the dynamic scope,
777including out of subroutines, but it's usually better to use some other
f86cebdf
GS
778construct such as C<last> or C<die>. The author of Perl has never felt the
779need to use this form of C<goto> (in Perl, that is--C is another matter).
4633a7c4 780
f86cebdf
GS
781The C<goto>-EXPR form expects a label name, whose scope will be resolved
782dynamically. This allows for computed C<goto>s per FORTRAN, but isn't
4633a7c4
LW
783necessarily recommended if you're optimizing for maintainability:
784
96f2dc66 785 goto(("FOO", "BAR", "GLARCH")[$i]);
4633a7c4 786
f86cebdf 787The C<goto>-&NAME form is highly magical, and substitutes a call to the
4633a7c4 788named subroutine for the currently running subroutine. This is used by
f86cebdf 789C<AUTOLOAD()> subroutines that wish to load another subroutine and then
4633a7c4 790pretend that the other subroutine had been called in the first place
f86cebdf
GS
791(except that any modifications to C<@_> in the current subroutine are
792propagated to the other subroutine.) After the C<goto>, not even C<caller()>
4633a7c4
LW
793will be able to tell that this routine was called first.
794
c07a80fd 795In almost all cases like this, it's usually a far, far better idea to use the
796structured control flow mechanisms of C<next>, C<last>, or C<redo> instead of
4633a7c4
LW
797resorting to a C<goto>. For certain applications, the catch and throw pair of
798C<eval{}> and die() for exception processing can also be a prudent approach.
cb1a09d0
AD
799
800=head2 PODs: Embedded Documentation
d74e8afc 801X<POD> X<documentation>
cb1a09d0
AD
802
803Perl has a mechanism for intermixing documentation with source code.
c07a80fd 804While it's expecting the beginning of a new statement, if the compiler
cb1a09d0
AD
805encounters a line that begins with an equal sign and a word, like this
806
807 =head1 Here There Be Pods!
808
809Then that text and all remaining text up through and including a line
810beginning with C<=cut> will be ignored. The format of the intervening
54310121 811text is described in L<perlpod>.
cb1a09d0
AD
812
813This allows you to intermix your source code
814and your documentation text freely, as in
815
816 =item snazzle($)
817
54310121 818 The snazzle() function will behave in the most spectacular
cb1a09d0
AD
819 form that you can possibly imagine, not even excepting
820 cybernetic pyrotechnics.
821
822 =cut back to the compiler, nuff of this pod stuff!
823
824 sub snazzle($) {
825 my $thingie = shift;
826 .........
54310121 827 }
cb1a09d0 828
54310121 829Note that pod translators should look at only paragraphs beginning
184e9718 830with a pod directive (it makes parsing easier), whereas the compiler
54310121 831actually knows to look for pod escapes even in the middle of a
cb1a09d0
AD
832paragraph. This means that the following secret stuff will be
833ignored by both the compiler and the translators.
834
835 $a=3;
836 =secret stuff
837 warn "Neither POD nor CODE!?"
838 =cut back
839 print "got $a\n";
840
f86cebdf 841You probably shouldn't rely upon the C<warn()> being podded out forever.
cb1a09d0
AD
842Not all pod translators are well-behaved in this regard, and perhaps
843the compiler will become pickier.
774d564b 844
845One may also use pod directives to quickly comment out a section
846of code.
847
848=head2 Plain Old Comments (Not!)
d74e8afc 849X<comment> X<line> X<#> X<preprocessor> X<eval>
774d564b 850
6ec4bd10 851Perl can process line directives, much like the C preprocessor. Using
5a964f20 852this, one can control Perl's idea of filenames and line numbers in
774d564b 853error or warning messages (especially for strings that are processed
f86cebdf 854with C<eval()>). The syntax for this mechanism is the same as for most
774d564b 855C preprocessors: it matches the regular expression
6ec4bd10
MS
856
857 # example: '# line 42 "new_filename.plx"'
82d4537c 858 /^\# \s*
6ec4bd10 859 line \s+ (\d+) \s*
7b6e93a8 860 (?:\s("?)([^"]+)\2)? \s*
6ec4bd10
MS
861 $/x
862
7b6e93a8
CW
863with C<$1> being the line number for the next line, and C<$3> being
864the optional filename (specified with or without quotes).
774d564b 865
003183f2
GS
866There is a fairly obvious gotcha included with the line directive:
867Debuggers and profilers will only show the last source line to appear
868at a particular line number in a given file. Care should be taken not
869to cause line number collisions in code you'd like to debug later.
870
774d564b 871Here are some examples that you should be able to type into your command
872shell:
873
874 % perl
875 # line 200 "bzzzt"
876 # the `#' on the previous line must be the first char on line
877 die 'foo';
878 __END__
879 foo at bzzzt line 201.
54310121 880
774d564b 881 % perl
882 # line 200 "bzzzt"
883 eval qq[\n#line 2001 ""\ndie 'foo']; print $@;
884 __END__
885 foo at - line 2001.
54310121 886
774d564b 887 % perl
888 eval qq[\n#line 200 "foo bar"\ndie 'foo']; print $@;
889 __END__
890 foo at foo bar line 200.
54310121 891
774d564b 892 % perl
893 # line 345 "goop"
894 eval "\n#line " . __LINE__ . ' "' . __FILE__ ."\"\ndie 'foo'";
895 print $@;
896 __END__
897 foo at goop line 345.
898
899=cut