1=head1 NAME 2X<reference> X<pointer> X<data structure> X<structure> X<struct> 3 4perlref - Perl references and nested data structures 5 6=head1 NOTE 7 8This is complete documentation about all aspects of references. 9For a shorter, tutorial introduction to just the essential features, 10see L<perlreftut>. 11 12=head1 DESCRIPTION 13 14Before release 5 of Perl it was difficult to represent complex data 15structures, because all references had to be symbolic--and even then 16it was difficult to refer to a variable instead of a symbol table entry. 17Perl now not only makes it easier to use symbolic references to variables, 18but also lets you have "hard" references to any piece of data or code. 19Any scalar may hold a hard reference. Because arrays and hashes contain 20scalars, you can now easily build arrays of arrays, arrays of hashes, 21hashes of arrays, arrays of hashes of functions, and so on. 22 23Hard references are smart--they keep track of reference counts for you, 24automatically freeing the thing referred to when its reference count goes 25to zero. (Reference counts for values in self-referential or 26cyclic data structures may not go to zero without a little help; see 27L</"Circular References"> for a detailed explanation.) 28If that thing happens to be an object, the object is destructed. See 29L<perlobj> for more about objects. (In a sense, everything in Perl is an 30object, but we usually reserve the word for references to objects that 31have been officially "blessed" into a class package.) 32 33Symbolic references are names of variables or other objects, just as a 34symbolic link in a Unix filesystem contains merely the name of a file. 35The C<*glob> notation is something of a symbolic reference. (Symbolic 36references are sometimes called "soft references", but please don't call 37them that; references are confusing enough without useless synonyms.) 38X<reference, symbolic> X<reference, soft> 39X<symbolic reference> X<soft reference> 40 41In contrast, hard references are more like hard links in a Unix file 42system: They are used to access an underlying object without concern for 43what its (other) name is. When the word "reference" is used without an 44adjective, as in the following paragraph, it is usually talking about a 45hard reference. 46X<reference, hard> X<hard reference> 47 48References are easy to use in Perl. There is just one overriding 49principle: in general, Perl does no implicit referencing or dereferencing. 50When a scalar is holding a reference, it always behaves as a simple scalar. 51It doesn't magically start being an array or hash or subroutine; you have to 52tell it explicitly to do so, by dereferencing it. 53 54=head2 Making References 55X<reference, creation> X<referencing> 56 57References can be created in several ways. 58 59=over 4 60 61=item 1. 62X<\> X<backslash> 63 64By using the backslash operator on a variable, subroutine, or value. 65(This works much like the & (address-of) operator in C.) 66This typically creates I<another> reference to a variable, because 67there's already a reference to the variable in the symbol table. But 68the symbol table reference might go away, and you'll still have the 69reference that the backslash returned. Here are some examples: 70 71 $scalarref = \$foo; 72 $arrayref = \@ARGV; 73 $hashref = \%ENV; 74 $coderef = \&handler; 75 $globref = \*foo; 76 77It isn't possible to create a true reference to an IO handle (filehandle 78or dirhandle) using the backslash operator. The most you can get is a 79reference to a typeglob, which is actually a complete symbol table entry. 80But see the explanation of the C<*foo{THING}> syntax below. However, 81you can still use type globs and globrefs as though they were IO handles. 82 83=item 2. 84X<array, anonymous> X<[> X<[]> X<square bracket> 85X<bracket, square> X<arrayref> X<array reference> X<reference, array> 86 87A reference to an anonymous array can be created using square 88brackets: 89 90 $arrayref = [1, 2, ['a', 'b', 'c']]; 91 92Here we've created a reference to an anonymous array of three elements 93whose final element is itself a reference to another anonymous array of three 94elements. (The multidimensional syntax described later can be used to 95access this. For example, after the above, C<< $arrayref->[2][1] >> would have 96the value "b".) 97 98Taking a reference to an enumerated list is not the same 99as using square brackets--instead it's the same as creating 100a list of references! 101 102 @list = (\$a, \@b, \%c); 103 @list = \($a, @b, %c); # same thing! 104 105As a special case, C<\(@foo)> returns a list of references to the contents 106of C<@foo>, not a reference to C<@foo> itself. Likewise for C<%foo>, 107except that the key references are to copies (since the keys are just 108strings rather than full-fledged scalars). 109 110=item 3. 111X<hash, anonymous> X<{> X<{}> X<curly bracket> 112X<bracket, curly> X<brace> X<hashref> X<hash reference> X<reference, hash> 113 114A reference to an anonymous hash can be created using curly 115brackets: 116 117 $hashref = { 118 'Adam' => 'Eve', 119 'Clyde' => 'Bonnie', 120 }; 121 122Anonymous hash and array composers like these can be intermixed freely to 123produce as complicated a structure as you want. The multidimensional 124syntax described below works for these too. The values above are 125literals, but variables and expressions would work just as well, because 126assignment operators in Perl (even within local() or my()) are executable 127statements, not compile-time declarations. 128 129Because curly brackets (braces) are used for several other things 130including BLOCKs, you may occasionally have to disambiguate braces at the 131beginning of a statement by putting a C<+> or a C<return> in front so 132that Perl realizes the opening brace isn't starting a BLOCK. The economy and 133mnemonic value of using curlies is deemed worth this occasional extra 134hassle. 135 136For example, if you wanted a function to make a new hash and return a 137reference to it, you have these options: 138 139 sub hashem { { @_ } } # silently wrong 140 sub hashem { +{ @_ } } # ok 141 sub hashem { return { @_ } } # ok 142 143On the other hand, if you want the other meaning, you can do this: 144 145 sub showem { { @_ } } # ambiguous (currently ok, 146 # but may change) 147 sub showem { {; @_ } } # ok 148 sub showem { { return @_ } } # ok 149 150The leading C<+{> and C<{;> always serve to disambiguate 151the expression to mean either the HASH reference, or the BLOCK. 152 153=item 4. 154X<subroutine, anonymous> X<subroutine, reference> X<reference, subroutine> 155X<scope, lexical> X<closure> X<lexical> X<lexical scope> 156 157A reference to an anonymous subroutine can be created by using 158C<sub> without a subname: 159 160 $coderef = sub { print "Boink!\n" }; 161 162Note the semicolon. Except for the code 163inside not being immediately executed, a C<sub {}> is not so much a 164declaration as it is an operator, like C<do{}> or C<eval{}>. (However, no 165matter how many times you execute that particular line (unless you're in an 166C<eval("...")>), $coderef will still have a reference to the I<same> 167anonymous subroutine.) 168 169Anonymous subroutines act as closures with respect to my() variables, 170that is, variables lexically visible within the current scope. Closure 171is a notion out of the Lisp world that says if you define an anonymous 172function in a particular lexical context, it pretends to run in that 173context even when it's called outside the context. 174 175In human terms, it's a funny way of passing arguments to a subroutine when 176you define it as well as when you call it. It's useful for setting up 177little bits of code to run later, such as callbacks. You can even 178do object-oriented stuff with it, though Perl already provides a different 179mechanism to do that--see L<perlobj>. 180 181You might also think of closure as a way to write a subroutine 182template without using eval(). Here's a small example of how 183closures work: 184 185 sub newprint { 186 my $x = shift; 187 return sub { my $y = shift; print "$x, $y!\n"; }; 188 } 189 $h = newprint("Howdy"); 190 $g = newprint("Greetings"); 191 192 # Time passes... 193 194 &$h("world"); 195 &$g("earthlings"); 196 197This prints 198 199 Howdy, world! 200 Greetings, earthlings! 201 202Note particularly that $x continues to refer to the value passed 203into newprint() I<despite> "my $x" having gone out of scope by the 204time the anonymous subroutine runs. That's what a closure is all 205about. 206 207This applies only to lexical variables, by the way. Dynamic variables 208continue to work as they have always worked. Closure is not something 209that most Perl programmers need trouble themselves about to begin with. 210 211=item 5. 212X<constructor> X<new> 213 214References are often returned by special subroutines called constructors. Perl 215objects are just references to a special type of object that happens to know 216which package it's associated with. Constructors are just special subroutines 217that know how to create that association. They do so by starting with an 218ordinary reference, and it remains an ordinary reference even while it's also 219being an object. Constructors are often named C<new()>. You I<can> call them 220indirectly: 221 222 $objref = new Doggie( Tail => 'short', Ears => 'long' ); 223 224But that can produce ambiguous syntax in certain cases, so it's often 225better to use the direct method invocation approach: 226 227 $objref = Doggie->new(Tail => 'short', Ears => 'long'); 228 229 use Term::Cap; 230 $terminal = Term::Cap->Tgetent( { OSPEED => 9600 }); 231 232 use Tk; 233 $main = MainWindow->new(); 234 $menubar = $main->Frame(-relief => "raised", 235 -borderwidth => 2) 236 237=item 6. 238X<autovivification> 239 240References of the appropriate type can spring into existence if you 241dereference them in a context that assumes they exist. Because we haven't 242talked about dereferencing yet, we can't show you any examples yet. 243 244=item 7. 245X<*foo{THING}> X<*> 246 247A reference can be created by using a special syntax, lovingly known as 248the *foo{THING} syntax. *foo{THING} returns a reference to the THING 249slot in *foo (which is the symbol table entry which holds everything 250known as foo). 251 252 $scalarref = *foo{SCALAR}; 253 $arrayref = *ARGV{ARRAY}; 254 $hashref = *ENV{HASH}; 255 $coderef = *handler{CODE}; 256 $ioref = *STDIN{IO}; 257 $globref = *foo{GLOB}; 258 $formatref = *foo{FORMAT}; 259 $globname = *foo{NAME}; # "foo" 260 $pkgname = *foo{PACKAGE}; # "main" 261 262Most of these are self-explanatory, but C<*foo{IO}> 263deserves special attention. It returns 264the IO handle, used for file handles (L<perlfunc/open>), sockets 265(L<perlfunc/socket> and L<perlfunc/socketpair>), and directory 266handles (L<perlfunc/opendir>). For compatibility with previous 267versions of Perl, C<*foo{FILEHANDLE}> is a synonym for C<*foo{IO}>, though it 268is discouraged, to encourage a consistent use of one name: IO. On perls 269between v5.8 and v5.22, it will issue a deprecation warning, but this 270deprecation has since been rescinded. 271 272C<*foo{THING}> returns undef if that particular THING hasn't been used yet, 273except in the case of scalars. C<*foo{SCALAR}> returns a reference to an 274anonymous scalar if $foo hasn't been used yet. This might change in a 275future release. 276 277C<*foo{NAME}> and C<*foo{PACKAGE}> are the exception, in that they return 278strings, rather than references. These return the package and name of the 279typeglob itself, rather than one that has been assigned to it. So, after 280C<*foo=*Foo::bar>, C<*foo> will become "*Foo::bar" when used as a string, 281but C<*foo{PACKAGE}> and C<*foo{NAME}> will continue to produce "main" and 282"foo", respectively. 283 284C<*foo{IO}> is an alternative to the C<*HANDLE> mechanism given in 285L<perldata/"Typeglobs and Filehandles"> for passing filehandles 286into or out of subroutines, or storing into larger data structures. 287Its disadvantage is that it won't create a new filehandle for you. 288Its advantage is that you have less risk of clobbering more than 289you want to with a typeglob assignment. (It still conflates file 290and directory handles, though.) However, if you assign the incoming 291value to a scalar instead of a typeglob as we do in the examples 292below, there's no risk of that happening. 293 294 splutter(*STDOUT); # pass the whole glob 295 splutter(*STDOUT{IO}); # pass both file and dir handles 296 297 sub splutter { 298 my $fh = shift; 299 print $fh "her um well a hmmm\n"; 300 } 301 302 $rec = get_rec(*STDIN); # pass the whole glob 303 $rec = get_rec(*STDIN{IO}); # pass both file and dir handles 304 305 sub get_rec { 306 my $fh = shift; 307 return scalar <$fh>; 308 } 309 310=back 311 312=head2 Using References 313X<reference, use> X<dereferencing> X<dereference> 314 315That's it for creating references. By now you're probably dying to 316know how to use references to get back to your long-lost data. There 317are several basic methods. 318 319=over 4 320 321=item 1. 322 323Anywhere you'd put an identifier (or chain of identifiers) as part 324of a variable or subroutine name, you can replace the identifier with 325a simple scalar variable containing a reference of the correct type: 326 327 $bar = $$scalarref; 328 push(@$arrayref, $filename); 329 $$arrayref[0] = "January"; 330 $$hashref{"KEY"} = "VALUE"; 331 &$coderef(1,2,3); 332 print $globref "output\n"; 333 334It's important to understand that we are specifically I<not> dereferencing 335C<$arrayref[0]> or C<$hashref{"KEY"}> there. The dereference of the 336scalar variable happens I<before> it does any key lookups. Anything more 337complicated than a simple scalar variable must use methods 2 or 3 below. 338However, a "simple scalar" includes an identifier that itself uses method 3391 recursively. Therefore, the following prints "howdy". 340 341 $refrefref = \\\"howdy"; 342 print $$$$refrefref; 343 344=item 2. 345 346Anywhere you'd put an identifier (or chain of identifiers) as part of a 347variable or subroutine name, you can replace the identifier with a 348BLOCK returning a reference of the correct type. In other words, the 349previous examples could be written like this: 350 351 $bar = ${$scalarref}; 352 push(@{$arrayref}, $filename); 353 ${$arrayref}[0] = "January"; 354 ${$hashref}{"KEY"} = "VALUE"; 355 &{$coderef}(1,2,3); 356 $globref->print("output\n"); # iff IO::Handle is loaded 357 358Admittedly, it's a little silly to use the curlies in this case, but 359the BLOCK can contain any arbitrary expression, in particular, 360subscripted expressions: 361 362 &{ $dispatch{$index} }(1,2,3); # call correct routine 363 364Because of being able to omit the curlies for the simple case of C<$$x>, 365people often make the mistake of viewing the dereferencing symbols as 366proper operators, and wonder about their precedence. If they were, 367though, you could use parentheses instead of braces. That's not the case. 368Consider the difference below; case 0 is a short-hand version of case 1, 369I<not> case 2: 370 371 $$hashref{"KEY"} = "VALUE"; # CASE 0 372 ${$hashref}{"KEY"} = "VALUE"; # CASE 1 373 ${$hashref{"KEY"}} = "VALUE"; # CASE 2 374 ${$hashref->{"KEY"}} = "VALUE"; # CASE 3 375 376Case 2 is also deceptive in that you're accessing a variable 377called %hashref, not dereferencing through $hashref to the hash 378it's presumably referencing. That would be case 3. 379 380=item 3. 381 382Subroutine calls and lookups of individual array elements arise often 383enough that it gets cumbersome to use method 2. As a form of 384syntactic sugar, the examples for method 2 may be written: 385 386 $arrayref->[0] = "January"; # Array element 387 $hashref->{"KEY"} = "VALUE"; # Hash element 388 $coderef->(1,2,3); # Subroutine call 389 390The left side of the arrow can be any expression returning a reference, 391including a previous dereference. Note that C<$array[$x]> is I<not> the 392same thing as C<< $array->[$x] >> here: 393 394 $array[$x]->{"foo"}->[0] = "January"; 395 396This is one of the cases we mentioned earlier in which references could 397spring into existence when in an lvalue context. Before this 398statement, C<$array[$x]> may have been undefined. If so, it's 399automatically defined with a hash reference so that we can look up 400C<{"foo"}> in it. Likewise C<< $array[$x]->{"foo"} >> will automatically get 401defined with an array reference so that we can look up C<[0]> in it. 402This process is called I<autovivification>. 403 404One more thing here. The arrow is optional I<between> brackets 405subscripts, so you can shrink the above down to 406 407 $array[$x]{"foo"}[0] = "January"; 408 409Which, in the degenerate case of using only ordinary arrays, gives you 410multidimensional arrays just like C's: 411 412 $score[$x][$y][$z] += 42; 413 414Well, okay, not entirely like C's arrays, actually. C doesn't know how 415to grow its arrays on demand. Perl does. 416 417=item 4. 418 419If a reference happens to be a reference to an object, then there are 420probably methods to access the things referred to, and you should probably 421stick to those methods unless you're in the class package that defines the 422object's methods. In other words, be nice, and don't violate the object's 423encapsulation without a very good reason. Perl does not enforce 424encapsulation. We are not totalitarians here. We do expect some basic 425civility though. 426 427=back 428 429Using a string or number as a reference produces a symbolic reference, 430as explained above. Using a reference as a number produces an 431integer representing its storage location in memory. The only 432useful thing to be done with this is to compare two references 433numerically to see whether they refer to the same location. 434X<reference, numeric context> 435 436 if ($ref1 == $ref2) { # cheap numeric compare of references 437 print "refs 1 and 2 refer to the same thing\n"; 438 } 439 440Using a reference as a string produces both its referent's type, 441including any package blessing as described in L<perlobj>, as well 442as the numeric address expressed in hex. The ref() operator returns 443just the type of thing the reference is pointing to, without the 444address. See L<perlfunc/ref> for details and examples of its use. 445X<reference, string context> 446 447The bless() operator may be used to associate the object a reference 448points to with a package functioning as an object class. See L<perlobj>. 449 450A typeglob may be dereferenced the same way a reference can, because 451the dereference syntax always indicates the type of reference desired. 452So C<${*foo}> and C<${\$foo}> both indicate the same scalar variable. 453 454Here's a trick for interpolating a subroutine call into a string: 455 456 print "My sub returned @{[mysub(1,2,3)]} that time.\n"; 457 458The way it works is that when the C<@{...}> is seen in the double-quoted 459string, it's evaluated as a block. The block creates a reference to an 460anonymous array containing the results of the call to C<mysub(1,2,3)>. So 461the whole block returns a reference to an array, which is then 462dereferenced by C<@{...}> and stuck into the double-quoted string. This 463chicanery is also useful for arbitrary expressions: 464 465 print "That yields @{[$n + 5]} widgets\n"; 466 467Similarly, an expression that returns a reference to a scalar can be 468dereferenced via C<${...}>. Thus, the above expression may be written 469as: 470 471 print "That yields ${\($n + 5)} widgets\n"; 472 473=head2 Circular References 474X<circular reference> X<reference, circular> 475 476It is possible to create a "circular reference" in Perl, which can lead 477to memory leaks. A circular reference occurs when two references 478contain a reference to each other, like this: 479 480 my $foo = {}; 481 my $bar = { foo => $foo }; 482 $foo->{bar} = $bar; 483 484You can also create a circular reference with a single variable: 485 486 my $foo; 487 $foo = \$foo; 488 489In this case, the reference count for the variables will never reach 0, 490and the references will never be garbage-collected. This can lead to 491memory leaks. 492 493Because objects in Perl are implemented as references, it's possible to 494have circular references with objects as well. Imagine a TreeNode class 495where each node references its parent and child nodes. Any node with a 496parent will be part of a circular reference. 497 498You can break circular references by creating a "weak reference". A 499weak reference does not increment the reference count for a variable, 500which means that the object can go out of scope and be destroyed. You 501can weaken a reference with the C<weaken> function exported by the 502L<Scalar::Util> module. 503 504Here's how we can make the first example safer: 505 506 use Scalar::Util 'weaken'; 507 508 my $foo = {}; 509 my $bar = { foo => $foo }; 510 $foo->{bar} = $bar; 511 512 weaken $foo->{bar}; 513 514The reference from C<$foo> to C<$bar> has been weakened. When the 515C<$bar> variable goes out of scope, it will be garbage-collected. The 516next time you look at the value of the C<< $foo->{bar} >> key, it will 517be C<undef>. 518 519This action at a distance can be confusing, so you should be careful 520with your use of weaken. You should weaken the reference in the 521variable that will go out of scope I<first>. That way, the longer-lived 522variable will contain the expected reference until it goes out of 523scope. 524 525=head2 Symbolic references 526X<reference, symbolic> X<reference, soft> 527X<symbolic reference> X<soft reference> 528 529We said that references spring into existence as necessary if they are 530undefined, but we didn't say what happens if a value used as a 531reference is already defined, but I<isn't> a hard reference. If you 532use it as a reference, it'll be treated as a symbolic 533reference. That is, the value of the scalar is taken to be the I<name> 534of a variable, rather than a direct link to a (possibly) anonymous 535value. 536 537People frequently expect it to work like this. So it does. 538 539 $name = "foo"; 540 $$name = 1; # Sets $foo 541 ${$name} = 2; # Sets $foo 542 ${$name x 2} = 3; # Sets $foofoo 543 $name->[0] = 4; # Sets $foo[0] 544 @$name = (); # Clears @foo 545 &$name(); # Calls &foo() 546 $pack = "THAT"; 547 ${"${pack}::$name"} = 5; # Sets $THAT::foo without eval 548 549This is powerful, and slightly dangerous, in that it's possible 550to intend (with the utmost sincerity) to use a hard reference, and 551accidentally use a symbolic reference instead. To protect against 552that, you can say 553 554 use strict 'refs'; 555 556and then only hard references will be allowed for the rest of the enclosing 557block. An inner block may countermand that with 558 559 no strict 'refs'; 560 561Only package variables (globals, even if localized) are visible to 562symbolic references. Lexical variables (declared with my()) aren't in 563a symbol table, and thus are invisible to this mechanism. For example: 564 565 local $value = 10; 566 $ref = "value"; 567 { 568 my $value = 20; 569 print $$ref; 570 } 571 572This will still print 10, not 20. Remember that local() affects package 573variables, which are all "global" to the package. 574 575=head2 Not-so-symbolic references 576 577Brackets around a symbolic reference can simply 578serve to isolate an identifier or variable name from the rest of an 579expression, just as they always have within a string. For example, 580 581 $push = "pop on "; 582 print "${push}over"; 583 584has always meant to print "pop on over", even though push is 585a reserved word. This is generalized to work the same 586without the enclosing double quotes, so that 587 588 print ${push} . "over"; 589 590and even 591 592 print ${ push } . "over"; 593 594will have the same effect. This 595construct is I<not> considered to be a symbolic reference when you're 596using strict refs: 597 598 use strict 'refs'; 599 ${ bareword }; # Okay, means $bareword. 600 ${ "bareword" }; # Error, symbolic reference. 601 602Similarly, because of all the subscripting that is done using single words, 603the same rule applies to any bareword that is used for subscripting a hash. 604So now, instead of writing 605 606 $hash{ "aaa" }{ "bbb" }{ "ccc" } 607 608you can write just 609 610 $hash{ aaa }{ bbb }{ ccc } 611 612and not worry about whether the subscripts are reserved words. In the 613rare event that you do wish to do something like 614 615 $hash{ shift } 616 617you can force interpretation as a reserved word by adding anything that 618makes it more than a bareword: 619 620 $hash{ shift() } 621 $hash{ +shift } 622 $hash{ shift @_ } 623 624The C<use warnings> pragma or the B<-w> switch will warn you if it 625interprets a reserved word as a string. 626But it will no longer warn you about using lowercase words, because the 627string is effectively quoted. 628 629=head2 Pseudo-hashes: Using an array as a hash 630X<pseudo-hash> X<pseudo hash> X<pseudohash> 631 632Pseudo-hashes have been removed from Perl. The 'fields' pragma 633remains available. 634 635=head2 Function Templates 636X<scope, lexical> X<closure> X<lexical> X<lexical scope> 637X<subroutine, nested> X<sub, nested> X<subroutine, local> X<sub, local> 638 639As explained above, an anonymous function with access to the lexical 640variables visible when that function was compiled, creates a closure. It 641retains access to those variables even though it doesn't get run until 642later, such as in a signal handler or a Tk callback. 643 644Using a closure as a function template allows us to generate many functions 645that act similarly. Suppose you wanted functions named after the colors 646that generated HTML font changes for the various colors: 647 648 print "Be ", red("careful"), "with that ", green("light"); 649 650The red() and green() functions would be similar. To create these, 651we'll assign a closure to a typeglob of the name of the function we're 652trying to build. 653 654 @colors = qw(red blue green yellow orange purple violet); 655 for my $name (@colors) { 656 no strict 'refs'; # allow symbol table manipulation 657 *$name = *{uc $name} = sub { "<FONT COLOR='$name'>@_</FONT>" }; 658 } 659 660Now all those different functions appear to exist independently. You can 661call red(), RED(), blue(), BLUE(), green(), etc. This technique saves on 662both compile time and memory use, and is less error-prone as well, since 663syntax checks happen at compile time. It's critical that any variables in 664the anonymous subroutine be lexicals in order to create a proper closure. 665That's the reasons for the C<my> on the loop iteration variable. 666 667This is one of the only places where giving a prototype to a closure makes 668much sense. If you wanted to impose scalar context on the arguments of 669these functions (probably not a wise idea for this particular example), 670you could have written it this way instead: 671 672 *$name = sub ($) { "<FONT COLOR='$name'>$_[0]</FONT>" }; 673 674However, since prototype checking happens at compile time, the assignment 675above happens too late to be of much use. You could address this by 676putting the whole loop of assignments within a BEGIN block, forcing it 677to occur during compilation. 678 679Access to lexicals that change over time--like those in the C<for> loop 680above, basically aliases to elements from the surrounding lexical scopes-- 681only works with anonymous subs, not with named subroutines. Generally 682said, named subroutines do not nest properly and should only be declared 683in the main package scope. 684 685This is because named subroutines are created at compile time so their 686lexical variables get assigned to the parent lexicals from the first 687execution of the parent block. If a parent scope is entered a second 688time, its lexicals are created again, while the nested subs still 689reference the old ones. 690 691Anonymous subroutines get to capture each time you execute the C<sub> 692operator, as they are created on the fly. If you are accustomed to using 693nested subroutines in other programming languages with their own private 694variables, you'll have to work at it a bit in Perl. The intuitive coding 695of this type of thing incurs mysterious warnings about "will not stay 696shared" due to the reasons explained above. 697For example, this won't work: 698 699 sub outer { 700 my $x = $_[0] + 35; 701 sub inner { return $x * 19 } # WRONG 702 return $x + inner(); 703 } 704 705A work-around is the following: 706 707 sub outer { 708 my $x = $_[0] + 35; 709 local *inner = sub { return $x * 19 }; 710 return $x + inner(); 711 } 712 713Now inner() can only be called from within outer(), because of the 714temporary assignments of the anonymous subroutine. But when it does, 715it has normal access to the lexical variable $x from the scope of 716outer() at the time outer is invoked. 717 718This has the interesting effect of creating a function local to another 719function, something not normally supported in Perl. 720 721=head1 WARNING: Don't use references as hash keys 722X<reference, string context> X<reference, use as hash key> 723 724You may not (usefully) use a reference as the key to a hash. It will be 725converted into a string: 726 727 $x{ \$a } = $a; 728 729If you try to dereference the key, it won't do a hard dereference, and 730you won't accomplish what you're attempting. You might want to do something 731more like 732 733 $r = \@a; 734 $x{ $r } = $r; 735 736And then at least you can use the values(), which will be 737real refs, instead of the keys(), which won't. 738 739The standard Tie::RefHash module provides a convenient workaround to this. 740 741=head2 Postfix Dereference Syntax 742 743Beginning in v5.20.0, a postfix syntax for using references is 744available. It behaves as described in L</Using References>, but instead 745of a prefixed sigil, a postfixed sigil-and-star is used. 746 747For example: 748 749 $r = \@a; 750 @b = $r->@*; # equivalent to @$r or @{ $r } 751 752 $r = [ 1, [ 2, 3 ], 4 ]; 753 $r->[1]->@*; # equivalent to @{ $r->[1] } 754 755In Perl 5.20 and 5.22, this syntax must be enabled with C<use feature 756'postderef'>. As of Perl 5.24, no feature declarations are required to make 757it available. 758 759Postfix dereference should work in all circumstances where block 760(circumfix) dereference worked, and should be entirely equivalent. This 761syntax allows dereferencing to be written and read entirely 762left-to-right. The following equivalencies are defined: 763 764 $sref->$*; # same as ${ $sref } 765 $aref->@*; # same as @{ $aref } 766 $aref->$#*; # same as $#{ $aref } 767 $href->%*; # same as %{ $href } 768 $cref->&*; # same as &{ $cref } 769 $gref->**; # same as *{ $gref } 770 771Note especially that C<< $cref->&* >> is I<not> equivalent to C<< 772$cref->() >>, and can serve different purposes. 773 774Glob elements can be extracted through the postfix dereferencing feature: 775 776 $gref->*{SCALAR}; # same as *{ $gref }{SCALAR} 777 778Postfix array and scalar dereferencing I<can> be used in interpolating 779strings (double quotes or the C<qq> operator), but only if the 780C<postderef_qq> feature is enabled. 781 782=head2 Postfix Reference Slicing 783 784Value slices of arrays and hashes may also be taken with postfix 785dereferencing notation, with the following equivalencies: 786 787 $aref->@[ ... ]; # same as @$aref[ ... ] 788 $href->@{ ... }; # same as @$href{ ... } 789 790Postfix key/value pair slicing, added in 5.20.0 and documented in 791L<the KeyE<sol>Value Hash Slices section of perldata|perldata/"Key/Value Hash 792Slices">, also behaves as expected: 793 794 $aref->%[ ... ]; # same as %$aref[ ... ] 795 $href->%{ ... }; # same as %$href{ ... } 796 797As with postfix array, postfix value slice dereferencing I<can> be used 798in interpolating strings (double quotes or the C<qq> operator), but only 799if the C<postderef_qq> L<feature> is enabled. 800 801=head2 Assigning to References 802 803Beginning in v5.22.0, the referencing operator can be assigned to. It 804performs an aliasing operation, so that the variable name referenced on the 805left-hand side becomes an alias for the thing referenced on the right-hand 806side: 807 808 \$a = \$b; # $a and $b now point to the same scalar 809 \&foo = \&bar; # foo() now means bar() 810 811This syntax must be enabled with C<use feature 'refaliasing'>. It is 812experimental, and will warn by default unless C<no warnings 813'experimental::refaliasing'> is in effect. 814 815These forms may be assigned to, and cause the right-hand side to be 816evaluated in scalar context: 817 818 \$scalar 819 \@array 820 \%hash 821 \&sub 822 \my $scalar 823 \my @array 824 \my %hash 825 \state $scalar # or @array, etc. 826 \our $scalar # etc. 827 \local $scalar # etc. 828 \local our $scalar # etc. 829 \$some_array[$index] 830 \$some_hash{$key} 831 \local $some_array[$index] 832 \local $some_hash{$key} 833 condition ? \$this : \$that[0] # etc. 834 835Slicing operations and parentheses cause 836the right-hand side to be evaluated in 837list context: 838 839 \@array[5..7] 840 (\@array[5..7]) 841 \(@array[5..7]) 842 \@hash{'foo','bar'} 843 (\@hash{'foo','bar'}) 844 \(@hash{'foo','bar'}) 845 (\$scalar) 846 \($scalar) 847 \(my $scalar) 848 \my($scalar) 849 (\@array) 850 (\%hash) 851 (\&sub) 852 \(&sub) 853 \($foo, @bar, %baz) 854 (\$foo, \@bar, \%baz) 855 856Each element on the right-hand side must be a reference to a datum of the 857right type. Parentheses immediately surrounding an array (and possibly 858also C<my>/C<state>/C<our>/C<local>) will make each element of the array an 859alias to the corresponding scalar referenced on the right-hand side: 860 861 \(@a) = \(@b); # @a and @b now have the same elements 862 \my(@a) = \(@b); # likewise 863 \(my @a) = \(@b); # likewise 864 push @a, 3; # but now @a has an extra element that @b lacks 865 \(@a) = (\$a, \$b, \$c); # @a now contains $a, $b, and $c 866 867Combining that form with C<local> and putting parentheses immediately 868around a hash are forbidden (because it is not clear what they should do): 869 870 \local(@array) = foo(); # WRONG 871 \(%hash) = bar(); # WRONG 872 873Assignment to references and non-references may be combined in lists and 874conditional ternary expressions, as long as the values on the right-hand 875side are the right type for each element on the left, though this may make 876for obfuscated code: 877 878 (my $tom, \my $dick, \my @harry) = (\1, \2, [1..3]); 879 # $tom is now \1 880 # $dick is now 2 (read-only) 881 # @harry is (1,2,3) 882 883 my $type = ref $thingy; 884 ($type ? $type eq 'ARRAY' ? \@foo : \$bar : $baz) = $thingy; 885 886The C<foreach> loop can also take a reference constructor for its loop 887variable, though the syntax is limited to one of the following, with an 888optional C<my>, C<state>, or C<our> after the backslash: 889 890 \$s 891 \@a 892 \%h 893 \&c 894 895No parentheses are permitted. This feature is particularly useful for 896arrays-of-arrays, or arrays-of-hashes: 897 898 foreach \my @a (@array_of_arrays) { 899 frobnicate($a[0], $a[-1]); 900 } 901 902 foreach \my %h (@array_of_hashes) { 903 $h{gelastic}++ if $h{type} eq 'funny'; 904 } 905 906B<CAVEAT:> Aliasing does not work correctly with closures. If you try to 907alias lexical variables from an inner subroutine or C<eval>, the aliasing 908will only be visible within that inner sub, and will not affect the outer 909subroutine where the variables are declared. This bizarre behavior is 910subject to change. 911 912=head1 Declaring a Reference to a Variable 913 914Beginning in v5.26.0, the referencing operator can come after C<my>, 915C<state>, C<our>, or C<local>. This syntax must be enabled with C<use 916feature 'declared_refs'>. It is experimental, and will warn by default 917unless C<no warnings 'experimental::refaliasing'> is in effect. 918 919This feature makes these: 920 921 my \$x; 922 our \$y; 923 924equivalent to: 925 926 \my $x; 927 \our $x; 928 929It is intended mainly for use in assignments to references (see 930L</Assigning to References>, above). It also allows the backslash to be 931used on just some items in a list of declared variables: 932 933 my ($foo, \@bar, \%baz); # equivalent to: my $foo, \my(@bar, %baz); 934 935=head1 SEE ALSO 936 937Besides the obvious documents, source code can be instructive. 938Some pathological examples of the use of references can be found 939in the F<t/op/ref.t> regression test in the Perl source directory. 940 941See also L<perldsc> and L<perllol> for how to use references to create 942complex data structures, and L<perlootut> and L<perlobj> 943for how to use them to create objects. 944