home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Fresh Fish 4
/
FreshFish_May-June1994.bin
/
new
/
util
/
cli
/
sort
/
sort.doc
< prev
next >
Wrap
Text File
|
1994-04-20
|
3KB
|
84 lines
sort.doc sort Version 1.23 by Rüdiger Werner
The program and files in this distribution are freely distributable,
but are also copyright (c) Rüdiger Werner. They may be freely
distributed as long as no more than a nominal fee is charged to cover
time and copying costs.
No commercial usage is permitted without written permission from the
author. Everything in this distribution must be kept together, in original
unmodified form.
The above is generally known as freeware.
***********************************************************************
* Notice that the author can't be made responsible for the destroying *
* or lost of data through use of this program. You use it on your own *
* risc. Please read the Doc-file before using. *
***********************************************************************
Please contact me if you have any comments or suggestions
or if you simply tried the program:
E-Mail: rw2@irz.inf.tu-dresden.de
Mail: Rüdiger Werner
Stresemannplatz 2
01309 Dresden
GERMANY
Description
-----------
The program was written for use in Shell only.
It is started either by simply typing it's name (of course it should be
in the current directory or in the path) or by giving additionally switches
and/or the name of the file what should be sorted.
sort [-a|d -g -e|E -n|N -o -t] infile [outfile]
By typing 'sort ?' appears a short help.
The specified file is opened and red in the memory. There it will be sorted
and, if the switches were set, manipulated in the required way.
Switches:
-a sorting in ascending order (it is optional, because default)
-d sorting in descending order
-g actually the capitals and small letters are distinguished.
by setting this switch, they won't be distinguished.
-e after sorting all lines which are empty will be erased.
-E after sorting all lines which are empty or more than once in a file
will be erased (of course ONE line is kept in the file).
-n the file is not sorted, only empty lines are erased.
-N the file is not sorted, only empty lines and lines with the same
contents which are side by side are erased (of course ONE line is
kept in the file).
Note that it might more useful if the file is sorted.
-o the specified file for reading will be overwritten by the sorted
file. DANGER!!! If once overwritten the original file can't be
restored!!!
-t the file which was red will be written in reverse order of lines
The switches can be set at any place after the program-name.
The maximum length of a line in a file is 1024 byte.
All bytes that a line is longer than this are cutted.
The size of the file to be sorted depends only on the size of the available
memory (and on your patience). The used time is shown after sorting, just
for your statistics ...
I have tested the programm with hundreds of different files and no loss
of data appeared.
Well, that's all I can tell about it.
Hope that you can use the program.
Rüdiger Werner