From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.5-pre1
Date: 4 May 93 15:03:27 GMT
From: cis.ohio-state.edu!magnus.acs.ohio-state.edu!usenet.ins.cwru.edu!howland.
reston.ans.net!europa.eng.gtefsd.com!fs7.ece.cmu.edu!news.sei.cmu.edu!firth@ucb
vax.Berkeley.EDU  (Robert Firth)
Subject: Re: ADA Performance
Message-ID: <1993May4.110327.19171@sei.cmu.edu>
List-Id: <comp.lang.ada>

In article <1993May4.142456.13012@convex.com> sercely@convex.com (Ron Sercely) 
writes:

>In the specific benchmark posted, IMHO, the BIGGEST difference between
>the Ada and FORTRAN implementation is the constraint checking.  The FORTRAN
>code does NOT check array bounds, nor bounds of the individual elements.  Ada,
>on the other hand, MUST check both.

I don't think so.  In the benchmark code, both loops were written

	for i in v1'range loop

and both v1 and v2 were declared of the same subtype.  Any Ada compiler
that introduced an index range check in such an obviously safe situation
would deserve to fail miserably.