Re: Efficiency of code generated by Ada compilers

["Randy Brukardt" <randy@rrsoftware.com>]

[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #1: Type: text/plain, Size: 1400 bytes --]

"Elias Salom�o Helou Neto" <eshneto@gmail.com> wrote in message 
news:8349c981-4dca-49dc-9189-8ea726234de3@f42g2000yqn.googlegroups.com...
...
> Yes, I know that. I am, however, writing code within that 1% of
> applications that would be tremendously affected if there is no way to
> access arrays with no range checking. So I am asking very precisely:
> does Ada allow me to do non range-checked access to arrays?

Several people have already answered your exact question, so I won't bother 
to repeat that. But I'd like to point out that Ada compilers spend a lot of 
effort in eliminating unnecessary range checks. So that if your code is 
well-written, there will be few if any range checks when you access arrays. 
(Dmitry showed you one way that can be accomplished; another is to ensure 
that temporaries have appropriate subtypes.)

So I'm suggesting that you try to avoid premature optimization. I can 
believe that there will be cases where you'll need to suppress range checks, 
but I'd also suggest that those will be far rarer than you are thinking. 
And, of course, the problem is that suppressing range checks is essentially 
the same as not wearing seat belts when driving. Just remember how many 
"security patches" have been caused by buffer overflows, all of which would 
have been detected and prevented by having range checking.

                                    Randy.