Re: How to do it in Ada ?

[Jeffrey Carter <jrcarter@acm.org>]

Tomasz Wegrzanowski wrote:
> 
> int main(int argc, char **argv)
> {
>     int *x;
>     int n;
> 
>     n = (argc==1)?1:atoi(argv[1]);
>     x = malloc (n*sizeof(int));
>     for (x=0;x<n;x++)
>         x[i]=0;
> 
>     /* ... */
> }
> 
> Something like that ... how to do such dynamic array allocation in Ada ?

The simple answer is, you don't. Ada makes this kind of thing much
simpler and less error-prone than in a low-level language.

procedure The_Right_Way is
   type List is array (Positive range <>) of Integer;

   function Get return Positive is separate;

   Num_Integers : constant Positive := Get;

   X : List (1 .. Num_Integers) := (others => 0);
begin -- The_Right_Way
   ...
end The_Right_Way;

Note that everything in your example is done in the declarative part.

-- 
Jeff Carter
"Nobody expects the Spanish Inquisition!"
Monty Python's Flying Circus