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

Re: Faster Hash Slices

by Anonymous Monk
on Nov 28, 2013 at 14:54 UTC ( [id://1064842]=note: print w/replies, xml ) Need Help??


in reply to Faster Hash Slices

Answer the questions the others asked. The best solution depends on the use case. I think what you want is an AoA with numeric constants instead of hash keys.

Replies are listed 'Best First'.
Re^2: Faster Hash Slices
by jht (Novice) on Nov 29, 2013 at 02:53 UTC
    I agree that an array with constants should be faster, however, it would require more changes to the existing code than I'm up for at the moment. Moving the hash creation and key allocation out of the loop as suggested by hdb has helped. I will try the array method when I get a chance. Thanks!

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others musing on the Monastery: (6)
As of 2024-04-25 12:29 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found