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,5d3a1501d97dab65
X-Google-Attributes: gid103376,public
From: dewar@cs.nyu.edu (Robert Dewar)
Subject: Re: C to Ada : a piece of code
Date: 1996/09/09
Message-ID: <dewar.842316873@schonberg>#1/1
X-Deja-AN: 179587001
references: <3231732C.2781@virgoa4.in2p3.fr>
 <JSA.96Sep7205717@alexandria><01bb9d61$537fe5e0$2b8371a5@dhoossr.iquest.com>
 <JSA.96Sep8202531@alexandria> <01bb9e40$d0312d80$348371a5@dhoossr.iquest.com>
organization: Courant Institute of Mathematical Sciences
newsgroups: comp.lang.ada
Date: 1996-09-09T00:00:00+00:00
List-Id: <comp.lang.ada>


"The trade off, (in those frequent cases where 0-based indexing is more
appropriate) is the one-time ugliness of the allocation, vs. the every time
ugliness of the references which need something like Vect'FIRST subtracted
during index computation."

In most cases, this extra subtraction ends up being essentially free since
it is always pulled out of loops. In any case, it is perfectly possible
to have implementations that avoid this subtraction all the time by using
virtual origins.