ACATS c380004

[Duncan Sands]

Hi Ed,

> An entry family is most naturally implemented with an array of queues, 
> and the task discriminants are mapped into the discriminants of the 
> enclosing record, which is why we use
> the same implementation strategy for regular records and for task 
> records. So far so good.
> However, in the case of protected types, an entry family can be 
> implemented with a single
> queue, and pending requests on it can be kept ordered by index (if the 
> queue is long the
> system is thrashing anyway!). In this case, the  array implementation 
> suggested by the "family" is bogus, and the problem disappears. The ARG 
> feels that this is a preferable implementation anyway, and we will 
> probably adopt it when we revisit the implementation of protected types 
> for Ada2005.

I see.

All the best,

Duncan.