Re: Can Ada iterate over Nd array?

[Georg Bauhaus <rm.dash-bauhaus@futureapps.de>]

On 26.04.12 08:02, Okasu wrote:
> On 2012-04-26, Jeffrey Carter<spam.jrcarter.not@spam.not.acm.org>  wrote:
>>
>> type Three_D is array (1 .. 3, 7 .. 300, 'A' .. 'Z') of Integer;
>>
>> A : Three_D;
>>
>> for I in A'range (1) loop
>>      for J in A'range (2) loop
>>         for K in A'range (3) loop
>>            -- Do something with A (I, J, K)
>>         end loop;
>>      end loop;
>> end loop;
>>
>
> It's a brain dead code.
> So you trying to say that i have to write loops for 10/100/1000d arrays
> by hand?

This will depend on your arrays.

With typical languages, typically, yes. Like in C, C++, Fortran, Pascal,
Lisp, ML, OCaml, Java, etc etc, arrays in Ada are basic. Array indexing
uses the same scheme as everyone else, except that Ada lets you
specify 'Range, 'First, and so on, no mishaps there. Even for an
array of dimension 1000, the scheme does not change in any of
these  languages.

(I will be very interested in seeing an array of dimension 1000
that isn't sparse.)

APL, SETL, R, and other languages are different.

When there is some library made for arrays, it can allow notions
such as "apply a subprogram Proc (First, Last: Vector) to the
block of dimension N between First and Last" where
N = Length(First) = Length(Last). There are some such libraries
for Ada, even in its standard  library.