NG4R3P

Linux 4gvps.4gvps.com 3.10.0-1127.18.2.vz7.163.46 #1 SMP Fri Nov 20 21:47:55 MSK 2020 x86_64
SOFT : Apache PHP : 7.4.33
/usr/share/perl5/pod/

38.135.39.45

[ NAME ]	[ SIZE ]	[ PERM ]	[ DATE ]	[ ACT ]
+FILE +DIR
a2p.pod	5.962 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl.pod	15.429 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5004delta.pod	54.921 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5005delta.pod	33.48 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5100delta.pod	53.413 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5101delta.pod	42.858 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5120delta.pod	87.193 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5121delta.pod	9.905 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5122delta.pod	9.378 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5123delta.pod	4.004 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5124delta.pod	3.586 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5140delta.pod	140.941 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5141delta.pod	7.779 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5142delta.pod	6.73 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5143delta.pod	7.578 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5160delta.pod	130.52 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5161delta.pod	5.998 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5162delta.pod	3.51 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl5163delta.pod	3.985 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl561delta.pod	121.786 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl56delta.pod	104.685 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl581delta.pod	37.168 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl582delta.pod	4.365 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl583delta.pod	6.187 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl584delta.pod	7.19 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl585delta.pod	5.751 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl586delta.pod	4.542 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl587delta.pod	8.161 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl588delta.pod	24.68 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl589delta.pod	52.637 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perl58delta.pod	112.215 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlaix.pod	18.768 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlamiga.pod	6.869 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlapi.pod	315.465 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlapio.pod	18.878 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlartistic.pod	6.846 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlbeos.pod	2.867 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlbook.pod	7.192 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlboot.pod	0.179 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlbot.pod	0.178 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlbs2000.pod	7.733 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlcall.pod	54.026 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlce.pod	8.723 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlcheat.pod	4.395 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlclib.pod	7.504 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlcn.pod	4.815 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlcommunity.pod	6.293 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlcygwin.pod	27.17 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldata.pod	36.331 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldbmfilter.pod	4.863 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldebguts.pod	36.789 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldebtut.pod	20.786 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldebug.pod	38.151 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldelta.pod	3.985 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldgux.pod	2.754 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldiag.pod	207.818 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldos.pod	10.275 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldsc.pod	24.837 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perldtrace.pod	6.209 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlebcdic.pod	67.605 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlembed.pod	35.209 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlepoc.pod	3.572 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlexperiment.pod	4.843 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq.pod	22.007 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq1.pod	13.519 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq2.pod	9.278 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq3.pod	37.464 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq4.pod	87.393 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq5.pod	54.113 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq6.pod	38.664 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq7.pod	36.352 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq8.pod	48.279 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfaq9.pod	14.709 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfork.pod	12.782 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlform.pod	16.287 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfreebsd.pod	1.554 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlfunc.pod	338.432 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlgit.pod	29.755 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlglossary.pod	110.655 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlgpl.pod	13.537 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlguts.pod	111.664 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlhack.pod	35.03 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlhacktips.pod	45.498 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlhacktut.pod	6.068 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlhaiku.pod	1.469 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlhist.pod	43.319 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlhpux.pod	28.065 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlhurd.pod	1.94 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlintern.pod	42.532 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlinterp.pod	30.002 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlintro.pod	22.085 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perliol.pod	33.027 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlipc.pod	70.165 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlirix.pod	4.291 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perljp.pod	7.572 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlko.pod	7.521 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perllexwarn.pod	14.612 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perllinux.pod	1.453 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perllocale.pod	51.435 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perllol.pod	10.935 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlmacos.pod	0.978 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlmacosx.pod	10.399 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlmod.pod	24.041 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlmodinstall.pod	12.412 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlmodlib.pod	78.491 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlmodstyle.pod	20.757 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlmpeix.pod	14.236 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlmroapi.pod	3.128 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlnetware.pod	6.348 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlnewmod.pod	10.952 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlnumber.pod	8.156 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlobj.pod	33.653 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlootut.pod	25.604 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlop.pod	121.731 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlopenbsd.pod	1.176 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlopentut.pod	37.533 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlos2.pod	90.533 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlos390.pod	15.2 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlos400.pod	4.513 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlpacktut.pod	49.834 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlperf.pod	50.048 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlplan9.pod	5.005 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlpod.pod	21.27 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlpodspec.pod	66.203 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlpolicy.pod	19.726 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlport.pod	82.635 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlpragma.pod	5.105 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlqnx.pod	4.145 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlre.pod	100.761 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlreapi.pod	25.168 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlrebackslash.pod	25.644 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlrecharclass.pod	34.188 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlref.pod	28.319 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlreftut.pod	18.232 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlreguts.pod	35.995 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlrequick.pod	17.499 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlreref.pod	14.19 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlretut.pod	115.128 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlriscos.pod	1.493 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlrun.pod	49.575 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlsec.pod	22.768 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlsolaris.pod	28.63 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlsource.pod	6.194 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlstyle.pod	8.416 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlsub.pod	55.153 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlsymbian.pod	15.439 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlsyn.pod	41.044 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlthrtut.pod	45.407 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perltie.pod	37.02 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perltoc.pod	638.995 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perltodo.pod	0.354 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perltooc.pod	0.179 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perltoot.pod	0.179 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perltrap.pod	40.281 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perltru64.pod	7.552 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perltw.pod	5.151 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlunicode.pod	70.891 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlunifaq.pod	13.314 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perluniintro.pod	35.443 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perluniprops.pod	229.736 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlunitut.pod	7.756 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlutil.pod	9.679 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perluts.pod	3.105 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlvar.pod	69.188 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlvmesa.pod	3.881 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlvms.pod	51.333 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlvos.pod	5.823 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlwin32.pod	34.581 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlxs.pod	71.663 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlxstut.pod	48.517 KB	-rw-r--r--	2023-10-25 12:41	R E G D
perlxstypemap.pod	22.966 KB	-rw-r--r--	2023-10-25 12:41	R E G D
REQUEST EXIT

