Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

Re^2: Ref to hash entries are faster?

by shotgunefx (Parson)
on Nov 29, 2006 at 20:36 UTC ( #586819=note: print w/ replies, xml ) Need Help??


in reply to Re: Ref to hash entries are faster?
in thread Ref to hash entries are faster?

It's a tough one to let go. Before Perl, most of my coding was C and ASM in a day when 66mhz was cutting edge. The urge to overly optimize was great :(


-Lee
"To be civilized is to deny one's nature."


Comment on Re^2: Ref to hash entries are faster?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (10)
As of 2015-07-30 07:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (270 votes), past polls