Re: Why in (array) aggregate, no more component allowed after a dynamic choice ?

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

It's complicated both for the reader and the compiler to ensure that an 
aggregate with multiple dynamic components in fact covers all of the 
components of the target type. (And that check is a hallmark of Ada, one 
cannot accidentally forget to specify a component and still have a working 
program.) It also gets very complicated to generate an others clause if a 
number of components at unknown locations are previously initialized.

Ada probably could have allowed two such components or maybe even three 
without the complexity growing too much. But there is a standard language 
design axiom that one should allow either zero, one, or unlimited/many of 
any thing. Allowing more than one dynamic component would violate this 
axiom, and the limit it is rarely encountered (you seem to have a knack for 
running into language corner-cases :-).

                                Randy.

"Mehdi Saada" <00120260a@gmail.com> wrote in message 
news:aa4f3429-4bfd-44ac-a817-9fd0dd187841@googlegroups.com...
>I had to write
> declare
>   Temp: T_Polynome (Poly_B.Degre + Ind -1);
> begin
>   Temp.Coef(Poly_B.Degre + Ind -1) :=
>   Poly_A.Coef(Poly_B.Degre+Ind)/Poly_B.Coef(Poly_B.Degre);
> end;
>
> Ind being a loop indice.
>
> whereas I would have prefered:
> Temp: T_polynome :=  (Poly_B.Degre + Ind - 1,(Poly_B.Degre + Ind - 1 => 
> Poly_A.Coef (Poly_B.Degre+Ind)/Poly_B.Coef(Poly_B.Degre), others => <>));
>
> What's the reason behind this limitation, whereas in one more sentence, 
> the same effect is achieved ?