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 serves mostly to separate tokens, unlike 14languages like Python where it is an important part of the syntax, 15or Fortran where it is immaterial. 16 17Many of Perl's syntactic elements are B<optional>. Rather than 18requiring you to put parentheses around every function call and 19declare every variable, you can often leave such explicit elements off 20and Perl will figure out what you meant. This is known as B<Do What I 21Mean>, abbreviated B<DWIM>. It allows programmers to be B<lazy> and to 22code in a style with which they are comfortable. 23 24Perl B<borrows syntax> and concepts from many languages: awk, sed, C, 25Bourne Shell, Smalltalk, Lisp and even English. Other 26languages have borrowed syntax from Perl, particularly its regular 27expression extensions. So if you have programmed in another language 28you will see familiar pieces in Perl. They often work the same, but 29see L<perltrap> for information about how they differ. 30 31=head2 Declarations 32X<declaration> X<undef> X<undefined> X<uninitialized> 33 34The only things you need to declare in Perl are report formats and 35subroutines (and sometimes not even subroutines). A scalar variable holds 36the undefined value (C<undef>) until it has been assigned a defined 37value, which is anything other than C<undef>. When used as a number, 38C<undef> is treated as C<0>; when used as a string, it is treated as 39the empty string, C<"">; and when used as a reference that isn't being 40assigned to, it is treated as an error. If you enable warnings, 41you'll be notified of an uninitialized value whenever you treat 42C<undef> as a string or a number. Well, usually. Boolean contexts, 43such as: 44 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 variables such as: 50 51 undef $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. All declarations are typically put at 59the beginning or the end of the script. However, if you're using 60lexically-scoped private variables created with C<my()>, 61C<state()>, or C<our()>, you'll have 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 73A bare declaration like that declares the function to be a list operator, 74not a unary operator, so you have to be careful to use parentheses (or 75C<or> instead of C<||>.) The C<||> operator binds too tightly to use after 76list operators; it becomes part of the last element. You can always use 77parentheses around the list operators arguments to turn the list operator 78back into something that behaves more like a function call. Alternatively, 79you can use the prototype C<($)> to turn the subroutine into a unary 80operator: 81 82 sub myname ($); 83 $me = myname $0 || die "can't get myname"; 84 85That now parses as you'd expect, but you still ought to get in the habit of 86using parentheses in that situation. For more on prototypes, see 87L<perlsub>. 88 89Subroutines declarations can also be loaded up with the C<require> statement 90or both loaded and imported into your namespace with a C<use> statement. 91See L<perlmod> for details on this. 92 93A statement sequence may contain declarations of lexically-scoped 94variables, but apart from declaring a variable name, the declaration acts 95like an ordinary statement, and is elaborated within the sequence of 96statements as if it were an ordinary statement. That means it actually 97has both compile-time and run-time effects. 98 99=head2 Comments 100X<comment> X<#> 101 102Text from a C<"#"> character until the end of the line is a comment, 103and is ignored. Exceptions include C<"#"> inside a string or regular 104expression. 105 106=head2 Simple Statements 107X<statement> X<semicolon> X<expression> X<;> 108 109The only kind of simple statement is an expression evaluated for its 110side-effects. Every simple statement must be terminated with a 111semicolon, unless it is the final statement in a block, in which case 112the semicolon is optional. But put the semicolon in anyway if the 113block takes up more than one line, because you may eventually add 114another line. Note that there are operators like C<eval {}>, C<sub {}>, and 115C<do {}> that I<look> like compound statements, but aren't--they're just 116TERMs in an expression--and thus need an explicit termination when used 117as the last item in a statement. 118 119=head2 Statement Modifiers 120X<statement modifier> X<modifier> X<if> X<unless> X<while> 121X<until> X<when> X<foreach> X<for> 122 123Any simple statement may optionally be followed by a I<SINGLE> modifier, 124just before the terminating semicolon (or block ending). The possible 125modifiers are: 126 127 if EXPR 128 unless EXPR 129 while EXPR 130 until EXPR 131 for LIST 132 foreach LIST 133 when EXPR 134 135The C<EXPR> following the modifier is referred to as the "condition". 136Its truth or falsehood determines how the modifier will behave. 137 138C<if> executes the statement once I<if> and only if the condition is 139true. C<unless> is the opposite, it executes the statement I<unless> 140the condition is true (that is, if the condition is false). See 141L<perldata/Scalar values> for definitions of true and false. 142 143 print "Basset hounds got long ears" if length $ear >= 10; 144 go_outside() and play() unless $is_raining; 145 146The C<for(each)> modifier is an iterator: it executes the statement once 147for each item in the LIST (with C<$_> aliased to each item in turn). 148There is no syntax to specify a C-style for loop or a lexically scoped 149iteration variable in this form. 150 151 print "Hello $_!\n" for qw(world Dolly nurse); 152 153C<while> repeats the statement I<while> the condition is true. 154Postfix C<while> has the same magic treatment of some kinds of condition 155that prefix C<while> has. 156C<until> does the opposite, it repeats the statement I<until> the 157condition is true (or while the condition is false): 158 159 # Both of these count from 0 to 10. 160 print $i++ while $i <= 10; 161 print $j++ until $j > 10; 162 163The C<while> and C<until> modifiers have the usual "C<while> loop" 164semantics (conditional evaluated first), except when applied to a 165C<do>-BLOCK (or to the Perl4 C<do>-SUBROUTINE statement), in 166which case the block executes once before the conditional is 167evaluated. 168 169This is so that you can write loops like: 170 171 do { 172 $line = <STDIN>; 173 ... 174 } until !defined($line) || $line eq ".\n" 175 176See L<perlfunc/do>. Note also that the loop control statements described 177later will I<NOT> work in this construct, because modifiers don't take 178loop labels. Sorry. You can always put another block inside of it 179(for C<next>/C<redo>) or around it (for C<last>) to do that sort of thing. 180X<next> X<last> X<redo> 181 182For C<next> or C<redo>, just double the braces: 183 184 do {{ 185 next if $x == $y; 186 # do something here 187 }} until $x++ > $z; 188 189For C<last>, you have to be more elaborate and put braces around it: 190X<last> 191 192 { 193 do { 194 last if $x == $y**2; 195 # do something here 196 } while $x++ <= $z; 197 } 198 199If you need both C<next> and C<last>, you have to do both and also use a 200loop label: 201 202 LOOP: { 203 do {{ 204 next if $x == $y; 205 last LOOP if $x == $y**2; 206 # do something here 207 }} until $x++ > $z; 208 } 209 210B<NOTE:> The behaviour of a C<my>, C<state>, or 211C<our> modified with a statement modifier conditional 212or loop construct (for example, C<my $x if ...>) is 213B<undefined>. The value of the C<my> variable may be C<undef>, any 214previously assigned value, or possibly anything else. Don't rely on 215it. Future versions of perl might do something different from the 216version of perl you try it out on. Here be dragons. 217X<my> 218 219The C<when> modifier is an experimental feature that first appeared in Perl 2205.14. To use it, you should include a C<use v5.14> declaration. 221(Technically, it requires only the C<switch> feature, but that aspect of it 222was not available before 5.14.) Operative only from within a C<foreach> 223loop or a C<given> block, it executes the statement only if the smartmatch 224C<< $_ ~~ I<EXPR> >> is true. If the statement executes, it is followed by 225a C<next> from inside a C<foreach> and C<break> from inside a C<given>. 226 227Under the current implementation, the C<foreach> loop can be 228anywhere within the C<when> modifier's dynamic scope, but must be 229within the C<given> block's lexical scope. This restriction may 230be relaxed in a future release. See L</"Switch Statements"> below. 231 232=head2 Compound Statements 233X<statement, compound> X<block> X<bracket, curly> X<curly bracket> X<brace> 234X<{> X<}> X<if> X<unless> X<given> X<while> X<until> X<foreach> X<for> X<continue> 235 236In Perl, a sequence of statements that defines a scope is called a block. 237Sometimes a block is delimited by the file containing it (in the case 238of a required file, or the program as a whole), and sometimes a block 239is delimited by the extent of a string (in the case of an eval). 240 241But generally, a block is delimited by curly brackets, also known as 242braces. We will call this syntactic construct a BLOCK. Because enclosing 243braces are also the syntax for hash reference constructor expressions 244(see L<perlref>), you may occasionally need to disambiguate by placing a 245C<;> immediately after an opening brace so that Perl realises the brace 246is the start of a block. You will more frequently need to disambiguate 247the other way, by placing a C<+> immediately before an opening brace to 248force it to be interpreted as a hash reference constructor expression. 249It is considered good style to use these disambiguating mechanisms 250liberally, not only when Perl would otherwise guess incorrectly. 251 252The following compound statements may be used to control flow: 253 254 if (EXPR) BLOCK 255 if (EXPR) BLOCK else BLOCK 256 if (EXPR) BLOCK elsif (EXPR) BLOCK ... 257 if (EXPR) BLOCK elsif (EXPR) BLOCK ... else BLOCK 258 259 unless (EXPR) BLOCK 260 unless (EXPR) BLOCK else BLOCK 261 unless (EXPR) BLOCK elsif (EXPR) BLOCK ... 262 unless (EXPR) BLOCK elsif (EXPR) BLOCK ... else BLOCK 263 264 given (EXPR) BLOCK 265 266 LABEL while (EXPR) BLOCK 267 LABEL while (EXPR) BLOCK continue BLOCK 268 269 LABEL until (EXPR) BLOCK 270 LABEL until (EXPR) BLOCK continue BLOCK 271 272 LABEL for (EXPR; EXPR; EXPR) BLOCK 273 LABEL for VAR (LIST) BLOCK 274 LABEL for VAR (LIST) BLOCK continue BLOCK 275 276 LABEL foreach (EXPR; EXPR; EXPR) BLOCK 277 LABEL foreach VAR (LIST) BLOCK 278 LABEL foreach VAR (LIST) BLOCK continue BLOCK 279 280 LABEL BLOCK 281 LABEL BLOCK continue BLOCK 282 283 PHASE BLOCK 284 285As of Perl 5.36, you can iterate over multiple values at a time by specifying 286a list of lexicals within parentheses: 287 288 no warnings "experimental::for_list"; 289 LABEL for my (VAR, VAR) (LIST) BLOCK 290 LABEL for my (VAR, VAR) (LIST) BLOCK continue BLOCK 291 LABEL foreach my (VAR, VAR) (LIST) BLOCK 292 LABEL foreach my (VAR, VAR) (LIST) BLOCK continue BLOCK 293 294If enabled by the experimental C<try> feature, the following may also be used 295 296 try BLOCK catch (VAR) BLOCK 297 try BLOCK catch (VAR) BLOCK finally BLOCK 298 299The experimental C<given> statement is I<not automatically enabled>; see 300L</"Switch Statements"> below for how to do so, and the attendant caveats. 301 302Unlike in C and Pascal, in Perl these are all defined in terms of BLOCKs, 303not statements. This means that the curly brackets are I<required>--no 304dangling statements allowed. If you want to write conditionals without 305curly brackets, there are several other ways to do it. The following 306all do the same thing: 307 308 if (!open(FOO)) { die "Can't open $FOO: $!" } 309 die "Can't open $FOO: $!" unless open(FOO); 310 open(FOO) || die "Can't open $FOO: $!"; 311 open(FOO) ? () : die "Can't open $FOO: $!"; 312 # a bit exotic, that last one 313 314The C<if> statement is straightforward. Because BLOCKs are always 315bounded by curly brackets, there is never any ambiguity about which 316C<if> an C<else> goes with. If you use C<unless> in place of C<if>, 317the sense of the test is reversed. Like C<if>, C<unless> can be followed 318by C<else>. C<unless> can even be followed by one or more C<elsif> 319statements, though you may want to think twice before using that particular 320language construct, as everyone reading your code will have to think at least 321twice before they can understand what's going on. 322 323The C<while> statement executes the block as long as the expression is 324true. 325The C<until> statement executes the block as long as the expression is 326false. 327The LABEL is optional, and if present, consists of an identifier followed 328by a colon. The LABEL identifies the loop for the loop control 329statements C<next>, C<last>, and C<redo>. 330If the LABEL is omitted, the loop control statement 331refers to the innermost enclosing loop. This may include dynamically 332searching through your call-stack at run time to find the LABEL. Such 333desperate behavior triggers a warning if you use the C<use warnings> 334pragma or the B<-w> flag. 335 336If the condition expression of a C<while> statement is based 337on any of a group of iterative expression types then it gets 338some magic treatment. The affected iterative expression types 339are L<C<readline>|perlfunc/readline EXPR>, the L<C<< <FILEHANDLE> 340>>|perlop/"I/O Operators"> input operator, L<C<readdir>|perlfunc/readdir 341DIRHANDLE>, L<C<glob>|perlfunc/glob EXPR>, the L<C<< <PATTERN> 342>>|perlop/"I/O Operators"> globbing operator, and L<C<each>|perlfunc/each 343HASH>. If the condition expression is one of these expression types, then 344the value yielded by the iterative operator will be implicitly assigned 345to C<$_>. If the condition expression is one of these expression types 346or an explicit assignment of one of them to a scalar, then the condition 347actually tests for definedness of the expression's value, not for its 348regular truth value. 349 350If there is a C<continue> BLOCK, it is always executed just before the 351conditional is about to be evaluated again. Thus it can be used to 352increment a loop variable, even when the loop has been continued via 353the C<next> statement. 354 355When a block is preceded by a compilation phase keyword such as C<BEGIN>, 356C<END>, C<INIT>, C<CHECK>, or C<UNITCHECK>, then the block will run only 357during the corresponding phase of execution. See L<perlmod> for more details. 358 359Extension modules can also hook into the Perl parser to define new 360kinds of compound statements. These are introduced by a keyword which 361the extension recognizes, and the syntax following the keyword is 362defined entirely by the extension. If you are an implementor, see 363L<perlapi/PL_keyword_plugin> for the mechanism. If you are using such 364a module, see the module's documentation for details of the syntax that 365it defines. 366 367=head2 Loop Control 368X<loop control> X<loop, control> X<next> X<last> X<redo> X<continue> 369 370The C<next> command starts the next iteration of the loop: 371 372 LINE: while (<STDIN>) { 373 next LINE if /^#/; # discard comments 374 ... 375 } 376 377The C<last> command immediately exits the loop in question. The 378C<continue> block, if any, is not executed: 379 380 LINE: while (<STDIN>) { 381 last LINE if /^$/; # exit when done with header 382 ... 383 } 384 385The C<redo> command restarts the loop block without evaluating the 386conditional again. The C<continue> block, if any, is I<not> executed. 387This command is normally used by programs that want to lie to themselves 388about what was just input. 389 390For example, when processing a file like F</etc/termcap>. 391If your input lines might end in backslashes to indicate continuation, you 392want to skip ahead and get the next record. 393 394 while (<>) { 395 chomp; 396 if (s/\\$//) { 397 $_ .= <>; 398 redo unless eof(); 399 } 400 # now process $_ 401 } 402 403which is Perl shorthand for the more explicitly written version: 404 405 LINE: while (defined($line = <ARGV>)) { 406 chomp($line); 407 if ($line =~ s/\\$//) { 408 $line .= <ARGV>; 409 redo LINE unless eof(); # not eof(ARGV)! 410 } 411 # now process $line 412 } 413 414Note that if there were a C<continue> block on the above code, it would 415get executed only on lines discarded by the regex (since redo skips the 416continue block). A continue block is often used to reset line counters 417or C<m?pat?> one-time matches: 418 419 # inspired by :1,$g/fred/s//WILMA/ 420 while (<>) { 421 m?(fred)? && s//WILMA $1 WILMA/; 422 m?(barney)? && s//BETTY $1 BETTY/; 423 m?(homer)? && s//MARGE $1 MARGE/; 424 } continue { 425 print "$ARGV $.: $_"; 426 close ARGV if eof; # reset $. 427 reset if eof; # reset ?pat? 428 } 429 430If the word C<while> is replaced by the word C<until>, the sense of the 431test is reversed, but the conditional is still tested before the first 432iteration. 433 434Loop control statements don't work in an C<if> or C<unless>, since 435they aren't loops. You can double the braces to make them such, though. 436 437 if (/pattern/) {{ 438 last if /fred/; 439 next if /barney/; # same effect as "last", 440 # but doesn't document as well 441 # do something here 442 }} 443 444This is caused by the fact that a block by itself acts as a loop that 445executes once, see L</"Basic BLOCKs">. 446 447The form C<while/if BLOCK BLOCK>, available in Perl 4, is no longer 448available. Replace any occurrence of C<if BLOCK> by C<if (do BLOCK)>. 449 450=head2 For Loops 451X<for> X<foreach> 452 453Perl's C-style C<for> loop works like the corresponding C<while> loop; 454that means that this: 455 456 for ($i = 1; $i < 10; $i++) { 457 ... 458 } 459 460is the same as this: 461 462 $i = 1; 463 while ($i < 10) { 464 ... 465 } continue { 466 $i++; 467 } 468 469There is one minor difference: if variables are declared with C<my> 470in the initialization section of the C<for>, the lexical scope of 471those variables is exactly the C<for> loop (the body of the loop 472and the control sections). To illustrate: 473X<my> 474 475 my $i = 'samba'; 476 for (my $i = 1; $i <= 4; $i++) { 477 print "$i\n"; 478 } 479 print "$i\n"; 480 481when executed, gives: 482 483 1 484 2 485 3 486 4 487 samba 488 489As a special case, if the test in the C<for> loop (or the corresponding 490C<while> loop) is empty, it is treated as true. That is, both 491 492 for (;;) { 493 ... 494 } 495 496and 497 498 while () { 499 ... 500 } 501 502are treated as infinite loops. 503 504Besides the normal array index looping, C<for> can lend itself 505to many other interesting applications. Here's one that avoids the 506problem you get into if you explicitly test for end-of-file on 507an interactive file descriptor causing your program to appear to 508hang. 509X<eof> X<end-of-file> X<end of file> 510 511 $on_a_tty = -t STDIN && -t STDOUT; 512 sub prompt { print "yes? " if $on_a_tty } 513 for ( prompt(); <STDIN>; prompt() ) { 514 # do something 515 } 516 517The condition expression of a C<for> loop gets the same magic treatment of 518C<readline> et al that the condition expression of a C<while> loop gets. 519 520=head2 Foreach Loops 521X<for> X<foreach> 522 523The C<foreach> loop iterates over a normal list value and sets the scalar 524variable VAR to be each element of the list in turn. If the variable 525is preceded with the keyword C<my>, then it is lexically scoped, and 526is therefore visible only within the loop. Otherwise, the variable is 527implicitly local to the loop and regains its former value upon exiting 528the loop. If the variable was previously declared with C<my>, it uses 529that variable instead of the global one, but it's still localized to 530the loop. This implicit localization occurs I<only> for non C-style 531loops. 532X<my> X<local> 533 534The C<foreach> keyword is actually a synonym for the C<for> keyword, so 535you can use either. If VAR is omitted, C<$_> is set to each value. 536X<$_> 537 538If any element of LIST is an lvalue, you can modify it by modifying 539VAR inside the loop. Conversely, if any element of LIST is NOT an 540lvalue, any attempt to modify that element will fail. In other words, 541the C<foreach> loop index variable is an implicit alias for each item 542in the list that you're looping over. 543X<alias> 544 545If any part of LIST is an array, C<foreach> will get very confused if 546you add or remove elements within the loop body, for example with 547C<splice>. So don't do that. 548X<splice> 549 550C<foreach> probably won't do what you expect if VAR is a tied or other 551special variable. Don't do that either. 552 553As of Perl 5.22, there is an experimental variant of this loop that accepts 554a variable preceded by a backslash for VAR, in which case the items in the 555LIST must be references. The backslashed variable will become an alias 556to each referenced item in the LIST, which must be of the correct type. 557The variable needn't be a scalar in this case, and the backslash may be 558followed by C<my>. To use this form, you must enable the C<refaliasing> 559feature via C<use feature>. (See L<feature>. See also L<perlref/Assigning 560to References>.) 561 562As of Perl 5.36, you can iterate over multiple values at a time. 563You can only iterate with lexical scalars as the iterator variables - unlike 564list assignment, it's not possible to use C<undef> to signify a value that 565isn't wanted. This is a limitation of the current implementation, and might 566be changed in the future. 567 568If the size of the LIST is not an exact multiple of the number of iterator 569variables, then on the last iteration the "excess" iterator variables are 570aliases to C<undef>, as if the LIST had C<, undef> appended as many times as 571needed for its length to become an exact multiple. This happens whether 572LIST is a literal LIST or an array - ie arrays are not extended if their 573size is not a multiple of the iteration size, consistent with iterating an 574array one-at-a-time. As these padding elements are not lvalues, attempting 575to modify them will fail, consistent with the behaviour when iterating a 576list with literal C<undef>s. If this is not the behaviour you desire, then 577before the loop starts either explicitly extend your array to be an exact 578multiple, or explicitly throw an exception. 579 580Examples: 581 582 for (@ary) { s/foo/bar/ } 583 584 for my $elem (@elements) { 585 $elem *= 2; 586 } 587 588 for $count (reverse(1..10), "BOOM") { 589 print $count, "\n"; 590 sleep(1); 591 } 592 593 for (1..15) { print "Merry Christmas\n"; } 594 595 foreach $item (split(/:[\\\n:]*/, $ENV{TERMCAP})) { 596 print "Item: $item\n"; 597 } 598 599 use feature "refaliasing"; 600 no warnings "experimental::refaliasing"; 601 foreach \my %hash (@array_of_hash_references) { 602 # do something with each %hash 603 } 604 605 foreach my ($foo, $bar, $baz) (@list) { 606 # do something three-at-a-time 607 } 608 609 foreach my ($key, $value) (%hash) { 610 # iterate over the hash 611 # The hash is immediately copied to a flat list before the loop 612 # starts. The list contains copies of keys but aliases of values. 613 # This is the same behaviour as for $var (%hash) {...} 614 } 615 616Here's how a C programmer might code up a particular algorithm in Perl: 617 618 for (my $i = 0; $i < @ary1; $i++) { 619 for (my $j = 0; $j < @ary2; $j++) { 620 if ($ary1[$i] > $ary2[$j]) { 621 last; # can't go to outer :-( 622 } 623 $ary1[$i] += $ary2[$j]; 624 } 625 # this is where that last takes me 626 } 627 628Whereas here's how a Perl programmer more comfortable with the idiom might 629do it: 630 631 OUTER: for my $wid (@ary1) { 632 INNER: for my $jet (@ary2) { 633 next OUTER if $wid > $jet; 634 $wid += $jet; 635 } 636 } 637 638See how much easier this is? It's cleaner, safer, and faster. It's 639cleaner because it's less noisy. It's safer because if code gets added 640between the inner and outer loops later on, the new code won't be 641accidentally executed. The C<next> explicitly iterates the other loop 642rather than merely terminating the inner one. And it's faster because 643Perl executes a C<foreach> statement more rapidly than it would the 644equivalent C-style C<for> loop. 645 646Perceptive Perl hackers may have noticed that a C<for> loop has a return 647value, and that this value can be captured by wrapping the loop in a C<do> 648block. The reward for this discovery is this cautionary advice: The 649return value of a C<for> loop is unspecified and may change without notice. 650Do not rely on it. 651 652=head2 Try Catch Exception Handling 653X<try> X<catch> X<finally> 654 655The C<try>/C<catch> syntax provides control flow relating to exception 656handling. The C<try> keyword introduces a block which will be executed when it 657is encountered, and the C<catch> block provides code to handle any exception 658that may be thrown by the first. 659 660 try { 661 my $x = call_a_function(); 662 $x < 100 or die "Too big"; 663 send_output($x); 664 } 665 catch ($e) { 666 warn "Unable to output a value; $e"; 667 } 668 print "Finished\n"; 669 670Here, the body of the C<catch> block (i.e. the C<warn> statement) will be 671executed if the initial block invokes the conditional C<die>, or if either of 672the functions it invokes throws an uncaught exception. The C<catch> block can 673inspect the C<$e> lexical variable in this case to see what the exception was. 674If no exception was thrown then the C<catch> block does not happen. In either 675case, execution will then continue from the following statement - in this 676example the C<print>. 677 678The C<catch> keyword must be immediately followed by a variable declaration in 679parentheses, which introduces a new variable visible to the body of the 680subsequent block. Inside the block this variable will contain the exception 681value that was thrown by the code in the C<try> block. It is not necessary 682to use the C<my> keyword to declare this variable; this is implied (similar 683as it is for subroutine signatures). 684 685Both the C<try> and the C<catch> blocks are permitted to contain control-flow 686expressions, such as C<return>, C<goto>, or C<next>/C<last>/C<redo>. In all 687cases they behave as expected without warnings. In particular, a C<return> 688expression inside the C<try> block will make its entire containing function 689return - this is in contrast to its behaviour inside an C<eval> block, where 690it would only make that block return. 691 692Like other control-flow syntax, C<try> and C<catch> will yield the last 693evaluated value when placed as the final statement in a function or a C<do> 694block. This permits the syntax to be used to create a value. In this case 695remember not to use the C<return> expression, or that will cause the 696containing function to return. 697 698 my $value = do { 699 try { 700 get_thing(@args); 701 } 702 catch ($e) { 703 warn "Unable to get thing - $e"; 704 $DEFAULT_THING; 705 } 706 }; 707 708As with other control-flow syntax, C<try> blocks are not visible to 709C<caller()> (just as for example, C<while> or C<foreach> loops are not). 710Successive levels of the C<caller> result can see subroutine calls and 711C<eval> blocks, because those affect the way that C<return> would work. Since 712C<try> blocks do not intercept C<return>, they are not of interest to 713C<caller>. 714 715The C<try> and C<catch> blocks may optionally be followed by a third block 716introduced by the C<finally> keyword. This third block is executed after the 717rest of the construct has finished. 718 719 try { 720 call_a_function(); 721 } 722 catch ($e) { 723 warn "Unable to call; $e"; 724 } 725 finally { 726 print "Finished\n"; 727 } 728 729The C<finally> block is equivalent to using a C<defer> block and will be 730invoked in the same situations; whether the C<try> block completes 731successfully, throws an exception, or transfers control elsewhere by using 732C<return>, a loop control, or C<goto>. 733 734Unlike the C<try> and C<catch> blocks, a C<finally> block is not permitted to 735C<return>, C<goto> or use any loop controls. The final expression value is 736ignored, and does not affect the return value of the containing function even 737if it is placed last in the function. 738 739This syntax is currently experimental and must be enabled with 740C<use feature 'try'>. It emits a warning in the C<experimental::try> category. 741 742=head2 Basic BLOCKs 743X<block> 744 745A BLOCK by itself (labeled or not) is semantically equivalent to a 746loop that executes once. Thus you can use any of the loop control 747statements in it to leave or restart the block. (Note that this is 748I<NOT> true in C<eval{}>, C<sub{}>, or contrary to popular belief 749C<do{}> blocks, which do I<NOT> count as loops.) The C<continue> 750block is optional. 751 752The BLOCK construct can be used to emulate case structures. 753 754 SWITCH: { 755 if (/^abc/) { $abc = 1; last SWITCH; } 756 if (/^def/) { $def = 1; last SWITCH; } 757 if (/^xyz/) { $xyz = 1; last SWITCH; } 758 $nothing = 1; 759 } 760 761You'll also find that C<foreach> loop used to create a topicalizer 762and a switch: 763 764 SWITCH: 765 for ($var) { 766 if (/^abc/) { $abc = 1; last SWITCH; } 767 if (/^def/) { $def = 1; last SWITCH; } 768 if (/^xyz/) { $xyz = 1; last SWITCH; } 769 $nothing = 1; 770 } 771 772Such constructs are quite frequently used, both because older versions of 773Perl had no official C<switch> statement, and also because the new version 774described immediately below remains experimental and can sometimes be confusing. 775 776=head2 defer blocks 777X<defer> 778 779A block prefixed by the C<defer> modifier provides a section of code which 780runs at a later time during scope exit. 781 782A C<defer> block can appear at any point where a regular block or other 783statement is permitted. If the flow of execution reaches this statement, the 784body of the block is stored for later, but not invoked immediately. When the 785flow of control leaves the containing block for any reason, this stored block 786is executed on the way past. It provides a means of deferring execution until 787a later time. This acts similarly to syntax provided by some other languages, 788often using keywords named C<try / finally>. 789 790This syntax is available if enabled by the C<defer> named feature, and is 791currently experimental. If experimental warnings are enabled it will emit a 792warning when used. 793 794 use feature 'defer'; 795 796 { 797 say "This happens first"; 798 defer { say "This happens last"; } 799 800 say "And this happens inbetween"; 801 } 802 803If multiple C<defer> blocks are contained in a single scope, they are 804executed in LIFO order; the last one reached is the first one executed. 805 806The code stored by the C<defer> block will be invoked when control leaves 807its containing block due to regular fallthrough, explicit C<return>, 808exceptions thrown by C<die> or propagated by functions called by it, C<goto>, 809or any of the loop control statements C<next>, C<last> or C<redo>. 810 811If the flow of control does not reach the C<defer> statement itself then its 812body is not stored for later execution. (This is in direct contrast to the 813code provided by an C<END> phaser block, which is always enqueued by the 814compiler, regardless of whether execution ever reached the line it was given 815on.) 816 817 use feature 'defer'; 818 819 { 820 defer { say "This will run"; } 821 return; 822 defer { say "This will not"; } 823 } 824 825Exceptions thrown by code inside a C<defer> block will propagate to the 826caller in the same way as any other exception thrown by normal code. 827 828If the C<defer> block is being executed due to a thrown exception and throws 829another one it is not specified what happens, beyond that the caller will 830definitely receive an exception. 831 832Besides throwing an exception, a C<defer> block is not permitted to 833otherwise alter the control flow of its surrounding code. In particular, it 834may not cause its containing function to C<return>, nor may it C<goto> a 835label, or control a containing loop using C<next>, C<last> or C<redo>. These 836constructions are however, permitted entirely within the body of the 837C<defer>. 838 839 use feature 'defer'; 840 841 { 842 defer { 843 foreach ( 1 .. 5 ) { 844 last if $_ == 3; # this is permitted 845 } 846 } 847 } 848 849 { 850 foreach ( 6 .. 10 ) { 851 defer { 852 last if $_ == 8; # this is not 853 } 854 } 855 } 856 857=head2 Switch Statements 858 859X<switch> X<case> X<given> X<when> X<default> 860 861Starting from Perl 5.10.1 (well, 5.10.0, but it didn't work 862right), you can say 863 864 use feature "switch"; 865 866to enable an experimental switch feature. This is loosely based on an 867old version of a Raku proposal, but it no longer resembles the Raku 868construct. You also get the switch feature whenever you declare that your 869code prefers to run under a version of Perl between 5.10 and 5.34. For 870example: 871 872 use v5.14; 873 874Under the "switch" feature, Perl gains the experimental keywords 875C<given>, C<when>, C<default>, C<continue>, and C<break>. 876Starting from Perl 5.16, one can prefix the switch 877keywords with C<CORE::> to access the feature without a C<use feature> 878statement. The keywords C<given> and 879C<when> are analogous to C<switch> and 880C<case> in other languages -- though C<continue> is not -- so the code 881in the previous section could be rewritten as 882 883 use v5.10.1; 884 for ($var) { 885 when (/^abc/) { $abc = 1 } 886 when (/^def/) { $def = 1 } 887 when (/^xyz/) { $xyz = 1 } 888 default { $nothing = 1 } 889 } 890 891The C<foreach> is the non-experimental way to set a topicalizer. 892If you wish to use the highly experimental C<given>, that could be 893written like this: 894 895 use v5.10.1; 896 given ($var) { 897 when (/^abc/) { $abc = 1 } 898 when (/^def/) { $def = 1 } 899 when (/^xyz/) { $xyz = 1 } 900 default { $nothing = 1 } 901 } 902 903As of 5.14, that can also be written this way: 904 905 use v5.14; 906 for ($var) { 907 $abc = 1 when /^abc/; 908 $def = 1 when /^def/; 909 $xyz = 1 when /^xyz/; 910 default { $nothing = 1 } 911 } 912 913Or if you don't care to play it safe, like this: 914 915 use v5.14; 916 given ($var) { 917 $abc = 1 when /^abc/; 918 $def = 1 when /^def/; 919 $xyz = 1 when /^xyz/; 920 default { $nothing = 1 } 921 } 922 923The arguments to C<given> and C<when> are in scalar context, 924and C<given> assigns the C<$_> variable its topic value. 925 926Exactly what the I<EXPR> argument to C<when> does is hard to describe 927precisely, but in general, it tries to guess what you want done. Sometimes 928it is interpreted as C<< $_ ~~ I<EXPR> >>, and sometimes it is not. It 929also behaves differently when lexically enclosed by a C<given> block than 930it does when dynamically enclosed by a C<foreach> loop. The rules are far 931too difficult to understand to be described here. See L</"Experimental Details 932on given and when"> later on. 933 934Due to an unfortunate bug in how C<given> was implemented between Perl 5.10 935and 5.16, under those implementations the version of C<$_> governed by 936C<given> is merely a lexically scoped copy of the original, not a 937dynamically scoped alias to the original, as it would be if it were a 938C<foreach> or under both the original and the current Raku language 939specification. This bug was fixed in Perl 5.18 (and lexicalized C<$_> itself 940was removed in Perl 5.24). 941 942If your code still needs to run on older versions, 943stick to C<foreach> for your topicalizer and 944you will be less unhappy. 945 946=head2 Goto 947X<goto> 948 949Although not for the faint of heart, Perl does support a C<goto> 950statement. There are three forms: C<goto>-LABEL, C<goto>-EXPR, and 951C<goto>-&NAME. A loop's LABEL is not actually a valid target for 952a C<goto>; it's just the name of the loop. 953 954The C<goto>-LABEL form finds the statement labeled with LABEL and resumes 955execution there. It may not be used to go into any construct that 956requires initialization, such as a subroutine or a C<foreach> loop. It 957also can't be used to go into a construct that is optimized away. It 958can be used to go almost anywhere else within the dynamic scope, 959including out of subroutines, but it's usually better to use some other 960construct such as C<last> or C<die>. The author of Perl has never felt the 961need to use this form of C<goto> (in Perl, that is--C is another matter). 962 963The C<goto>-EXPR form expects a label name, whose scope will be resolved 964dynamically. This allows for computed C<goto>s per FORTRAN, but isn't 965necessarily recommended if you're optimizing for maintainability: 966 967 goto(("FOO", "BAR", "GLARCH")[$i]); 968 969The C<goto>-&NAME form is highly magical, and substitutes a call to the 970named subroutine for the currently running subroutine. This is used by 971C<AUTOLOAD()> subroutines that wish to load another subroutine and then 972pretend that the other subroutine had been called in the first place 973(except that any modifications to C<@_> in the current subroutine are 974propagated to the other subroutine.) After the C<goto>, not even C<caller()> 975will be able to tell that this routine was called first. 976 977In almost all cases like this, it's usually a far, far better idea to use the 978structured control flow mechanisms of C<next>, C<last>, or C<redo> instead of 979resorting to a C<goto>. For certain applications, the catch and throw pair of 980C<eval{}> and die() for exception processing can also be a prudent approach. 981 982=head2 The Ellipsis Statement 983X<...> 984X<... statement> 985X<ellipsis operator> 986X<elliptical statement> 987X<unimplemented statement> 988X<unimplemented operator> 989X<yada-yada> 990X<yada-yada operator> 991X<... operator> 992X<whatever operator> 993X<triple-dot operator> 994 995Beginning in Perl 5.12, Perl accepts an ellipsis, "C<...>", as a 996placeholder for code that you haven't implemented yet. 997When Perl 5.12 or later encounters an ellipsis statement, it parses this 998without error, but if and when you should actually try to execute it, Perl 999throws an exception with the text C<Unimplemented>: 1000 1001 use v5.12; 1002 sub unimplemented { ... } 1003 eval { unimplemented() }; 1004 if ($@ =~ /^Unimplemented at /) { 1005 say "I found an ellipsis!"; 1006 } 1007 1008You can only use the elliptical statement to stand in for a complete 1009statement. Syntactically, "C<...;>" is a complete statement, but, 1010as with other kinds of semicolon-terminated statement, the semicolon 1011may be omitted if "C<...>" appears immediately before a closing brace. 1012These examples show how the ellipsis works: 1013 1014 use v5.12; 1015 { ... } 1016 sub foo { ... } 1017 ...; 1018 eval { ... }; 1019 sub somemeth { 1020 my $self = shift; 1021 ...; 1022 } 1023 $x = do { 1024 my $n; 1025 ...; 1026 say "Hurrah!"; 1027 $n; 1028 }; 1029 1030The elliptical statement cannot stand in for an expression that 1031is part of a larger statement. 1032These examples of attempts to use an ellipsis are syntax errors: 1033 1034 use v5.12; 1035 1036 print ...; 1037 open(my $fh, ">", "/dev/passwd") or ...; 1038 if ($condition && ... ) { say "Howdy" }; 1039 ... if $a > $b; 1040 say "Cromulent" if ...; 1041 $flub = 5 + ...; 1042 1043There are some cases where Perl can't immediately tell the difference 1044between an expression and a statement. For instance, the syntax for a 1045block and an anonymous hash reference constructor look the same unless 1046there's something in the braces to give Perl a hint. The ellipsis is a 1047syntax error if Perl doesn't guess that the C<{ ... }> is a block. 1048Inside your block, you can use a C<;> before the ellipsis to denote that the 1049C<{ ... }> is a block and not a hash reference constructor. 1050 1051Note: Some folks colloquially refer to this bit of punctuation as a 1052"yada-yada" or "triple-dot", but its true name 1053is actually an ellipsis. 1054 1055=head2 PODs: Embedded Documentation 1056X<POD> X<documentation> 1057 1058Perl has a mechanism for intermixing documentation with source code. 1059While it's expecting the beginning of a new statement, if the compiler 1060encounters a line that begins with an equal sign and a word, like this 1061 1062 =head1 Here There Be Pods! 1063 1064Then that text and all remaining text up through and including a line 1065beginning with C<=cut> will be ignored. The format of the intervening 1066text is described in L<perlpod>. 1067 1068This allows you to intermix your source code 1069and your documentation text freely, as in 1070 1071 =item snazzle($) 1072 1073 The snazzle() function will behave in the most spectacular 1074 form that you can possibly imagine, not even excepting 1075 cybernetic pyrotechnics. 1076 1077 =cut back to the compiler, nuff of this pod stuff! 1078 1079 sub snazzle($) { 1080 my $thingie = shift; 1081 ......... 1082 } 1083 1084Note that pod translators should look at only paragraphs beginning 1085with a pod directive (it makes parsing easier), whereas the compiler 1086actually knows to look for pod escapes even in the middle of a 1087paragraph. This means that the following secret stuff will be 1088ignored by both the compiler and the translators. 1089 1090 $a=3; 1091 =secret stuff 1092 warn "Neither POD nor CODE!?" 1093 =cut back 1094 print "got $a\n"; 1095 1096You probably shouldn't rely upon the C<warn()> being podded out forever. 1097Not all pod translators are well-behaved in this regard, and perhaps 1098the compiler will become pickier. 1099 1100One may also use pod directives to quickly comment out a section 1101of code. 1102 1103=head2 Plain Old Comments (Not!) 1104X<comment> X<line> X<#> X<preprocessor> X<eval> 1105 1106Perl can process line directives, much like the C preprocessor. Using 1107this, one can control Perl's idea of filenames and line numbers in 1108error or warning messages (especially for strings that are processed 1109with C<eval()>). The syntax for this mechanism is almost the same as for 1110most C preprocessors: it matches the regular expression 1111 1112 # example: '# line 42 "new_filename.plx"' 1113 /^\# \s* 1114 line \s+ (\d+) \s* 1115 (?:\s("?)([^"]+)\g2)? \s* 1116 $/x 1117 1118with C<$1> being the line number for the next line, and C<$3> being 1119the optional filename (specified with or without quotes). Note that 1120no whitespace may precede the C<< # >>, unlike modern C preprocessors. 1121 1122There is a fairly obvious gotcha included with the line directive: 1123Debuggers and profilers will only show the last source line to appear 1124at a particular line number in a given file. Care should be taken not 1125to cause line number collisions in code you'd like to debug later. 1126 1127Here are some examples that you should be able to type into your command 1128shell: 1129 1130 % perl 1131 # line 200 "bzzzt" 1132 # the '#' on the previous line must be the first char on line 1133 die 'foo'; 1134 __END__ 1135 foo at bzzzt line 201. 1136 1137 % perl 1138 # line 200 "bzzzt" 1139 eval qq[\n#line 2001 ""\ndie 'foo']; print $@; 1140 __END__ 1141 foo at - line 2001. 1142 1143 % perl 1144 eval qq[\n#line 200 "foo bar"\ndie 'foo']; print $@; 1145 __END__ 1146 foo at foo bar line 200. 1147 1148 % perl 1149 # line 345 "goop" 1150 eval "\n#line " . __LINE__ . ' "' . __FILE__ ."\"\ndie 'foo'"; 1151 print $@; 1152 __END__ 1153 foo at goop line 345. 1154 1155=head2 Experimental Details on given and when 1156 1157As previously mentioned, the "switch" feature is considered highly 1158experimental; it is subject to change with little notice. In particular, 1159C<when> has tricky behaviours that are expected to change to become less 1160tricky in the future. Do not rely upon its current (mis)implementation. 1161Before Perl 5.18, C<given> also had tricky behaviours that you should still 1162beware of if your code must run on older versions of Perl. 1163 1164Here is a longer example of C<given>: 1165 1166 use feature ":5.10"; 1167 given ($foo) { 1168 when (undef) { 1169 say '$foo is undefined'; 1170 } 1171 when ("foo") { 1172 say '$foo is the string "foo"'; 1173 } 1174 when ([1,3,5,7,9]) { 1175 say '$foo is an odd digit'; 1176 continue; # Fall through 1177 } 1178 when ($_ < 100) { 1179 say '$foo is numerically less than 100'; 1180 } 1181 when (\&complicated_check) { 1182 say 'a complicated check for $foo is true'; 1183 } 1184 default { 1185 die q(I don't know what to do with $foo); 1186 } 1187 } 1188 1189Before Perl 5.18, C<given(EXPR)> assigned the value of I<EXPR> to 1190merely a lexically scoped I<B<copy>> (!) of C<$_>, not a dynamically 1191scoped alias the way C<foreach> does. That made it similar to 1192 1193 do { my $_ = EXPR; ... } 1194 1195except that the block was automatically broken out of by a successful 1196C<when> or an explicit C<break>. Because it was only a copy, and because 1197it was only lexically scoped, not dynamically scoped, you could not do the 1198things with it that you are used to in a C<foreach> loop. In particular, 1199it did not work for arbitrary function calls if those functions might try 1200to access $_. Best stick to C<foreach> for that. 1201 1202Most of the power comes from the implicit smartmatching that can 1203sometimes apply. Most of the time, C<when(EXPR)> is treated as an 1204implicit smartmatch of C<$_>, that is, C<$_ ~~ EXPR>. (See 1205L<perlop/"Smartmatch Operator"> for more information on smartmatching.) 1206But when I<EXPR> is one of the 10 exceptional cases (or things like them) 1207listed below, it is used directly as a boolean. 1208 1209=over 4 1210 1211=item Z<>1. 1212 1213A user-defined subroutine call or a method invocation. 1214 1215=item Z<>2. 1216 1217A regular expression match in the form of C</REGEX/>, C<$foo =~ /REGEX/>, 1218or C<$foo =~ EXPR>. Also, a negated regular expression match in 1219the form C<!/REGEX/>, C<$foo !~ /REGEX/>, or C<$foo !~ EXPR>. 1220 1221=item Z<>3. 1222 1223A smart match that uses an explicit C<~~> operator, such as C<EXPR ~~ EXPR>. 1224 1225B<NOTE:> You will often have to use C<$c ~~ $_> because the default case 1226uses C<$_ ~~ $c> , which is frequently the opposite of what you want. 1227 1228=item Z<>4. 1229 1230A boolean comparison operator such as C<$_ E<lt> 10> or C<$x eq "abc">. The 1231relational operators that this applies to are the six numeric comparisons 1232(C<< < >>, C<< > >>, C<< <= >>, C<< >= >>, C<< == >>, and C<< != >>), and 1233the six string comparisons (C<lt>, C<gt>, C<le>, C<ge>, C<eq>, and C<ne>). 1234 1235=item Z<>5. 1236 1237At least the three builtin functions C<defined(...)>, C<exists(...)>, and 1238C<eof(...)>. We might someday add more of these later if we think of them. 1239 1240=item Z<>6. 1241 1242A negated expression, whether C<!(EXPR)> or C<not(EXPR)>, or a logical 1243exclusive-or, C<(EXPR1) xor (EXPR2)>. The bitwise versions (C<~> and C<^>) 1244are not included. 1245 1246=item Z<>7. 1247 1248A filetest operator, with exactly 4 exceptions: C<-s>, C<-M>, C<-A>, and 1249C<-C>, as these return numerical values, not boolean ones. The C<-z> 1250filetest operator is not included in the exception list. 1251 1252=item Z<>8. 1253 1254The C<..> and C<...> flip-flop operators. Note that the C<...> flip-flop 1255operator is completely different from the C<...> elliptical statement 1256just described. 1257 1258=back 1259 1260In those 8 cases above, the value of EXPR is used directly as a boolean, so 1261no smartmatching is done. You may think of C<when> as a smartsmartmatch. 1262 1263Furthermore, Perl inspects the operands of logical operators to 1264decide whether to use smartmatching for each one by applying the 1265above test to the operands: 1266 1267=over 4 1268 1269=item Z<>9. 1270 1271If EXPR is C<EXPR1 && EXPR2> or C<EXPR1 and EXPR2>, the test is applied 1272I<recursively> to both EXPR1 and EXPR2. 1273Only if I<both> operands also pass the 1274test, I<recursively>, will the expression be treated as boolean. Otherwise, 1275smartmatching is used. 1276 1277=item Z<>10. 1278 1279If EXPR is C<EXPR1 || EXPR2>, C<EXPR1 // EXPR2>, or C<EXPR1 or EXPR2>, the 1280test is applied I<recursively> to EXPR1 only (which might itself be a 1281higher-precedence AND operator, for example, and thus subject to the 1282previous rule), not to EXPR2. If EXPR1 is to use smartmatching, then EXPR2 1283also does so, no matter what EXPR2 contains. But if EXPR2 does not get to 1284use smartmatching, then the second argument will not be either. This is 1285quite different from the C<&&> case just described, so be careful. 1286 1287=back 1288 1289These rules are complicated, but the goal is for them to do what you want 1290(even if you don't quite understand why they are doing it). For example: 1291 1292 when (/^\d+$/ && $_ < 75) { ... } 1293 1294will be treated as a boolean match because the rules say both 1295a regex match and an explicit test on C<$_> will be treated 1296as boolean. 1297 1298Also: 1299 1300 when ([qw(foo bar)] && /baz/) { ... } 1301 1302will use smartmatching because only I<one> of the operands is a boolean: 1303the other uses smartmatching, and that wins. 1304 1305Further: 1306 1307 when ([qw(foo bar)] || /^baz/) { ... } 1308 1309will use smart matching (only the first operand is considered), whereas 1310 1311 when (/^baz/ || [qw(foo bar)]) { ... } 1312 1313will test only the regex, which causes both operands to be 1314treated as boolean. Watch out for this one, then, because an 1315arrayref is always a true value, which makes it effectively 1316redundant. Not a good idea. 1317 1318Tautologous boolean operators are still going to be optimized 1319away. Don't be tempted to write 1320 1321 when ("foo" or "bar") { ... } 1322 1323This will optimize down to C<"foo">, so C<"bar"> will never be considered (even 1324though the rules say to use a smartmatch 1325on C<"foo">). For an alternation like 1326this, an array ref will work, because this will instigate smartmatching: 1327 1328 when ([qw(foo bar)] { ... } 1329 1330This is somewhat equivalent to the C-style switch statement's fallthrough 1331functionality (not to be confused with I<Perl's> fallthrough 1332functionality--see below), wherein the same block is used for several 1333C<case> statements. 1334 1335Another useful shortcut is that, if you use a literal array or hash as the 1336argument to C<given>, it is turned into a reference. So C<given(@foo)> is 1337the same as C<given(\@foo)>, for example. 1338 1339C<default> behaves exactly like C<when(1 == 1)>, which is 1340to say that it always matches. 1341 1342=head3 Breaking out 1343 1344You can use the C<break> keyword to break out of the enclosing 1345C<given> block. Every C<when> block is implicitly ended with 1346a C<break>. 1347 1348=head3 Fall-through 1349 1350You can use the C<continue> keyword to fall through from one 1351case to the next immediate C<when> or C<default>: 1352 1353 given($foo) { 1354 when (/x/) { say '$foo contains an x'; continue } 1355 when (/y/) { say '$foo contains a y' } 1356 default { say '$foo does not contain a y' } 1357 } 1358 1359=head3 Return value 1360 1361When a C<given> statement is also a valid expression (for example, 1362when it's the last statement of a block), it evaluates to: 1363 1364=over 4 1365 1366=item * 1367 1368An empty list as soon as an explicit C<break> is encountered. 1369 1370=item * 1371 1372The value of the last evaluated expression of the successful 1373C<when>/C<default> clause, if there happens to be one. 1374 1375=item * 1376 1377The value of the last evaluated expression of the C<given> block if no 1378condition is true. 1379 1380=back 1381 1382In both last cases, the last expression is evaluated in the context that 1383was applied to the C<given> block. 1384 1385Note that, unlike C<if> and C<unless>, failed C<when> statements always 1386evaluate to an empty list. 1387 1388 my $price = do { 1389 given ($item) { 1390 when (["pear", "apple"]) { 1 } 1391 break when "vote"; # My vote cannot be bought 1392 1e10 when /Mona Lisa/; 1393 "unknown"; 1394 } 1395 }; 1396 1397Currently, C<given> blocks can't always 1398be used as proper expressions. This 1399may be addressed in a future version of Perl. 1400 1401=head3 Switching in a loop 1402 1403Instead of using C<given()>, you can use a C<foreach()> loop. 1404For example, here's one way to count how many times a particular 1405string occurs in an array: 1406 1407 use v5.10.1; 1408 my $count = 0; 1409 for (@array) { 1410 when ("foo") { ++$count } 1411 } 1412 print "\@array contains $count copies of 'foo'\n"; 1413 1414Or in a more recent version: 1415 1416 use v5.14; 1417 my $count = 0; 1418 for (@array) { 1419 ++$count when "foo"; 1420 } 1421 print "\@array contains $count copies of 'foo'\n"; 1422 1423At the end of all C<when> blocks, there is an implicit C<next>. 1424You can override that with an explicit C<last> if you're 1425interested in only the first match alone. 1426 1427This doesn't work if you explicitly specify a loop variable, as 1428in C<for $item (@array)>. You have to use the default variable C<$_>. 1429 1430=head3 Differences from Raku 1431 1432The Perl 5 smartmatch and C<given>/C<when> constructs are not compatible 1433with their Raku analogues. The most visible difference and least 1434important difference is that, in Perl 5, parentheses are required around 1435the argument to C<given()> and C<when()> (except when this last one is used 1436as a statement modifier). Parentheses in Raku are always optional in a 1437control construct such as C<if()>, C<while()>, or C<when()>; they can't be 1438made optional in Perl 5 without a great deal of potential confusion, 1439because Perl 5 would parse the expression 1440 1441 given $foo { 1442 ... 1443 } 1444 1445as though the argument to C<given> were an element of the hash 1446C<%foo>, interpreting the braces as hash-element syntax. 1447 1448However, their are many, many other differences. For example, 1449this works in Perl 5: 1450 1451 use v5.12; 1452 my @primary = ("red", "blue", "green"); 1453 1454 if (@primary ~~ "red") { 1455 say "primary smartmatches red"; 1456 } 1457 1458 if ("red" ~~ @primary) { 1459 say "red smartmatches primary"; 1460 } 1461 1462 say "that's all, folks!"; 1463 1464But it doesn't work at all in Raku. Instead, you should 1465use the (parallelizable) C<any> operator: 1466 1467 if any(@primary) eq "red" { 1468 say "primary smartmatches red"; 1469 } 1470 1471 if "red" eq any(@primary) { 1472 say "red smartmatches primary"; 1473 } 1474 1475The table of smartmatches in L<perlop/"Smartmatch Operator"> is not 1476identical to that proposed by the Raku specification, mainly due to 1477differences between Raku's and Perl 5's data models, but also because 1478the Raku spec has changed since Perl 5 rushed into early adoption. 1479 1480In Raku, C<when()> will always do an implicit smartmatch with its 1481argument, while in Perl 5 it is convenient (albeit potentially confusing) to 1482suppress this implicit smartmatch in various rather loosely-defined 1483situations, as roughly outlined above. (The difference is largely because 1484Perl 5 does not have, even internally, a boolean type.) 1485 1486=cut 1487