Re: Task Discriminants & Arrays

[bobduff@world.std.com (Robert A Duff)]

In article <3379C86F.352@this.message>,
W. Wesley Groleau (Wes) <see.signature@this.message> wrote:
>Is it not true that I can read the ID of each task?  

You can read them.

>function "<" ( Left, Right : Discriminated_Task ) return Boolean is
>begin
>  return Left.ID < Right.ID;
>end "<"
>
>-- write Bob Duff's ID function to ensure that all IDs are in A'Range 
>-- instantiate your favorite sort with the "<" above and Matt's array.
>-- declare the array, then sort it.
>-- result:  A(I).ID = I  for all  I in A'Range

But you can't move the tasks around -- they're limited.  You could move
pointers to tasks around, but if you're willing to use pointers, you
might as well use allocators, and assign the id's you want.  I suppose
you could have an array of tasks, and an array of pointers to tasks, and
sort the latter (and hide the former from clients).  The only advantage
I can see to that is that it allows parallel activation of the tasks.

- Bob