From: James <[EMAIL PROTECTED]> > 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?
Would it be a big problem to change the HoA to a hash of strings containing a comma (or whatever) separated list of values? This should lower the memory print by itself and will make it easier to use a tied hash if it's still too much data. Jenda ===== [EMAIL PROTECTED] === http://Jenda.Krynicky.cz ===== When it comes to wine, women and song, wizards are allowed to get drunk and croon as much as they like. -- Terry Pratchett in Sourcery -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] http://learn.perl.org/
