Re: C to Ada : a piece of code

["John G. Volan" <John_Volan@dayton.saic.com>]

David C. Hoos, Sr. wrote:
> 
> 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.

Not so fast, David! First of all, that's an under-the-hood
implementation issue.
Second of all, what you describe is only one possible implementation of
array index computation, namely:

    item_address := first_item_address + (index - first_index) *
item_size

    [where item_size = size of an item in storage units]

But there is at least one other possible scheme (exploited by the GNAT
compiler,
I believe), which avoids that subtraction:

    item_address := zeroeth_item_address + index * item_size

    [where zeroeth_item_address = first_item_address - first_index *
item_size]

In other words, you pretend that the array extends beyond its lower end
and hypothetically determine where the "zeroeth" item would be. You do
this just once, and thereafter compute all your array offsets directly
from your array indexes, without any subtraction, using this "zeroeth"
address as the basis. As always, there's no risk of tromping on memory
outside the array, because Ada's index constraints require index >=
first_index.
 
------------------------------------------------------------------------
Internet.Usenet.Put_Signature 
  (Name => "John G. Volan",  Home_Email => "John_Volan@syspac.com",
   Employer => "S.A.I.C.",   Work_Email => "John_Volan@dayton.saic.com",
   Slogan => "Ada95: The World's *FIRST* International-Standard OOPL",
   Disclaimer => "My employer never defined these opinions, so using " &
     "them is totally erroneous...or is that a bounded error now? :-)");
------------------------------------------------------------------------