From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,154942e4f1d1b8e9
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news3.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!nx01.iad01.newshosting.com!newshosting.com!207.69.154.102.MISMATCH!elnk-atl-nf2!newsfeed.earthlink.net!stamper.news.atl.earthlink.net!newsread3.news.atl.earthlink.net.POSTED!14bb18d8!not-for-mail
Sender: Matthew Heaney@MHEANEYIBMT43
Newsgroups: comp.lang.ada
Subject: Re: Dynamically tagged expression required
References: <dn9dnd$d5h$1@sunnews.cern.ch>
 <2852224.m2vuDFxfOX@linux1.krischik.com> <dnbhjf$1fa$1@sunnews.cern.ch>
 <wccirtygr41.fsf@shell01.TheWorld.com>
 <3818406.kEZhMvudHC@linux1.krischik.com> <u8xusfopy.fsf@earthlink.net>
 <3610380.mzgl1UEuzs@linux1.krischik.com>
From: Matthew Heaney <matthewjheaney@earthlink.net>
Message-ID: <uzmn7emoy.fsf@earthlink.net>
User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.3
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Date: Sun, 11 Dec 2005 14:24:30 GMT
NNTP-Posting-Host: 24.149.57.125
X-Complaints-To: abuse@earthlink.net
X-Trace: newsread3.news.atl.earthlink.net 1134311070 24.149.57.125 (Sun,
 11 Dec 2005 06:24:30 PST)
NNTP-Posting-Date: Sun, 11 Dec 2005 06:24:30 PST
Organization: EarthLink Inc. -- http://www.EarthLink.net
Xref: g2news1.google.com comp.lang.ada:6828
Date: 2005-12-11T14:24:30+00:00
List-Id: <comp.lang.ada>

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?