In this chapter, you will see a feature that makes Perl one of the world’s truly great programming languages: hashes. Although hashes are a powerful and useful feature, you may have used other powerful languages for years without ever hearing of hashes. But you’ll use hashes in nearly every Perl program you’ll write from now on; they’re that important.
A hash is a data structure, not unlike an array in that it can hold any number of values and retrieve them at will. But instead of indexing the values by number, as we did with arrays, we’ll look up the values by name. That is, the indices (here, we’ll call them keys) aren’t numbers, but instead they are arbitrary unique strings (see Figure 6-1).
The keys are strings, first of all, so
instead of getting element number
from an array, we’ll be accessing the hash element named
These keys are arbitrary strings—you can use any string expression
for a hash key. And they are unique strings—just as there’s only one
array element numbered
only one hash element named
Another way to think of a hash is that it’s like a barrel of data (see Figure 6-2), where each piece of data has a tag attached. You can reach into the barrel and pull out any tag and see what piece of data is attached. But there’s no “first” item in the barrel; it’s just a jumble. In an array, ...