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

Re: Fast data structure..!!!

by Thilosophy (Curate)
on Apr 16, 2008 at 01:20 UTC ( #680711=note: print w/replies, xml ) Need Help??

in reply to Fast data structure..!!!

Pre-sizing the hash so that it does not need to expand dynamically should save a lot of time.

Also, try to get rid of the nesting in the hash by concatenating the components of the key and using the concatenation as key to a flat hash.

If that is still not fast enough, you will probably have to implement your own hash in C, or reconsider if you can come up with a clever algorithm that does not depend on instant access to a huge data structure (do you really need all that data?)

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (11)
As of 2016-10-21 16:16 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (289 votes). Check out past polls.