From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,177ff20edf7f64cf
X-Google-Attributes: gid103376,public
From: dewar@cs.nyu.edu (Robert Dewar)
Subject: Re: Unconstrained array aggregation..sq. peg into round hole?
Date: 1996/03/19
Message-ID: <dewar.827283101@schonberg>#1/1
X-Deja-AN: 143139288
references: <4ihrvo$hs5@dfw.dfw.net> <314F211B.4823@escmail.orl.mmc.com>
organization: Courant Institute of Mathematical Sciences
newsgroups: comp.lang.ada
Date: 1996-03-19T00:00:00+00:00
List-Id: <comp.lang.ada>

In C, you represent a 2-D array as an array of arrays. Do the same
in Ada, and you will be able to slice it (at either level). Allowing
direct slicing of 2-D arrays (a la Fortran 90) is a BIG feature with
distributed overhead.