Re: Workqueues in Ada

[Wiktor Moskwa <wiktorDOTmoskwa@gmail.com>]

On 28.07.2007, Simon Wright <simon.j.wright@mac.com> wrote:
> Sounds very complicated & fragile to me, it no longer resembles
> anything one would recognise as a 'queue'.
>

It seems that my 'circular queue' idea was a blind alley.

> It's hard to see how to avoid this with unbounded containers. You
> could look at alternative container packages? (I normally wouldn't
> suggest this, given Ada.Containers, but a BC.Comtainers.Queues.Bounded
> from http://booch95.sf.net doesn't allocate .. but you have to know
> the maximum number of elements you are going to need.)

I think it can be done with unbounded containers provided that
a custom storage pool can be used. The pool would allocate memory
in chunks for i.e. 100 items and thus only 1 call in 100 would
result in malloc call. Deleted items would make place for new ones
and so on.

-- 
Wiktor Moskwa