Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much

RE: RE: RE: RE: RE: My views on pseudohashes

by chromatic (Archbishop)
on Jun 24, 2000 at 08:27 UTC ( #19701=note: print w/replies, xml ) Need Help??

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

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.)

  • Comment on RE: RE: RE: RE: RE: My views on pseudohashes

Replies are listed 'Best First'.
(jcwren) RE: RE: RE: RE: RE: RE: My views on pseudohashes
by jcwren (Prior) on Jun 24, 2000 at 18:55 UTC
    chromatic not only learned from Object Oriented Perl, he wrote the book. Well, a review, at any rate. chromatics prolific review list can be found on SlashDot, here.

    (he's actually very modest, and never would have mentioned this himself)


Log In?

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (7)
As of 2020-09-24 12:26 GMT
Find Nodes?
    Voting Booth?
    If at first I donít succeed, I Ö

    Results (133 votes). Check out past polls.