Re: Dynamically tagged expression required

[Martin Krischik <krischik@users.sourceforge.net>]

Matthew Heaney wrote:

> Martin Krischik <krischik@users.sourceforge.net> writes:
> 
>> Well ever since I started to use the indefinite containers of the booch
>> components I never needed another new for tagged records.
> 
> You can use any of the indefinite containers in the standard library, with
> the same effect.

This is of corse true. It is just that my first container library was IBM
Open-Class-Library. The OCL is a far higher level container library when
compared to the STL. And as such I prefer the Booch-Components over the
Ada.Containers.

I know you had different priorities when designing Charles and later
Ada.Containers - but there not mine:

* STL-like won't count for me - I don't like the STL.
* One Step vs. Thee step instantiation is is not that  important when you
are used to deciding if an IKeySortedSetAsAvlTree or an
IKeySortedSetAsTable is more appropriate for the task at hand.

Of corse the OCL/STL comparison guide only suggest "map<>" for all
IKeySortedSet variants - and the IKeySet, IMap and ISortedMap variants as
well - all just "map<>".

Just to clarify: There is also a default IKeySortedSet - for those who don't
want to make to much thinking when coosing a container.

Martin
-- 
mailto://krischik@users.sourceforge.net
Ada programming at: http://ada.krischik.com