Re: Looking for Skeleton RPG program

[Brian Parkins <goodprophet.bp@xxxxxxxxx>]

Just my five cents worth. You would never display a database file with 
many more than, say, 200 rows in its entirety.

Just think about it. If the following were specified: SFLSIZ(9999) 
SFLPAG(20) - it means the User would have to page down 500 times to 
reach the end of the data. Not realistic. So, displaying > 9,999 rows is 
not worth considering.

As others have already indicated, you would employ some filter/subset 
mechanism, (e.g. SQL) to reduce the number of rows to be displayed to a 
manageable number, (<200). These days, most folk take the SFLSIZ=SFLPAG, 
(non-extending) approach so that the data is always refreshed on page 
up/down. The alternative is to code a load-all subfile, (understanding 
that the data will become "stale" over time.). Avoid the unnecessary 
complications of the SFLPAG+1 (extending) approach.

I've not read the book that has been quoted (below). I have skimmed it 
on Amazon. Be mindful that it was published in 2011. Although the code 
samples use free-format C-specs, there is no use of (modern), fully 
free-format RPG IV. So, the title may be a little misleading. I also 
spotted this type of coding,

DOU *INKC OR *INKL;

- which is not widely recommended.

You don't state whether or not you HAVE to code for green-screen. Again, 
as others have pointed out, presentation will be much better if 
displayed through a browser interface - which means you can avoid 
subfile programming altogether.

Hope this helps.

Brian.

On 08/01/2018 12:36, Kevin wrote:
> Hi
>
> What I did was purchased Subfiles in FREE-FROMAT RPG by KEVIN VANDEVER..
>
> Good book and you'll understand what you are actually doing and the 
> subfile subject as a whole.
>
> Good luck.
>
> Regards
>
> Kevin
> On 08/01/2018 09:21, p.Caroti wrote:
> > Hi Bruno
> >
> >
> > I'm looking for a "solid" skeleton from which start that manage also the
> > condition to display a database file (in a subfile) that a have more 
> > than
> > 9999 rows
> >
> >
> > Thanks in advance