sort		Version 1.46e		by Rüdiger Werner

History
-------

Version 1.00 - 1.20
internal versions
written on a PC because of lack of a working C-Compiler for AMIGA

Version 1.21
adapted to AMIGA
now it can be compiled with the DICE-C-Compiler V2.06.21
written by Matthew Dillon

Version 1.22
removed the bug that the program crashes if a line in input file is longer
than the limit. But 1024 Byte is quite long. So I don't think it will
be reached. If yes after all, the bytes which are too much will be cutted.

Version 1.23
added the -n|N switch
Translated the program into English, optimized the code a little bit.

Version 1.24
made some changes on the part where switches are interpreted
now some contradictions removed

Version 1.25
the loading routine completely new implemented, now needs less memory

Version 1.30
implemented an improved algorithm for sorting.
Now the speed is more than twice as fast as before.

Version 1.31
optimized the erasing of empty lines, so sorting becomes faster
added some colors

Version 1.32
optimized setting of switches
added -j|J switch; now it's possible to join as much files as memory allows
removed some bugs, which could be troublesome (actually every bug is this)

Version 1.33
added -f[y] and -l[y] switch
now it's possible to sort within a given range, of course the speed becomes
slower due to additional code in the sorting routine
if no range is given the speed is around 10 per cent faster as before

Version 1.34
removed a bug which could be fatal.
Due to some changings in the sorting routine the speed has been increased
again.

Version 1.35
don't remember, because of the long time which has gone (holidays...)
oh yes, added the -s option

Version 1.36
added the -P option
the -s option can now be used also in a given range, means it works now as
the other functions too.
as usual the sorting speed could be increased a little bit again

Version 1.37
added the -c option
now its possible to sort files after a given number of column
due to that the need of memory to manage the list is slightly bigger
then removed a minor bug, that while joining files exactly on file less
is loaded as given. Now it's ok. of course it was found only after uploading
the previous version :-)

Version 1.38
removed a minor bug, which actually doesn't bother, but who knows ...
added a check if the output file already exists.

Version 1.38a
Bugfix.
The -o option didn't work anymore due to check for the file existing.
Now it works.

Version 1.41
modified the load routine, added "pointer buffering" to the sort algorithm.
depending on file, sort time reduced to 50% - 25% compared to Version 1.38
used mempools routines © by Jochen Wiedmann for allocating and freeing the
memory, time for memory management reduced downto 2 (two) percent

Version 1.42
changed -c option
Now the file is sorted after the column given by the first number, for
sorting the number of chars are used given by the second number.
added -v option
If this switch is given, no message appears, except of error messages.
added -S option
Now a single char (the first given) can be replaced by another one
(the second given)

Version 1.43
Bugfix
the join option didn't work properly
the messages of the program looked funny
added -C option
same as -c, but the -E / -N option uses the column for comparison, after
which is sorted.

Version 1.44
added -i option
added a new algorithm to prepare the list for sorting
now the sorting speed is 6 (six) times faster than before
especially sorting files with more than 3000 or 4000 lines is extremely
faster now.

Version 1.45
recoded the load routine (for Amiga Version only)
Needs much less time to load the files and in fact no (recognizable)
time to free the memory
Memory usage reduced by about 30%

Version 1.46
removed a bug which could occur, if binary characters in the file
no maximun length of a line for AMIGA version anymore

For more informations read the docfile.