|
|
|
| Problems? Is your data what you think it is? | |
| PerlMonks |
Re^3: Memory efficient way to deal with really large arrays?by LanX (Saint) |
| on Dec 13, 2020 at 19:01 UTC ( [id://11125132]=note: print w/replies, xml ) | Need Help?? |
|
If you keep the pairs, i.e. 2 dim points, how would you want to sort them in one dimension? > the OP hasn't told us yet what his final goal is! Exactly! For instance, if he wanted to process the data sequentially he could also sort them into HoHs or AoHs, since Perl is swapping out unused data. Like this only the currently processed second level structure would be in RAM and the performance overhead for swapping would be negligible.
Cheers Rolf
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||