Re: VMS

On Fri, 20 Jun 2025 21:19:35 +0100, Richard Kettlewell wrote:

Secondly, many checks can be optimized out. e.g. iterating over an array
(or a prefix of it) doesn’t need a check on every access, it just needs
a check that the loop bound doesn’t exceed the array bound[1].

And remember, Ada has subrange types, just like Pascal before it. This
means, if you have something like (excuse any errors in Ada syntax)

    nr_elements : constant integer := 10;
    subtype index is
        1 .. nr_elements;

    buffer : array index of elt_type;
    buffer_index : index;

then an array access like

    buffer(buffer_index)

doesn’t actually need to be range-checked at that point, because the
value of buffer_index is already known to be within the valid range.