🚀 go-pugleaf

I don't see what is so abominably inefficient about a nice clean
indexing function on an array descriptor.  That would be the Natural
Solution to this problem as well as more general ones, such as how to
store symmetric arrays in half the space, how to switch from dense
to sparse storage of a matrix, etc, etc.

The function call overhead is all the additional burden required,
since the arithmetic of index computation must be done in any case.
The only other inefficiency might be when a smart optimizing compiler
can simplify some sequential accesses to the array, but isn't smart enough
(or given opportunity) to expand an indexing function call inline
in order to optimize it.

Vincent Broman, code 632,  Naval Ocean Systems Center, San Diego, CA 92152, USA
Phone: +1 619 225 2365        {seismo,caip,ihnp4,ucbvax}!\\\\\\\
Arpa: broman@bugs.nosc.mil Uucp: {floyd,moss,bang,hp-sdd,sdcsvax}!noscvax!broman