Re: syntaxic exploration

[Niklas Holsti <niklas.holsti@tidorum.invalid>]

On 17-12-22 15:31 , Mehdi Saada wrote:
> It compiled, but I entered the agonizing world of debugging run time erros...
> What in that:
> return RES: T_POLYNOME :=
> (T_DEGRE'MAX(POLY_A.DEGRE,POLY_B.DEGRE),POLY_A.COEF) do
> 	for I in POLY_B.COEF'Range loop
> 		RES.COEF(I) := RES.COEF(I) + POLY_B.COEF(I);
> 	end loop;
> 	RES := POLY_REDUIT(RES);
> end return;
>
> is wrong ? Because the result is.
> P1: 1 -2X
> P2: -1
> POLY1 + (POLY1 * POLY2) = 9 -15X +2X** 2  -- wrong.

I can't help with that, because you do not show the input values, nor 
the output procedures.

> It ends with raised CONSTRAINT_ERROR : p_poly_v1_g.adb:63 length check failed
>  59 function "+" (POLY_A, POLY_B: T_POLYNOME) return T_POLYNOME is
>  60 begin
>  61     return RES: T_POLYNOME :=
>  62     (T_DEGRE'MAX(POLY_A.DEGRE,POLY_B.DEGRE),POLY_A.COEF) do

RES.COEF should have a length of RES.DEGRE, but the aggregate above 
supplies an array (POLY_A.COEF) with a length of POLY_A.DEGRE. If 
POLY_B.DEGRE is larger than POLY_A.DEGRE, these lengths are different.

-- 
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
       .      @       .