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<perlobj/"Two-Phased Garbage Collection"> 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: Perl does no implicit referencing or dereferencing. When a 50scalar is holding a reference, it always behaves as a simple scalar. It 51doesn'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, but may change) 146 sub showem { {; @_ } } # ok 147 sub showem { { return @_ } } # ok 148 149The leading C<+{> and C<{;> always serve to disambiguate 150the expression to mean either the HASH reference, or the BLOCK. 151 152=item 4. 153X<subroutine, anonymous> X<subroutine, reference> X<reference, subroutine> 154X<scope, lexical> X<closure> X<lexical> X<lexical scope> 155 156A reference to an anonymous subroutine can be created by using 157C<sub> without a subname: 158 159 $coderef = sub { print "Boink!\n" }; 160 161Note the semicolon. Except for the code 162inside not being immediately executed, a C<sub {}> is not so much a 163declaration as it is an operator, like C<do{}> or C<eval{}>. (However, no 164matter how many times you execute that particular line (unless you're in an 165C<eval("...")>), $coderef will still have a reference to the I<same> 166anonymous subroutine.) 167 168Anonymous subroutines act as closures with respect to my() variables, 169that is, variables lexically visible within the current scope. Closure 170is a notion out of the Lisp world that says if you define an anonymous 171function in a particular lexical context, it pretends to run in that 172context even when it's called outside the context. 173 174In human terms, it's a funny way of passing arguments to a subroutine when 175you define it as well as when you call it. It's useful for setting up 176little bits of code to run later, such as callbacks. You can even 177do object-oriented stuff with it, though Perl already provides a different 178mechanism to do that--see L<perlobj>. 179 180You might also think of closure as a way to write a subroutine 181template without using eval(). Here's a small example of how 182closures work: 183 184 sub newprint { 185 my $x = shift; 186 return sub { my $y = shift; print "$x, $y!\n"; }; 187 } 188 $h = newprint("Howdy"); 189 $g = newprint("Greetings"); 190 191 # Time passes... 192 193 &$h("world"); 194 &$g("earthlings"); 195 196This prints 197 198 Howdy, world! 199 Greetings, earthlings! 200 201Note particularly that $x continues to refer to the value passed 202into newprint() I<despite> "my $x" having gone out of scope by the 203time the anonymous subroutine runs. That's what a closure is all 204about. 205 206This applies only to lexical variables, by the way. Dynamic variables 207continue to work as they have always worked. Closure is not something 208that most Perl programmers need trouble themselves about to begin with. 209 210=item 5. 211X<constructor> X<new> 212 213References are often returned by special subroutines called constructors. Perl 214objects are just references to a special type of object that happens to know 215which package it's associated with. Constructors are just special subroutines 216that know how to create that association. They do so by starting with an 217ordinary reference, and it remains an ordinary reference even while it's also 218being an object. Constructors are often named C<new()>. You I<can> call them 219indirectly: 220 221 $objref = new Doggie( Tail => 'short', Ears => 'long' ); 222 223But that can produce ambiguous syntax in certain cases, so it's often 224better to use the direct method invocation approach: 225 226 $objref = Doggie->new(Tail => 'short', Ears => 'long'); 227 228 use Term::Cap; 229 $terminal = Term::Cap->Tgetent( { OSPEED => 9600 }); 230 231 use Tk; 232 $main = MainWindow->new(); 233 $menubar = $main->Frame(-relief => "raised", 234 -borderwidth => 2) 235 236=item 6. 237X<autovivification> 238 239References of the appropriate type can spring into existence if you 240dereference them in a context that assumes they exist. Because we haven't 241talked about dereferencing yet, we can't show you any examples yet. 242 243=item 7. 244X<*foo{THING}> X<*> 245 246A reference can be created by using a special syntax, lovingly known as 247the *foo{THING} syntax. *foo{THING} returns a reference to the THING 248slot in *foo (which is the symbol table entry which holds everything 249known as foo). 250 251 $scalarref = *foo{SCALAR}; 252 $arrayref = *ARGV{ARRAY}; 253 $hashref = *ENV{HASH}; 254 $coderef = *handler{CODE}; 255 $ioref = *STDIN{IO}; 256 $globref = *foo{GLOB}; 257 $formatref = *foo{FORMAT}; 258 259All of these are self-explanatory except for C<*foo{IO}>. It returns 260the IO handle, used for file handles (L<perlfunc/open>), sockets 261(L<perlfunc/socket> and L<perlfunc/socketpair>), and directory 262handles (L<perlfunc/opendir>). For compatibility with previous 263versions of Perl, C<*foo{FILEHANDLE}> is a synonym for C<*foo{IO}>, though it 264is deprecated as of 5.8.0. If deprecation warnings are in effect, it will warn 265of its use. 266 267C<*foo{THING}> returns undef if that particular THING hasn't been used yet, 268except in the case of scalars. C<*foo{SCALAR}> returns a reference to an 269anonymous scalar if $foo hasn't been used yet. This might change in a 270future release. 271 272C<*foo{IO}> is an alternative to the C<*HANDLE> mechanism given in 273L<perldata/"Typeglobs and Filehandles"> for passing filehandles 274into or out of subroutines, or storing into larger data structures. 275Its disadvantage is that it won't create a new filehandle for you. 276Its advantage is that you have less risk of clobbering more than 277you want to with a typeglob assignment. (It still conflates file 278and directory handles, though.) However, if you assign the incoming 279value to a scalar instead of a typeglob as we do in the examples 280below, there's no risk of that happening. 281 282 splutter(*STDOUT); # pass the whole glob 283 splutter(*STDOUT{IO}); # pass both file and dir handles 284 285 sub splutter { 286 my $fh = shift; 287 print $fh "her um well a hmmm\n"; 288 } 289 290 $rec = get_rec(*STDIN); # pass the whole glob 291 $rec = get_rec(*STDIN{IO}); # pass both file and dir handles 292 293 sub get_rec { 294 my $fh = shift; 295 return scalar <$fh>; 296 } 297 298=back 299 300=head2 Using References 301X<reference, use> X<dereferencing> X<dereference> 302 303That's it for creating references. By now you're probably dying to 304know how to use references to get back to your long-lost data. There 305are several basic methods. 306 307=over 4 308 309=item 1. 310 311Anywhere you'd put an identifier (or chain of identifiers) as part 312of a variable or subroutine name, you can replace the identifier with 313a simple scalar variable containing a reference of the correct type: 314 315 $bar = $$scalarref; 316 push(@$arrayref, $filename); 317 $$arrayref[0] = "January"; 318 $$hashref{"KEY"} = "VALUE"; 319 &$coderef(1,2,3); 320 print $globref "output\n"; 321 322It's important to understand that we are specifically I<not> dereferencing 323C<$arrayref[0]> or C<$hashref{"KEY"}> there. The dereference of the 324scalar variable happens I<before> it does any key lookups. Anything more 325complicated than a simple scalar variable must use methods 2 or 3 below. 326However, a "simple scalar" includes an identifier that itself uses method 3271 recursively. Therefore, the following prints "howdy". 328 329 $refrefref = \\\"howdy"; 330 print $$$$refrefref; 331 332=item 2. 333 334Anywhere you'd put an identifier (or chain of identifiers) as part of a 335variable or subroutine name, you can replace the identifier with a 336BLOCK returning a reference of the correct type. In other words, the 337previous examples could be written like this: 338 339 $bar = ${$scalarref}; 340 push(@{$arrayref}, $filename); 341 ${$arrayref}[0] = "January"; 342 ${$hashref}{"KEY"} = "VALUE"; 343 &{$coderef}(1,2,3); 344 $globref->print("output\n"); # iff IO::Handle is loaded 345 346Admittedly, it's a little silly to use the curlies in this case, but 347the BLOCK can contain any arbitrary expression, in particular, 348subscripted expressions: 349 350 &{ $dispatch{$index} }(1,2,3); # call correct routine 351 352Because of being able to omit the curlies for the simple case of C<$$x>, 353people often make the mistake of viewing the dereferencing symbols as 354proper operators, and wonder about their precedence. If they were, 355though, you could use parentheses instead of braces. That's not the case. 356Consider the difference below; case 0 is a short-hand version of case 1, 357I<not> case 2: 358 359 $$hashref{"KEY"} = "VALUE"; # CASE 0 360 ${$hashref}{"KEY"} = "VALUE"; # CASE 1 361 ${$hashref{"KEY"}} = "VALUE"; # CASE 2 362 ${$hashref->{"KEY"}} = "VALUE"; # CASE 3 363 364Case 2 is also deceptive in that you're accessing a variable 365called %hashref, not dereferencing through $hashref to the hash 366it's presumably referencing. That would be case 3. 367 368=item 3. 369 370Subroutine calls and lookups of individual array elements arise often 371enough that it gets cumbersome to use method 2. As a form of 372syntactic sugar, the examples for method 2 may be written: 373 374 $arrayref->[0] = "January"; # Array element 375 $hashref->{"KEY"} = "VALUE"; # Hash element 376 $coderef->(1,2,3); # Subroutine call 377 378The left side of the arrow can be any expression returning a reference, 379including a previous dereference. Note that C<$array[$x]> is I<not> the 380same thing as C<< $array->[$x] >> here: 381 382 $array[$x]->{"foo"}->[0] = "January"; 383 384This is one of the cases we mentioned earlier in which references could 385spring into existence when in an lvalue context. Before this 386statement, C<$array[$x]> may have been undefined. If so, it's 387automatically defined with a hash reference so that we can look up 388C<{"foo"}> in it. Likewise C<< $array[$x]->{"foo"} >> will automatically get 389defined with an array reference so that we can look up C<[0]> in it. 390This process is called I<autovivification>. 391 392One more thing here. The arrow is optional I<between> brackets 393subscripts, so you can shrink the above down to 394 395 $array[$x]{"foo"}[0] = "January"; 396 397Which, in the degenerate case of using only ordinary arrays, gives you 398multidimensional arrays just like C's: 399 400 $score[$x][$y][$z] += 42; 401 402Well, okay, not entirely like C's arrays, actually. C doesn't know how 403to grow its arrays on demand. Perl does. 404 405=item 4. 406 407If a reference happens to be a reference to an object, then there are 408probably methods to access the things referred to, and you should probably 409stick to those methods unless you're in the class package that defines the 410object's methods. In other words, be nice, and don't violate the object's 411encapsulation without a very good reason. Perl does not enforce 412encapsulation. We are not totalitarians here. We do expect some basic 413civility though. 414 415=back 416 417Using a string or number as a reference produces a symbolic reference, 418as explained above. Using a reference as a number produces an 419integer representing its storage location in memory. The only 420useful thing to be done with this is to compare two references 421numerically to see whether they refer to the same location. 422X<reference, numeric context> 423 424 if ($ref1 == $ref2) { # cheap numeric compare of references 425 print "refs 1 and 2 refer to the same thing\n"; 426 } 427 428Using a reference as a string produces both its referent's type, 429including any package blessing as described in L<perlobj>, as well 430as the numeric address expressed in hex. The ref() operator returns 431just the type of thing the reference is pointing to, without the 432address. See L<perlfunc/ref> for details and examples of its use. 433X<reference, string context> 434 435The bless() operator may be used to associate the object a reference 436points to with a package functioning as an object class. See L<perlobj>. 437 438A typeglob may be dereferenced the same way a reference can, because 439the dereference syntax always indicates the type of reference desired. 440So C<${*foo}> and C<${\$foo}> both indicate the same scalar variable. 441 442Here's a trick for interpolating a subroutine call into a string: 443 444 print "My sub returned @{[mysub(1,2,3)]} that time.\n"; 445 446The way it works is that when the C<@{...}> is seen in the double-quoted 447string, it's evaluated as a block. The block creates a reference to an 448anonymous array containing the results of the call to C<mysub(1,2,3)>. So 449the whole block returns a reference to an array, which is then 450dereferenced by C<@{...}> and stuck into the double-quoted string. This 451chicanery is also useful for arbitrary expressions: 452 453 print "That yields @{[$n + 5]} widgets\n"; 454 455Similarly, an expression that returns a reference to a scalar can be 456dereferenced via C<${...}>. Thus, the above expression may be written 457as: 458 459 print "That yields ${\($n + 5)} widgets\n"; 460 461=head2 Symbolic references 462X<reference, symbolic> X<reference, soft> 463X<symbolic reference> X<soft reference> 464 465We said that references spring into existence as necessary if they are 466undefined, but we didn't say what happens if a value used as a 467reference is already defined, but I<isn't> a hard reference. If you 468use it as a reference, it'll be treated as a symbolic 469reference. That is, the value of the scalar is taken to be the I<name> 470of a variable, rather than a direct link to a (possibly) anonymous 471value. 472 473People frequently expect it to work like this. So it does. 474 475 $name = "foo"; 476 $$name = 1; # Sets $foo 477 ${$name} = 2; # Sets $foo 478 ${$name x 2} = 3; # Sets $foofoo 479 $name->[0] = 4; # Sets $foo[0] 480 @$name = (); # Clears @foo 481 &$name(); # Calls &foo() (as in Perl 4) 482 $pack = "THAT"; 483 ${"${pack}::$name"} = 5; # Sets $THAT::foo without eval 484 485This is powerful, and slightly dangerous, in that it's possible 486to intend (with the utmost sincerity) to use a hard reference, and 487accidentally use a symbolic reference instead. To protect against 488that, you can say 489 490 use strict 'refs'; 491 492and then only hard references will be allowed for the rest of the enclosing 493block. An inner block may countermand that with 494 495 no strict 'refs'; 496 497Only package variables (globals, even if localized) are visible to 498symbolic references. Lexical variables (declared with my()) aren't in 499a symbol table, and thus are invisible to this mechanism. For example: 500 501 local $value = 10; 502 $ref = "value"; 503 { 504 my $value = 20; 505 print $$ref; 506 } 507 508This will still print 10, not 20. Remember that local() affects package 509variables, which are all "global" to the package. 510 511=head2 Not-so-symbolic references 512 513A new feature contributing to readability in perl version 5.001 is that the 514brackets around a symbolic reference behave more like quotes, just as they 515always have within a string. That is, 516 517 $push = "pop on "; 518 print "${push}over"; 519 520has always meant to print "pop on over", even though push is 521a reserved word. This has been generalized to work the same outside 522of quotes, so that 523 524 print ${push} . "over"; 525 526and even 527 528 print ${ push } . "over"; 529 530will have the same effect. (This would have been a syntax error in 531Perl 5.000, though Perl 4 allowed it in the spaceless form.) This 532construct is I<not> considered to be a symbolic reference when you're 533using strict refs: 534 535 use strict 'refs'; 536 ${ bareword }; # Okay, means $bareword. 537 ${ "bareword" }; # Error, symbolic reference. 538 539Similarly, because of all the subscripting that is done using single 540words, we've applied the same rule to any bareword that is used for 541subscripting a hash. So now, instead of writing 542 543 $array{ "aaa" }{ "bbb" }{ "ccc" } 544 545you can write just 546 547 $array{ aaa }{ bbb }{ ccc } 548 549and not worry about whether the subscripts are reserved words. In the 550rare event that you do wish to do something like 551 552 $array{ shift } 553 554you can force interpretation as a reserved word by adding anything that 555makes it more than a bareword: 556 557 $array{ shift() } 558 $array{ +shift } 559 $array{ shift @_ } 560 561The C<use warnings> pragma or the B<-w> switch will warn you if it 562interprets a reserved word as a string. 563But it will no longer warn you about using lowercase words, because the 564string is effectively quoted. 565 566=head2 Pseudo-hashes: Using an array as a hash 567X<pseudo-hash> X<pseudo hash> X<pseudohash> 568 569Pseudo-hashes have been removed from Perl. The 'fields' pragma 570remains available. 571 572=head2 Function Templates 573X<scope, lexical> X<closure> X<lexical> X<lexical scope> 574X<subroutine, nested> X<sub, nested> X<subroutine, local> X<sub, local> 575 576As explained above, an anonymous function with access to the lexical 577variables visible when that function was compiled, creates a closure. It 578retains access to those variables even though it doesn't get run until 579later, such as in a signal handler or a Tk callback. 580 581Using a closure as a function template allows us to generate many functions 582that act similarly. Suppose you wanted functions named after the colors 583that generated HTML font changes for the various colors: 584 585 print "Be ", red("careful"), "with that ", green("light"); 586 587The red() and green() functions would be similar. To create these, 588we'll assign a closure to a typeglob of the name of the function we're 589trying to build. 590 591 @colors = qw(red blue green yellow orange purple violet); 592 for my $name (@colors) { 593 no strict 'refs'; # allow symbol table manipulation 594 *$name = *{uc $name} = sub { "<FONT COLOR='$name'>@_</FONT>" }; 595 } 596 597Now all those different functions appear to exist independently. You can 598call red(), RED(), blue(), BLUE(), green(), etc. This technique saves on 599both compile time and memory use, and is less error-prone as well, since 600syntax checks happen at compile time. It's critical that any variables in 601the anonymous subroutine be lexicals in order to create a proper closure. 602That's the reasons for the C<my> on the loop iteration variable. 603 604This is one of the only places where giving a prototype to a closure makes 605much sense. If you wanted to impose scalar context on the arguments of 606these functions (probably not a wise idea for this particular example), 607you could have written it this way instead: 608 609 *$name = sub ($) { "<FONT COLOR='$name'>$_[0]</FONT>" }; 610 611However, since prototype checking happens at compile time, the assignment 612above happens too late to be of much use. You could address this by 613putting the whole loop of assignments within a BEGIN block, forcing it 614to occur during compilation. 615 616Access to lexicals that change over time--like those in the C<for> loop 617above, basically aliases to elements from the surrounding lexical scopes-- 618only works with anonymous subs, not with named subroutines. Generally 619said, named subroutines do not nest properly and should only be declared 620in the main package scope. 621 622This is because named subroutines are created at compile time so their 623lexical variables get assigned to the parent lexicals from the first 624execution of the parent block. If a parent scope is entered a second 625time, its lexicals are created again, while the nested subs still 626reference the old ones. 627 628Anonymous subroutines get to capture each time you execute the C<sub> 629operator, as they are created on the fly. If you are accustomed to using 630nested subroutines in other programming languages with their own private 631variables, you'll have to work at it a bit in Perl. The intuitive coding 632of this type of thing incurs mysterious warnings about "will not stay 633shared" due to the reasons explained above. 634For example, this won't work: 635 636 sub outer { 637 my $x = $_[0] + 35; 638 sub inner { return $x * 19 } # WRONG 639 return $x + inner(); 640 } 641 642A work-around is the following: 643 644 sub outer { 645 my $x = $_[0] + 35; 646 local *inner = sub { return $x * 19 }; 647 return $x + inner(); 648 } 649 650Now inner() can only be called from within outer(), because of the 651temporary assignments of the anonymous subroutine. But when it does, 652it has normal access to the lexical variable $x from the scope of 653outer() at the time outer is invoked. 654 655This has the interesting effect of creating a function local to another 656function, something not normally supported in Perl. 657 658=head1 WARNING 659X<reference, string context> X<reference, use as hash key> 660 661You may not (usefully) use a reference as the key to a hash. It will be 662converted into a string: 663 664 $x{ \$a } = $a; 665 666If you try to dereference the key, it won't do a hard dereference, and 667you won't accomplish what you're attempting. You might want to do something 668more like 669 670 $r = \@a; 671 $x{ $r } = $r; 672 673And then at least you can use the values(), which will be 674real refs, instead of the keys(), which won't. 675 676The standard Tie::RefHash module provides a convenient workaround to this. 677 678=head1 SEE ALSO 679 680Besides the obvious documents, source code can be instructive. 681Some pathological examples of the use of references can be found 682in the F<t/op/ref.t> regression test in the Perl source directory. 683 684See also L<perldsc> and L<perllol> for how to use references to create 685complex data structures, and L<perltoot>, L<perlobj>, and L<perlbot> 686for how to use them to create objects. 687