Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"

Re^3: Sorting data that don't fit in memory (DBM::Deep)

by dragonchild (Archbishop)
on Oct 10, 2007 at 17:10 UTC ( #644030=note: print w/replies, xml ) Need Help??

in reply to Re^2: Sorting data that don't fit in memory (DBM::Deep)
in thread Sorting data that don't fit in memory

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:
  1. Does it work?
  2. Can someone else come in, make a change, and be reasonably certain no bugs were introduced?
  • Comment on Re^3: Sorting data that don't fit in memory (DBM::Deep)

Replies are listed 'Best First'.
Re^4: Sorting data that don't fit in memory (DBM::Deep)
by tye (Sage) on Oct 10, 2007 at 17:24 UTC

    Then you might want to test your suggestion of using sort on an enormous DBM::Deep'd array. I'm not convinced that it will be easy to actually avoid using huge amounts of memory or that it will be reasonably fast. More detailed instructions on how to accomplish the former might be helpful and you might find improvements to make while looking at the latter.

    - tye        

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://644030]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (6)
As of 2020-10-29 16:19 GMT
Find Nodes?
    Voting Booth?
    My favourite web site is:

    Results (273 votes). Check out past polls.