Are there downsides for using a hash I am not considering?
A fully populated 2000x2000 entry HoHs will require around 250MB. Well within the bounds of any modern system. Even my smartphone can handle it. And you can iterate the entire thing in a couple of seconds, so performance isn't an issue.
Whether it is the best mechanism for your particular application rather depends on whether this is a one-off program, or if it needs to be run many times per day (or hour or minute); and where the data to populate that HoHs comes from and what you do with it when the program ends.
The more information you are able to give about the needs and restraints of the application, the more likely you are to get a meaningful assessment of the options available to you.
In reply to Re: Array vs. Hash
by BrowserUk
in thread Array vs. Hash
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |