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,f2690a5e963b61b6
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!postnews.google.com!o13g2000cwo.googlegroups.com!not-for-mail
From: "MMM" <terekhov@emc.com>
Newsgroups: comp.lang.ada
Subject: Re: GCC 4.0 Ada.Containers Cursor danger.
Date: 12 Jul 2005 13:00:41 -0700
Organization: http://groups.google.com
Message-ID: <1121198441.766238.303580@o13g2000cwo.googlegroups.com>
References: <42cb8d21$0$22761$9b4e6d93@newsread2.arcor-online.net>
   <ldco4pwrxop4$.1py0a7isiagea.dlg@40tude.net>
   <z--dnRI60_7j_lHfRVn-qw@megapath.net>
   <tyi72ga8ch55$.3tea03tbwrtx.dlg@40tude.net>
   <42cd064c$0$10817$9b4e6d93@newsread4.arcor-online.net>
   <k62rlp2n1ls3.1cnwufmnuit7v.dlg@40tude.net>
   <42cda8c4$0$22780$9b4e6d93@newsread2.arcor-online.net>
   <1u3hh2597i4ne$.1ryetugksbmus.dlg@40tude.net>
   <uslyp8mmb.fsf@earthlink.net>
   <1121093807.949660.274060@g44g2000cwa.googlegroups.com>
   <1121124248.600055.292320@f14g2000cwb.googlegroups.com>
   <1121137531.752285.44280@g44g2000cwa.googlegroups.com>
   <946e7$42d3c64d$4995421$28449@ALLTEL.NET>
   <1121179909.262566.192270@o13g2000cwo.googlegroups.com>
   <5a73f$42d40166$4995149$5993@ALLTEL.NET>
   <1121194262.036046.38230@g49g2000cwa.googlegroups.com>
   <1121195712.513120.70330@g43g2000cwa.googlegroups.com>
NNTP-Posting-Host: 168.159.190.36
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Trace: posting.google.com 1121198447 22865 127.0.0.1 (12 Jul 2005 20:00:47
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Tue, 12 Jul 2005 20:00:47 +0000 (UTC)
In-Reply-To: <1121195712.513120.70330@g43g2000cwa.googlegroups.com>
User-Agent: G2/0.2
Complaints-To: groups-abuse@google.com
Injection-Info: o13g2000cwo.googlegroups.com; posting-host=168.159.190.36;
   posting-account=0PrGnQwAAAAhG4fw_pPdaColajHpyOJW
Xref: g2news1.google.com comp.lang.ada:12023
Date: 2005-07-12T13:00:41-07:00
List-Id: <comp.lang.ada>

> MMM wrote:
> > The problem is that Matthew insists that
> > there is no need for a plain
> > vanilla unordered set and/or plain vanilla unordered hash...
>
> Because unordered sets and maps would have O(n) time complexity, which
> makes them useless for real programs.  You might as well just use a
> list.
How did you get this estimate (O(n))? Lookup and insertion time is O(1)
for a hash implementation.
Check for example http://www.nist.gov/dads/HTML/hashtab.html