Re: Generic Containers in Ada2005

[Anh Vo <anhvofrcaus@gmail.com>]

On Feb 8, 4:57 pm, Jeffrey Carter <spam.jrcarter....@spam.not.acm.org>
wrote:
> On 02/08/2011 05:43 PM, Bryan wrote:
>
>
>
> > I realize that I can write a wrapper interface and create my own queue, but
> > queues are so common I can't believe we have Hashed_Maps and not a simple
> > Queue container.
>
> I agree. And given that the Ada philosophy was usually to provide building
> blocks that the user can combine to create more complex things, it always
> surprised me that the library, when it finally came into existence, requires the
> implementor to have implementations of hash tables and an O(log N) searchable
> structure, but not to make them available to the user. (Of course, implementors
> have always had to have unlimited-precision math libraries, but not make them
> available.)
>
> Personally, I'd base a queue on the lists package rather than the vectors.
>
> You can find queues, as well as bounded data structures in the PragmAda Reusable
> Components:
>
> http://pragmada.x10hosting.com/pragmarc.htm

Or look at http://www.adaic.org/ada-resources/tools-libraries/ for
Booch components and Charles (Charles Container Library). Although,
Ada 95 is the target, Booch components should be compatible with Ada
2005.

A. Vo