Aleksandar Donev wrote:
> So the whole memory layout of the datastructure is
> 15*(10*(7*(24*(4)+2)+5)) in words.
>
> Now, I claimed, and others seem to agree, that the section
> weekly_records[:,:]%daily_records[:]%hourly_records[:]%temperature[:]
> can indeed be described as a *regular* rank-5 array section. HOW?!?
Let me put the question in another form which might help:
Given a recursive set of stride-1 memory patterns, such as:
Pattern P1: n1 patterns P2, starting every s1 words
Pattern P2: n2 patterns P3, starting every s2 words
...
Pattern Px: nx words, starting every s[x] words (rank-1 pattern)
...
is this describable as an array section of rank x (word here means whatever the
storage required by the type at question is--say a default integer)?
If so, does anyone know of a way to make an array pointer to this section, *without*
trying to manually alter the array descriptor (since this requires knowing it for each
compiler in question)? Maybe a recursive approach of taking sections of sections or
something like that would work. I cannot figure it out...
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
__________________________________
|