× 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.



Also note it you want better performance, consider using the C Library
function, memmove directly from RPG. Serach the archives for more
info.

***NOTE: do not use memcpy as your source and destinations will be
overlapping which is not supported by memcpy. But is supported by
memmove.

http://archive.midrange.com/rpg400-l/200101/msg00068.html


HTH,
Charles


On Tue, Feb 3, 2009 at 3:23 PM, James Newman, CDP <newmanas400@xxxxxxxxx> wrote:
I'm on a V5R2 machine and rewriting a program that currently uses 60 element
arrays when processing records. As part of the processing I have to move
element 59 to element 60, 58 to 59, etc and put the newly read record in
element 1. A friend (thanks Marshall) suggested that instead of using
arrays, define the arrays as data structures and move the data structure
instead. This should be much faster. But do I have to define each element
as part of the larger data structure? I guess there's no "OCCURS X TIMES"
in RPG, eh?

TIA.
--
This is the RPG programming on the IBM i / System i (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 ...

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.