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