Re: Based data structure as dynamic array

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

On 2010-10-08 12:15, Bryce Martin wrote:

I thought there was a third way of doing it. Using a MODS is not the way
to go. I don't want to create a new DS for each element of the array.
That is very heavy. I saw an example by Scott yesterday but can't find it
today. It don't remember it involving DIM or MODS. I have seen other
references to it as well, but never with an example.... just people
saying.... 'There are lots of examples, google is your friend'. I know
that there is a way to get past the 32767 DIM limit and rely totally on
the 16MB space limitation.

If you don't need to run lookup, you can easily build a linked or doubly
linked list. There is no limit other than physical memory that way.
Allocate the heap with an array of pointers as needed. It doesn't matter
which element you're currently using, as you just put the next address
in the last node, and deallocate everything at the end. I think there's
even an RPG linked list implementation available on the net that would
give you some object-like service methods.

- --
Pete Hall
pete@xxxxxxxxxxxxxx
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.10 (GNU/Linux)

iEYEARECAAYFAkyvqo4ACgkQXczQcKdXKg7yKACguF9QpSm7Ve5ElPjbBBvdWstr
4UcAnRYBWBlgaG00C2EYNEYtlnM3jxdi
=RqIa
-----END PGP SIGNATURE-----