Re: Separation of Presentation, BL, and I/O Tiers

["David Morris" <David.Morris@xxxxxxxxxxxxx>]

Jon,

A dynamic MODS is nice enough, but by the time you do it more than
once you are going to want some sort of wrapper. That is what the
storage toolkit, which is part of the iSeries-toolkit
(www.iseries-toolkit.com)
provides. It allows you to say build me a mods on the
heap/userspace/lda and extend it if necessary and possible.
You can set criteria like initial size and increment size. It also
has support for sort and will even gather up fragmented
memory if necessary.

David Morris

>>> Jon.Paris@Partner400.com 04/10/02 12:51PM >>>
 >> I've seen several posters saying they could, but have seen no
examples
of that, yet.

MODS can be based (and therefore dynamically sized) just as arrays can.
 The
limitation (as for an array) is that you must define the number of
occurrences as the largest number you will ever need.  I like the
technique
because it has the added advantage that you can have multiple
definitions of
the DS and map them to individual occurrences of the MODS so you
simply
directly compare multiple occurrences.

You can also use things like the C qsort and bsearch routines to sort
and
search the MODS.

Jon Paris
Partner400