On 02 Jan 96 22:10, Paul Edwards wrote to Kieran Haughey:

Hi Paul,

KH>>> I was wondering if someone might be able to point me in the right 
KH>>> direction of how to numerically and alphabetically sort a
large file, say 
KH>>> raning from 1k to over 4meg in size...

PE>> Check out xysort.c in OZPD.  It has no restrictions other than 
PE>> available memory.  Therefor you need to compile it with emx 0.9a
PE>> or a similar dos extender if you want to use it under DOS and use
PE>> 4 meg.  Actually, I can compile it under Watcom for you if you want.

KH>> It might be handy, but I'm working on a very tightly spaced area memory 
KH>> wise, I only have 2 meg memory... I might try reducing it's memory 
KH>> limits.. unless it's been written to be used with an extender?..

PE> The Dos extenders will use disk space for virtual memory if the
PE> available RAM runs out.  The disk will probably thrash a lot
PE> though.  The program has not been written specifically for a 
PE> DOS extender, it's just a general program that will work for as
PE> long as malloc() works.  BFN.  Paul.

I tried it without extender and it basically ran out of memory.. and I
can't remember what happened with dssort.. also which extender are you
talking about, because whenever I use an extender I nearly always run out
of memory, the only think which has survived running under dos4gw on my
computer is fastlst.. not even squish would run with it..
ÿ
Happy New Year,
Kieran

3:711/413.17{at}fidonet
@EOT:

--- MsgedSQ 3.30