Re: Ada Popularity: Comparison of Ada/Charles with C++ STL (and Perl)

["Robert Kawulak" <tigrisek@interia.pl>]

Hi,

> First, that all will be templates, I do not want them, generics are
> inherently bad. For instance, it is impossible to have generic programming
> on containers of containers. You cannot have a list of items of "array"
> types that are different instantiations.

    I don't know about Ada, but in C++ you can, and such "templates nesting" 
is even the recommended way to have multi-dimensional vectors:

typedef vector< vector < vector <int> > > vector_int_3D;

> Secondly it is not checked whether the thing you are implementing *is* an
> array which *will* work with all that standard algorithms. You never know
> before you instantiate.
> Ideologically, it is stone age, not the Ada's way,
> IMO.

    C++ templates are not checked only when instantiated. Every template 
body is parsed, whether it's instantiated anywhere or not (this is why there 
is the typename keyword).
    That's as to grammar correctness. And if you mean semantics, I don't 
thing Ada compiler will check them for you as well... You also have to write 
some program using generic instantiations to test whether they work as you 
expect them to do.

Best regards,
Robert