× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



I looked at that example and it sure wasn't clear to me which field in the 
DS they were sorting on
For example

     D DispItems       DS                  Qualified
     D  DispItemsFld                       Dim(5000) like(Dummy)
     D   Insurance                         Inz(0) overlay(DispItemsFld)
     D                                     like(dummy.Insurance)
     D   Family                            Inz(0) 
overlay(DispItemsFld:*next)
     D                                     like(dummy.Family)
     D   Member                            Inz(0) 
overlay(DispItemsFld:*next)
     D                                     like(dummy.Member)
     D   Claim                             Inz(0) 
overlay(DispItemsFld:*next)
     D                                     like(dummy.Claim)
     D   Assigned                          Inz(*Loval)
     D                                     overlay(DispItemsFld:*next)
     D                                     like(dummy.Assigned)

     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?



Rob Berendt
-- 
"All creatures will make merry... under pain of death."
-Ming the Merciless (Flash Gordon)




"Buck" <buck.calabro@xxxxxxxxxxxx> 
Sent by: rpg400-l-bounces@xxxxxxxxxxxx
01/19/2004 03:09 PM
Please respond to
RPG programming on the AS400 / iSeries <rpg400-l@xxxxxxxxxxxx>


To
rpg400-l@xxxxxxxxxxxx
cc

Fax to

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






> All of this just to avoid using qsort()?  Qsort isn't
> just more flexible, it's also more more efficient.
>
> What's the drawback to using qsort() that
> everyone's trying to avoid it?

Especially when working examples are in the Redbook and in the archive:
http://archive.midrange.com/rpg400-l/200207/msg00386.html  One can exceed
the 64k data structure size limit by placing the data in a user space and
using the QUSPTRUS API to get a pointer to it.
  --buck



_______________________________________________
This is the RPG programming on the AS400 / iSeries (RPG400-L) mailing list
To post a message email: RPG400-L@xxxxxxxxxxxx
To subscribe, unsubscribe, or change list options,
visit: http://lists.midrange.com/mailman/listinfo/rpg400-l
or email: RPG400-L-request@xxxxxxxxxxxx
Before posting, please take a moment to review the archives
at http://archive.midrange.com/rpg400-l.



As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

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.