I think it has to do with how big your lists are. If they are small then all of the reading and writing in your routine will kill it with overhead; however, if your lists are large then writing them out and sorting them there is a known optimization trick. Of course, it will also depend on how they are actually being sorted.
Lots of bullets, not many silver ones.... Hth Colin Alfke -----Original Message----- From: Shawn Waldie [mailto:[EMAIL PROTECTED] Sent: Friday, August 20, 2004 11:16 AM To: [EMAIL PROTECTED] Subject: [U2] [UD] Sorting Thank you for your thoughts, gentlemen. This is what I wrote before the suggestions reached me: WRITELIST XL.NEW.LIST ON X.SAVEDLIST EXECUTE X.SORT.SAVEDLIST GETLIST X.SAVEDLIST TO 1 THEN READLIST XL.SORTED.DATES FROM 1 ELSE XL.SORTED.DATES = "" END CLEARSELECT 1 END SWAP @AM WITH @VM IN XL.SORTED.DATES DELETELIST X.SAVEDLIST But I'll change it if it's much less efficient. What do ya think? -----Original Message----- From: Shawn Waldie Sent: Friday, August 20, 2004 9:46 AM To: [EMAIL PROTECTED] Subject: [U2] [UD] Sorting I have records that contains a mv list of dates, i.e., 13200:@VM:13312:@VM:13176. I need to store these values in ascending order, so I: a) convert the VMs to AMs, b) perform a FORMLIST, SAVE.LIST, SORT.LIST; and c) load the values back into the attribute. There has to be a more efficient way. Any suggestions? ------- u2-users mailing list [EMAIL PROTECTED] To unsubscribe please visit http://listserver.u2ug.org/ ------- u2-users mailing list [EMAIL PROTECTED] To unsubscribe please visit http://listserver.u2ug.org/
