Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^3: Does Perl do constant anonymous hash creation optimisation?

by jaa (Friar)
on Jul 10, 2006 at 15:06 UTC ( [id://560159]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Does Perl do constant anonymous hash creation optimisation?
in thread Does Perl do constant anonymous hash creation optimisation?

Dear Monks,

Extending the cmpthese() example, I found no appreciable performance difference between:

use constant SKIPWORDS => {...}; our $SKIPWORDS = {};
So a big thumbs up for use constant()!

Thanks for the help!

Jeff

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others rifling through the Monastery: (4)
As of 2024-03-29 10:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found