Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Optimization Help on Perl Hash Traversal (eval use)

by CountZero (Bishop)
on Feb 06, 2013 at 22:21 UTC ( #1017514=note: print w/replies, xml ) Need Help??

in reply to Optimization Help on Perl Hash Traversal (eval use)

I wonder if there is any need to sort the keys of your outer and middle loop. If you are looking for any, even small, time-savings, here might be a quick bonus.


A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

My blog: Imperial Deltronics

Replies are listed 'Best First'.
Re^2: Optimization Help on Perl Hash Traversal (eval use)
by mwb613 (Sexton) on Feb 06, 2013 at 22:35 UTC

    No good reason except that I'm bit robotic in my code sometimes. I'll pull out the "sort" commands.


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1017514]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (3)
As of 2018-02-24 05:03 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (310 votes). Check out past polls.