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=head3 Backslash Operator 60X<\> X<backslash> 61 62By using the backslash operator on a variable, subroutine, or value. 63(This works much like the & (address-of) operator in C.) 64This typically creates I<another> reference to a variable, because 65there's already a reference to the variable in the symbol table. But 66the symbol table reference might go away, and you'll still have the 67reference that the backslash returned. Here are some examples: 68 69 $scalarref = \$foo; 70 $arrayref = \@ARGV; 71 $hashref = \%ENV; 72 $coderef = \&handler; 73 $globref = \*foo; 74 75It isn't possible to create a true reference to an IO handle (filehandle 76or dirhandle) using the backslash operator. The most you can get is a 77reference to a typeglob, which is actually a complete symbol table entry. 78But see the explanation of the C<*foo{THING}> syntax below. However, 79you can still use type globs and globrefs as though they were IO handles. 80 81=head3 Square Brackets 82X<array, anonymous> X<[> X<[]> X<square bracket> 83X<bracket, square> X<arrayref> X<array reference> X<reference, array> 84 85A reference to an anonymous array can be created using square 86brackets: 87 88 $arrayref = [1, 2, ['a', 'b', 'c']]; 89 90Here we've created a reference to an anonymous array of three elements 91whose final element is itself a reference to another anonymous array of three 92elements. (The multidimensional syntax described later can be used to 93access this. For example, after the above, C<< $arrayref->[2][1] >> would have 94the value "b".) 95 96Taking a reference to an enumerated list is not the same 97as using square brackets--instead it's the same as creating 98a list of references! 99 100 @list = (\$x, \@y, \%z); 101 @list = \($x, @y, %z); # same thing! 102 103As a special case, C<\(@foo)> returns a list of references to the contents 104of C<@foo>, not a reference to C<@foo> itself. Likewise for C<%foo>, 105except that the key references are to copies (since the keys are just 106strings rather than full-fledged scalars). 107 108=head3 Curly Brackets 109X<hash, anonymous> X<{> X<{}> X<curly bracket> 110X<bracket, curly> X<brace> X<hashref> X<hash reference> X<reference, hash> 111 112A reference to an anonymous hash can be created using curly 113brackets: 114 115 $hashref = { 116 'Adam' => 'Eve', 117 'Clyde' => 'Bonnie', 118 }; 119 120Anonymous hash and array composers like these can be intermixed freely to 121produce as complicated a structure as you want. The multidimensional 122syntax described below works for these too. The values above are 123literals, but variables and expressions would work just as well, because 124assignment operators in Perl (even within local() or my()) are executable 125statements, not compile-time declarations. 126 127Because curly brackets (braces) are used for several other things 128including BLOCKs, you may occasionally have to disambiguate braces at the 129beginning of a statement by putting a C<+> or a C<return> in front so 130that Perl realizes the opening brace isn't starting a BLOCK. The economy and 131mnemonic value of using curlies is deemed worth this occasional extra 132hassle. 133 134For example, if you wanted a function to make a new hash and return a 135reference to it, you have these options: 136 137 sub hashem { { @_ } } # silently wrong 138 sub hashem { +{ @_ } } # ok 139 sub hashem { return { @_ } } # ok 140 141On the other hand, if you want the other meaning, you can do this: 142 143 sub showem { { @_ } } # ambiguous (currently ok, 144 # but may change) 145 sub showem { {; @_ } } # ok 146 sub showem { { return @_ } } # ok 147 148The leading C<+{> and C<{;> always serve to disambiguate 149the expression to mean either the HASH reference, or the BLOCK. 150 151=head3 Anonymous Subroutines 152X<subroutine, anonymous> X<subroutine, reference> X<reference, subroutine> 153X<scope, lexical> X<closure> X<lexical> X<lexical scope> 154 155A reference to an anonymous subroutine can be created by using 156C<sub> without a subname: 157 158 $coderef = sub { print "Boink!\n" }; 159 160Note the semicolon. Except for the code 161inside not being immediately executed, a C<sub {}> is not so much a 162declaration as it is an operator, like C<do{}> or C<eval{}>. (However, no 163matter how many times you execute that particular line (unless you're in an 164C<eval("...")>), $coderef will still have a reference to the I<same> 165anonymous subroutine.) 166 167Anonymous subroutines act as closures with respect to my() variables, 168that is, variables lexically visible within the current scope. Closure 169is a notion out of the Lisp world that says if you define an anonymous 170function in a particular lexical context, it pretends to run in that 171context even when it's called outside the context. 172 173In human terms, it's a funny way of passing arguments to a subroutine when 174you define it as well as when you call it. It's useful for setting up 175little bits of code to run later, such as callbacks. You can even 176do object-oriented stuff with it, though Perl already provides a different 177mechanism to do that--see L<perlobj>. 178 179You might also think of closure as a way to write a subroutine 180template without using eval(). Here's a small example of how 181closures work: 182 183 sub newprint { 184 my $x = shift; 185 return sub { my $y = shift; print "$x, $y!\n"; }; 186 } 187 $h = newprint("Howdy"); 188 $g = newprint("Greetings"); 189 190 # Time passes... 191 192 &$h("world"); 193 &$g("earthlings"); 194 195This prints 196 197 Howdy, world! 198 Greetings, earthlings! 199 200Note particularly that $x continues to refer to the value passed 201into newprint() I<despite> "my $x" having gone out of scope by the 202time the anonymous subroutine runs. That's what a closure is all 203about. 204 205This applies only to lexical variables, by the way. Dynamic variables 206continue to work as they have always worked. Closure is not something 207that most Perl programmers need trouble themselves about to begin with. 208 209=head3 Constructors 210X<constructor> X<new> 211 212References are often returned by special subroutines called constructors. Perl 213objects are just references to a special type of object that happens to know 214which package it's associated with. Constructors are just special subroutines 215that know how to create that association. They do so by starting with an 216ordinary reference, and it remains an ordinary reference even while it's also 217being an object. Constructors are often named C<new()>. You I<can> call them 218indirectly: 219 220 $objref = new Doggie( Tail => 'short', Ears => 'long' ); 221 222But that can produce ambiguous syntax in certain cases, so it's often 223better to use the direct method invocation approach: 224 225 $objref = Doggie->new(Tail => 'short', Ears => 'long'); 226 227 use Term::Cap; 228 $terminal = Term::Cap->Tgetent( { OSPEED => 9600 }); 229 230 use Tk; 231 $main = MainWindow->new(); 232 $menubar = $main->Frame(-relief => "raised", 233 -borderwidth => 2) 234 235This indirect object syntax is only available when 236L<C<use feature "indirect">|feature/The 'indirect' feature> is in effect, 237and that is not the case when L<C<use v5.36>|perlfunc/use VERSION> (or 238higher) is requested, it is best to avoid indirect object syntax entirely. 239 240=head3 Autovivification 241X<autovivification> 242 243References of the appropriate type can spring into existence if you 244dereference them in a context that assumes they exist. Because we haven't 245talked about dereferencing yet, we can't show you any examples yet. 246 247=head3 Typeglob Slots 248X<*foo{THING}> X<*> 249 250A reference can be created by using a special syntax, lovingly known as 251the *foo{THING} syntax. *foo{THING} returns a reference to the THING 252slot in *foo (which is the symbol table entry which holds everything 253known as foo). 254 255 $scalarref = *foo{SCALAR}; 256 $arrayref = *ARGV{ARRAY}; 257 $hashref = *ENV{HASH}; 258 $coderef = *handler{CODE}; 259 $ioref = *STDIN{IO}; 260 $globref = *foo{GLOB}; 261 $formatref = *foo{FORMAT}; 262 $globname = *foo{NAME}; # "foo" 263 $pkgname = *foo{PACKAGE}; # "main" 264 265Most of these are self-explanatory, but C<*foo{IO}> 266deserves special attention. It returns 267the IO handle, used for file handles (L<perlfunc/open>), sockets 268(L<perlfunc/socket> and L<perlfunc/socketpair>), and directory 269handles (L<perlfunc/opendir>). For compatibility with previous 270versions of Perl, C<*foo{FILEHANDLE}> is a synonym for C<*foo{IO}>, though it 271is discouraged, to encourage a consistent use of one name: IO. On perls 272between v5.8 and v5.22, it will issue a deprecation warning, but this 273deprecation has since been rescinded. 274 275C<*foo{THING}> returns undef if that particular THING hasn't been used yet, 276except in the case of scalars. C<*foo{SCALAR}> returns a reference to an 277anonymous scalar if $foo hasn't been used yet. This might change in a 278future release. 279 280C<*foo{NAME}> and C<*foo{PACKAGE}> are the exception, in that they return 281strings, rather than references. These return the package and name of the 282typeglob itself, rather than one that has been assigned to it. So, after 283C<*foo=*Foo::bar>, C<*foo> will become "*Foo::bar" when used as a string, 284but C<*foo{PACKAGE}> and C<*foo{NAME}> will continue to produce "main" and 285"foo", respectively. 286 287C<*foo{IO}> is an alternative to the C<*HANDLE> mechanism given in 288L<perldata/"Typeglobs and Filehandles"> for passing filehandles 289into or out of subroutines, or storing into larger data structures. 290Its disadvantage is that it won't create a new filehandle for you. 291Its advantage is that you have less risk of clobbering more than 292you want to with a typeglob assignment. (It still conflates file 293and directory handles, though.) However, if you assign the incoming 294value to a scalar instead of a typeglob as we do in the examples 295below, there's no risk of that happening. 296 297 splutter(*STDOUT); # pass the whole glob 298 splutter(*STDOUT{IO}); # pass both file and dir handles 299 300 sub splutter { 301 my $fh = shift; 302 print $fh "her um well a hmmm\n"; 303 } 304 305 $rec = get_rec(*STDIN); # pass the whole glob 306 $rec = get_rec(*STDIN{IO}); # pass both file and dir handles 307 308 sub get_rec { 309 my $fh = shift; 310 return scalar <$fh>; 311 } 312 313=head2 Using References 314X<reference, use> X<dereferencing> X<dereference> 315 316That's it for creating references. By now you're probably dying to 317know how to use references to get back to your long-lost data. There 318are several basic methods. 319 320=head3 Simple Scalar 321 322Anywhere you'd put an identifier (or chain of identifiers) as part 323of a variable or subroutine name, you can replace the identifier with 324a simple scalar variable containing a reference of the correct type: 325 326 $bar = $$scalarref; 327 push(@$arrayref, $filename); 328 $$arrayref[0] = "January"; 329 $$hashref{"KEY"} = "VALUE"; 330 &$coderef(1,2,3); 331 print $globref "output\n"; 332 333It's important to understand that we are specifically I<not> dereferencing 334C<$arrayref[0]> or C<$hashref{"KEY"}> there. The dereference of the 335scalar variable happens I<before> it does any key lookups. Anything more 336complicated than a simple scalar variable must use methods 2 or 3 below. 337However, a "simple scalar" includes an identifier that itself uses method 3381 recursively. Therefore, the following prints "howdy". 339 340 $refrefref = \\\"howdy"; 341 print $$$$refrefref; 342 343=head3 Block 344 345Anywhere you'd put an identifier (or chain of identifiers) as part of a 346variable or subroutine name, you can replace the identifier with a 347BLOCK returning a reference of the correct type. In other words, the 348previous examples could be written like this: 349 350 $bar = ${$scalarref}; 351 push(@{$arrayref}, $filename); 352 ${$arrayref}[0] = "January"; 353 ${$hashref}{"KEY"} = "VALUE"; 354 &{$coderef}(1,2,3); 355 $globref->print("output\n"); # iff IO::Handle is loaded 356 357Admittedly, it's a little silly to use the curlies in this case, but 358the BLOCK can contain any arbitrary expression, in particular, 359subscripted expressions: 360 361 &{ $dispatch{$index} }(1,2,3); # call correct routine 362 363Because of being able to omit the curlies for the simple case of C<$$x>, 364people often make the mistake of viewing the dereferencing symbols as 365proper operators, and wonder about their precedence. If they were, 366though, you could use parentheses instead of braces. That's not the case. 367Consider the difference below; case 0 is a short-hand version of case 1, 368I<not> case 2: 369 370 $$hashref{"KEY"} = "VALUE"; # CASE 0 371 ${$hashref}{"KEY"} = "VALUE"; # CASE 1 372 ${$hashref{"KEY"}} = "VALUE"; # CASE 2 373 ${$hashref->{"KEY"}} = "VALUE"; # CASE 3 374 375Case 2 is also deceptive in that you're accessing a variable 376called %hashref, not dereferencing through $hashref to the hash 377it's presumably referencing. That would be case 3. 378 379=head3 Arrow Notation 380 381Subroutine calls and lookups of individual array elements arise often 382enough that it gets cumbersome to use method 2. As a form of 383syntactic sugar, the examples for method 2 may be written: 384 385 $arrayref->[0] = "January"; # Array element 386 $hashref->{"KEY"} = "VALUE"; # Hash element 387 $coderef->(1,2,3); # Subroutine call 388 389The left side of the arrow can be any expression returning a reference, 390including a previous dereference. Note that C<$array[$x]> is I<not> the 391same thing as C<< $array->[$x] >> here: 392 393 $array[$x]->{"foo"}->[0] = "January"; 394 395This is one of the cases we mentioned earlier in which references could 396spring into existence when in an lvalue context. Before this 397statement, C<$array[$x]> may have been undefined. If so, it's 398automatically defined with a hash reference so that we can look up 399C<{"foo"}> in it. Likewise C<< $array[$x]->{"foo"} >> will automatically get 400defined with an array reference so that we can look up C<[0]> in it. 401This process is called I<autovivification>. 402 403One more thing here. The arrow is optional I<between> brackets 404subscripts, so you can shrink the above down to 405 406 $array[$x]{"foo"}[0] = "January"; 407 408Which, in the degenerate case of using only ordinary arrays, gives you 409multidimensional arrays just like C's: 410 411 $score[$x][$y][$z] += 42; 412 413Well, okay, not entirely like C's arrays, actually. C doesn't know how 414to grow its arrays on demand. Perl does. 415 416=head3 Objects 417 418If a reference happens to be a reference to an object, then there are 419probably methods to access the things referred to, and you should probably 420stick to those methods unless you're in the class package that defines the 421object's methods. In other words, be nice, and don't violate the object's 422encapsulation without a very good reason. Perl does not enforce 423encapsulation. We are not totalitarians here. We do expect some basic 424civility though. 425 426=head3 Miscellaneous Usage 427 428Using a string or number as a reference produces a symbolic reference, 429as explained above. Using a reference as a number produces an 430integer representing its storage location in memory. The only 431useful thing to be done with this is to compare two references 432numerically to see whether they refer to the same location. 433X<reference, numeric context> 434 435 if ($ref1 == $ref2) { # cheap numeric compare of references 436 print "refs 1 and 2 refer to the same thing\n"; 437 } 438 439Using a reference as a string produces both its referent's type, 440including any package blessing as described in L<perlobj>, as well 441as the numeric address expressed in hex. The ref() operator returns 442just the type of thing the reference is pointing to, without the 443address. See L<perlfunc/ref> for details and examples of its use. 444X<reference, string context> 445 446The bless() operator may be used to associate the object a reference 447points to with a package functioning as an object class. See L<perlobj>. 448 449A typeglob may be dereferenced the same way a reference can, because 450the dereference syntax always indicates the type of reference desired. 451So C<${*foo}> and C<${\$foo}> both indicate the same scalar variable. 452 453Here's a trick for interpolating a subroutine call into a string: 454 455 print "My sub returned @{[mysub(1,2,3)]} that time.\n"; 456 457The way it works is that when the C<@{...}> is seen in the double-quoted 458string, it's evaluated as a block. The block creates a reference to an 459anonymous array containing the results of the call to C<mysub(1,2,3)>. So 460the whole block returns a reference to an array, which is then 461dereferenced by C<@{...}> and stuck into the double-quoted string. This 462chicanery is also useful for arbitrary expressions: 463 464 print "That yields @{[$n + 5]} widgets\n"; 465 466Similarly, an expression that returns a reference to a scalar can be 467dereferenced via C<${...}>. Thus, the above expression may be written 468as: 469 470 print "That yields ${\($n + 5)} widgets\n"; 471 472=head2 Circular References 473X<circular reference> X<reference, circular> 474 475It is possible to create a "circular reference" in Perl, which can lead 476to memory leaks. A circular reference occurs when two references 477contain a reference to each other, like this: 478 479 my $foo = {}; 480 my $bar = { foo => $foo }; 481 $foo->{bar} = $bar; 482 483You can also create a circular reference with a single variable: 484 485 my $foo; 486 $foo = \$foo; 487 488In this case, the reference count for the variables will never reach 0, 489and the references will never be garbage-collected. This can lead to 490memory leaks. 491 492Because objects in Perl are implemented as references, it's possible to 493have circular references with objects as well. Imagine a TreeNode class 494where each node references its parent and child nodes. Any node with a 495parent will be part of a circular reference. 496 497You can break circular references by creating a "weak reference". A 498weak reference does not increment the reference count for a variable, 499which means that the object can go out of scope and be destroyed. You 500can weaken a reference with the C<weaken> function exported by the 501L<Scalar::Util> module, or available as C<builtin::weaken> directly in 502Perl version 5.35.7 or later. 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=head2 Postfix Dereference Syntax 722 723Beginning in v5.20.0, a postfix syntax for using references is 724available. It behaves as described in L</Using References>, but instead 725of a prefixed sigil, a postfixed sigil-and-star is used. 726 727For example: 728 729 $r = \@a; 730 @b = $r->@*; # equivalent to @$r or @{ $r } 731 732 $r = [ 1, [ 2, 3 ], 4 ]; 733 $r->[1]->@*; # equivalent to @{ $r->[1] } 734 735In Perl 5.20 and 5.22, this syntax must be enabled with C<use feature 736'postderef'>. As of Perl 5.24, no feature declarations are required to make 737it available. 738 739Postfix dereference should work in all circumstances where block 740(circumfix) dereference worked, and should be entirely equivalent. This 741syntax allows dereferencing to be written and read entirely 742left-to-right. The following equivalencies are defined: 743 744 $sref->$*; # same as ${ $sref } 745 $aref->@*; # same as @{ $aref } 746 $aref->$#*; # same as $#{ $aref } 747 $href->%*; # same as %{ $href } 748 $cref->&*; # same as &{ $cref } 749 $gref->**; # same as *{ $gref } 750 751Note especially that C<< $cref->&* >> is I<not> equivalent to C<< 752$cref->() >>, and can serve different purposes. 753 754Glob elements can be extracted through the postfix dereferencing feature: 755 756 $gref->*{SCALAR}; # same as *{ $gref }{SCALAR} 757 758Postfix array and scalar dereferencing I<can> be used in interpolating 759strings (double quotes or the C<qq> operator), but only if the 760C<postderef_qq> feature is enabled. Interpolation of postfix array highest index 761access (C<< ->$#* >>) is also supported when the C<postderef_qq> feature is 762enabled. 763 764=head2 Postfix Reference Slicing 765 766Value slices of arrays and hashes may also be taken with postfix 767dereferencing notation, with the following equivalencies: 768 769 $aref->@[ ... ]; # same as @$aref[ ... ] 770 $href->@{ ... }; # same as @$href{ ... } 771 772Postfix key/value pair slicing, added in 5.20.0 and documented in 773L<the KeyE<sol>Value Hash Slices section of perldata|perldata/"Key/Value Hash 774Slices">, also behaves as expected: 775 776 $aref->%[ ... ]; # same as %$aref[ ... ] 777 $href->%{ ... }; # same as %$href{ ... } 778 779As with postfix array, postfix value slice dereferencing I<can> be used 780in interpolating strings (double quotes or the C<qq> operator), but only 781if the C<postderef_qq> L<feature> is enabled. 782 783=head2 Assigning to References 784 785Beginning in v5.22.0, the referencing operator can be assigned to. It 786performs an aliasing operation, so that the variable name referenced on the 787left-hand side becomes an alias for the thing referenced on the right-hand 788side: 789 790 \$x = \$y; # $x and $y now point to the same scalar 791 \&foo = \&bar; # foo() now means bar() 792 793This syntax must be enabled with C<use feature 'refaliasing'>. It is 794experimental, and will warn by default unless C<no warnings 795'experimental::refaliasing'> is in effect. 796 797These forms may be assigned to, and cause the right-hand side to be 798evaluated in scalar context: 799 800 \$scalar 801 \@array 802 \%hash 803 \&sub 804 \my $scalar 805 \my @array 806 \my %hash 807 \state $scalar # or @array, etc. 808 \our $scalar # etc. 809 \local $scalar # etc. 810 \local our $scalar # etc. 811 \$some_array[$index] 812 \$some_hash{$key} 813 \local $some_array[$index] 814 \local $some_hash{$key} 815 condition ? \$this : \$that[0] # etc. 816 817Slicing operations and parentheses cause 818the right-hand side to be evaluated in 819list context: 820 821 \@array[5..7] 822 (\@array[5..7]) 823 \(@array[5..7]) 824 \@hash{'foo','bar'} 825 (\@hash{'foo','bar'}) 826 \(@hash{'foo','bar'}) 827 (\$scalar) 828 \($scalar) 829 \(my $scalar) 830 \my($scalar) 831 (\@array) 832 (\%hash) 833 (\&sub) 834 \(&sub) 835 \($foo, @bar, %baz) 836 (\$foo, \@bar, \%baz) 837 838Each element on the right-hand side must be a reference to a datum of the 839right type. Parentheses immediately surrounding an array (and possibly 840also C<my>/C<state>/C<our>/C<local>) will make each element of the array an 841alias to the corresponding scalar referenced on the right-hand side: 842 843 \(@x) = \(@y); # @x and @y now have the same elements 844 \my(@x) = \(@y); # likewise 845 \(my @x) = \(@y); # likewise 846 push @x, 3; # but now @x has an extra element that @y lacks 847 \(@x) = (\$x, \$y, \$z); # @x now contains $x, $y, and $z 848 849Combining that form with C<local> and putting parentheses immediately 850around a hash are forbidden (because it is not clear what they should do): 851 852 \local(@array) = foo(); # WRONG 853 \(%hash) = bar(); # WRONG 854 855Assignment to references and non-references may be combined in lists and 856conditional ternary expressions, as long as the values on the right-hand 857side are the right type for each element on the left, though this may make 858for obfuscated code: 859 860 (my $tom, \my $dick, \my @harry) = (\1, \2, [1..3]); 861 # $tom is now \1 862 # $dick is now 2 (read-only) 863 # @harry is (1,2,3) 864 865 my $type = ref $thingy; 866 ($type ? $type eq 'ARRAY' ? \@foo : \$bar : $baz) = $thingy; 867 868A reference assignment in list context returns a list of references to 869each left-hand value. So for example 870 871 @b = ((\$l1, \$l2, \(@a)) = (\$r1, \$r2, $\r3, \$4)); 872 873is equivalent to 874 875 (\$l1, \$l2, \(@a)) = (\$r1, \$r2, $\r3, \$4); 876 @b = (\$l1, \$l2, \$a[0], \$a[1]); 877 878The C<foreach> loop can also take a reference constructor for its loop 879variable, though the syntax is limited to one of the following, with an 880optional C<my>, C<state>, or C<our> after the backslash: 881 882 \$s 883 \@a 884 \%h 885 \&c 886 887No parentheses are permitted. This feature is particularly useful for 888arrays-of-arrays, or arrays-of-hashes: 889 890 foreach \my @a (@array_of_arrays) { 891 frobnicate($a[0], $a[-1]); 892 } 893 894 foreach \my %h (@array_of_hashes) { 895 $h{gelastic}++ if $h{type} eq 'funny'; 896 } 897 898B<CAVEAT:> Aliasing does not work correctly with closures. If you try to 899alias lexical variables from an inner subroutine or C<eval>, the aliasing 900will only be visible within that inner sub, and will not affect the outer 901subroutine where the variables are declared. This bizarre behavior is 902subject to change. 903 904=head2 Declaring a Reference to a Variable 905 906Beginning in v5.26.0, the referencing operator can come after C<my>, 907C<state>, C<our>, or C<local>. This syntax must be enabled with C<use 908feature 'declared_refs'>. It is experimental, and will warn by default 909unless C<no warnings 'experimental::refaliasing'> is in effect. 910 911This feature makes these: 912 913 my \$x; 914 our \$y; 915 916equivalent to: 917 918 \my $x; 919 \our $x; 920 921It is intended mainly for use in assignments to references (see 922L</Assigning to References>, above). It also allows the backslash to be 923used on just some items in a list of declared variables: 924 925 my ($foo, \@bar, \%baz); # equivalent to: my $foo, \my(@bar, %baz); 926 927=head1 WARNING: Don't use references as hash keys 928X<reference, string context> X<reference, use as hash key> 929 930You may not (usefully) use a reference as the key to a hash. It will be 931converted into a string: 932 933 $x{ \$x } = $x; 934 935If you try to dereference the key, it won't do a hard dereference, and 936you won't accomplish what you're attempting. You might want to do something 937more like 938 939 $r = \@a; 940 $x{ $r } = $r; 941 942And then at least you can use the values(), which will be 943real refs, instead of the keys(), which won't. 944 945The standard Tie::RefHash module provides a convenient workaround to this. 946 947=head1 SEE ALSO 948 949Besides the obvious documents, source code can be instructive. 950Some pathological examples of the use of references can be found 951in the F<t/op/ref.t> regression test in the Perl source directory. 952 953See also L<perldsc> and L<perllol> for how to use references to create 954complex data structures, and L<perlootut> and L<perlobj> 955for how to use them to create objects. 956