Re: Help needed - Upper Bound of an array - Question.

[adacrypt <austin.obyrne@hotmail.com>]

On Feb 7, 6:22 pm, Ludovic Brenta <ludo...@ludovic-brenta.org> wrote:
> adacrypt writes on comp.lang.ada:
>
> > Many thanks to everyone - your'e a bit over my head technically but I
> > get the gist of it from each one of you.
>
> > This is my declaration.
>
> >  SUBTYPE Index_30 IS Integer RANGE -500000 .. 500000;
> >   TYPE I_CoefficientsNumArray IS ARRAY(Index_30) OF Integer;
> >   I_Num : I_CoefficientsNumArray;
> >   -- counts the occurences of the j coefficients of the ciphertext.
>
> > Question : can I use your 'big array' declaration procedure in Ada-95
> > just as you have typed here ? that would be great - will it work just
> > by replacing the present declaration with this? do I type in as a
> > straight crib just like that, regards - adacrypt
>
> Yes, you would simply augment your program with an access type
> declaration like so:
>
> SUBTYPE Index_30 IS Integer RANGE -500000 .. 500000;
> TYPE I_CoefficientsNumArray IS ARRAY(Index_30) OF Integer;
>
> type Array_Access is access I_CoefficientsNumArray; -- new type
>
> I_Num : Array_Access := new I_CoefficientsNumArray; -- allocate on the heap
> -- counts the occurences of the j coefficients of the ciphertext.
>
> For more details on dynamic memory allocation and deallocation and
> access types, read this:
>
> http://www.it.bton.ac.uk/staff/je/adacraft/ch11.htm
>
> which is the book I recommend for novice programmers.  In fact, even I
> enjoyed this book thoroughly when I learned Ada as my 12th (or so)
> programming language :)
>
> --
> Ludovic Brenta.

Many Many thanks to every one - adacrypt