Re: Pointer types (I mean access types)

[Gautier write-only <gautier_niouzes@hotmail.com>]

On Jul 11, 2:03 am, Rob Solomon <use...@drrob1-noreply.com> wrote:
> I am trying to understand how pointers work in Ada.  I would like to
> know if I have the correct equivalencies
>
> Assume this declaration:
>   type List_Node;  -- An incomplete type declaration.
>   type List_Node_Access is access List_Node;
>   type List_Node is
>     record
>       Data        : Integer;
>       Next        : List_Node_Access;
>     end record;
>
> Ada                                               Modula-2 (or Pascal)
> --------------------------------             ----------------------
> type Node_Access is access Node; TYPE NodeAccess = POINTER TO Node;

Would be type NodeAcces = ^Node in Pascal IIRC ...

> Start : Node_Access;                      VAR Start : NodeAccess;
> Current := new Node;                    Current := NEW(Node);
> Current := Start;                            Current := Start;
> Current.all := Start.all;                   Current^ := Start^;
> Current.Data := 5;                         Current^.Data := 5;

Seems fine to me (I had a course in Modula-2; never had in Ada :-) ).
Note that Ada's "Current.Data := 5" is a shortcut for
"Current.all.Data := 5"

G.