add missing file from change#1943
[p5sagit/p5-mst-13.2.git] / pod / perlref.pod
CommitLineData
a0d0e21e 1=head1 NAME
2
3perlref - Perl references and nested data structures
4
5=head1 DESCRIPTION
6
cb1a09d0 7Before release 5 of Perl it was difficult to represent complex data
5a964f20 8structures, because all references had to be symbolic--and even then
9it was difficult to refer to a variable instead of a symbol table entry.
10Perl now not only makes it easier to use symbolic references to variables,
11but also lets you have "hard" references to any piece of data or code.
12Any scalar may hold a hard reference. Because arrays and hashes contain
13scalars, you can now easily build arrays of arrays, arrays of hashes,
14hashes of arrays, arrays of hashes of functions, and so on.
a0d0e21e 15
16Hard references are smart--they keep track of reference counts for you,
2d24ed35 17automatically freeing the thing referred to when its reference count goes
7b8d334a 18to zero. (Note: the reference counts for values in self-referential or
2d24ed35 19cyclic data structures may not go to zero without a little help; see
7b8d334a 20L<perlobj/"Two-Phased Garbage Collection"> for a detailed explanation.)
2d24ed35 21If that thing happens to be an object, the object is destructed. See
22L<perlobj> for more about objects. (In a sense, everything in Perl is an
23object, but we usually reserve the word for references to objects that
24have been officially "blessed" into a class package.)
25
26Symbolic references are names of variables or other objects, just as a
54310121 27symbolic link in a Unix filesystem contains merely the name of a file.
2d24ed35 28The C<*glob> notation is a kind of symbolic reference. (Symbolic
29references are sometimes called "soft references", but please don't call
30them that; references are confusing enough without useless synonyms.)
31
54310121 32In contrast, hard references are more like hard links in a Unix file
2d24ed35 33system: They are used to access an underlying object without concern for
34what its (other) name is. When the word "reference" is used without an
5a964f20 35adjective, as in the following paragraph, it is usually talking about a
2d24ed35 36hard reference.
37
38References are easy to use in Perl. There is just one overriding
39principle: Perl does no implicit referencing or dereferencing. When a
40scalar is holding a reference, it always behaves as a simple scalar. It
41doesn't magically start being an array or hash or subroutine; you have to
42tell it explicitly to do so, by dereferencing it.
a0d0e21e 43
5a964f20 44=head2 Making References
45
46References can be created in several ways.
a0d0e21e 47
48=over 4
49
50=item 1.
51
52By using the backslash operator on a variable, subroutine, or value.
54310121 53(This works much like the & (address-of) operator in C.) Note
5f05dabc 54that this typically creates I<ANOTHER> reference to a variable, because
a0d0e21e 55there's already a reference to the variable in the symbol table. But
56the symbol table reference might go away, and you'll still have the
57reference that the backslash returned. Here are some examples:
58
59 $scalarref = \$foo;
60 $arrayref = \@ARGV;
61 $hashref = \%ENV;
62 $coderef = \&handler;
55497cff 63 $globref = \*foo;
cb1a09d0 64
5a964f20 65It isn't possible to create a true reference to an IO handle (filehandle
66or dirhandle) using the backslash operator. The most you can get is a
67reference to a typeglob, which is actually a complete symbol table entry.
68But see the explanation of the C<*foo{THING}> syntax below. However,
69you can still use type globs and globrefs as though they were IO handles.
a0d0e21e 70
71=item 2.
72
5a964f20 73A reference to an anonymous array can be created using square
a0d0e21e 74brackets:
75
76 $arrayref = [1, 2, ['a', 'b', 'c']];
77
5a964f20 78Here we've created a reference to an anonymous array of three elements
54310121 79whose final element is itself a reference to another anonymous array of three
a0d0e21e 80elements. (The multidimensional syntax described later can be used to
184e9718 81access this. For example, after the above, C<$arrayref-E<gt>[2][1]> would have
a0d0e21e 82the value "b".)
83
cb1a09d0 84Note that taking a reference to an enumerated list is not the same
85as using square brackets--instead it's the same as creating
86a list of references!
87
54310121 88 @list = (\$a, \@b, \%c);
58e0a6ae 89 @list = \($a, @b, %c); # same thing!
90
54310121 91As a special case, C<\(@foo)> returns a list of references to the contents
b6429b1b 92of C<@foo>, not a reference to C<@foo> itself. Likewise for C<%foo>,
93except that the key references are to copies (since the keys are just
94strings rather than full-fledged scalars).
cb1a09d0 95
a0d0e21e 96=item 3.
97
5a964f20 98A reference to an anonymous hash can be created using curly
a0d0e21e 99brackets:
100
101 $hashref = {
102 'Adam' => 'Eve',
103 'Clyde' => 'Bonnie',
104 };
105
5a964f20 106Anonymous hash and array composers like these can be intermixed freely to
a0d0e21e 107produce as complicated a structure as you want. The multidimensional
108syntax described below works for these too. The values above are
109literals, but variables and expressions would work just as well, because
110assignment operators in Perl (even within local() or my()) are executable
111statements, not compile-time declarations.
112
113Because curly brackets (braces) are used for several other things
114including BLOCKs, you may occasionally have to disambiguate braces at the
115beginning of a statement by putting a C<+> or a C<return> in front so
116that Perl realizes the opening brace isn't starting a BLOCK. The economy and
117mnemonic value of using curlies is deemed worth this occasional extra
118hassle.
119
120For example, if you wanted a function to make a new hash and return a
121reference to it, you have these options:
122
123 sub hashem { { @_ } } # silently wrong
124 sub hashem { +{ @_ } } # ok
125 sub hashem { return { @_ } } # ok
126
ebc58f1a 127On the other hand, if you want the other meaning, you can do this:
128
129 sub showem { { @_ } } # ambiguous (currently ok, but may change)
130 sub showem { {; @_ } } # ok
131 sub showem { { return @_ } } # ok
132
133Note how the leading C<+{> and C<{;> always serve to disambiguate
134the expression to mean either the HASH reference, or the BLOCK.
135
a0d0e21e 136=item 4.
137
5a964f20 138A reference to an anonymous subroutine can be created by using
a0d0e21e 139C<sub> without a subname:
140
141 $coderef = sub { print "Boink!\n" };
142
143Note the presence of the semicolon. Except for the fact that the code
144inside isn't executed immediately, a C<sub {}> is not so much a
145declaration as it is an operator, like C<do{}> or C<eval{}>. (However, no
5a964f20 146matter how many times you execute that particular line (unless you're in an
a0d0e21e 147C<eval("...")>), C<$coderef> will still have a reference to the I<SAME>
148anonymous subroutine.)
149
748a9306 150Anonymous subroutines act as closures with respect to my() variables,
151that is, variables visible lexically within the current scope. Closure
152is a notion out of the Lisp world that says if you define an anonymous
153function in a particular lexical context, it pretends to run in that
154context even when it's called outside of the context.
155
156In human terms, it's a funny way of passing arguments to a subroutine when
157you define it as well as when you call it. It's useful for setting up
158little bits of code to run later, such as callbacks. You can even
54310121 159do object-oriented stuff with it, though Perl already provides a different
160mechanism to do that--see L<perlobj>.
748a9306 161
162You can also think of closure as a way to write a subroutine template without
163using eval. (In fact, in version 5.000, eval was the I<only> way to get
164closures. You may wish to use "require 5.001" if you use closures.)
165
166Here's a small example of how closures works:
167
168 sub newprint {
169 my $x = shift;
170 return sub { my $y = shift; print "$x, $y!\n"; };
a0d0e21e 171 }
748a9306 172 $h = newprint("Howdy");
173 $g = newprint("Greetings");
174
175 # Time passes...
176
177 &$h("world");
178 &$g("earthlings");
a0d0e21e 179
748a9306 180This prints
181
182 Howdy, world!
183 Greetings, earthlings!
184
185Note particularly that $x continues to refer to the value passed into
cb1a09d0 186newprint() I<despite> the fact that the "my $x" has seemingly gone out of
748a9306 187scope by the time the anonymous subroutine runs. That's what closure
188is all about.
189
5a964f20 190This applies only to lexical variables, by the way. Dynamic variables
748a9306 191continue to work as they have always worked. Closure is not something
192that most Perl programmers need trouble themselves about to begin with.
a0d0e21e 193
194=item 5.
195
196References are often returned by special subroutines called constructors.
748a9306 197Perl objects are just references to a special kind of object that happens to know
a0d0e21e 198which package it's associated with. Constructors are just special
199subroutines that know how to create that association. They do so by
200starting with an ordinary reference, and it remains an ordinary reference
5a964f20 201even while it's also being an object. Constructors are often
202named new() and called indirectly:
a0d0e21e 203
204 $objref = new Doggie (Tail => 'short', Ears => 'long');
205
5a964f20 206But don't have to be:
207
208 $objref = Doggie->new(Tail => 'short', Ears => 'long');
209
210 use Term::Cap;
211 $terminal = Term::Cap->Tgetent( { OSPEED => 9600 });
212
213 use Tk;
214 $main = MainWindow->new();
215 $menubar = $main->Frame(-relief => "raised",
216 -borderwidth => 2)
217
a0d0e21e 218=item 6.
219
220References of the appropriate type can spring into existence if you
5f05dabc 221dereference them in a context that assumes they exist. Because we haven't
a0d0e21e 222talked about dereferencing yet, we can't show you any examples yet.
223
cb1a09d0 224=item 7.
225
55497cff 226A reference can be created by using a special syntax, lovingly known as
227the *foo{THING} syntax. *foo{THING} returns a reference to the THING
228slot in *foo (which is the symbol table entry which holds everything
229known as foo).
cb1a09d0 230
55497cff 231 $scalarref = *foo{SCALAR};
232 $arrayref = *ARGV{ARRAY};
233 $hashref = *ENV{HASH};
234 $coderef = *handler{CODE};
36477c24 235 $ioref = *STDIN{IO};
55497cff 236 $globref = *foo{GLOB};
237
36477c24 238All of these are self-explanatory except for *foo{IO}. It returns the
239IO handle, used for file handles (L<perlfunc/open>), sockets
240(L<perlfunc/socket> and L<perlfunc/socketpair>), and directory handles
241(L<perlfunc/opendir>). For compatibility with previous versions of
242Perl, *foo{FILEHANDLE} is a synonym for *foo{IO}.
55497cff 243
5f05dabc 244*foo{THING} returns undef if that particular THING hasn't been used yet,
245except in the case of scalars. *foo{SCALAR} returns a reference to an
246anonymous scalar if $foo hasn't been used yet. This might change in a
247future release.
248
5a964f20 249*foo{IO} is an alternative to the \*HANDLE mechanism given in
250L<perldata/"Typeglobs and Filehandles"> for passing filehandles
251into or out of subroutines, or storing into larger data structures.
252Its disadvantage is that it won't create a new filehandle for you.
253Its advantage is that you have no risk of clobbering more than you want
254to with a typeglob assignment, although if you assign to a scalar instead
255of a typeglob, you're ok.
36477c24 256
5a964f20 257 splutter(*STDOUT);
36477c24 258 splutter(*STDOUT{IO});
5a964f20 259
cb1a09d0 260 sub splutter {
261 my $fh = shift;
262 print $fh "her um well a hmmm\n";
263 }
264
5a964f20 265 $rec = get_rec(*STDIN);
36477c24 266 $rec = get_rec(*STDIN{IO});
5a964f20 267
cb1a09d0 268 sub get_rec {
269 my $fh = shift;
270 return scalar <$fh>;
271 }
272
a0d0e21e 273=back
274
5a964f20 275=head2 Using References
276
a0d0e21e 277That's it for creating references. By now you're probably dying to
278know how to use references to get back to your long-lost data. There
279are several basic methods.
280
281=over 4
282
283=item 1.
284
6309d9d9 285Anywhere you'd put an identifier (or chain of identifiers) as part
286of a variable or subroutine name, you can replace the identifier with
287a simple scalar variable containing a reference of the correct type:
a0d0e21e 288
289 $bar = $$scalarref;
290 push(@$arrayref, $filename);
291 $$arrayref[0] = "January";
292 $$hashref{"KEY"} = "VALUE";
293 &$coderef(1,2,3);
cb1a09d0 294 print $globref "output\n";
a0d0e21e 295
296It's important to understand that we are specifically I<NOT> dereferencing
297C<$arrayref[0]> or C<$hashref{"KEY"}> there. The dereference of the
298scalar variable happens I<BEFORE> it does any key lookups. Anything more
299complicated than a simple scalar variable must use methods 2 or 3 below.
300However, a "simple scalar" includes an identifier that itself uses method
3011 recursively. Therefore, the following prints "howdy".
302
303 $refrefref = \\\"howdy";
304 print $$$$refrefref;
305
306=item 2.
307
6309d9d9 308Anywhere you'd put an identifier (or chain of identifiers) as part of a
309variable or subroutine name, you can replace the identifier with a
310BLOCK returning a reference of the correct type. In other words, the
311previous examples could be written like this:
a0d0e21e 312
313 $bar = ${$scalarref};
314 push(@{$arrayref}, $filename);
315 ${$arrayref}[0] = "January";
316 ${$hashref}{"KEY"} = "VALUE";
317 &{$coderef}(1,2,3);
36477c24 318 $globref->print("output\n"); # iff IO::Handle is loaded
a0d0e21e 319
320Admittedly, it's a little silly to use the curlies in this case, but
321the BLOCK can contain any arbitrary expression, in particular,
322subscripted expressions:
323
54310121 324 &{ $dispatch{$index} }(1,2,3); # call correct routine
a0d0e21e 325
326Because of being able to omit the curlies for the simple case of C<$$x>,
327people often make the mistake of viewing the dereferencing symbols as
328proper operators, and wonder about their precedence. If they were,
5f05dabc 329though, you could use parentheses instead of braces. That's not the case.
a0d0e21e 330Consider the difference below; case 0 is a short-hand version of case 1,
331I<NOT> case 2:
332
333 $$hashref{"KEY"} = "VALUE"; # CASE 0
334 ${$hashref}{"KEY"} = "VALUE"; # CASE 1
335 ${$hashref{"KEY"}} = "VALUE"; # CASE 2
336 ${$hashref->{"KEY"}} = "VALUE"; # CASE 3
337
338Case 2 is also deceptive in that you're accessing a variable
339called %hashref, not dereferencing through $hashref to the hash
340it's presumably referencing. That would be case 3.
341
342=item 3.
343
6da72b64 344Subroutine calls and lookups of individual array elements arise often
345enough that it gets cumbersome to use method 2. As a form of
346syntactic sugar, the examples for method 2 may be written:
a0d0e21e 347
6da72b64 348 $arrayref->[0] = "January"; # Array element
349 $hashref->{"KEY"} = "VALUE"; # Hash element
350 $coderef->(1,2,3); # Subroutine call
a0d0e21e 351
6da72b64 352The left side of the arrow can be any expression returning a reference,
a0d0e21e 353including a previous dereference. Note that C<$array[$x]> is I<NOT> the
354same thing as C<$array-E<gt>[$x]> here:
355
356 $array[$x]->{"foo"}->[0] = "January";
357
358This is one of the cases we mentioned earlier in which references could
359spring into existence when in an lvalue context. Before this
360statement, C<$array[$x]> may have been undefined. If so, it's
361automatically defined with a hash reference so that we can look up
362C<{"foo"}> in it. Likewise C<$array[$x]-E<gt>{"foo"}> will automatically get
363defined with an array reference so that we can look up C<[0]> in it.
5a964f20 364This process is called I<autovivification>.
a0d0e21e 365
366One more thing here. The arrow is optional I<BETWEEN> brackets
367subscripts, so you can shrink the above down to
368
369 $array[$x]{"foo"}[0] = "January";
370
371Which, in the degenerate case of using only ordinary arrays, gives you
372multidimensional arrays just like C's:
373
374 $score[$x][$y][$z] += 42;
375
376Well, okay, not entirely like C's arrays, actually. C doesn't know how
377to grow its arrays on demand. Perl does.
378
379=item 4.
380
381If a reference happens to be a reference to an object, then there are
382probably methods to access the things referred to, and you should probably
383stick to those methods unless you're in the class package that defines the
384object's methods. In other words, be nice, and don't violate the object's
385encapsulation without a very good reason. Perl does not enforce
386encapsulation. We are not totalitarians here. We do expect some basic
387civility though.
388
389=back
390
391The ref() operator may be used to determine what type of thing the
392reference is pointing to. See L<perlfunc>.
393
5a964f20 394The bless() operator may be used to associate the object a reference
395points to with a package functioning as an object class. See L<perlobj>.
a0d0e21e 396
5f05dabc 397A typeglob may be dereferenced the same way a reference can, because
a0d0e21e 398the dereference syntax always indicates the kind of reference desired.
399So C<${*foo}> and C<${\$foo}> both indicate the same scalar variable.
400
401Here's a trick for interpolating a subroutine call into a string:
402
cb1a09d0 403 print "My sub returned @{[mysub(1,2,3)]} that time.\n";
404
405The way it works is that when the C<@{...}> is seen in the double-quoted
406string, it's evaluated as a block. The block creates a reference to an
407anonymous array containing the results of the call to C<mysub(1,2,3)>. So
408the whole block returns a reference to an array, which is then
409dereferenced by C<@{...}> and stuck into the double-quoted string. This
410chicanery is also useful for arbitrary expressions:
a0d0e21e 411
184e9718 412 print "That yields @{[$n + 5]} widgets\n";
a0d0e21e 413
414=head2 Symbolic references
415
416We said that references spring into existence as necessary if they are
417undefined, but we didn't say what happens if a value used as a
418reference is already defined, but I<ISN'T> a hard reference. If you
419use it as a reference in this case, it'll be treated as a symbolic
420reference. That is, the value of the scalar is taken to be the I<NAME>
421of a variable, rather than a direct link to a (possibly) anonymous
422value.
423
424People frequently expect it to work like this. So it does.
425
426 $name = "foo";
427 $$name = 1; # Sets $foo
428 ${$name} = 2; # Sets $foo
429 ${$name x 2} = 3; # Sets $foofoo
430 $name->[0] = 4; # Sets $foo[0]
431 @$name = (); # Clears @foo
432 &$name(); # Calls &foo() (as in Perl 4)
433 $pack = "THAT";
434 ${"${pack}::$name"} = 5; # Sets $THAT::foo without eval
435
436This is very powerful, and slightly dangerous, in that it's possible
437to intend (with the utmost sincerity) to use a hard reference, and
438accidentally use a symbolic reference instead. To protect against
439that, you can say
440
441 use strict 'refs';
442
443and then only hard references will be allowed for the rest of the enclosing
54310121 444block. An inner block may countermand that with
a0d0e21e 445
446 no strict 'refs';
447
5a964f20 448Only package variables (globals, even if localized) are visible to
449symbolic references. Lexical variables (declared with my()) aren't in
450a symbol table, and thus are invisible to this mechanism. For example:
a0d0e21e 451
5a964f20 452 local $value = 10;
a0d0e21e 453 $ref = \$value;
454 {
455 my $value = 20;
456 print $$ref;
54310121 457 }
a0d0e21e 458
459This will still print 10, not 20. Remember that local() affects package
460variables, which are all "global" to the package.
461
748a9306 462=head2 Not-so-symbolic references
463
a6006777 464A new feature contributing to readability in perl version 5.001 is that the
465brackets around a symbolic reference behave more like quotes, just as they
748a9306 466always have within a string. That is,
467
468 $push = "pop on ";
469 print "${push}over";
470
471has always meant to print "pop on over", despite the fact that push is
472a reserved word. This has been generalized to work the same outside
473of quotes, so that
474
475 print ${push} . "over";
476
477and even
478
479 print ${ push } . "over";
480
481will have the same effect. (This would have been a syntax error in
a6006777 482Perl 5.000, though Perl 4 allowed it in the spaceless form.) Note that this
748a9306 483construct is I<not> considered to be a symbolic reference when you're
484using strict refs:
485
486 use strict 'refs';
487 ${ bareword }; # Okay, means $bareword.
488 ${ "bareword" }; # Error, symbolic reference.
489
490Similarly, because of all the subscripting that is done using single
491words, we've applied the same rule to any bareword that is used for
492subscripting a hash. So now, instead of writing
493
494 $array{ "aaa" }{ "bbb" }{ "ccc" }
495
5f05dabc 496you can write just
748a9306 497
498 $array{ aaa }{ bbb }{ ccc }
499
500and not worry about whether the subscripts are reserved words. In the
501rare event that you do wish to do something like
502
503 $array{ shift }
504
505you can force interpretation as a reserved word by adding anything that
506makes it more than a bareword:
507
508 $array{ shift() }
509 $array{ +shift }
510 $array{ shift @_ }
511
512The B<-w> switch will warn you if it interprets a reserved word as a string.
5f05dabc 513But it will no longer warn you about using lowercase words, because the
748a9306 514string is effectively quoted.
515
49399b3f 516=head2 Pseudo-hashes: Using an array as a hash
517
518WARNING: This section describes an experimental feature. Details may
519change without notice in future versions.
520
521Beginning with release 5.005 of Perl you can use an array reference
522in some contexts that would normally require a hash reference. This
523allows you to access array elements using symbolic names, as if they
524were fields in a structure.
525
526For this to work, the array must contain extra information. The first
527element of the array has to be a hash reference that maps field names
528to array indices. Here is an example:
529
530 $struct = [{foo => 1, bar => 2}, "FOO", "BAR"];
531
532 $struct->{foo}; # same as $struct->[1], i.e. "FOO"
533 $struct->{bar}; # same as $struct->[2], i.e. "BAR"
534
535 keys %$struct; # will return ("foo", "bar") in some order
536 values %$struct; # will return ("FOO", "BAR") in same some order
537
538 while (my($k,$v) = each %$struct) {
539 print "$k => $v\n";
540 }
541
542Perl will raise an exception if you try to delete keys from a pseudo-hash
543or try to access nonexistent fields. For better performance, Perl can also
544do the translation from field names to array indices at compile time for
545typed object references. See L<fields>.
546
547
5a964f20 548=head2 Function Templates
549
550As explained above, a closure is an anonymous function with access to the
551lexical variables visible when that function was compiled. It retains
552access to those variables even though it doesn't get run until later,
553such as in a signal handler or a Tk callback.
554
555Using a closure as a function template allows us to generate many functions
556that act similarly. Suppopose you wanted functions named after the colors
557that generated HTML font changes for the various colors:
558
559 print "Be ", red("careful"), "with that ", green("light");
560
561The red() and green() functions would be very similar. To create these,
562we'll assign a closure to a typeglob of the name of the function we're
563trying to build.
564
565 @colors = qw(red blue green yellow orange purple violet);
566 for my $name (@colors) {
567 no strict 'refs'; # allow symbol table manipulation
568 *$name = *{uc $name} = sub { "<FONT COLOR='$name'>@_</FONT>" };
569 }
570
571Now all those different functions appear to exist independently. You can
572call red(), RED(), blue(), BLUE(), green(), etc. This technique saves on
573both compile time and memory use, and is less error-prone as well, since
574syntax checks happen at compile time. It's critical that any variables in
575the anonymous subroutine be lexicals in order to create a proper closure.
576That's the reasons for the C<my> on the loop iteration variable.
577
578This is one of the only places where giving a prototype to a closure makes
579much sense. If you wanted to impose scalar context on the arguments of
580these functions (probably not a wise idea for this particular example),
581you could have written it this way instead:
582
583 *$name = sub ($) { "<FONT COLOR='$name'>$_[0]</FONT>" };
584
585However, since prototype checking happens at compile time, the assignment
586above happens too late to be of much use. You could address this by
587putting the whole loop of assignments within a BEGIN block, forcing it
588to occur during compilation.
589
590Access to lexicals that change over type--like those in the C<for> loop
591above--only works with closures, not general subroutines. In the general
592case, then, named subroutines do not nest properly, although anonymous
593ones do. If you are accustomed to using nested subroutines in other
594programming languages with their own private variables, you'll have to
595work at it a bit in Perl. The intuitive coding of this kind of thing
596incurs mysterious warnings about ``will not stay shared''. For example,
597this won't work:
598
599 sub outer {
600 my $x = $_[0] + 35;
601 sub inner { return $x * 19 } # WRONG
602 return $x + inner();
603 }
604
605A work-around is the following:
606
607 sub outer {
608 my $x = $_[0] + 35;
609 local *inner = sub { return $x * 19 };
610 return $x + inner();
611 }
612
613Now inner() can only be called from within outer(), because of the
614temporary assignments of the closure (anonymous subroutine). But when
615it does, it has normal access to the lexical variable $x from the scope
616of outer().
617
618This has the interesting effect of creating a function local to another
619function, something not normally supported in Perl.
620
cb1a09d0 621=head1 WARNING
748a9306 622
623You may not (usefully) use a reference as the key to a hash. It will be
624converted into a string:
625
626 $x{ \$a } = $a;
627
54310121 628If you try to dereference the key, it won't do a hard dereference, and
184e9718 629you won't accomplish what you're attempting. You might want to do something
cb1a09d0 630more like
748a9306 631
cb1a09d0 632 $r = \@a;
633 $x{ $r } = $r;
634
635And then at least you can use the values(), which will be
636real refs, instead of the keys(), which won't.
637
5a964f20 638The standard Tie::RefHash module provides a convenient workaround to this.
639
cb1a09d0 640=head1 SEE ALSO
a0d0e21e 641
642Besides the obvious documents, source code can be instructive.
643Some rather pathological examples of the use of references can be found
644in the F<t/op/ref.t> regression test in the Perl source directory.
cb1a09d0 645
646See also L<perldsc> and L<perllol> for how to use references to create
5a964f20 647complex data structures, and L<perltoot>, L<perlobj>, and L<perlbot>
648for how to use them to create objects.