Re: Ada Queue

[tmoran@bix.com]

Renaming and rearranging, you get the more Ada-ish, and IMHO clearer:

procedure Enqueue(Q: in out Queue; E : Element_type) is
   Cursor : Queue;
begin
   if Q = null then
       Q := new QueueNode'(Data=>E, Rest=>null);
   else
       Cursor := Q;
       while Cursor.Rest /= null loop
          Cursor := Cursor.Rest;
       end loop;
       Cursor.Rest := new QueueNode'(Data=>E, Rest=>null);
   end if;
end Enqueue;