|
sjones@xxxxxxxxxxxxxx wrote: > > I need to sort the array by field one, field two, field three so the > sorted array would end up like: > > AAAAA , 85- , XXXXX > AAAAA , 7, DDDDD > BBBBB, 3- , CCCCC > BBBBB , 4 , CCCCC > > I saw some previous posts on using QSort, but I don't see an example on > how to sort by multiple fields using it. > Here's an example of QSort sorting a data structure: http://archive.midrange.com/rpg400-l/200411/msg00039.html The procedure called "CompByFirst" does basically what you want; it compares a ds first by one subfield and then when those are equal, it tests another subfield. For three subfields, you'd just add more code at the place where it returns zero. To get the results you want, you'd have something like this: // compare field one first if ds1.fieldone > ds2.fieldone; return 1; elseif if ds1.fieldone < ds2.fieldone; return -1; // field one is equal. Compare field two next if ds1.fieldtwo > ds2.fieldtwo; return 1; elseif if ds1.fieldtwo < ds2.fieldtwo; return -1; // field one and field two are equal. Compare field three next if ds1.fieldthree > ds2.fieldthree; return 1; elseif if ds1.fieldthree < ds2.fieldthree; return -1; // All three fields are equal, so the ds's compare equal else; return 0; endif;
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.