Re: Varying fields in a data structure

You've got your answer...

But wanted to add that I'd reconsider building a DS to store the data from
the XML.

If you're planning to use XML-INTO, don't. For simple docs, it's great.
Not so much for complex ones. Instead, use the SAX Parser; especially if
you're only really interested in part of the document.

If you really need all the data, consider looking into the various XML SQL
functions built into the DB now-a-ways.

In particular, if the XML doc contains RDB data, take a look at
XDBDECOMPXML()
http://daniel-vesely.blogspot.com/2012/02/xml-decomposition-on-ibm-i71.html

Also the XMLTABLE() function...

Charles





On Tue, May 17, 2016 at 4:14 PM, John R. Smith, Jr. <
smith5646midrange@xxxxxxxxx> wrote:

I am building a very complicated (some might say convoluted) data structure
in an RPG program to handle an XML document (the XSD is a couple thousand
lines). It will have multiple levels of nested data structures and
multiple
dimensions on some of the levels.



My question is if I create a data structure like shown below, since Field1
and Field2 are varying, is my data structure always consuming 514 bytes as
it shows in the compile listing or if I store "Hello" in Field1 and "World"
in Field2, is it only using 14 bytes? I'm trying to figure out if I can
use
a default length of maybe 255 or if I should spend the time trying to
figure
out what the max size of each field should be.



Program

d Data ds

d Field1 255 varying

d Field2 255 varying



Compile listing

DATA DS(514)

FIELD1 A(255)

VARYING(2)

FIELD2 A(255)

VARYING(2)

--
This is the RPG programming on the IBM i (AS/400 and iSeries) (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.

Please contact support@xxxxxxxxxxxx for any subscription related
questions.