Re: Arrays with discriminated task components

[Niklas Holsti <niklas.holsti@tidorum.invalid>]

On 2022-12-24 13:44, AdaMagica wrote:
> I've got a task type with a discriminant:
> 
> type Index is range 1 .. N;
> 
> task type T (D: Index);
> 
> Now I want an array of these tasks, where each task knows its 
> identity  (the index) via the discriminant, an iterated_component_association:
> 
> Arr: array (Index) of T := (for I in Index => ???);
> 
> How can I do this?
> 
> This works with access, but I find this extremely ugly:
> 
> Arr: array (Index) of access T := (for I in Index => new T (I));
> 
> Alternatively, I could use the traditional method with a Start entry with the index as parameter:
> 
> task type T is
>    entry Start (D: Index);
> end T;


This seems to work with gnat, but I'm not entirely sure if it is legal 
(could there be a conflict between the default value of the task 
discriminant, which is the same for all tasks in the array, and the 
actual discriminants which are different for each task in the array?):

    N : constant := 10;

    type Index is range 1 .. N;

    task type T (D: Index := Index'First);
    -- A default value for D is needed to make the type constrained, as
    -- required by the Arr declaration below.

    function New_T (I : in Index)
    return T
    is
    begin
       return TI : T (D => I)
       do
          null;
       end return;
    end New_T;

    Arr: array (Index) of T := (for I in Index => New_T(I));

Whether this is any less ugly than the heap allocation method is doubtful.