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,FREEMAIL_FROM
	autolearn=unavailable autolearn_force=no version=3.4.4
X-Received: by 2002:a6b:8aa0:: with SMTP id
 c32-v6mr8442478ioj.85.1525158559011;
        Tue, 01 May 2018 00:09:19 -0700 (PDT)
X-Received: by 2002:a9d:830:: with SMTP id 45-v6mr1178893oty.7.1525158558888;
 Tue, 01 May 2018 00:09:18 -0700 (PDT)
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!feeder.eternal-september.org!news.uzoreto.com!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder-in1.iad1.usenetexpress.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!k65-v6no2750034ita.0!news-out.google.com!b185-v6ni4298itb.0!nntp.google.com!k65-v6no2750029ita.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail
Newsgroups: comp.lang.ada
Date: Tue, 1 May 2018 00:09:18 -0700 (PDT)
In-Reply-To: <pc92b5$jpq$1@gioia.aioe.org>
Complaints-To: groups-abuse@google.com
Injection-Info: glegroupsg2000goo.googlegroups.com;
 posting-host=188.87.244.237;
 posting-account=gRqrnQkAAAAC_02ynnhqGk1VRQlve6ZG
NNTP-Posting-Host: 188.87.244.237
References: <1c73f159-eae4-4ae7-a348-03964b007197@googlegroups.com>
 <dbcb51b9-8ab9-4d39-bb70-47fdb15ebfd8@googlegroups.com>
 <pb7eii$bf1$1@dont-email.me>
 <b75ad71f-a917-4638-9b38-ccfe69b04e53@googlegroups.com>
 <slrnpdpiv9.ntv.address@is.invalid>
 <pbr3mi$leu$1@franka.jacob-sparre.dk> <87k1su7nag.fsf@nightsong.com>
 <pbtlno$3k2$1@franka.jacob-sparre.dk> <87po2la2qt.fsf@nightsong.com>
 <87in8buttb.fsf@jacob-sparre.dk> <87wowqpowu.fsf@nightsong.com>
 <16406268-83df-4564-8855-9bd0fe9caac0@googlegroups.com>
 <87o9i2pkcr.fsf@nightsong.com>
 <pc3tcv$bno$1@dont-email.me> <87bme2oy91.fsf@nightsong.com>
 <pc8ln8$koq$1@franka.jacob-sparre.dk> <877eoom26h.fsf@nightsong.com>
 <pc92b5$jpq$1@gioia.aioe.org>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <1c4c7bd9-fa68-4ea2-8419-098becb6993e@googlegroups.com>
Subject: Re: How to get Ada to ?cross the chasm??
From: gautier_niouzes@hotmail.com
Injection-Date: Tue, 01 May 2018 07:09:19 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Xref: reader02.eternal-september.org comp.lang.ada:51870
Date: 2018-05-01T00:09:18-07:00
List-Id: <comp.lang.ada>

> > Well there are also loops etc.  If you want to make a new array whose
> > elements are the squares of all the elements of an old array, you end u=
p
> > writing a loop.
>=20
> But I don't want it. There is no practical need in array operations=20
> using arrays as a whole.

Programmers in R do it all the time (leading to very convoluted code!) beca=
use they discover sooner or later that loops with many iterations, or worse=
, nested loops, kill the performance of their programs. Perhaps it's the ca=
se with other script languages. I've seen series of complicated array opera=
tions in Python just for the sake of avoiding a trivial loop. In the end it=
's still much slower than Ada, but the script programmers knowing only thei=
r language have the satisfaction of having "optimized" their code.