perlreftut.pod
来自「视频监控网络部分的协议ddns,的模块的实现代码,请大家大胆指正.」· POD 代码 · 共 528 行 · 第 1/2 页
POD
528 行
=head1 NAMEperlreftut - Mark's very short tutorial about references=head1 DESCRIPTIONOne of the most important new features in Perl 5 was the capability tomanage complicated data structures like multidimensional arrays andnested hashes. To enable these, Perl 5 introduced a feature called`references', and using references is the key to managing complicated,structured data in Perl. Unfortunately, there's a lot of funny syntaxto learn, and the main manual page can be hard to follow. The manualis quite complete, and sometimes people find that a problem, becauseit can be hard to tell what is important and what isn't.Fortunately, you only need to know 10% of what's in the main page to get90% of the benefit. This page will show you that 10%.=head1 Who Needs Complicated Data Structures?One problem that came up all the time in Perl 4 was how to represent ahash whose values were lists. Perl 4 had hashes, of course, but thevalues had to be scalars; they couldn't be lists.Why would you want a hash of lists? Let's take a simple example: Youhave a file of city and country names, like this: Chicago, USA Frankfurt, Germany Berlin, Germany Washington, USA Helsinki, Finland New York, USAand you want to produce an output like this, with each country mentionedonce, and then an alphabetical list of the cities in that country: Finland: Helsinki. Germany: Berlin, Frankfurt. USA: Chicago, New York, Washington.The natural way to do this is to have a hash whose keys are countrynames. Associated with each country name key is a list of the cities inthat country. Each time you read a line of input, split it into a countryand a city, look up the list of cities already known to be in thatcountry, and append the new city to the list. When you're done readingthe input, iterate over the hash as usual, sorting each list of citiesbefore you print it out.If hash values can't be lists, you lose. In Perl 4, hash values can'tbe lists; they can only be strings. You lose. You'd probably have tocombine all the cities into a single string somehow, and then whentime came to write the output, you'd have to break the string into alist, sort the list, and turn it back into a string. This is messyand error-prone. And it's frustrating, because Perl already hasperfectly good lists that would solve the problem if only you coulduse them.=head1 The SolutionBy the time Perl 5 rolled around, we were already stuck with thisdesign: Hash values must be scalars. The solution to this isreferences.A reference is a scalar value that I<refers to> an entire array or anentire hash (or to just about anything else). Names are one kind ofreference that you're already familiar with. Think of the Presidentof the United States: a messy, inconvenient bag of blood and bones.But to talk about him, or to represent him in a computer program, allyou need is the easy, convenient scalar string "George Bush".References in Perl are like names for arrays and hashes. They'rePerl's private, internal names, so you can be sure they'reunambiguous. Unlike "George Bush", a reference only refers to onething, and you always know what it refers to. If you have a referenceto an array, you can recover the entire array from it. If you have areference to a hash, you can recover the entire hash. But thereference is still an easy, compact scalar value.You can't have a hash whose values are arrays; hash values can only bescalars. We're stuck with that. But a single reference can refer toan entire array, and references are scalars, so you can have a hash ofreferences to arrays, and it'll act a lot like a hash of arrays, andit'll be just as useful as a hash of arrays.We'll come back to this city-country problem later, after we've seensome syntax for managing references.=head1 SyntaxThere are just two ways to make a reference, and just two ways to useit once you have it.=head2 Making References=head3 B<Make Rule 1>If you put a C<\> in front of a variable, you get areference to that variable. $aref = \@array; # $aref now holds a reference to @array $href = \%hash; # $href now holds a reference to %hash $sref = \$scalar; # $sref now holds a reference to $scalarOnce the reference is stored in a variable like $aref or $href, youcan copy it or store it just the same as any other scalar value: $xy = $aref; # $xy now holds a reference to @array $p[3] = $href; # $p[3] now holds a reference to %hash $z = $p[3]; # $z now holds a reference to %hashThese examples show how to make references to variables with names.Sometimes you want to make an array or a hash that doesn't have aname. This is analogous to the way you like to be able to use thestring C<"\n"> or the number 80 without having to store it in a namedvariable first.B<Make Rule 2>C<[ ITEMS ]> makes a new, anonymous array, and returns a reference tothat array. C<{ ITEMS }> makes a new, anonymous hash, and returns areference to that hash. $aref = [ 1, "foo", undef, 13 ]; # $aref now holds a reference to an array $href = { APR => 4, AUG => 8 }; # $href now holds a reference to a hashThe references you get from rule 2 are the same kind ofreferences that you get from rule 1: # This: $aref = [ 1, 2, 3 ]; # Does the same as this: @array = (1, 2, 3); $aref = \@array;The first line is an abbreviation for the following two lines, exceptthat it doesn't create the superfluous array variable C<@array>.If you write just C<[]>, you get a new, empty anonymous array.If you write just C<{}>, you get a new, empty anonymous hash.=head2 Using ReferencesWhat can you do with a reference once you have it? It's a scalarvalue, and we've seen that you can store it as a scalar and get it backagain just like any scalar. There are just two more ways to use it:=head3 B<Use Rule 1>You can always use an array reference, in curly braces, in place ofthe name of an array. For example, C<@{$aref}> instead of C<@array>.Here are some examples of that:Arrays: @a @{$aref} An array reverse @a reverse @{$aref} Reverse the array $a[3] ${$aref}[3] An element of the array $a[3] = 17; ${$aref}[3] = 17 Assigning an elementOn each line are two expressions that do the same thing. Theleft-hand versions operate on the array C<@a>. The right-handversions operate on the array that is referred to by C<$aref>. Oncethey find the array they're operating on, both versions do the samethings to the arrays.Using a hash reference is I<exactly> the same: %h %{$href} A hash keys %h keys %{$href} Get the keys from the hash $h{'red'} ${$href}{'red'} An element of the hash $h{'red'} = 17 ${$href}{'red'} = 17 Assigning an elementWhatever you want to do with a reference, B<Use Rule 1> tells you howto do it. You just write the Perl code that you would have writtenfor doing the same thing to a regular array or hash, and then replacethe array or hash name with C<{$reference}>. "How do I loop over anarray when all I have is a reference?" Well, to loop over an array, youwould write for my $element (@array) { ... }so replace the array name, C<@array>, with the reference: for my $element (@{$aref}) { ... }"How do I print out the contents of a hash when all I have is areference?" First write the code for printing out a hash: for my $key (keys %hash) { print "$key => $hash{$key}\n"; }And then replace the hash name with the reference: for my $key (keys %{$href}) { print "$key => ${$href}{$key}\n"; }=head3 B<Use Rule 2>B<Use Rule 1> is all you really need, because it tells you how to doabsolutely everything you ever need to do with references. But themost common thing to do with an array or a hash is to extract a singleelement, and the B<Use Rule 1> notation is cumbersome. So there is anabbreviation.C<${$aref}[3]> is too hard to read, so you can write C<< $aref->[3] >>instead.C<${$href}{red}> is too hard to read, so you can writeC<< $href->{red} >> instead.If C<$aref> holds a reference to an array, then C<< $aref->[3] >> isthe fourth element of the array. Don't confuse this with C<$aref[3]>,which is the fourth element of a totally different array, onedeceptively named C<@aref>. C<$aref> and C<@aref> are unrelated thesame way that C<$item> and C<@item> are.Similarly, C<< $href->{'red'} >> is part of the hash referred to bythe scalar variable C<$href>, perhaps even one with no name.C<$href{'red'}> is part of the deceptively named C<%href> hash. It'seasy to forget to leave out the C<< -> >>, and if you do, you'll getbizarre results when your program gets array and hash elements out oftotally unexpected hashes and arrays that weren't the ones you wantedto use.=head2 An ExampleLet's see a quick example of how all this is useful.First, remember that C<[1, 2, 3]> makes an anonymous array containingC<(1, 2, 3)>, and gives you a reference to that array.Now think about @a = ( [1, 2, 3], [4, 5, 6], [7, 8, 9] );@a is an array with three elements, and each one is a reference toanother array.C<$a[1]> is one of these references. It refers to an array, the arraycontaining C<(4, 5, 6)>, and because it is a reference to an array,B<Use Rule 2> says that we can write C<< $a[1]->[2] >> to get the
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?