To conserve memory, iterate over the hash with each. Invoking keys will create a list, which, for large hashes, could be substantial itself.
Then again, access to the second hash may hit memory in random patterns and thus perform sub-optimally. Large datasets are best managed using a database.
In reply to Re: memory:: grep vs looping through hash
by Anonymous Monk
in thread memory:: grep vs looping through hash
by f77coder
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |