|
> >When using a multiple occurrence data structure I would like to have the >compiler create an index for me when it sees the following so that I could >do a "Random Find" using a "Lookup" function. > >D MDS1 DS OCCURS(20) >D CUST 7 >D DEPT 5 > > >C DSKEY DLIST >C DFLD CUST >C DFLD DEPT > >C EVAL CUST = XXXCUST >C EVAL DEPT = XXXDEPT > >C EVAL X = 1 >C DSKEY LOOKUP MDS1(X) 90 >C IF (*IN90 = *ON) >C BLAH BLAH BLAH >C ENDIF > > >This would include a new 'DLIST' and 'DFLD' definitions. >I know its crazy, but finding whether or not you have those values in a >multi-DS now forces to use an array, Lookup the value on the array and >set the occurrence to the value of the successful array lookup up index. > You can use a basing pointer to redefine the multiple occurence data structure as overlaying arrays. Do the lookup on the overlaying array to get the index and then set the occurence of the multiple occurence data structure. Everything can be referentially defined. Having said that, I also want the DLIST capability. But I do not want to require the DFLDs to be sequentially specified fields in the data structure. I want the equivalent of a logical file index over the multiple occurence data structure. Charlie Massoglia, Massoglia Technical Consulting, Inc. PO Box 1065, Okemos, MI 48854, USA 517-676-9700 Fax: 517-676-1006 EMAIL: cmassoglia@voyager.net * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * This is the Midrange System Mailing List! To submit a new message, * * send your mail to "MIDRANGE-L@midrange.com". To unsubscribe from * * this list send email to MAJORDOMO@midrange.com and specify * * 'unsubscribe MIDRANGE-L' in the body of your message. Questions * * should be directed to the list owner / operator: david@midrange.com * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2025 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.