Re: memory management in Ada: tedious without GC?

[Pascal Obry <pascal@obry.net>]

jhc0033@gmail.com a �crit :
> Did I misunderstand?

You have already received a bunch of excellent answers. I'd like to 
point out that in Ada you have less need for dynamically allocated 
memory. Ada supports unconstraint types. Objects of such types when 
declared can be "allocated" on the stack and passed around (no heap 
usage). A simple example:

    type Vector is (Positive range <>) of Float;

    function Norm (V : in Vector) return Float;

    ...

    declare
       V : Vector (1 .. 100);
       R : Float;
    begin
       R := Norm (V);
       ...

Not a single memory allocation. In C/C++ you'll need to dynamically 
allocate V on the heap, and then worry about freeing this memory.

Pascal.

-- 

--|------------------------------------------------------
--| Pascal Obry                           Team-Ada Member
--| 45, rue Gabriel Peri - 78114 Magny Les Hameaux FRANCE
--|------------------------------------------------------
--|              http://www.obry.net
--| "The best way to travel is by means of imagination"
--|
--| gpg --keyserver wwwkeys.pgp.net --recv-key C1082595