Multiple sort option logic

[bvining@xxxxxxxxxxxx]

Another option would be to use the QLGSORT (Sort) API found in the
National Language Support category of system APIs.  The API can accept
input from sources such as files or buffers and return the sorted
output to either files or buffers.  I suspect if speed is important that
the ability to return the results directly in a buffer (as opposed to
a database file) might be nice, and that you will find the API to be very
efficient.

Bruce

>
>Is the printed output going to be the same, no matter what? You may want to
>use the FMTDTA command based on the user's selection. You store the sorting
>logic as a source physical file member, and use it when necessary. If you're
>more comfortable with logicals, try having multiple logical file formats
>stored as source members. Then you can compile the logical on the fly into
>qtemp lvlchk(*no) and then jsut override to that file with your CL program.
>
>BTW, FMTDTA works just as efficiently, if not better than OPNQRYF. Just ask
>Jim Sloan....:-))
>
>>
>> We have a requirement to print multiple variations of an aging
>> report, giving users 4 different sort groups.  The matrix looks
>> like about 80 combinations.
>>
>> The users will have an input screen of some kind to define their
>> sort definitions.
>>
>> Right away, I thought OPNQRYF using variables might do the trick.
>> Ugly IMHO but effective.  Then I wondered aloud if SQL would be a
>> better avenue.  We almost certainly have partial paths out there,
>> so we do not start from zero, but then again it could also get ugly.
>> Also, the ability to save at least a definition (even better, a full
>> path) would be an attaboy.
>>
>> Trying to weigh the maintainability versus the performance, and looking
>> for suggestions.
>>