Think about Loose Coupling | |
PerlMonks |
Re^3: Sorting data that don't fit in memory (DBM::Deep)by dragonchild (Archbishop) |
on Oct 10, 2007 at 17:10 UTC ( [id://644030]=note: print w/replies, xml ) | Need Help?? |
The hashkeys are not stored sorted, no. But, in doing a sort (and I could be wrong), Perl doesn't necessarily pull all the data into memory. If it does, then I would certainly accept help in getting Perl to do the sort in the way you're describing.
My criteria for good software:
In Section
Seekers of Perl Wisdom
|
|