Leaked source code of windows server 2003
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

703 lines
27 KiB

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