|
Jim wrote: > or any way you want to do it. Interesting, how do you do elemets >with dimentioned data structures? Time to hit the manual Lookup the keyword OCCURS. (DIM on data structure definition was one of the items that came out in the first $100 in the 2001 RPG enhancement survery, so who knows? You may well see it in the language within the next few decades.) >The whole point being, RPG or the AS/400 shouldn't care what the >upper limit is. It does not have to allocate any memory, since we >are using a pointer anyway, and just looking at memory that's already >there. The program math is fairly simple behind the covers, the >array element X starts at SizeOfStructure * (X - 1) + 1 Of course, that's one possible design. We could allow DIM(*) for a based array or data structure and forget about generating code to check the upper bound. That's not unreasonable. We just have a bunch of other things to look at first before we get around to dynamic arrays. But certainly if there's something easy we can do in the meantime to make things easier, we will consider it. Cheers! Hans Hans Boldt, ILE RPG Development, IBM Toronto Lab, boldt@ca.ibm.com +--- | This is the RPG/400 Mailing List! | To submit a new message, send your mail to RPG400-L@midrange.com. | To subscribe to this list send email to RPG400-L-SUB@midrange.com. | To unsubscribe from this list send email to RPG400-L-UNSUB@midrange.com. | 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-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.