Re^4: Hash value interpolation

Thanks for all the help everyone... responding to ikegami's two points, the reason for the two hashes is because I wanted to simplify the code sample to focus on my problem, but the idea was to select a hash table to use based on a calculation. Also, the hash table makes the data elements much more readable for me. Is there a performance gained by using an array over the hash? Thanks gain!

Comment on Re^4: Hash value interpolation

Replies are listed 'Best First'.
Re^5: Hash value interpolation by ikegami (Patriarch) on Feb 17, 2009 at 23:01 UTC
the reason for the two hashes is because I wanted to simplify the code You didn't do that. Your data structure is horribly complex. What's the point of having a hash for every key! (And don't say "1" and "2" could be the same string because then your goal makes no sense at all. There wouldn't be a right "hm" to fetch.) Is there a performance gained by using an array over the hash? Performance? Not really. The problem is that emulating a hash using an array is one more thing that can go wrong compared to just using an array.	[reply]
Re^6: Hash value interpolation by csarid (Sexton) on Feb 18, 2009 at 05:14 UTC
I see your point. I guess I can just pull the value from standard array just as easily based on the position. I'll give that a try. Thanks for the feedback do appreciate it.	[reply]