=head1 NAME X X X X X perlref - Perl references and nested data structures =head1 NOTE This is complete documentation about all aspects of references. For a shorter, tutorial introduction to just the essential features, see L. =head1 DESCRIPTION Before release 5 of Perl it was difficult to represent complex data structures, because all references had to be symbolic--and even then it was difficult to refer to a variable instead of a symbol table entry. Perl now not only makes it easier to use symbolic references to variables, but also lets you have "hard" references to any piece of data or code. Any scalar may hold a hard reference. Because arrays and hashes contain scalars, you can now easily build arrays of arrays, arrays of hashes, hashes of arrays, arrays of hashes of functions, and so on. Hard references are smart--they keep track of reference counts for you, automatically freeing the thing referred to when its reference count goes to zero. (Reference counts for values in self-referential or cyclic data structures may not go to zero without a little help; see L for a detailed explanation.) If that thing happens to be an object, the object is destructed. See L for more about objects. (In a sense, everything in Perl is an object, but we usually reserve the word for references to objects that have been officially "blessed" into a class package.) Symbolic references are names of variables or other objects, just as a symbolic link in a Unix filesystem contains merely the name of a file. The C<*glob> notation is something of a symbolic reference. (Symbolic references are sometimes called "soft references", but please don't call them that; references are confusing enough without useless synonyms.) X X X X In contrast, hard references are more like hard links in a Unix file system: They are used to access an underlying object without concern for what its (other) name is. When the word "reference" is used without an adjective, as in the following paragraph, it is usually talking about a hard reference. X X References are easy to use in Perl. There is just one overriding principle: Perl does no implicit referencing or dereferencing. When a scalar is holding a reference, it always behaves as a simple scalar. It doesn't magically start being an array or hash or subroutine; you have to tell it explicitly to do so, by dereferencing it. References are easy to use in Perl. There is just one overriding principle: in general, Perl does no implicit referencing or dereferencing. When a scalar is holding a reference, it always behaves as a simple scalar. It doesn't magically start being an array or hash or subroutine; you have to tell it explicitly to do so, by dereferencing it. That said, be aware that Perl version 5.14 introduces an exception to the rule, for syntactic convenience. Experimental array and hash container function behavior allows array and hash references to be handled by Perl as if they had been explicitly syntactically dereferenced. See L and L for details. =head2 Making References X X References can be created in several ways. =over 4 =item 1. X<\> X By using the backslash operator on a variable, subroutine, or value. (This works much like the & (address-of) operator in C.) This typically creates I reference to a variable, because there's already a reference to the variable in the symbol table. But the symbol table reference might go away, and you'll still have the reference that the backslash returned. Here are some examples: $scalarref = \$foo; $arrayref = \@ARGV; $hashref = \%ENV; $coderef = \&handler; $globref = \*foo; It isn't possible to create a true reference to an IO handle (filehandle or dirhandle) using the backslash operator. The most you can get is a reference to a typeglob, which is actually a complete symbol table entry. But see the explanation of the C<*foo{THING}> syntax below. However, you can still use type globs and globrefs as though they were IO handles. =item 2. X X<[> X<[]> X X X X X A reference to an anonymous array can be created using square brackets: $arrayref = [1, 2, ['a', 'b', 'c']]; Here we've created a reference to an anonymous array of three elements whose final element is itself a reference to another anonymous array of three elements. (The multidimensional syntax described later can be used to access this. For example, after the above, C<< $arrayref->[2][1] >> would have the value "b".) Taking a reference to an enumerated list is not the same as using square brackets--instead it's the same as creating a list of references! @list = (\$a, \@b, \%c); @list = \($a, @b, %c); # same thing! As a special case, C<\(@foo)> returns a list of references to the contents of C<@foo>, not a reference to C<@foo> itself. Likewise for C<%foo>, except that the key references are to copies (since the keys are just strings rather than full-fledged scalars). =item 3. X X<{> X<{}> X X X X X X A reference to an anonymous hash can be created using curly brackets: $hashref = { 'Adam' => 'Eve', 'Clyde' => 'Bonnie', }; Anonymous hash and array composers like these can be intermixed freely to produce as complicated a structure as you want. The multidimensional syntax described below works for these too. The values above are literals, but variables and expressions would work just as well, because assignment operators in Perl (even within local() or my()) are executable statements, not compile-time declarations. Because curly brackets (braces) are used for several other things including BLOCKs, you may occasionally have to disambiguate braces at the beginning of a statement by putting a C<+> or a C in front so that Perl realizes the opening brace isn't starting a BLOCK. The economy and mnemonic value of using curlies is deemed worth this occasional extra hassle. For example, if you wanted a function to make a new hash and return a reference to it, you have these options: sub hashem { { @_ } } # silently wrong sub hashem { +{ @_ } } # ok sub hashem { return { @_ } } # ok On the other hand, if you want the other meaning, you can do this: sub showem { { @_ } } # ambiguous (currently ok, but may change) sub showem { {; @_ } } # ok sub showem { { return @_ } } # ok The leading C<+{> and C<{;> always serve to disambiguate the expression to mean either the HASH reference, or the BLOCK. =item 4. X X X X X X X A reference to an anonymous subroutine can be created by using C_{without a subname:

$coderef = sub { print "Boink!\n" };

Note the semicolon. Except for the code
inside not being immediately executed, a C_{is not so much a
declaration as it is an operator, like C or C. (However, no
matter how many times you execute that particular line (unless you're in an
C), $coderef will still have a reference to the I
anonymous subroutine.)

Anonymous subroutines act as closures with respect to my() variables,
that is, variables lexically visible within the current scope. Closure
is a notion out of the Lisp world that says if you define an anonymous
function in a particular lexical context, it pretends to run in that
context even when it's called outside the context.

In human terms, it's a funny way of passing arguments to a subroutine when
you define it as well as when you call it. It's useful for setting up
little bits of code to run later, such as callbacks. You can even
do object-oriented stuff with it, though Perl already provides a different
mechanism to do that--see L.

You might also think of closure as a way to write a subroutine
template without using eval(). Here's a small example of how
closures work:

sub newprint {
my $x = shift;
return sub { my $y = shift; print "$x, $y!\n"; };
}
$h = newprint("Howdy");
$g = newprint("Greetings");

# Time passes...

&$h("world");
&$g("earthlings");

This prints

Howdy, world!
Greetings, earthlings!

Note particularly that $x continues to refer to the value passed
into newprint() I "my $x" having gone out of scope by the
time the anonymous subroutine runs. That's what a closure is all
about.

This applies only to lexical variables, by the way. Dynamic variables
continue to work as they have always worked. Closure is not something
that most Perl programmers need trouble themselves about to begin with.

=item 5.
X X

References are often returned by special subroutines called constructors. Perl
objects are just references to a special type of object that happens to know
which package it's associated with. Constructors are just special subroutines
that know how to create that association. They do so by starting with an
ordinary reference, and it remains an ordinary reference even while it's also
being an object. Constructors are often named C. You I call them
indirectly:

$objref = new Doggie( Tail => 'short', Ears => 'long' );

But that can produce ambiguous syntax in certain cases, so it's often
better to use the direct method invocation approach:

$objref = Doggie->new(Tail => 'short', Ears => 'long');

use Term::Cap;
$terminal = Term::Cap->Tgetent( { OSPEED => 9600 });

use Tk;
$main = MainWindow->new();
$menubar = $main->Frame(-relief => "raised",
-borderwidth => 2)

=item 6.
X

References of the appropriate type can spring into existence if you
dereference them in a context that assumes they exist. Because we haven't
talked about dereferencing yet, we can't show you any examples yet.

=item 7.
X<*foo{THING}> X<*>

A reference can be created by using a special syntax, lovingly known as
the *foo{THING} syntax. *foo{THING} returns a reference to the THING
slot in *foo (which is the symbol table entry which holds everything
known as foo).

$scalarref = *foo{SCALAR};
$arrayref = *ARGV{ARRAY};
$hashref = *ENV{HASH};
$coderef = *handler{CODE};
$ioref = *STDIN{IO};
$globref = *foo{GLOB};
$formatref = *foo{FORMAT};

All of these are self-explanatory except for C<*foo{IO}>. It returns
the IO handle, used for file handles (L), sockets
(L and L), and directory
handles (L). For compatibility with previous
versions of Perl, C<*foo{FILEHANDLE}> is a synonym for C<*foo{IO}>, though it
is deprecated as of 5.8.0. If deprecation warnings are in effect, it will warn
of its use.

C<*foo{THING}> returns undef if that particular THING hasn't been used yet,
except in the case of scalars. C<*foo{SCALAR}> returns a reference to an
anonymous scalar if $foo hasn't been used yet. This might change in a
future release.

C<*foo{IO}> is an alternative to the C<*HANDLE> mechanism given in
L for passing filehandles
into or out of subroutines, or storing into larger data structures.
Its disadvantage is that it won't create a new filehandle for you.
Its advantage is that you have less risk of clobbering more than
you want to with a typeglob assignment. (It still conflates file
and directory handles, though.) However, if you assign the incoming
value to a scalar instead of a typeglob as we do in the examples
below, there's no risk of that happening.

splutter(*STDOUT); # pass the whole glob
splutter(*STDOUT{IO}); # pass both file and dir handles

sub splutter {
my $fh = shift;
print $fh "her um well a hmmm\n";
}

$rec = get_rec(*STDIN); # pass the whole glob
$rec = get_rec(*STDIN{IO}); # pass both file and dir handles

sub get_rec {
my $fh = shift;
return scalar <$fh>;
}

=back

=head2 Using References
X X X

That's it for creating references. By now you're probably dying to
know how to use references to get back to your long-lost data. There
are several basic methods.

=over 4

=item 1.

Anywhere you'd put an identifier (or chain of identifiers) as part
of a variable or subroutine name, you can replace the identifier with
a simple scalar variable containing a reference of the correct type:

$bar = $$scalarref;
push(@$arrayref, $filename);
$$arrayref[0] = "January";
$$hashref{"KEY"} = "VALUE";
&$coderef(1,2,3);
print $globref "output\n";

It's important to understand that we are specifically I dereferencing
C<$arrayref[0]> or C<$hashref{"KEY"}> there. The dereference of the
scalar variable happens I it does any key lookups. Anything more
complicated than a simple scalar variable must use methods 2 or 3 below.
However, a "simple scalar" includes an identifier that itself uses method
1 recursively. Therefore, the following prints "howdy".

$refrefref = \\\"howdy";
print $$$$refrefref;

=item 2.

Anywhere you'd put an identifier (or chain of identifiers) as part of a
variable or subroutine name, you can replace the identifier with a
BLOCK returning a reference of the correct type. In other words, the
previous examples could be written like this:

$bar = ${$scalarref};
push(@{$arrayref}, $filename);
${$arrayref}[0] = "January";
${$hashref}{"KEY"} = "VALUE";
&{$coderef}(1,2,3);
$globref->print("output\n"); # iff IO::Handle is loaded

Admittedly, it's a little silly to use the curlies in this case, but
the BLOCK can contain any arbitrary expression, in particular,
subscripted expressions:

&{ $dispatch{$index} }(1,2,3); # call correct routine

Because of being able to omit the curlies for the simple case of C<$$x>,
people often make the mistake of viewing the dereferencing symbols as
proper operators, and wonder about their precedence. If they were,
though, you could use parentheses instead of braces. That's not the case.
Consider the difference below; case 0 is a short-hand version of case 1,
I case 2:

$$hashref{"KEY"} = "VALUE"; # CASE 0
${$hashref}{"KEY"} = "VALUE"; # CASE 1
${$hashref{"KEY"}} = "VALUE"; # CASE 2
${$hashref->{"KEY"}} = "VALUE"; # CASE 3

Case 2 is also deceptive in that you're accessing a variable
called %hashref, not dereferencing through $hashref to the hash
it's presumably referencing. That would be case 3.

=item 3.

Subroutine calls and lookups of individual array elements arise often
enough that it gets cumbersome to use method 2. As a form of
syntactic sugar, the examples for method 2 may be written:

$arrayref->[0] = "January"; # Array element
$hashref->{"KEY"} = "VALUE"; # Hash element
$coderef->(1,2,3); # Subroutine call

The left side of the arrow can be any expression returning a reference,
including a previous dereference. Note that C<$array[$x]> is I the
same thing as C<< $array->[$x] >> here:

$array[$x]->{"foo"}->[0] = "January";

This is one of the cases we mentioned earlier in which references could
spring into existence when in an lvalue context. Before this
statement, C<$array[$x]> may have been undefined. If so, it's
automatically defined with a hash reference so that we can look up
C<{"foo"}> in it. Likewise C<< $array[$x]->{"foo"} >> will automatically get
defined with an array reference so that we can look up C<[0]> in it.
This process is called I.

One more thing here. The arrow is optional I brackets
subscripts, so you can shrink the above down to

$array[$x]{"foo"}[0] = "January";

Which, in the degenerate case of using only ordinary arrays, gives you
multidimensional arrays just like C's:

$score[$x][$y][$z] += 42;

Well, okay, not entirely like C's arrays, actually. C doesn't know how
to grow its arrays on demand. Perl does.

=item 4.

If a reference happens to be a reference to an object, then there are
probably methods to access the things referred to, and you should probably
stick to those methods unless you're in the class package that defines the
object's methods. In other words, be nice, and don't violate the object's
encapsulation without a very good reason. Perl does not enforce
encapsulation. We are not totalitarians here. We do expect some basic
civility though.

=back

Using a string or number as a reference produces a symbolic reference,
as explained above. Using a reference as a number produces an
integer representing its storage location in memory. The only
useful thing to be done with this is to compare two references
numerically to see whether they refer to the same location.
X

if ($ref1 == $ref2) { # cheap numeric compare of references
print "refs 1 and 2 refer to the same thing\n";
}

Using a reference as a string produces both its referent's type,
including any package blessing as described in L, as well
as the numeric address expressed in hex. The ref() operator returns
just the type of thing the reference is pointing to, without the
address. See L for details and examples of its use.
X

The bless() operator may be used to associate the object a reference
points to with a package functioning as an object class. See L.

A typeglob may be dereferenced the same way a reference can, because
the dereference syntax always indicates the type of reference desired.
So C<${*foo}> and C<${\$foo}> both indicate the same scalar variable.

Here's a trick for interpolating a subroutine call into a string:

print "My sub returned @{[mysub(1,2,3)]} that time.\n";

The way it works is that when the C<@{...}> is seen in the double-quoted
string, it's evaluated as a block. The block creates a reference to an
anonymous array containing the results of the call to C. So
the whole block returns a reference to an array, which is then
dereferenced by C<@{...}> and stuck into the double-quoted string. This
chicanery is also useful for arbitrary expressions:

print "That yields @{[$n + 5]} widgets\n";

Similarly, an expression that returns a reference to a scalar can be
dereferenced via C<${...}>. Thus, the above expression may be written
as:

print "That yields ${\($n + 5)} widgets\n";

=head2 Circular References
X X

It is possible to create a "circular reference" in Perl, which can lead
to memory leaks. A circular reference occurs when two references
contain a reference to each other, like this:

my $foo = {};
my $bar = { foo => $foo };
$foo->{bar} = $bar;

You can also create a circular reference with a single variable:

my $foo;
$foo = \$foo;

In this case, the reference count for the variables will never reach 0,
and the references will never be garbage-collected. This can lead to
memory leaks.

Because objects in Perl are implemented as references, it's possible to
have circular references with objects as well. Imagine a TreeNode class
where each node references its parent and child nodes. Any node with a
parent will be part of a circular reference.

You can break circular references by creating a "weak reference". A
weak reference does not increment the reference count for a variable,
which means that the object can go out of scope and be destroyed. You
can weaken a reference with the C function exported by the
L module.

Here's how we can make the first example safer:

use Scalar::Util 'weaken';

my $foo = {};
my $bar = { foo => $foo };
$foo->{bar} = $bar;

weaken $foo->{bar};

The reference from C<$foo> to C<$bar> has been weakened. When the
C<$bar> variable goes out of scope, it will be garbage-collected. The
next time you look at the value of the C<< $foo->{bar} >> key, it will
be C.

This action at a distance can be confusing, so you should be careful
with your use of weaken. You should weaken the reference in the
variable that will go out of scope I. That way, the longer-lived
variable will contain the expected reference until it goes out of
scope.

=head2 Symbolic references
X X
X X

We said that references spring into existence as necessary if they are
undefined, but we didn't say what happens if a value used as a
reference is already defined, but I a hard reference. If you
use it as a reference, it'll be treated as a symbolic
reference. That is, the value of the scalar is taken to be the I
of a variable, rather than a direct link to a (possibly) anonymous
value.

People frequently expect it to work like this. So it does.

$name = "foo";
$$name = 1; # Sets $foo
${$name} = 2; # Sets $foo
${$name x 2} = 3; # Sets $foofoo
$name->[0] = 4; # Sets $foo[0]
@$name = (); # Clears @foo
&$name(); # Calls &foo() (as in Perl 4)
$pack = "THAT";
${"${pack}::$name"} = 5; # Sets $THAT::foo without eval

This is powerful, and slightly dangerous, in that it's possible
to intend (with the utmost sincerity) to use a hard reference, and
accidentally use a symbolic reference instead. To protect against
that, you can say

use strict 'refs';

and then only hard references will be allowed for the rest of the enclosing
block. An inner block may countermand that with

no strict 'refs';

Only package variables (globals, even if localized) are visible to
symbolic references. Lexical variables (declared with my()) aren't in
a symbol table, and thus are invisible to this mechanism. For example:

local $value = 10;
$ref = "value";
{
my $value = 20;
print $$ref;
}

This will still print 10, not 20. Remember that local() affects package
variables, which are all "global" to the package.

=head2 Not-so-symbolic references

Since Perl verion 5.001, brackets around a symbolic reference can simply
serve to isolate an identifier or variable name from the rest of an
expression, just as they always have within a string. For example,

$push = "pop on ";
print "${push}over";

has always meant to print "pop on over", even though push is
a reserved word. In 5.001, this was generalized to work the same
without the enclosing double quotes, so that

print ${push} . "over";

and even

print ${ push } . "over";

will have the same effect. (This would have been a syntax error in
Perl 5.000, though Perl 4 allowed it in the spaceless form.) This
construct is I considered to be a symbolic reference when you're
using strict refs:

use strict 'refs';
${ bareword }; # Okay, means $bareword.
${ "bareword" }; # Error, symbolic reference.

Similarly, because of all the subscripting that is done using single words,
the same rule applies to any bareword that is used for subscripting a hash.
So now, instead of writing

$array{ "aaa" }{ "bbb" }{ "ccc" }

you can write just

$array{ aaa }{ bbb }{ ccc }

and not worry about whether the subscripts are reserved words. In the
rare event that you do wish to do something like

$array{ shift }

you can force interpretation as a reserved word by adding anything that
makes it more than a bareword:

$array{ shift() }
$array{ +shift }
$array{ shift @_ }

The C pragma or the B<-w> switch will warn you if it
interprets a reserved word as a string.
But it will no longer warn you about using lowercase words, because the
string is effectively quoted.

=head2 Pseudo-hashes: Using an array as a hash
X X X

Pseudo-hashes have been removed from Perl. The 'fields' pragma
remains available.

=head2 Function Templates
X X X X
X X X X

As explained above, an anonymous function with access to the lexical
variables visible when that function was compiled, creates a closure. It
retains access to those variables even though it doesn't get run until
later, such as in a signal handler or a Tk callback.

Using a closure as a function template allows us to generate many functions
that act similarly. Suppose you wanted functions named after the colors
that generated HTML font changes for the various colors:

print "Be ", red("careful"), "with that ", green("light");

The red() and green() functions would be similar. To create these,
we'll assign a closure to a typeglob of the name of the function we're
trying to build.

@colors = qw(red blue green yellow orange purple violet);
for my $name (@colors) {
no strict 'refs'; # allow symbol table manipulation
*$name = *{uc $name} = sub { "@_" };
}

Now all those different functions appear to exist independently. You can
call red(), RED(), blue(), BLUE(), green(), etc. This technique saves on
both compile time and memory use, and is less error-prone as well, since
syntax checks happen at compile time. It's critical that any variables in
the anonymous subroutine be lexicals in order to create a proper closure.
That's the reasons for the C on the loop iteration variable.

This is one of the only places where giving a prototype to a closure makes
much sense. If you wanted to impose scalar context on the arguments of
these functions (probably not a wise idea for this particular example),
you could have written it this way instead:

*$name = sub ($) { "$_[0]" };

However, since prototype checking happens at compile time, the assignment
above happens too late to be of much use. You could address this by
putting the whole loop of assignments within a BEGIN block, forcing it
to occur during compilation.

Access to lexicals that change over time--like those in the C loop
above, basically aliases to elements from the surrounding lexical scopes--
only works with anonymous subs, not with named subroutines. Generally
said, named subroutines do not nest properly and should only be declared
in the main package scope.

This is because named subroutines are created at compile time so their
lexical variables get assigned to the parent lexicals from the first
execution of the parent block. If a parent scope is entered a second
time, its lexicals are created again, while the nested subs still
reference the old ones.

Anonymous subroutines get to capture each time you execute the C_{operator, as they are created on the fly. If you are accustomed to using
nested subroutines in other programming languages with their own private
variables, you'll have to work at it a bit in Perl. The intuitive coding
of this type of thing incurs mysterious warnings about "will not stay
shared" due to the reasons explained above.
For example, this won't work:

sub outer {
my $x = $_[0] + 35;
sub inner { return $x * 19 } # WRONG
return $x + inner();
}

A work-around is the following:

sub outer {
my $x = $_[0] + 35;
local *inner = sub { return $x * 19 };
return $x + inner();
}

Now inner() can only be called from within outer(), because of the
temporary assignments of the anonymous subroutine. But when it does,
it has normal access to the lexical variable $x from the scope of
outer() at the time outer is invoked.

This has the interesting effect of creating a function local to another
function, something not normally supported in Perl.

=head1 WARNING
X X

You may not (usefully) use a reference as the key to a hash. It will be
converted into a string:

$x{ \$a } = $a;

If you try to dereference the key, it won't do a hard dereference, and
you won't accomplish what you're attempting. You might want to do something
more like

$r = \@a;
$x{ $r } = $r;

And then at least you can use the values(), which will be
real refs, instead of the keys(), which won't.

The standard Tie::RefHash module provides a convenient workaround to this.

=head1 SEE ALSO

Besides the obvious documents, source code can be instructive.
Some pathological examples of the use of references can be found
in the F regression test in the Perl source directory.

See also L and L for how to use references to create
complex data structures, and L and L
for how to use them to create objects.}}}