Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

RE: RE: My views on pseudohashes

by Zoogie (Curate)
on Jun 24, 2000 at 00:03 UTC ( #19654=note: print w/replies, xml ) Need Help??

in reply to RE: My views on pseudohashes
in thread My views on pseudohashes

I had no clue what a pseudohash was... until I started searching for "pseudo-hash" instead of "pseudohash". Apparently, you can use an array as a hash. Here's a a snippet from perlref on the subject:

Beginning with release 5.005 of Perl you can use an array reference in some contexts that would normally require a hash reference. This allows you to access array elements using symbolic names, as if they were fields in a structure.

For this to work, the array must contain extra information. The first element of the array has to be a hash reference that maps field names to array indices. Here is an example:

$struct = [{foo => 1, bar => 2}, "FOO", "BAR"]; $struct->{foo}; # same as $struct->[1], i.e. "FOO" $struct->{bar}; # same as $struct->[2], i.e. "BAR" keys %$struct; # will return ("foo", "bar") in some order values %$struct; # will return ("FOO", "BAR") in same some order while (my($k,$v) = each %$struct) { print "$k => $v\n"; }

- Zoogie

Replies are listed 'Best First'.
RE: RE: RE: My views on pseudohashes
by Adam (Vicar) on Jun 24, 2000 at 03:17 UTC
    That's pretty cool. I wonder what it's good for.
      This is just a guess (perhaps somebody who's more experienced with Perl compiler optimizations can help out here). Since accessing array elements tends to be faster than accessing hash elements, if the Perl compiler resolves the pseudo-hash keys to the array indexes at compile-time, it makes building structures with named elements more efficient at run-time than simply using hashes.

      The perlref page notes that the compiler does something to this effect for using named fields in objects. I'm not at all familiar with objects in Perl, so I can't really elaborate on that.

      - Zoogie

        Array access is faster than hash access. Yes, with a good hashing algorithm, access is O(1), but it'll never be as fast as array index access. You still have to pay the overhead of the hashing algorithm. There's also the increased memory requirement.

        Of course, with arrays you either use numbers for indexes or constants. That's a bit of trouble to go to either way, and with constants you still have some memory overhead.

        Let's not forget autovivification of hash keys. That could bite you when you least expect it.

        The pseudo-hash tries to solve all of those. Yes, it's a little more complex than your average array, but you can access it either way, and it's faster than a hash, doesn't autovivify keys, and it allows you to refer to values by name instead of by index.

        See perlref for more information, as well as the documentation for (I learned about them from Object Oriented Perl, a fine book.)

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://19654]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (3)
As of 2020-09-19 02:40 GMT
Find Nodes?
    Voting Booth?
    If at first I donít succeed, I Ö

    Results (114 votes). Check out past polls.