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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 109fba,7efa2e62a00a99a3
X-Google-Attributes: gid109fba,public
X-Google-Thread: 103376,7efa2e62a00a99a3
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-03-14 02:33:11 PST
Path: 
 bga.com!news.sprintlink.net!pipex!oleane!jussieu.fr!u-psud.fr!etca.fr!alofi!chris
From: chris@alofi.etca.fr (Christian Millour)
Newsgroups: comp.lang.ada,comp.lang.c++
Subject: Re: Three C++ problems
Date: 14 Mar 1995 10:23:27 GMT
Organization: Site Experimental en Hyperparallelisme - E.T.C.A. - FRANCE
Sender: chris@alofi (Christian Millour)
Distribution: world
Message-ID: <3k3qqv$b2u@etca.etca.fr>
References: <3k2t38$hck@goanna.cs.rmit.edu.au>
NNTP-Posting-Host: alofi.etca.fr
Xref: bga.com comp.lang.ada:11089 comp.lang.c++:54165
Date: 1995-03-14T10:23:27+00:00
List-Id: <comp.lang.ada>

In article <3k2t38$hck@goanna.cs.rmit.edu.au>, ok@goanna.cs.rmit.edu.au (Richard A. O'Keefe) writes:
|> 2.  Topic:  Arrays
|>     Goal :  Run-Time Efficiency (Stack allocation)

<arguments deleted>

|>     Run-time array sizing is not an exotic technique whose efficient
|>     implementation is only now becoming understood in the most advanced
|>     computer science research laboratories.  It has been well understood
|>     for 30 years.  Ada 83 had it.  Fortran 90 has it.  Ada 95 manages to
|>     combine it with OOP.

Yup. gcc had it for some time too. IMHO one of its most valuable assets.

--chris@etca.fr