in reply to memory:: grep vs looping through hash
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.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: memory:: grep vs looping through hash
by f77coder (Beadle) on Aug 18, 2014 at 16:47 UTC |