Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
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."

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://586819]
help
Chatterbox?
[LanX]: http://web.archive .org/web/ 20071005212040/ http://www. everydevel.com:80/ index.pl?node= Everything %20Diagram
erix .oO( hm, tough beans )

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (7)
As of 2017-11-20 21:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (294 votes). Check out past polls.

    Notices?