Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Schwartzian Transform and memory allocation.

by grantm (Parson)
on Jun 19, 2002 at 21:55 UTC ( #175852=note: print w/ replies, xml ) Need Help??


in reply to Schwartzian Transform and memory allocation.

If you translated your data to XML, you could sort it with XML::Filter::Sort (which I uploaded to CPAN a few days ago). One feature of this module is that you can specify the amount of memory (not including interpreter overheads) that the sort can use. Any overflow will be handled by using temporary sort/merge files.

I'm not going to pretend it would be fast though - probably several orders of magnitude slower than what you're doing now.


Comment on Re: Schwartzian Transform and memory allocation.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (6)
As of 2014-09-21 22:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (176 votes), past polls