I have some code which creates a hash of arrays (HoA) then runs a 'while' loop, growing the HoA until x. So far the code works great but I have a data set I know will create a huge HoA and maybe eat up the memory. It's 'skinny' data in terms of lots of 'keys' => a few array values each. I'm happy with the data structure & methodology so what's a more efficient way of storing the data?
Will a Tied hash help conserve memory when the HoA gets very large by writing to disk, and will it thus speed things up as it's not holding so much in memory? other suggestions? Thanks, J. -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] http://learn.perl.org/
