Source code of Windows XP (NT5)
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.

654 lines
24 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. (Note: the 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 a kind 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.) Note
  46. that 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-E<gt>[2][1]> would have
  68. the value "b".)
  69. Note that 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. Note how 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 presence of the semicolon. Except for the fact that the code
  113. inside isn't executed immediately, 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("...")>), C<$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 visible lexically 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 of 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 can also think of closure as a way to write a subroutine template without
  129. using eval. (In fact, in version 5.000, eval was the I<only> way to get
  130. closures. You may wish to use "require 5.001" if you use closures.)
  131. Here's a small example of how closures works:
  132. sub newprint {
  133. my $x = shift;
  134. return sub { my $y = shift; print "$x, $y!\n"; };
  135. }
  136. $h = newprint("Howdy");
  137. $g = newprint("Greetings");
  138. # Time passes...
  139. &$h("world");
  140. &$g("earthlings");
  141. This prints
  142. Howdy, world!
  143. Greetings, earthlings!
  144. Note particularly that $x continues to refer to the value passed into
  145. newprint() I<despite> the fact that the "my $x" has seemingly gone out of
  146. scope by the time the anonymous subroutine runs. That's what closure
  147. is all about.
  148. This applies only to lexical variables, by the way. Dynamic variables
  149. continue to work as they have always worked. Closure is not something
  150. that most Perl programmers need trouble themselves about to begin with.
  151. =item 5.
  152. References are often returned by special subroutines called constructors.
  153. Perl objects are just references to a special kind of object that happens to know
  154. which package it's associated with. Constructors are just special
  155. subroutines that know how to create that association. They do so by
  156. starting with an ordinary reference, and it remains an ordinary reference
  157. even while it's also being an object. Constructors are often
  158. named new() and called indirectly:
  159. $objref = new Doggie (Tail => 'short', Ears => 'long');
  160. But don't have to be:
  161. $objref = Doggie->new(Tail => 'short', Ears => 'long');
  162. use Term::Cap;
  163. $terminal = Term::Cap->Tgetent( { OSPEED => 9600 });
  164. use Tk;
  165. $main = MainWindow->new();
  166. $menubar = $main->Frame(-relief => "raised",
  167. -borderwidth => 2)
  168. =item 6.
  169. References of the appropriate type can spring into existence if you
  170. dereference them in a context that assumes they exist. Because we haven't
  171. talked about dereferencing yet, we can't show you any examples yet.
  172. =item 7.
  173. A reference can be created by using a special syntax, lovingly known as
  174. the *foo{THING} syntax. *foo{THING} returns a reference to the THING
  175. slot in *foo (which is the symbol table entry which holds everything
  176. known as foo).
  177. $scalarref = *foo{SCALAR};
  178. $arrayref = *ARGV{ARRAY};
  179. $hashref = *ENV{HASH};
  180. $coderef = *handler{CODE};
  181. $ioref = *STDIN{IO};
  182. $globref = *foo{GLOB};
  183. All of these are self-explanatory except for *foo{IO}. It returns the
  184. IO handle, used for file handles (L<perlfunc/open>), sockets
  185. (L<perlfunc/socket> and L<perlfunc/socketpair>), and directory handles
  186. (L<perlfunc/opendir>). For compatibility with previous versions of
  187. Perl, *foo{FILEHANDLE} is a synonym for *foo{IO}.
  188. *foo{THING} returns undef if that particular THING hasn't been used yet,
  189. except in the case of scalars. *foo{SCALAR} returns a reference to an
  190. anonymous scalar if $foo hasn't been used yet. This might change in a
  191. future release.
  192. *foo{IO} is an alternative to the \*HANDLE mechanism given in
  193. L<perldata/"Typeglobs and Filehandles"> for passing filehandles
  194. into or out of subroutines, or storing into larger data structures.
  195. Its disadvantage is that it won't create a new filehandle for you.
  196. Its advantage is that you have no risk of clobbering more than you want
  197. to with a typeglob assignment, although if you assign to a scalar instead
  198. of a typeglob, you're ok.
  199. splutter(*STDOUT);
  200. splutter(*STDOUT{IO});
  201. sub splutter {
  202. my $fh = shift;
  203. print $fh "her um well a hmmm\n";
  204. }
  205. $rec = get_rec(*STDIN);
  206. $rec = get_rec(*STDIN{IO});
  207. sub get_rec {
  208. my $fh = shift;
  209. return scalar <$fh>;
  210. }
  211. =back
  212. =head2 Using References
  213. That's it for creating references. By now you're probably dying to
  214. know how to use references to get back to your long-lost data. There
  215. are several basic methods.
  216. =over 4
  217. =item 1.
  218. Anywhere you'd put an identifier (or chain of identifiers) as part
  219. of a variable or subroutine name, you can replace the identifier with
  220. a simple scalar variable containing a reference of the correct type:
  221. $bar = $$scalarref;
  222. push(@$arrayref, $filename);
  223. $$arrayref[0] = "January";
  224. $$hashref{"KEY"} = "VALUE";
  225. &$coderef(1,2,3);
  226. print $globref "output\n";
  227. It's important to understand that we are specifically I<NOT> dereferencing
  228. C<$arrayref[0]> or C<$hashref{"KEY"}> there. The dereference of the
  229. scalar variable happens I<BEFORE> it does any key lookups. Anything more
  230. complicated than a simple scalar variable must use methods 2 or 3 below.
  231. However, a "simple scalar" includes an identifier that itself uses method
  232. 1 recursively. Therefore, the following prints "howdy".
  233. $refrefref = \\\"howdy";
  234. print $$$$refrefref;
  235. =item 2.
  236. Anywhere you'd put an identifier (or chain of identifiers) as part of a
  237. variable or subroutine name, you can replace the identifier with a
  238. BLOCK returning a reference of the correct type. In other words, the
  239. previous examples could be written like this:
  240. $bar = ${$scalarref};
  241. push(@{$arrayref}, $filename);
  242. ${$arrayref}[0] = "January";
  243. ${$hashref}{"KEY"} = "VALUE";
  244. &{$coderef}(1,2,3);
  245. $globref->print("output\n"); # iff IO::Handle is loaded
  246. Admittedly, it's a little silly to use the curlies in this case, but
  247. the BLOCK can contain any arbitrary expression, in particular,
  248. subscripted expressions:
  249. &{ $dispatch{$index} }(1,2,3); # call correct routine
  250. Because of being able to omit the curlies for the simple case of C<$$x>,
  251. people often make the mistake of viewing the dereferencing symbols as
  252. proper operators, and wonder about their precedence. If they were,
  253. though, you could use parentheses instead of braces. That's not the case.
  254. Consider the difference below; case 0 is a short-hand version of case 1,
  255. I<NOT> case 2:
  256. $$hashref{"KEY"} = "VALUE"; # CASE 0
  257. ${$hashref}{"KEY"} = "VALUE"; # CASE 1
  258. ${$hashref{"KEY"}} = "VALUE"; # CASE 2
  259. ${$hashref->{"KEY"}} = "VALUE"; # CASE 3
  260. Case 2 is also deceptive in that you're accessing a variable
  261. called %hashref, not dereferencing through $hashref to the hash
  262. it's presumably referencing. That would be case 3.
  263. =item 3.
  264. Subroutine calls and lookups of individual array elements arise often
  265. enough that it gets cumbersome to use method 2. As a form of
  266. syntactic sugar, the examples for method 2 may be written:
  267. $arrayref->[0] = "January"; # Array element
  268. $hashref->{"KEY"} = "VALUE"; # Hash element
  269. $coderef->(1,2,3); # Subroutine call
  270. The left side of the arrow can be any expression returning a reference,
  271. including a previous dereference. Note that C<$array[$x]> is I<NOT> the
  272. same thing as C<$array-E<gt>[$x]> here:
  273. $array[$x]->{"foo"}->[0] = "January";
  274. This is one of the cases we mentioned earlier in which references could
  275. spring into existence when in an lvalue context. Before this
  276. statement, C<$array[$x]> may have been undefined. If so, it's
  277. automatically defined with a hash reference so that we can look up
  278. C<{"foo"}> in it. Likewise C<$array[$x]-E<gt>{"foo"}> will automatically get
  279. defined with an array reference so that we can look up C<[0]> in it.
  280. This process is called I<autovivification>.
  281. One more thing here. The arrow is optional I<BETWEEN> brackets
  282. subscripts, so you can shrink the above down to
  283. $array[$x]{"foo"}[0] = "January";
  284. Which, in the degenerate case of using only ordinary arrays, gives you
  285. multidimensional arrays just like C's:
  286. $score[$x][$y][$z] += 42;
  287. Well, okay, not entirely like C's arrays, actually. C doesn't know how
  288. to grow its arrays on demand. Perl does.
  289. =item 4.
  290. If a reference happens to be a reference to an object, then there are
  291. probably methods to access the things referred to, and you should probably
  292. stick to those methods unless you're in the class package that defines the
  293. object's methods. In other words, be nice, and don't violate the object's
  294. encapsulation without a very good reason. Perl does not enforce
  295. encapsulation. We are not totalitarians here. We do expect some basic
  296. civility though.
  297. =back
  298. The ref() operator may be used to determine what type of thing the
  299. reference is pointing to. See L<perlfunc>.
  300. The bless() operator may be used to associate the object a reference
  301. points to with a package functioning as an object class. See L<perlobj>.
  302. A typeglob may be dereferenced the same way a reference can, because
  303. the dereference syntax always indicates the kind of reference desired.
  304. So C<${*foo}> and C<${\$foo}> both indicate the same scalar variable.
  305. Here's a trick for interpolating a subroutine call into a string:
  306. print "My sub returned @{[mysub(1,2,3)]} that time.\n";
  307. The way it works is that when the C<@{...}> is seen in the double-quoted
  308. string, it's evaluated as a block. The block creates a reference to an
  309. anonymous array containing the results of the call to C<mysub(1,2,3)>. So
  310. the whole block returns a reference to an array, which is then
  311. dereferenced by C<@{...}> and stuck into the double-quoted string. This
  312. chicanery is also useful for arbitrary expressions:
  313. print "That yields @{[$n + 5]} widgets\n";
  314. =head2 Symbolic references
  315. We said that references spring into existence as necessary if they are
  316. undefined, but we didn't say what happens if a value used as a
  317. reference is already defined, but I<ISN'T> a hard reference. If you
  318. use it as a reference in this case, it'll be treated as a symbolic
  319. reference. That is, the value of the scalar is taken to be the I<NAME>
  320. of a variable, rather than a direct link to a (possibly) anonymous
  321. value.
  322. People frequently expect it to work like this. So it does.
  323. $name = "foo";
  324. $$name = 1; # Sets $foo
  325. ${$name} = 2; # Sets $foo
  326. ${$name x 2} = 3; # Sets $foofoo
  327. $name->[0] = 4; # Sets $foo[0]
  328. @$name = (); # Clears @foo
  329. &$name(); # Calls &foo() (as in Perl 4)
  330. $pack = "THAT";
  331. ${"${pack}::$name"} = 5; # Sets $THAT::foo without eval
  332. This is very powerful, and slightly dangerous, in that it's possible
  333. to intend (with the utmost sincerity) to use a hard reference, and
  334. accidentally use a symbolic reference instead. To protect against
  335. that, you can say
  336. use strict 'refs';
  337. and then only hard references will be allowed for the rest of the enclosing
  338. block. An inner block may countermand that with
  339. no strict 'refs';
  340. Only package variables (globals, even if localized) are visible to
  341. symbolic references. Lexical variables (declared with my()) aren't in
  342. a symbol table, and thus are invisible to this mechanism. For example:
  343. local $value = 10;
  344. $ref = "value";
  345. {
  346. my $value = 20;
  347. print $$ref;
  348. }
  349. This will still print 10, not 20. Remember that local() affects package
  350. variables, which are all "global" to the package.
  351. =head2 Not-so-symbolic references
  352. A new feature contributing to readability in perl version 5.001 is that the
  353. brackets around a symbolic reference behave more like quotes, just as they
  354. always have within a string. That is,
  355. $push = "pop on ";
  356. print "${push}over";
  357. has always meant to print "pop on over", despite the fact that push is
  358. a reserved word. This has been generalized to work the same outside
  359. of quotes, so that
  360. print ${push} . "over";
  361. and even
  362. print ${ push } . "over";
  363. will have the same effect. (This would have been a syntax error in
  364. Perl 5.000, though Perl 4 allowed it in the spaceless form.) Note that this
  365. construct is I<not> considered to be a symbolic reference when you're
  366. using strict refs:
  367. use strict 'refs';
  368. ${ bareword }; # Okay, means $bareword.
  369. ${ "bareword" }; # Error, symbolic reference.
  370. Similarly, because of all the subscripting that is done using single
  371. words, we've applied the same rule to any bareword that is used for
  372. subscripting a hash. So now, instead of writing
  373. $array{ "aaa" }{ "bbb" }{ "ccc" }
  374. you can write just
  375. $array{ aaa }{ bbb }{ ccc }
  376. and not worry about whether the subscripts are reserved words. In the
  377. rare event that you do wish to do something like
  378. $array{ shift }
  379. you can force interpretation as a reserved word by adding anything that
  380. makes it more than a bareword:
  381. $array{ shift() }
  382. $array{ +shift }
  383. $array{ shift @_ }
  384. The B<-w> switch will warn you if it interprets a reserved word as a string.
  385. But it will no longer warn you about using lowercase words, because the
  386. string is effectively quoted.
  387. =head2 Pseudo-hashes: Using an array as a hash
  388. WARNING: This section describes an experimental feature. Details may
  389. change without notice in future versions.
  390. Beginning with release 5.005 of Perl you can use an array reference
  391. in some contexts that would normally require a hash reference. This
  392. allows you to access array elements using symbolic names, as if they
  393. were fields in a structure.
  394. For this to work, the array must contain extra information. The first
  395. element of the array has to be a hash reference that maps field names
  396. to array indices. Here is an example:
  397. $struct = [{foo => 1, bar => 2}, "FOO", "BAR"];
  398. $struct->{foo}; # same as $struct->[1], i.e. "FOO"
  399. $struct->{bar}; # same as $struct->[2], i.e. "BAR"
  400. keys %$struct; # will return ("foo", "bar") in some order
  401. values %$struct; # will return ("FOO", "BAR") in same some order
  402. while (my($k,$v) = each %$struct) {
  403. print "$k => $v\n";
  404. }
  405. Perl will raise an exception if you try to delete keys from a pseudo-hash
  406. or try to access nonexistent fields. For better performance, Perl can also
  407. do the translation from field names to array indices at compile time for
  408. typed object references. See L<fields>.
  409. =head2 Function Templates
  410. As explained above, a closure is an anonymous function with access to the
  411. lexical variables visible when that function was compiled. It retains
  412. access to those variables even though it doesn't get run until later,
  413. such as in a signal handler or a Tk callback.
  414. Using a closure as a function template allows us to generate many functions
  415. that act similarly. Suppose you wanted functions named after the colors
  416. that generated HTML font changes for the various colors:
  417. print "Be ", red("careful"), "with that ", green("light");
  418. The red() and green() functions would be very similar. To create these,
  419. we'll assign a closure to a typeglob of the name of the function we're
  420. trying to build.
  421. @colors = qw(red blue green yellow orange purple violet);
  422. for my $name (@colors) {
  423. no strict 'refs'; # allow symbol table manipulation
  424. *$name = *{uc $name} = sub { "<FONT COLOR='$name'>@_</FONT>" };
  425. }
  426. Now all those different functions appear to exist independently. You can
  427. call red(), RED(), blue(), BLUE(), green(), etc. This technique saves on
  428. both compile time and memory use, and is less error-prone as well, since
  429. syntax checks happen at compile time. It's critical that any variables in
  430. the anonymous subroutine be lexicals in order to create a proper closure.
  431. That's the reasons for the C<my> on the loop iteration variable.
  432. This is one of the only places where giving a prototype to a closure makes
  433. much sense. If you wanted to impose scalar context on the arguments of
  434. these functions (probably not a wise idea for this particular example),
  435. you could have written it this way instead:
  436. *$name = sub ($) { "<FONT COLOR='$name'>$_[0]</FONT>" };
  437. However, since prototype checking happens at compile time, the assignment
  438. above happens too late to be of much use. You could address this by
  439. putting the whole loop of assignments within a BEGIN block, forcing it
  440. to occur during compilation.
  441. Access to lexicals that change over type--like those in the C<for> loop
  442. above--only works with closures, not general subroutines. In the general
  443. case, then, named subroutines do not nest properly, although anonymous
  444. ones do. If you are accustomed to using nested subroutines in other
  445. programming languages with their own private variables, you'll have to
  446. work at it a bit in Perl. The intuitive coding of this kind of thing
  447. incurs mysterious warnings about ``will not stay shared''. For example,
  448. this won't work:
  449. sub outer {
  450. my $x = $_[0] + 35;
  451. sub inner { return $x * 19 } # WRONG
  452. return $x + inner();
  453. }
  454. A work-around is the following:
  455. sub outer {
  456. my $x = $_[0] + 35;
  457. local *inner = sub { return $x * 19 };
  458. return $x + inner();
  459. }
  460. Now inner() can only be called from within outer(), because of the
  461. temporary assignments of the closure (anonymous subroutine). But when
  462. it does, it has normal access to the lexical variable $x from the scope
  463. of outer().
  464. This has the interesting effect of creating a function local to another
  465. function, something not normally supported in Perl.
  466. =head1 WARNING
  467. You may not (usefully) use a reference as the key to a hash. It will be
  468. converted into a string:
  469. $x{ \$a } = $a;
  470. If you try to dereference the key, it won't do a hard dereference, and
  471. you won't accomplish what you're attempting. You might want to do something
  472. more like
  473. $r = \@a;
  474. $x{ $r } = $r;
  475. And then at least you can use the values(), which will be
  476. real refs, instead of the keys(), which won't.
  477. The standard Tie::RefHash module provides a convenient workaround to this.
  478. =head1 SEE ALSO
  479. Besides the obvious documents, source code can be instructive.
  480. Some rather pathological examples of the use of references can be found
  481. in the F<t/op/ref.t> regression test in the Perl source directory.
  482. See also L<perldsc> and L<perllol> for how to use references to create
  483. complex data structures, and L<perltoot>, L<perlobj>, and L<perlbot>
  484. for how to use them to create objects.