On 29 Jun 2005 17:21:35 -0700, in bit.listserv.ibm-main
(Message-ID:<[EMAIL PROTECTED]>)
[EMAIL PROTECTED] (Adrian H Auer-Hudson) wrote:
Anyone have any thoughts on this: I have a large
sequential file. I need to drop duplicate records from
said file. Sort would work fine if I knew the correct key
sequence. This information is not imediately
available. The file needs to retain its input
sequence. Duplicates are always grouped together.
Short of writing a program is there a quick way to fix this?
These are statements for Syncsort. I'm not sure if
there's an exact equivalent for DFSORT. Also, I haven't
tried it, but this *might* work:
SORT FIELDS=COPY
SUM FIELDS=NONE
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [EMAIL PROTECTED] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
