Re: Performance of element access in Vector

[Maciej Sobczak <see.my.homepage@gmail.com>]

On 21 Sty, 11:19, "Dmitry A. Kazakov" <mail...@dmitry-kazakov.de>
wrote:

> > You mean that arrays have the Iterate method?
>
> The language Ada has iteration methods, for example for-loop.

No, for-loops are not iteration methods, they are control structures.
Iteration methods are defined by particular interfaces and these are
different for arrays and Vectors.

> >> Ordered containers must have array interface.
>
> > You mean that containers overload the () indexing? I'm afraid they
> > don't.
>
> That containers implement element access using an index from 1D space, if
> we are talking about iterations.

This similarity can be interesting as a theory, but is useless in
practice.

Can you *reuse* a piece of code that traverses an array (or Vector)
and apply it to a Vector (or array, respectively)?

There are two reuse mechanisms in Ada, one with class-wide types and
run-time polymorphism and one with generics. Neither one can be
applied to the arrays vs. Vectors problem.
That's why, as far as I'm concerned, arrays and Vectors do not share
any interface.

--
Maciej Sobczak * www.msobczak.com * www.inspirel.com

Database Access Library for Ada: www.inspirel.com/soci-ada