Hi,
This is not so much of a Fortran question but some may have an opinion.
In designing flexible data structures like dictionaries, I have
considered it a very nice goal to separate the memory allocation system
from the data-structure itself. This can be done by, for example,
representing the next link in linked structrues with a pointer of type
NODE, rather than an integer into some array of nodes. This way one can
easily change the way memory is allocated, however, at a cost of some
pointers instead of integers.
Another goal however would be to have a rellocatable data-structure,
that is, one whose storage can be moved without having to redo the
internals, like changing next pointers. Obviously if one uses pointers
like I say above this won't work.
Is there maybe a compromise or bang-bang solution in which one can
design a structure that is easily rellocatable AND can change storage
formats easily? I am not sure what if anything people do about this
issue.
Thanks,
Aleksandar
--
__________________________________
Aleksandar Donev
Complex Materials Theory Group (http://cherrypit.princeton.edu/)
Princeton Materials Institute &
Program in Applied and Computational Mathematics
@ Princeton University
Address:
419 Bowen Hall, 70 Prospect Avenue
Princeton University
Princeton, NJ 08540-5211
E-mail: [log in to unmask]
WWW: http://atom.princeton.edu/donev
Phone: (609) 258-2775
Fax: (609) 258-6878
__________________________________
|