Re: New aggregates with Ada 2022.

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

"Niklas Holsti" <niklas.holsti@tidorum.invalid> wrote in message 
news:ji2q1nFu6qeU1@mid.individual.net...
...
> Except if someone invents new abstractions and needs a "raw memory" type 
> to implement them.

Sure, but that should be a rarely used type, and it is best off in a corner, 
much like Unchecked_Conversion and other unsafe stuff.

My design for a post-Ada langyage has a "Fixed_Vector" container for the 
purposes of interfacing; it supports setting component sizes so it should 
match any sort of interface. But most abstractions should be built on top of 
some sort of bounded or unbounded container. The implementation would spend 
much of its effort optimizing those basic containers rather than worrying 
about making arrays fast.

You said something about slices of matrices being a common operation. And I 
agree with that, and it is one that Ada cannot support. It would be better 
if slices were implemented as a form of function, so that they can be used 
when they make sense (and only then). No reason to build in such things. (My 
post-Ada language design includes variable-returning functions, so that sort 
of need can be accomadated.)

                                      Randy.