Roberto R. wrote on 04/26/2006 03:23:20 PM: > If I understand this correctly I need a different solution depending on if I > have duplicates in input1 or input2, is this true? My situation is that > input1 consists of roughly 10.000 records and input2 about 350.000 records, > and I have no idea how or where duplicates exist. I take this as there is no > universal solution in DFSORT for matching records based on a key in this > manner... Guess I need to write a program instead :-( But thanks anyway.
I don't really know if there's a universal solution or not. You showed me two different examples, so I gave you two different solutions. If you show me a more complete example of the records in each input file with the different possible variations of duplicates and non-duplicates, and the expected output records, then I can tell you whether or not there's a DFSORT/ICETOOL solution for that. Frank Yaeger - DFSORT Team (IBM) Specialties: PARSE, JFY, SQZ, ICETOOL, IFTHEN, OVERLAY, Symbols, Migration => DFSORT/MVS is on the Web at http://www.ibm.com/storage/dfsort/ ---------------------------------------------------------------------- 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
