Re: Sort of a Data Structure Array... Idea

> I looked at that example and it sure wasn't clear to me
> which field in the DS they were sorting on
-snip-
>      D Dummy           ds                  Qualified
>      D   Insurance                    5S 0
>      D   Family                       9P 0
>      D   Member                       2S 0
>      D   Claim                        4P 0
>      D   Assigned                      D
>
> How would you sort on Member, then sort again on Claim?

When you call qsort(), you give it the procptr of a procedure that you
supply to determine the order.  That procedure takes an two entire elements
as it's input and returns which is higher (or equal)

d compare         pi            10i 0
d  element1Ptr                    *   value
d  element2Ptr                    *   value

For every 'record' in the original space, this procedure gets called with
the current 'record' and the next 'record'.  (Not precise, but you get the
point.)  It's asked to tell qsort() which of the two 'records' is higher in
sequence.  I'd map a pair of data structures BASED on those pointers,
%editc() and concatenate them so I could compare them.  The point being that
your code makes the comparison; you don't specify columns like you would
with a utility like FMTDTA.
  --buck