Re: Translate this into Ada ...

[Richard Irvine <Richard.Irvine@eurocontrol.fr>]

Spasmo wrote:
> 
> Richard Irvine (Richard.Irvine@eurocontrol.fr) wrote:
> : Can anyone help with what I imagine is a frequently ocurring problem?
> 
> : We would like all lists in an application to be read using an iterator
> : with operations like:
> 
> [Snip]
> 
> Well I'm no expert in Ada, but I have successfully written
> generic linked list routines that pretty much do what you want.
> Here's some info, but if you would like the actual source code
> I'd be more than happy to provide it (I haven't done all that
> much debugging but it seems to work and at the very least should
> give you an idea of how to proceed).
> 

Thanks for your reply which concerned a particular implementation of 
a generic list. What I was really trying to get at was how to produce
an abstract specification of a list which MANY implementations (e.g.
singly-linked lists, arrays etc. ) might conform to. In our case
we are tyring to develop a subsystem which may be embedded in many
client applications (none of which is written in Ada!). 
The client applications will provide us with lists (collections)
and we have no idea how they will be implemented.
Nonetheless, we would like to have some way of ensuring that the
different lists provided by the client (and by ourselves) are 
accessed in a consistent way. The problems come because the 
function which creates the iterator refers to two asbtract types.
(Doubly dispatching).

For a concrete implementation one might make use of David Weller's 
Booch components, for example.