|
Vern,
I'd love to do it with a user space, but I never did one before. And management wants this done for yesterday. As always.
Thanks.
-----Message d'origine-----
De : rpg400-l-bounces@xxxxxxxxxxxx [mailto:rpg400-l-bounces@xxxxxxxxxxxx] De la part de Vern Hamberg
Envoyé : jeudi 12 novembre 2009 14:18
À : RPG programming on the IBM i / System i
Objet : Re: Load a subfile with clients selected by user
Hi David
There are limits, such as 9999 rows in a subfile - for elements in an array, max is 32767 in v5r4 and before - over 16 million in v6r1.
An alternative to an array is a user space. Easiest way would be to fill the user space with fixed-length entries, incrementing a pointer for each entry by the entry's length. You would then use the qsort API to sort it, then read it by pointer to get as many as you can in the subfile at a time. There are ways to handle paging beyond the subfile limit of 9999 with this technique, too.
Filling a user space via pointer is very fast.
Vern
David FOXWELL wrote:
Hope this thread still works!into your idea of using an intermediate array. Now to do this, I'd have to put all the clients into the array in one go, otherwise there'd be no way of sorting them. That means having an array that will hold about 50 000 records. I haven't looked, but maybe an array can't be that big. Then, there's the issue of the time taken to fill the array, sort it and copy it to the subfile.
Hi Vern, I'm back on this subject again and I'm lookingI don't think I'll have that problem with SQL.the IBM i /
Tell me if I'm missing something.
-----Message d'origine-----
De : rpg400-l-bounces@xxxxxxxxxxxx
[mailto:rpg400-l-bounces@xxxxxxxxxxxx] De la part de Vern Hamberg Envoyé : mardi 30 juin 2009 14:12 À : RPG programming ontables, whetherSystem i Objet : Re: Load a subfile with clients selected by user
Well, David, something is going to read those extrait, thenyou go with embedded SQL or native - either you or the SQL engine. With native, I'm suggesting filling an array, then sortingsorting, getsfilling the subfile from it - probably.
I do this with some maintenance screens that have mixedinnermost chainme what I want - and that is even using SQL!!
Your description sounds simple enough - again, SQL has to do something similar.
read Adresss-file;
dow not %eof(Address-file);
Chain address Client-address-file;
if %found(Client-address-file);
chain client Client-file;
if %found(Client-file) and [name-matches];
[do whatever you need to do - add data to subfile, or to array, sort later];
endif;
endif;
read Address-file;
enddo;
And yes - this is a priming read - there is another way, so no comments
required on that front. ;-)
As to a logical on client name, well, if you did theyou have aon that logical, you'd have to compare the client. Maybecould use alogical on client AND name - then the innermost chain would be
chain {client : name} Client-file;
Then your if %found(Client-file); is all you need to determine whether to continue processing.
This seems simple - easily maintained - and goes directly to the files.
And if you do not need the data in the Client file, youIOs - onesetll instead of the chain - this would not require the IO to retrieve the actual data, only the IO on the index (the logical file). Remember, when reading through an index, you have 2to - thatfor the logical file, one for the physical file it pointsWith SQL youis a generalization, of course.
Anyhow, that seems easy enough. Am I missing something?use that nameneed a 3-way JOIN - it might work well but maybe not.
And if you put a sort on it by name, it still might notVisual Explainindex, because it will have to sort the result, probably.
Mock up the SELECT and run it in iSeries Access intoefficientand see what it does.
Vern
David FOXWELL wrote:
Vern,think that the native solution would be complicated, less
I'v been thinking it over.
I'm kind of wishing I'd never discovered embedded SQL. I
existence andand more difficult to modify.
For example, if a user wants all clients in Bradford with asurname beginning with F :
Read Bradford addresses from address file,from client/address file
For each address,
Read client numbers associated with that address
For each client at that addressone file, ie a cursor that I'd have created.
Chain to client file and compare name.
In this case, the index on client name will never be used.
If I use the SQL solution, I'll effectively just read from
* From: Vern Hamberg <vhamberg@xxxxxxxxxxx>SQL<http://archive.midrange.com/rpg400-l/200906/msg00445.html#
* Date: Fri, 26 Jun 2009 09:22:25 -0500
David
If you go
, you would be better off doing it all with SQL - I'd say use > CHAINs or SETLL into the address file - if you have a logical over postcode or the other fields, SETLL is enough to testCPU<http://archive.midrange.com/rpg400-l/200906/msg00445.html#>.is very inexpensive in IO and
then > be#> could enter part of a client's name and a subfile wouldYou need several logical files, but you do, anyhow, to getgood performance with SQL.
SQL is not the answer for every situation, IMHO.user<http://archive.midrange.com/rpg400-l/200906/msg00445.html
HTH
Vern
David FOXWELL wrote:
Hi, I have this tricky ( for me) problem.
We started off with a screen where a
shown with those clients matching the name entered. Wecompanies. In
have a PF that contains clients that can be persons ora client,that PF either client_name or company_name will exist fordecides whichbut never both. A logical exists on company_name and another on client_name. Depending on the user input, the programwanted to searchlogical to read from.
Recently, a third logical was created when the usersaddress, itby maiden name.
Now, I've been asked to take into accountzip<http://archive.midrange.com/rpg400-l/200906/msg00445.html#
or postcode, town and date of birth into the equation. Asthe addresses are in an adress file with an intermediate client/address file needed to get from the client to the
logical andis obviously no longer just a question of adding anotherunknown ( to usreading from that.
It looks like a case for SQL. It probably should havestarted out that way but at the time embedded SQL was
user input to).
I was thinking of leaving everything intact, as I don'twant to completely rewrite, but using SQL whenever one of the new fields gets used by the user. In that case, I'd use the
cursors<http://archive.midrange.com/rpg400-l/200906/msg00445.hcreate
a cursor totml#> and use these to populate the subfile. At the moment the > subfile is charged one page at a time and pagedown or up
always reads from the PF.
If there are any flaws with this choice, maybe someonewould let me know. I'm a little worried having never used
program willgo backwards and forwards and to populate a subfile. Thelook out forbe continually opening and closing cursors with the same name. I think I need to manage when a user changes a field so that I don't close the cursor unneccessarily. Are there any issues toand reopeningwhen opening a cursor, say C1 for SMITH then closing C1experience with suchit for JONES of Birmingham, etc,etc.
I guess what I'm trying to say is am I at risk of any badsurprises given that I have not a huge amount of
please take ause of SQL?
--
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,--moment to review the archives at http://archive.midrange.com/rpg400-l.
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 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.