Re: Dynamically tagged expression required

[Matthew Heaney <matthewjheaney@earthlink.net>]

Martin Krischik <krischik@users.sourceforge.net> writes:

> * One Step vs. Thee step instantiation is not that important when you are
> used to deciding if an IKeySortedSetAsAvlTree or an IKeySortedSetAsTable is
> more appropriate for the task at hand.

That's the same as Ordered_Map and Hashed_Map.  And only a single instantiation
is necessary in both the STL and Ada standard container library.


> 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<>".

I haven't read that guide but that sounds right.


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

I wonder how this works?  Does it assume something about the key type (maybe
all types have a hash function a la Java, or have a relationship operator), or
does it just use a list underneath?  What is the time complexity?