Others have covered your question. I just wanted to offer a comment:
The hash is a great general-purpose data structure, but it's not perfect for everything. In cases where you start pushing the limits, you need to consider alternatives. Specifically, in this case, you may want to think about your data structure. Figure out the requirements and see how else you might meet them with a different data structure. With a tweak to your requirements or your algorithm, you might find a way to make an array do the job, which could save you a good bit of memory. Or perhaps you might want to make a tied reference to a DBM database or some such. If your application is interested only in the key values, it may be satisfied by a sorted array. Or perhaps a large delimited string you could search through.
...roboticusIn reply to Re: Completeness of Devel::Size answers
by roboticus
in thread Completeness of Devel::Size answers
by gone2015
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |